./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe004_power.opt_pso.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fd9ec5b-ff28-40d3-8ca2-084b1c12878c/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fd9ec5b-ff28-40d3-8ca2-084b1c12878c/bin/uautomizer-DrprNOufMa/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fd9ec5b-ff28-40d3-8ca2-084b1c12878c/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fd9ec5b-ff28-40d3-8ca2-084b1c12878c/bin/uautomizer-DrprNOufMa/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe004_power.opt_pso.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fd9ec5b-ff28-40d3-8ca2-084b1c12878c/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fd9ec5b-ff28-40d3-8ca2-084b1c12878c/bin/uautomizer-DrprNOufMa --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 ad7a565ad4ebe037ce541fa36cdf85746d072cc2b5132ab8ae2e3025ff70fea5 --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-12-06 23:56:36,489 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-06 23:56:36,491 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-06 23:56:36,520 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-06 23:56:36,521 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-06 23:56:36,522 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-06 23:56:36,524 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-06 23:56:36,526 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-06 23:56:36,528 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-06 23:56:36,529 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-06 23:56:36,530 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-06 23:56:36,532 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-06 23:56:36,532 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-06 23:56:36,533 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-06 23:56:36,535 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-06 23:56:36,536 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-06 23:56:36,537 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-06 23:56:36,538 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-06 23:56:36,540 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-06 23:56:36,542 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-06 23:56:36,544 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-06 23:56:36,545 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-06 23:56:36,547 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-06 23:56:36,548 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-06 23:56:36,551 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-06 23:56:36,551 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-06 23:56:36,552 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-06 23:56:36,553 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-06 23:56:36,553 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-06 23:56:36,555 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-06 23:56:36,555 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-06 23:56:36,556 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-06 23:56:36,557 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-06 23:56:36,557 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-06 23:56:36,558 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-06 23:56:36,559 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-06 23:56:36,559 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-06 23:56:36,559 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-06 23:56:36,560 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-06 23:56:36,560 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-06 23:56:36,561 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-06 23:56:36,562 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fd9ec5b-ff28-40d3-8ca2-084b1c12878c/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-06 23:56:36,583 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-06 23:56:36,584 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-06 23:56:36,584 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-06 23:56:36,584 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-06 23:56:36,585 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-06 23:56:36,585 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-06 23:56:36,585 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-06 23:56:36,585 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-06 23:56:36,585 INFO L138 SettingsManager]: * Use SBE=true [2021-12-06 23:56:36,586 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-06 23:56:36,586 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-06 23:56:36,586 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-06 23:56:36,586 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-06 23:56:36,586 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-06 23:56:36,586 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-06 23:56:36,586 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-06 23:56:36,587 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-06 23:56:36,587 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-06 23:56:36,587 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-06 23:56:36,587 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-06 23:56:36,587 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-06 23:56:36,587 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-06 23:56:36,587 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-06 23:56:36,588 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-06 23:56:36,588 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 23:56:36,588 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-06 23:56:36,588 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-06 23:56:36,588 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-06 23:56:36,588 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-06 23:56:36,588 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-06 23:56:36,588 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-06 23:56:36,589 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-06 23:56:36,589 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-06 23:56:36,589 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-06 23:56:36,589 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_2fd9ec5b-ff28-40d3-8ca2-084b1c12878c/bin/uautomizer-DrprNOufMa/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_2fd9ec5b-ff28-40d3-8ca2-084b1c12878c/bin/uautomizer-DrprNOufMa 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 -> ad7a565ad4ebe037ce541fa36cdf85746d072cc2b5132ab8ae2e3025ff70fea5 [2021-12-06 23:56:36,780 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-06 23:56:36,799 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-06 23:56:36,801 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-06 23:56:36,801 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-06 23:56:36,802 INFO L275 PluginConnector]: CDTParser initialized [2021-12-06 23:56:36,803 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fd9ec5b-ff28-40d3-8ca2-084b1c12878c/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/pthread-wmm/safe004_power.opt_pso.opt_rmo.opt.i [2021-12-06 23:56:36,843 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fd9ec5b-ff28-40d3-8ca2-084b1c12878c/bin/uautomizer-DrprNOufMa/data/746589bbe/e437f0a16b6d466d93359e10fbbb1a29/FLAGb98586645 [2021-12-06 23:56:37,297 INFO L306 CDTParser]: Found 1 translation units. [2021-12-06 23:56:37,298 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fd9ec5b-ff28-40d3-8ca2-084b1c12878c/sv-benchmarks/c/pthread-wmm/safe004_power.opt_pso.opt_rmo.opt.i [2021-12-06 23:56:37,312 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fd9ec5b-ff28-40d3-8ca2-084b1c12878c/bin/uautomizer-DrprNOufMa/data/746589bbe/e437f0a16b6d466d93359e10fbbb1a29/FLAGb98586645 [2021-12-06 23:56:37,830 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fd9ec5b-ff28-40d3-8ca2-084b1c12878c/bin/uautomizer-DrprNOufMa/data/746589bbe/e437f0a16b6d466d93359e10fbbb1a29 [2021-12-06 23:56:37,833 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-06 23:56:37,834 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-06 23:56:37,836 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-06 23:56:37,836 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-06 23:56:37,839 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-06 23:56:37,840 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 11:56:37" (1/1) ... [2021-12-06 23:56:37,841 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1121b010 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 11:56:37, skipping insertion in model container [2021-12-06 23:56:37,841 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 11:56:37" (1/1) ... [2021-12-06 23:56:37,847 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-06 23:56:37,876 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-06 23:56:37,992 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fd9ec5b-ff28-40d3-8ca2-084b1c12878c/sv-benchmarks/c/pthread-wmm/safe004_power.opt_pso.opt_rmo.opt.i[967,980] [2021-12-06 23:56:38,096 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 23:56:38,102 INFO L203 MainTranslator]: Completed pre-run [2021-12-06 23:56:38,110 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fd9ec5b-ff28-40d3-8ca2-084b1c12878c/sv-benchmarks/c/pthread-wmm/safe004_power.opt_pso.opt_rmo.opt.i[967,980] [2021-12-06 23:56:38,149 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 23:56:38,175 INFO L208 MainTranslator]: Completed translation [2021-12-06 23:56:38,175 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 11:56:38 WrapperNode [2021-12-06 23:56:38,175 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-06 23:56:38,176 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-06 23:56:38,176 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-06 23:56:38,176 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-06 23:56:38,182 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 11:56:38" (1/1) ... [2021-12-06 23:56:38,195 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 11:56:38" (1/1) ... [2021-12-06 23:56:38,219 INFO L137 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 274 [2021-12-06 23:56:38,220 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-06 23:56:38,220 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-06 23:56:38,220 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-06 23:56:38,220 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-06 23:56:38,226 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 11:56:38" (1/1) ... [2021-12-06 23:56:38,227 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 11:56:38" (1/1) ... [2021-12-06 23:56:38,230 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 11:56:38" (1/1) ... [2021-12-06 23:56:38,230 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 11:56:38" (1/1) ... [2021-12-06 23:56:38,238 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 11:56:38" (1/1) ... [2021-12-06 23:56:38,241 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 11:56:38" (1/1) ... [2021-12-06 23:56:38,243 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 11:56:38" (1/1) ... [2021-12-06 23:56:38,247 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-06 23:56:38,247 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-06 23:56:38,248 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-06 23:56:38,248 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-06 23:56:38,248 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 11:56:38" (1/1) ... [2021-12-06 23:56:38,255 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 23:56:38,264 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fd9ec5b-ff28-40d3-8ca2-084b1c12878c/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 23:56:38,274 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fd9ec5b-ff28-40d3-8ca2-084b1c12878c/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-06 23:56:38,278 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fd9ec5b-ff28-40d3-8ca2-084b1c12878c/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-06 23:56:38,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-06 23:56:38,307 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-12-06 23:56:38,307 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-06 23:56:38,307 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-06 23:56:38,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-06 23:56:38,308 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-12-06 23:56:38,308 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-12-06 23:56:38,308 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-12-06 23:56:38,308 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-12-06 23:56:38,308 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-12-06 23:56:38,308 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-12-06 23:56:38,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-06 23:56:38,308 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-12-06 23:56:38,308 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-06 23:56:38,308 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-06 23:56:38,310 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-12-06 23:56:38,400 INFO L236 CfgBuilder]: Building ICFG [2021-12-06 23:56:38,401 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-06 23:56:38,769 INFO L277 CfgBuilder]: Performing block encoding [2021-12-06 23:56:38,992 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-06 23:56:38,992 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-06 23:56:38,994 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 11:56:38 BoogieIcfgContainer [2021-12-06 23:56:38,994 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-06 23:56:38,995 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-06 23:56:38,995 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-06 23:56:38,998 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-06 23:56:38,998 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 11:56:37" (1/3) ... [2021-12-06 23:56:38,999 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d9e2c43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 11:56:38, skipping insertion in model container [2021-12-06 23:56:38,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 11:56:38" (2/3) ... [2021-12-06 23:56:38,999 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d9e2c43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 11:56:38, skipping insertion in model container [2021-12-06 23:56:38,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 11:56:38" (3/3) ... [2021-12-06 23:56:39,000 INFO L111 eAbstractionObserver]: Analyzing ICFG safe004_power.opt_pso.opt_rmo.opt.i [2021-12-06 23:56:39,004 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-12-06 23:56:39,005 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-06 23:56:39,005 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-12-06 23:56:39,005 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-12-06 23:56:39,031 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,032 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,032 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,032 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,032 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,032 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,032 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,032 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,032 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,033 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,033 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,033 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,033 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,033 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,033 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,034 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,034 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,034 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,034 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,034 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,034 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,034 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,035 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,035 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,035 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,035 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,036 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,036 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,036 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,036 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,036 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,036 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,036 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,036 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,037 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,037 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,037 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,037 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,037 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,037 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,037 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,037 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,037 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,038 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,038 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,038 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,038 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,038 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,038 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,039 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,039 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,039 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,039 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,039 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,039 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,039 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,039 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,040 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,040 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,040 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,040 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,040 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,040 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,041 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,041 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,041 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,041 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,041 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,041 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,041 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,041 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,042 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,042 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,042 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,042 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,042 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,042 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,042 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,042 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,043 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,043 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,043 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,043 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,044 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,044 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,044 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,046 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,047 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,047 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,047 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,047 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,047 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,048 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,048 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,048 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,048 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,049 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,049 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,049 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,049 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,050 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,050 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,050 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,050 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,050 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,050 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,050 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,051 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,051 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,051 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,051 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,051 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,051 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,051 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,051 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,051 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,051 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,052 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:56:39,052 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-12-06 23:56:39,092 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-06 23:56:39,100 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-06 23:56:39,100 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-12-06 23:56:39,111 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 122 places, 114 transitions, 243 flow [2021-12-06 23:56:39,150 INFO L129 PetriNetUnfolder]: 2/111 cut-off events. [2021-12-06 23:56:39,150 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-12-06 23:56:39,154 INFO L84 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 111 events. 2/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 54 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2021-12-06 23:56:39,155 INFO L82 GeneralOperation]: Start removeDead. Operand has 122 places, 114 transitions, 243 flow [2021-12-06 23:56:39,159 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 111 transitions, 231 flow [2021-12-06 23:56:39,171 INFO L129 PetriNetUnfolder]: 0/60 cut-off events. [2021-12-06 23:56:39,171 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-12-06 23:56:39,171 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 23:56:39,172 INFO L254 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] [2021-12-06 23:56:39,172 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-06 23:56:39,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:56:39,177 INFO L85 PathProgramCache]: Analyzing trace with hash -388777824, now seen corresponding path program 1 times [2021-12-06 23:56:39,183 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:56:39,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412053241] [2021-12-06 23:56:39,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:56:39,184 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:56:39,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:56:39,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 23:56:39,424 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:56:39,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412053241] [2021-12-06 23:56:39,425 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412053241] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:56:39,425 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:56:39,425 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-06 23:56:39,426 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612100383] [2021-12-06 23:56:39,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:56:39,433 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 23:56:39,433 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:56:39,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 23:56:39,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 23:56:39,457 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 114 [2021-12-06 23:56:39,461 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 111 transitions, 231 flow. Second operand has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:56:39,461 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 23:56:39,461 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 114 [2021-12-06 23:56:39,463 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 23:56:39,590 INFO L129 PetriNetUnfolder]: 57/323 cut-off events. [2021-12-06 23:56:39,590 INFO L130 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2021-12-06 23:56:39,592 INFO L84 FinitePrefix]: Finished finitePrefix Result has 448 conditions, 323 events. 57/323 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1318 event pairs, 11 based on Foata normal form. 12/318 useless extension candidates. Maximal degree in co-relation 397. Up to 75 conditions per place. [2021-12-06 23:56:39,595 INFO L132 encePairwiseOnDemand]: 109/114 looper letters, 13 selfloop transitions, 2 changer transitions 0/112 dead transitions. [2021-12-06 23:56:39,595 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 112 transitions, 266 flow [2021-12-06 23:56:39,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 23:56:39,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-12-06 23:56:39,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 320 transitions. [2021-12-06 23:56:39,607 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.935672514619883 [2021-12-06 23:56:39,608 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 320 transitions. [2021-12-06 23:56:39,608 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 320 transitions. [2021-12-06 23:56:39,610 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 23:56:39,613 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 320 transitions. [2021-12-06 23:56:39,617 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:56:39,623 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:56:39,624 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:56:39,626 INFO L186 Difference]: Start difference. First operand has 119 places, 111 transitions, 231 flow. Second operand 3 states and 320 transitions. [2021-12-06 23:56:39,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 112 transitions, 266 flow [2021-12-06 23:56:39,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 112 transitions, 262 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-12-06 23:56:39,634 INFO L242 Difference]: Finished difference. Result has 116 places, 107 transitions, 224 flow [2021-12-06 23:56:39,636 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=224, PETRI_PLACES=116, PETRI_TRANSITIONS=107} [2021-12-06 23:56:39,639 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, -3 predicate places. [2021-12-06 23:56:39,639 INFO L470 AbstractCegarLoop]: Abstraction has has 116 places, 107 transitions, 224 flow [2021-12-06 23:56:39,640 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:56:39,640 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 23:56:39,640 INFO L254 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] [2021-12-06 23:56:39,640 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-06 23:56:39,641 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-06 23:56:39,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:56:39,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1563106335, now seen corresponding path program 1 times [2021-12-06 23:56:39,641 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:56:39,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357847774] [2021-12-06 23:56:39,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:56:39,642 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:56:39,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:56:39,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 23:56:39,859 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:56:39,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357847774] [2021-12-06 23:56:39,859 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357847774] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:56:39,860 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:56:39,860 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 23:56:39,860 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189369484] [2021-12-06 23:56:39,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:56:39,861 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 23:56:39,861 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:56:39,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 23:56:39,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-06 23:56:39,864 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 114 [2021-12-06 23:56:39,865 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 107 transitions, 224 flow. Second operand has 6 states, 6 states have (on average 91.83333333333333) internal successors, (551), 6 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:56:39,865 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 23:56:39,865 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 114 [2021-12-06 23:56:39,865 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 23:56:40,458 INFO L129 PetriNetUnfolder]: 1152/3062 cut-off events. [2021-12-06 23:56:40,459 INFO L130 PetriNetUnfolder]: For 135/135 co-relation queries the response was YES. [2021-12-06 23:56:40,468 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4978 conditions, 3062 events. 1152/3062 cut-off events. For 135/135 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 24421 event pairs, 256 based on Foata normal form. 0/2973 useless extension candidates. Maximal degree in co-relation 4927. Up to 992 conditions per place. [2021-12-06 23:56:40,478 INFO L132 encePairwiseOnDemand]: 107/114 looper letters, 25 selfloop transitions, 3 changer transitions 63/167 dead transitions. [2021-12-06 23:56:40,478 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 167 transitions, 522 flow [2021-12-06 23:56:40,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-06 23:56:40,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-06 23:56:40,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 892 transitions. [2021-12-06 23:56:40,497 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8693957115009746 [2021-12-06 23:56:40,498 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 892 transitions. [2021-12-06 23:56:40,498 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 892 transitions. [2021-12-06 23:56:40,499 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 23:56:40,499 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 892 transitions. [2021-12-06 23:56:40,503 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 99.11111111111111) internal successors, (892), 9 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:56:40,508 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:56:40,509 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:56:40,509 INFO L186 Difference]: Start difference. First operand has 116 places, 107 transitions, 224 flow. Second operand 9 states and 892 transitions. [2021-12-06 23:56:40,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 167 transitions, 522 flow [2021-12-06 23:56:40,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 167 transitions, 504 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-12-06 23:56:40,516 INFO L242 Difference]: Finished difference. Result has 129 places, 97 transitions, 239 flow [2021-12-06 23:56:40,516 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=239, PETRI_PLACES=129, PETRI_TRANSITIONS=97} [2021-12-06 23:56:40,517 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 10 predicate places. [2021-12-06 23:56:40,517 INFO L470 AbstractCegarLoop]: Abstraction has has 129 places, 97 transitions, 239 flow [2021-12-06 23:56:40,518 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 91.83333333333333) internal successors, (551), 6 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:56:40,518 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 23:56:40,518 INFO L254 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] [2021-12-06 23:56:40,519 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-06 23:56:40,519 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-06 23:56:40,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:56:40,520 INFO L85 PathProgramCache]: Analyzing trace with hash -153763700, now seen corresponding path program 1 times [2021-12-06 23:56:40,520 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:56:40,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365955248] [2021-12-06 23:56:40,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:56:40,520 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:56:40,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:56:40,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 23:56:40,649 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:56:40,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365955248] [2021-12-06 23:56:40,650 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365955248] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:56:40,650 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:56:40,650 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 23:56:40,650 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124079377] [2021-12-06 23:56:40,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:56:40,651 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 23:56:40,651 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:56:40,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 23:56:40,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-06 23:56:40,652 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 114 [2021-12-06 23:56:40,653 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 97 transitions, 239 flow. Second operand has 6 states, 6 states have (on average 94.83333333333333) internal successors, (569), 6 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:56:40,653 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 23:56:40,654 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 114 [2021-12-06 23:56:40,654 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 23:56:40,978 INFO L129 PetriNetUnfolder]: 420/940 cut-off events. [2021-12-06 23:56:40,978 INFO L130 PetriNetUnfolder]: For 682/682 co-relation queries the response was YES. [2021-12-06 23:56:40,982 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2147 conditions, 940 events. 420/940 cut-off events. For 682/682 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 5198 event pairs, 98 based on Foata normal form. 30/931 useless extension candidates. Maximal degree in co-relation 2089. Up to 295 conditions per place. [2021-12-06 23:56:40,987 INFO L132 encePairwiseOnDemand]: 108/114 looper letters, 18 selfloop transitions, 2 changer transitions 31/132 dead transitions. [2021-12-06 23:56:40,987 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 132 transitions, 429 flow [2021-12-06 23:56:40,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-06 23:56:40,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-06 23:56:40,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 890 transitions. [2021-12-06 23:56:40,991 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8674463937621832 [2021-12-06 23:56:40,992 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 890 transitions. [2021-12-06 23:56:40,992 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 890 transitions. [2021-12-06 23:56:40,993 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 23:56:40,993 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 890 transitions. [2021-12-06 23:56:40,996 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 98.88888888888889) internal successors, (890), 9 states have internal predecessors, (890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:56:40,999 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:56:41,000 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:56:41,000 INFO L186 Difference]: Start difference. First operand has 129 places, 97 transitions, 239 flow. Second operand 9 states and 890 transitions. [2021-12-06 23:56:41,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 132 transitions, 429 flow [2021-12-06 23:56:41,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 132 transitions, 412 flow, removed 7 selfloop flow, removed 4 redundant places. [2021-12-06 23:56:41,010 INFO L242 Difference]: Finished difference. Result has 122 places, 97 transitions, 250 flow [2021-12-06 23:56:41,011 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=250, PETRI_PLACES=122, PETRI_TRANSITIONS=97} [2021-12-06 23:56:41,012 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 3 predicate places. [2021-12-06 23:56:41,012 INFO L470 AbstractCegarLoop]: Abstraction has has 122 places, 97 transitions, 250 flow [2021-12-06 23:56:41,012 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 94.83333333333333) internal successors, (569), 6 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:56:41,013 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 23:56:41,013 INFO L254 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] [2021-12-06 23:56:41,013 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-06 23:56:41,013 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-06 23:56:41,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:56:41,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1392322563, now seen corresponding path program 1 times [2021-12-06 23:56:41,014 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:56:41,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127861778] [2021-12-06 23:56:41,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:56:41,014 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:56:41,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:56:41,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 23:56:41,121 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:56:41,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127861778] [2021-12-06 23:56:41,121 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127861778] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:56:41,121 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:56:41,121 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 23:56:41,121 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910788608] [2021-12-06 23:56:41,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:56:41,122 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 23:56:41,122 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:56:41,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 23:56:41,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-06 23:56:41,123 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 114 [2021-12-06 23:56:41,124 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 97 transitions, 250 flow. Second operand has 6 states, 6 states have (on average 94.83333333333333) internal successors, (569), 6 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:56:41,124 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 23:56:41,124 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 114 [2021-12-06 23:56:41,124 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 23:56:41,411 INFO L129 PetriNetUnfolder]: 420/924 cut-off events. [2021-12-06 23:56:41,411 INFO L130 PetriNetUnfolder]: For 1073/1073 co-relation queries the response was YES. [2021-12-06 23:56:41,415 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2284 conditions, 924 events. 420/924 cut-off events. For 1073/1073 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 4907 event pairs, 98 based on Foata normal form. 30/913 useless extension candidates. Maximal degree in co-relation 2221. Up to 295 conditions per place. [2021-12-06 23:56:41,418 INFO L132 encePairwiseOnDemand]: 108/114 looper letters, 18 selfloop transitions, 2 changer transitions 31/132 dead transitions. [2021-12-06 23:56:41,418 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 132 transitions, 450 flow [2021-12-06 23:56:41,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-06 23:56:41,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-06 23:56:41,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 890 transitions. [2021-12-06 23:56:41,421 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8674463937621832 [2021-12-06 23:56:41,421 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 890 transitions. [2021-12-06 23:56:41,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 890 transitions. [2021-12-06 23:56:41,422 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 23:56:41,422 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 890 transitions. [2021-12-06 23:56:41,424 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 98.88888888888889) internal successors, (890), 9 states have internal predecessors, (890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:56:41,426 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:56:41,426 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:56:41,427 INFO L186 Difference]: Start difference. First operand has 122 places, 97 transitions, 250 flow. Second operand 9 states and 890 transitions. [2021-12-06 23:56:41,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 132 transitions, 450 flow [2021-12-06 23:56:41,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 132 transitions, 418 flow, removed 14 selfloop flow, removed 8 redundant places. [2021-12-06 23:56:41,434 INFO L242 Difference]: Finished difference. Result has 123 places, 97 transitions, 254 flow [2021-12-06 23:56:41,434 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=254, PETRI_PLACES=123, PETRI_TRANSITIONS=97} [2021-12-06 23:56:41,435 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 4 predicate places. [2021-12-06 23:56:41,435 INFO L470 AbstractCegarLoop]: Abstraction has has 123 places, 97 transitions, 254 flow [2021-12-06 23:56:41,435 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 94.83333333333333) internal successors, (569), 6 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:56:41,436 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 23:56:41,436 INFO L254 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] [2021-12-06 23:56:41,436 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-06 23:56:41,436 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-06 23:56:41,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:56:41,436 INFO L85 PathProgramCache]: Analyzing trace with hash -412497469, now seen corresponding path program 1 times [2021-12-06 23:56:41,436 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:56:41,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99696780] [2021-12-06 23:56:41,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:56:41,437 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:56:41,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:56:41,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 23:56:41,587 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:56:41,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99696780] [2021-12-06 23:56:41,588 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99696780] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:56:41,588 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:56:41,588 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-06 23:56:41,588 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626017709] [2021-12-06 23:56:41,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:56:41,589 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-06 23:56:41,589 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:56:41,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-06 23:56:41,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-12-06 23:56:41,590 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 114 [2021-12-06 23:56:41,591 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 97 transitions, 254 flow. Second operand has 10 states, 10 states have (on average 91.4) internal successors, (914), 10 states have internal predecessors, (914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:56:41,591 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 23:56:41,591 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 114 [2021-12-06 23:56:41,591 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 23:56:42,026 INFO L129 PetriNetUnfolder]: 482/1087 cut-off events. [2021-12-06 23:56:42,026 INFO L130 PetriNetUnfolder]: For 1266/1266 co-relation queries the response was YES. [2021-12-06 23:56:42,029 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2664 conditions, 1087 events. 482/1087 cut-off events. For 1266/1266 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 5741 event pairs, 212 based on Foata normal form. 26/1069 useless extension candidates. Maximal degree in co-relation 2597. Up to 452 conditions per place. [2021-12-06 23:56:42,034 INFO L132 encePairwiseOnDemand]: 101/114 looper letters, 20 selfloop transitions, 11 changer transitions 43/152 dead transitions. [2021-12-06 23:56:42,034 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 152 transitions, 566 flow [2021-12-06 23:56:42,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-06 23:56:42,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2021-12-06 23:56:42,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1427 transitions. [2021-12-06 23:56:42,039 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8345029239766082 [2021-12-06 23:56:42,040 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1427 transitions. [2021-12-06 23:56:42,040 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1427 transitions. [2021-12-06 23:56:42,041 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 23:56:42,041 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1427 transitions. [2021-12-06 23:56:42,045 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 95.13333333333334) internal successors, (1427), 15 states have internal predecessors, (1427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:56:42,049 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 114.0) internal successors, (1824), 16 states have internal predecessors, (1824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:56:42,050 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 114.0) internal successors, (1824), 16 states have internal predecessors, (1824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:56:42,050 INFO L186 Difference]: Start difference. First operand has 123 places, 97 transitions, 254 flow. Second operand 15 states and 1427 transitions. [2021-12-06 23:56:42,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 152 transitions, 566 flow [2021-12-06 23:56:42,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 152 transitions, 526 flow, removed 18 selfloop flow, removed 8 redundant places. [2021-12-06 23:56:42,059 INFO L242 Difference]: Finished difference. Result has 134 places, 104 transitions, 341 flow [2021-12-06 23:56:42,059 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=341, PETRI_PLACES=134, PETRI_TRANSITIONS=104} [2021-12-06 23:56:42,060 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 15 predicate places. [2021-12-06 23:56:42,060 INFO L470 AbstractCegarLoop]: Abstraction has has 134 places, 104 transitions, 341 flow [2021-12-06 23:56:42,060 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 91.4) internal successors, (914), 10 states have internal predecessors, (914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:56:42,060 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 23:56:42,060 INFO L254 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] [2021-12-06 23:56:42,060 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-06 23:56:42,060 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-06 23:56:42,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:56:42,061 INFO L85 PathProgramCache]: Analyzing trace with hash 179682420, now seen corresponding path program 1 times [2021-12-06 23:56:42,061 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:56:42,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314580130] [2021-12-06 23:56:42,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:56:42,061 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:56:42,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:56:42,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 23:56:42,157 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:56:42,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314580130] [2021-12-06 23:56:42,158 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314580130] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:56:42,158 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:56:42,158 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 23:56:42,158 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006400790] [2021-12-06 23:56:42,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:56:42,159 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 23:56:42,159 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:56:42,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 23:56:42,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 23:56:42,160 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 114 [2021-12-06 23:56:42,161 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 104 transitions, 341 flow. Second operand has 7 states, 7 states have (on average 91.14285714285714) internal successors, (638), 7 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:56:42,161 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 23:56:42,161 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 114 [2021-12-06 23:56:42,161 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 23:56:42,790 INFO L129 PetriNetUnfolder]: 950/2077 cut-off events. [2021-12-06 23:56:42,790 INFO L130 PetriNetUnfolder]: For 7056/8657 co-relation queries the response was YES. [2021-12-06 23:56:42,799 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7821 conditions, 2077 events. 950/2077 cut-off events. For 7056/8657 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 13488 event pairs, 238 based on Foata normal form. 34/1998 useless extension candidates. Maximal degree in co-relation 7747. Up to 697 conditions per place. [2021-12-06 23:56:42,810 INFO L132 encePairwiseOnDemand]: 107/114 looper letters, 63 selfloop transitions, 16 changer transitions 17/173 dead transitions. [2021-12-06 23:56:42,810 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 173 transitions, 1039 flow [2021-12-06 23:56:42,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-06 23:56:42,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-12-06 23:56:42,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1058 transitions. [2021-12-06 23:56:42,813 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8437001594896332 [2021-12-06 23:56:42,813 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1058 transitions. [2021-12-06 23:56:42,814 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1058 transitions. [2021-12-06 23:56:42,814 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 23:56:42,814 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1058 transitions. [2021-12-06 23:56:42,816 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 96.18181818181819) internal successors, (1058), 11 states have internal predecessors, (1058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:56:42,819 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 114.0) internal successors, (1368), 12 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:56:42,819 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 114.0) internal successors, (1368), 12 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:56:42,819 INFO L186 Difference]: Start difference. First operand has 134 places, 104 transitions, 341 flow. Second operand 11 states and 1058 transitions. [2021-12-06 23:56:42,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 173 transitions, 1039 flow [2021-12-06 23:56:42,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 173 transitions, 1015 flow, removed 10 selfloop flow, removed 5 redundant places. [2021-12-06 23:56:42,829 INFO L242 Difference]: Finished difference. Result has 139 places, 117 transitions, 535 flow [2021-12-06 23:56:42,829 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=331, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=535, PETRI_PLACES=139, PETRI_TRANSITIONS=117} [2021-12-06 23:56:42,829 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 20 predicate places. [2021-12-06 23:56:42,830 INFO L470 AbstractCegarLoop]: Abstraction has has 139 places, 117 transitions, 535 flow [2021-12-06 23:56:42,830 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 91.14285714285714) internal successors, (638), 7 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:56:42,830 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 23:56:42,830 INFO L254 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] [2021-12-06 23:56:42,830 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-06 23:56:42,831 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-06 23:56:42,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:56:42,831 INFO L85 PathProgramCache]: Analyzing trace with hash 338290766, now seen corresponding path program 2 times [2021-12-06 23:56:42,831 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:56:42,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952384168] [2021-12-06 23:56:42,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:56:42,831 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:56:42,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:56:42,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 23:56:42,910 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:56:42,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952384168] [2021-12-06 23:56:42,911 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952384168] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:56:42,911 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:56:42,911 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 23:56:42,911 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826630587] [2021-12-06 23:56:42,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:56:42,911 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 23:56:42,911 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:56:42,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 23:56:42,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 23:56:42,912 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 114 [2021-12-06 23:56:42,913 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 117 transitions, 535 flow. Second operand has 7 states, 7 states have (on average 91.14285714285714) internal successors, (638), 7 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:56:42,913 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 23:56:42,913 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 114 [2021-12-06 23:56:42,913 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 23:56:43,426 INFO L129 PetriNetUnfolder]: 1162/2578 cut-off events. [2021-12-06 23:56:43,426 INFO L130 PetriNetUnfolder]: For 12523/15624 co-relation queries the response was YES. [2021-12-06 23:56:43,442 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10573 conditions, 2578 events. 1162/2578 cut-off events. For 12523/15624 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 18720 event pairs, 277 based on Foata normal form. 38/2507 useless extension candidates. Maximal degree in co-relation 10494. Up to 1014 conditions per place. [2021-12-06 23:56:43,455 INFO L132 encePairwiseOnDemand]: 105/114 looper letters, 46 selfloop transitions, 6 changer transitions 30/159 dead transitions. [2021-12-06 23:56:43,455 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 159 transitions, 1046 flow [2021-12-06 23:56:43,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 23:56:43,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-12-06 23:56:43,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 682 transitions. [2021-12-06 23:56:43,458 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8546365914786967 [2021-12-06 23:56:43,458 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 682 transitions. [2021-12-06 23:56:43,458 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 682 transitions. [2021-12-06 23:56:43,459 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 23:56:43,459 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 682 transitions. [2021-12-06 23:56:43,461 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 97.42857142857143) internal successors, (682), 7 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:56:43,463 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 114.0) internal successors, (912), 8 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:56:43,464 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 114.0) internal successors, (912), 8 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:56:43,464 INFO L186 Difference]: Start difference. First operand has 139 places, 117 transitions, 535 flow. Second operand 7 states and 682 transitions. [2021-12-06 23:56:43,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 159 transitions, 1046 flow [2021-12-06 23:56:43,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 159 transitions, 948 flow, removed 44 selfloop flow, removed 1 redundant places. [2021-12-06 23:56:43,492 INFO L242 Difference]: Finished difference. Result has 148 places, 117 transitions, 486 flow [2021-12-06 23:56:43,492 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=458, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=486, PETRI_PLACES=148, PETRI_TRANSITIONS=117} [2021-12-06 23:56:43,493 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 29 predicate places. [2021-12-06 23:56:43,493 INFO L470 AbstractCegarLoop]: Abstraction has has 148 places, 117 transitions, 486 flow [2021-12-06 23:56:43,493 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 91.14285714285714) internal successors, (638), 7 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:56:43,493 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 23:56:43,493 INFO L254 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] [2021-12-06 23:56:43,494 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-06 23:56:43,494 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-06 23:56:43,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:56:43,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1076000987, now seen corresponding path program 1 times [2021-12-06 23:56:43,494 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:56:43,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243888978] [2021-12-06 23:56:43,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:56:43,494 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:56:43,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:56:43,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 23:56:43,564 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:56:43,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243888978] [2021-12-06 23:56:43,564 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243888978] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:56:43,565 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:56:43,565 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 23:56:43,565 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837269038] [2021-12-06 23:56:43,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:56:43,565 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 23:56:43,565 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:56:43,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 23:56:43,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-06 23:56:43,566 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 114 [2021-12-06 23:56:43,567 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 117 transitions, 486 flow. Second operand has 6 states, 6 states have (on average 92.5) internal successors, (555), 6 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:56:43,567 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 23:56:43,567 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 114 [2021-12-06 23:56:43,567 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 23:56:44,041 INFO L129 PetriNetUnfolder]: 842/1978 cut-off events. [2021-12-06 23:56:44,041 INFO L130 PetriNetUnfolder]: For 7510/8607 co-relation queries the response was YES. [2021-12-06 23:56:44,049 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7462 conditions, 1978 events. 842/1978 cut-off events. For 7510/8607 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 13487 event pairs, 313 based on Foata normal form. 24/1895 useless extension candidates. Maximal degree in co-relation 7377. Up to 688 conditions per place. [2021-12-06 23:56:44,054 INFO L132 encePairwiseOnDemand]: 108/114 looper letters, 29 selfloop transitions, 2 changer transitions 50/158 dead transitions. [2021-12-06 23:56:44,054 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 158 transitions, 975 flow [2021-12-06 23:56:44,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-06 23:56:44,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-06 23:56:44,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 870 transitions. [2021-12-06 23:56:44,057 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.847953216374269 [2021-12-06 23:56:44,057 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 870 transitions. [2021-12-06 23:56:44,057 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 870 transitions. [2021-12-06 23:56:44,058 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 23:56:44,058 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 870 transitions. [2021-12-06 23:56:44,060 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 96.66666666666667) internal successors, (870), 9 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) [2021-12-06 23:56:44,061 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:56:44,062 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:56:44,062 INFO L186 Difference]: Start difference. First operand has 148 places, 117 transitions, 486 flow. Second operand 9 states and 870 transitions. [2021-12-06 23:56:44,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 158 transitions, 975 flow [2021-12-06 23:56:44,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 158 transitions, 927 flow, removed 18 selfloop flow, removed 7 redundant places. [2021-12-06 23:56:44,077 INFO L242 Difference]: Finished difference. Result has 153 places, 100 transitions, 348 flow [2021-12-06 23:56:44,077 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=348, PETRI_PLACES=153, PETRI_TRANSITIONS=100} [2021-12-06 23:56:44,078 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 34 predicate places. [2021-12-06 23:56:44,078 INFO L470 AbstractCegarLoop]: Abstraction has has 153 places, 100 transitions, 348 flow [2021-12-06 23:56:44,078 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.5) internal successors, (555), 6 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:56:44,078 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 23:56:44,078 INFO L254 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] [2021-12-06 23:56:44,078 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-06 23:56:44,079 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-06 23:56:44,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:56:44,079 INFO L85 PathProgramCache]: Analyzing trace with hash 267818572, now seen corresponding path program 1 times [2021-12-06 23:56:44,079 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:56:44,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074021844] [2021-12-06 23:56:44,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:56:44,079 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:56:44,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:56:44,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 23:56:44,231 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:56:44,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074021844] [2021-12-06 23:56:44,231 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074021844] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:56:44,231 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:56:44,231 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-06 23:56:44,231 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017573941] [2021-12-06 23:56:44,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:56:44,232 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-06 23:56:44,232 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:56:44,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-06 23:56:44,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-12-06 23:56:44,233 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 114 [2021-12-06 23:56:44,234 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 100 transitions, 348 flow. Second operand has 10 states, 10 states have (on average 90.6) internal successors, (906), 10 states have internal predecessors, (906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:56:44,234 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 23:56:44,234 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 114 [2021-12-06 23:56:44,234 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 23:56:44,629 INFO L129 PetriNetUnfolder]: 222/596 cut-off events. [2021-12-06 23:56:44,629 INFO L130 PetriNetUnfolder]: For 3072/3129 co-relation queries the response was YES. [2021-12-06 23:56:44,631 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2255 conditions, 596 events. 222/596 cut-off events. For 3072/3129 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2672 event pairs, 65 based on Foata normal form. 20/601 useless extension candidates. Maximal degree in co-relation 2166. Up to 244 conditions per place. [2021-12-06 23:56:44,634 INFO L132 encePairwiseOnDemand]: 101/114 looper letters, 25 selfloop transitions, 14 changer transitions 42/156 dead transitions. [2021-12-06 23:56:44,634 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 156 transitions, 951 flow [2021-12-06 23:56:44,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-06 23:56:44,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-12-06 23:56:44,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1501 transitions. [2021-12-06 23:56:44,639 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8229166666666666 [2021-12-06 23:56:44,639 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1501 transitions. [2021-12-06 23:56:44,639 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1501 transitions. [2021-12-06 23:56:44,640 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 23:56:44,640 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1501 transitions. [2021-12-06 23:56:44,644 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 93.8125) internal successors, (1501), 16 states have internal predecessors, (1501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:56:44,649 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 114.0) internal successors, (1938), 17 states have internal predecessors, (1938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:56:44,650 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 114.0) internal successors, (1938), 17 states have internal predecessors, (1938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:56:44,650 INFO L186 Difference]: Start difference. First operand has 153 places, 100 transitions, 348 flow. Second operand 16 states and 1501 transitions. [2021-12-06 23:56:44,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 156 transitions, 951 flow [2021-12-06 23:56:44,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 156 transitions, 807 flow, removed 67 selfloop flow, removed 23 redundant places. [2021-12-06 23:56:44,666 INFO L242 Difference]: Finished difference. Result has 143 places, 111 transitions, 454 flow [2021-12-06 23:56:44,666 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=454, PETRI_PLACES=143, PETRI_TRANSITIONS=111} [2021-12-06 23:56:44,666 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 24 predicate places. [2021-12-06 23:56:44,666 INFO L470 AbstractCegarLoop]: Abstraction has has 143 places, 111 transitions, 454 flow [2021-12-06 23:56:44,667 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 90.6) internal successors, (906), 10 states have internal predecessors, (906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:56:44,667 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 23:56:44,667 INFO L254 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] [2021-12-06 23:56:44,667 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-06 23:56:44,667 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-06 23:56:44,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:56:44,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1810698876, now seen corresponding path program 2 times [2021-12-06 23:56:44,668 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:56:44,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470414981] [2021-12-06 23:56:44,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:56:44,668 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:56:44,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:56:44,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 23:56:44,854 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:56:44,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470414981] [2021-12-06 23:56:44,854 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470414981] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:56:44,854 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:56:44,854 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-06 23:56:44,854 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672367571] [2021-12-06 23:56:44,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:56:44,855 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-06 23:56:44,855 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:56:44,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-06 23:56:44,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-12-06 23:56:44,856 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 114 [2021-12-06 23:56:44,857 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 111 transitions, 454 flow. Second operand has 11 states, 11 states have (on average 90.45454545454545) internal successors, (995), 11 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:56:44,857 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 23:56:44,857 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 114 [2021-12-06 23:56:44,857 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 23:56:45,148 INFO L129 PetriNetUnfolder]: 206/563 cut-off events. [2021-12-06 23:56:45,149 INFO L130 PetriNetUnfolder]: For 2968/3117 co-relation queries the response was YES. [2021-12-06 23:56:45,151 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2440 conditions, 563 events. 206/563 cut-off events. For 2968/3117 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2484 event pairs, 60 based on Foata normal form. 32/576 useless extension candidates. Maximal degree in co-relation 2358. Up to 230 conditions per place. [2021-12-06 23:56:45,154 INFO L132 encePairwiseOnDemand]: 101/114 looper letters, 21 selfloop transitions, 16 changer transitions 28/140 dead transitions. [2021-12-06 23:56:45,154 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 140 transitions, 882 flow [2021-12-06 23:56:45,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-06 23:56:45,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-12-06 23:56:45,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1303 transitions. [2021-12-06 23:56:45,158 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8164160401002506 [2021-12-06 23:56:45,158 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1303 transitions. [2021-12-06 23:56:45,158 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1303 transitions. [2021-12-06 23:56:45,159 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 23:56:45,159 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1303 transitions. [2021-12-06 23:56:45,162 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 93.07142857142857) internal successors, (1303), 14 states have internal predecessors, (1303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:56:45,165 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 114.0) internal successors, (1710), 15 states have internal predecessors, (1710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:56:45,165 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 114.0) internal successors, (1710), 15 states have internal predecessors, (1710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:56:45,165 INFO L186 Difference]: Start difference. First operand has 143 places, 111 transitions, 454 flow. Second operand 14 states and 1303 transitions. [2021-12-06 23:56:45,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 140 transitions, 882 flow [2021-12-06 23:56:45,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 140 transitions, 832 flow, removed 22 selfloop flow, removed 6 redundant places. [2021-12-06 23:56:45,173 INFO L242 Difference]: Finished difference. Result has 147 places, 110 transitions, 463 flow [2021-12-06 23:56:45,173 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=412, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=463, PETRI_PLACES=147, PETRI_TRANSITIONS=110} [2021-12-06 23:56:45,174 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 28 predicate places. [2021-12-06 23:56:45,174 INFO L470 AbstractCegarLoop]: Abstraction has has 147 places, 110 transitions, 463 flow [2021-12-06 23:56:45,175 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 90.45454545454545) internal successors, (995), 11 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:56:45,175 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 23:56:45,175 INFO L254 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] [2021-12-06 23:56:45,175 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-06 23:56:45,175 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-06 23:56:45,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:56:45,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1019068748, now seen corresponding path program 1 times [2021-12-06 23:56:45,176 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:56:45,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463524160] [2021-12-06 23:56:45,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:56:45,177 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:56:45,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:56:45,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 23:56:45,267 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:56:45,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463524160] [2021-12-06 23:56:45,267 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463524160] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:56:45,267 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:56:45,267 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 23:56:45,268 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105531406] [2021-12-06 23:56:45,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:56:45,268 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 23:56:45,268 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:56:45,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 23:56:45,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-06 23:56:45,269 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 114 [2021-12-06 23:56:45,270 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 110 transitions, 463 flow. Second operand has 6 states, 6 states have (on average 92.33333333333333) internal successors, (554), 6 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:56:45,270 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 23:56:45,270 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 114 [2021-12-06 23:56:45,270 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 23:56:45,647 INFO L129 PetriNetUnfolder]: 814/1729 cut-off events. [2021-12-06 23:56:45,647 INFO L130 PetriNetUnfolder]: For 12998/13182 co-relation queries the response was YES. [2021-12-06 23:56:45,652 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6904 conditions, 1729 events. 814/1729 cut-off events. For 12998/13182 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 10203 event pairs, 47 based on Foata normal form. 31/1695 useless extension candidates. Maximal degree in co-relation 6820. Up to 500 conditions per place. [2021-12-06 23:56:45,659 INFO L132 encePairwiseOnDemand]: 104/114 looper letters, 36 selfloop transitions, 7 changer transitions 46/165 dead transitions. [2021-12-06 23:56:45,660 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 165 transitions, 1052 flow [2021-12-06 23:56:45,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 23:56:45,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-06 23:56:45,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 976 transitions. [2021-12-06 23:56:45,662 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.856140350877193 [2021-12-06 23:56:45,662 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 976 transitions. [2021-12-06 23:56:45,662 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 976 transitions. [2021-12-06 23:56:45,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 23:56:45,663 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 976 transitions. [2021-12-06 23:56:45,664 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 97.6) internal successors, (976), 10 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:56:45,666 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:56:45,666 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:56:45,666 INFO L186 Difference]: Start difference. First operand has 147 places, 110 transitions, 463 flow. Second operand 10 states and 976 transitions. [2021-12-06 23:56:45,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 165 transitions, 1052 flow [2021-12-06 23:56:45,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 165 transitions, 868 flow, removed 67 selfloop flow, removed 19 redundant places. [2021-12-06 23:56:45,674 INFO L242 Difference]: Finished difference. Result has 137 places, 105 transitions, 382 flow [2021-12-06 23:56:45,674 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=382, PETRI_PLACES=137, PETRI_TRANSITIONS=105} [2021-12-06 23:56:45,674 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 18 predicate places. [2021-12-06 23:56:45,674 INFO L470 AbstractCegarLoop]: Abstraction has has 137 places, 105 transitions, 382 flow [2021-12-06 23:56:45,675 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.33333333333333) internal successors, (554), 6 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:56:45,675 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 23:56:45,675 INFO L254 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] [2021-12-06 23:56:45,675 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-06 23:56:45,675 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-06 23:56:45,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:56:45,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1823898893, now seen corresponding path program 1 times [2021-12-06 23:56:45,676 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:56:45,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511856697] [2021-12-06 23:56:45,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:56:45,676 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:56:45,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:56:45,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 23:56:45,753 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:56:45,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511856697] [2021-12-06 23:56:45,753 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511856697] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:56:45,753 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:56:45,753 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 23:56:45,754 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459656910] [2021-12-06 23:56:45,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:56:45,754 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 23:56:45,754 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:56:45,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 23:56:45,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-06 23:56:45,755 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 114 [2021-12-06 23:56:45,756 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 105 transitions, 382 flow. Second operand has 7 states, 7 states have (on average 92.14285714285714) internal successors, (645), 7 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:56:45,756 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 23:56:45,756 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 114 [2021-12-06 23:56:45,756 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 23:56:46,044 INFO L129 PetriNetUnfolder]: 348/945 cut-off events. [2021-12-06 23:56:46,044 INFO L130 PetriNetUnfolder]: For 3697/3770 co-relation queries the response was YES. [2021-12-06 23:56:46,047 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3633 conditions, 945 events. 348/945 cut-off events. For 3697/3770 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 5386 event pairs, 24 based on Foata normal form. 29/959 useless extension candidates. Maximal degree in co-relation 3558. Up to 236 conditions per place. [2021-12-06 23:56:46,050 INFO L132 encePairwiseOnDemand]: 104/114 looper letters, 44 selfloop transitions, 18 changer transitions 23/161 dead transitions. [2021-12-06 23:56:46,050 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 161 transitions, 1041 flow [2021-12-06 23:56:46,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-06 23:56:46,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-12-06 23:56:46,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1072 transitions. [2021-12-06 23:56:46,052 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8548644338118022 [2021-12-06 23:56:46,052 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1072 transitions. [2021-12-06 23:56:46,052 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1072 transitions. [2021-12-06 23:56:46,052 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 23:56:46,052 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1072 transitions. [2021-12-06 23:56:46,054 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) [2021-12-06 23:56:46,055 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 114.0) internal successors, (1368), 12 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:56:46,056 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 114.0) internal successors, (1368), 12 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:56:46,056 INFO L186 Difference]: Start difference. First operand has 137 places, 105 transitions, 382 flow. Second operand 11 states and 1072 transitions. [2021-12-06 23:56:46,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 161 transitions, 1041 flow [2021-12-06 23:56:46,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 161 transitions, 1025 flow, removed 4 selfloop flow, removed 4 redundant places. [2021-12-06 23:56:46,062 INFO L242 Difference]: Finished difference. Result has 145 places, 120 transitions, 559 flow [2021-12-06 23:56:46,062 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=373, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=559, PETRI_PLACES=145, PETRI_TRANSITIONS=120} [2021-12-06 23:56:46,063 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 26 predicate places. [2021-12-06 23:56:46,063 INFO L470 AbstractCegarLoop]: Abstraction has has 145 places, 120 transitions, 559 flow [2021-12-06 23:56:46,063 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 92.14285714285714) internal successors, (645), 7 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:56:46,063 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 23:56:46,063 INFO L254 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] [2021-12-06 23:56:46,063 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-06 23:56:46,063 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-06 23:56:46,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:56:46,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1630077358, now seen corresponding path program 1 times [2021-12-06 23:56:46,064 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:56:46,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476612477] [2021-12-06 23:56:46,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:56:46,064 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:56:46,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:56:46,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 23:56:46,141 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:56:46,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476612477] [2021-12-06 23:56:46,141 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476612477] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:56:46,141 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:56:46,141 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-06 23:56:46,141 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870152798] [2021-12-06 23:56:46,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:56:46,141 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-06 23:56:46,142 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:56:46,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-06 23:56:46,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-06 23:56:46,142 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 114 [2021-12-06 23:56:46,143 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 120 transitions, 559 flow. Second operand has 8 states, 8 states have (on average 92.125) internal successors, (737), 8 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:56:46,143 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 23:56:46,143 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 114 [2021-12-06 23:56:46,143 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 23:56:46,434 INFO L129 PetriNetUnfolder]: 286/823 cut-off events. [2021-12-06 23:56:46,434 INFO L130 PetriNetUnfolder]: For 4136/4221 co-relation queries the response was YES. [2021-12-06 23:56:46,438 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3533 conditions, 823 events. 286/823 cut-off events. For 4136/4221 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 4964 event pairs, 20 based on Foata normal form. 17/825 useless extension candidates. Maximal degree in co-relation 3453. Up to 198 conditions per place. [2021-12-06 23:56:46,441 INFO L132 encePairwiseOnDemand]: 104/114 looper letters, 37 selfloop transitions, 22 changer transitions 25/160 dead transitions. [2021-12-06 23:56:46,441 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 160 transitions, 1087 flow [2021-12-06 23:56:46,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-06 23:56:46,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-12-06 23:56:46,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1333 transitions. [2021-12-06 23:56:46,444 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8352130325814536 [2021-12-06 23:56:46,444 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1333 transitions. [2021-12-06 23:56:46,444 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1333 transitions. [2021-12-06 23:56:46,444 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 23:56:46,444 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1333 transitions. [2021-12-06 23:56:46,447 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 95.21428571428571) internal successors, (1333), 14 states have internal predecessors, (1333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:56:46,450 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 114.0) internal successors, (1710), 15 states have internal predecessors, (1710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:56:46,451 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 114.0) internal successors, (1710), 15 states have internal predecessors, (1710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:56:46,451 INFO L186 Difference]: Start difference. First operand has 145 places, 120 transitions, 559 flow. Second operand 14 states and 1333 transitions. [2021-12-06 23:56:46,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 160 transitions, 1087 flow [2021-12-06 23:56:46,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 160 transitions, 955 flow, removed 60 selfloop flow, removed 8 redundant places. [2021-12-06 23:56:46,464 INFO L242 Difference]: Finished difference. Result has 157 places, 121 transitions, 551 flow [2021-12-06 23:56:46,464 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=467, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=551, PETRI_PLACES=157, PETRI_TRANSITIONS=121} [2021-12-06 23:56:46,465 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 38 predicate places. [2021-12-06 23:56:46,465 INFO L470 AbstractCegarLoop]: Abstraction has has 157 places, 121 transitions, 551 flow [2021-12-06 23:56:46,465 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 92.125) internal successors, (737), 8 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:56:46,465 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 23:56:46,465 INFO L254 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] [2021-12-06 23:56:46,466 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-06 23:56:46,466 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-06 23:56:46,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:56:46,466 INFO L85 PathProgramCache]: Analyzing trace with hash 302611040, now seen corresponding path program 1 times [2021-12-06 23:56:46,466 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:56:46,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908459879] [2021-12-06 23:56:46,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:56:46,466 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:56:46,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:56:46,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 23:56:46,640 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:56:46,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908459879] [2021-12-06 23:56:46,641 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908459879] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:56:46,641 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:56:46,641 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-12-06 23:56:46,641 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607168078] [2021-12-06 23:56:46,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:56:46,641 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-06 23:56:46,641 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:56:46,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-06 23:56:46,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2021-12-06 23:56:46,642 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 114 [2021-12-06 23:56:46,643 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 121 transitions, 551 flow. Second operand has 13 states, 13 states have (on average 88.6923076923077) internal successors, (1153), 13 states have internal predecessors, (1153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:56:46,643 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 23:56:46,643 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 114 [2021-12-06 23:56:46,643 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 23:56:46,842 INFO L129 PetriNetUnfolder]: 94/668 cut-off events. [2021-12-06 23:56:46,842 INFO L130 PetriNetUnfolder]: For 1701/1746 co-relation queries the response was YES. [2021-12-06 23:56:46,845 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2037 conditions, 668 events. 94/668 cut-off events. For 1701/1746 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 5103 event pairs, 0 based on Foata normal form. 1/639 useless extension candidates. Maximal degree in co-relation 1970. Up to 95 conditions per place. [2021-12-06 23:56:46,846 INFO L132 encePairwiseOnDemand]: 104/114 looper letters, 22 selfloop transitions, 8 changer transitions 8/131 dead transitions. [2021-12-06 23:56:46,847 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 131 transitions, 673 flow [2021-12-06 23:56:46,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 23:56:46,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-06 23:56:46,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 903 transitions. [2021-12-06 23:56:46,848 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7921052631578948 [2021-12-06 23:56:46,848 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 903 transitions. [2021-12-06 23:56:46,848 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 903 transitions. [2021-12-06 23:56:46,848 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 23:56:46,848 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 903 transitions. [2021-12-06 23:56:46,850 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 90.3) internal successors, (903), 10 states have internal predecessors, (903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:56:46,851 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:56:46,851 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:56:46,851 INFO L186 Difference]: Start difference. First operand has 157 places, 121 transitions, 551 flow. Second operand 10 states and 903 transitions. [2021-12-06 23:56:46,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 131 transitions, 673 flow [2021-12-06 23:56:46,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 131 transitions, 555 flow, removed 36 selfloop flow, removed 17 redundant places. [2021-12-06 23:56:46,862 INFO L242 Difference]: Finished difference. Result has 150 places, 120 transitions, 468 flow [2021-12-06 23:56:46,862 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=445, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=468, PETRI_PLACES=150, PETRI_TRANSITIONS=120} [2021-12-06 23:56:46,862 INFO L334 CegarLoopForPetriNet]: 119 programPoint places, 31 predicate places. [2021-12-06 23:56:46,862 INFO L470 AbstractCegarLoop]: Abstraction has has 150 places, 120 transitions, 468 flow [2021-12-06 23:56:46,863 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 88.6923076923077) internal successors, (1153), 13 states have internal predecessors, (1153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:56:46,863 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 23:56:46,863 INFO L254 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] [2021-12-06 23:56:46,863 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-06 23:56:46,864 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-06 23:56:46,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:56:46,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1354931950, now seen corresponding path program 2 times [2021-12-06 23:56:46,864 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:56:46,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867003105] [2021-12-06 23:56:46,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:56:46,864 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:56:46,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 23:56:46,916 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-06 23:56:46,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 23:56:46,986 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-06 23:56:46,986 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-06 23:56:46,987 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2021-12-06 23:56:46,988 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2021-12-06 23:56:46,989 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (3 of 6 remaining) [2021-12-06 23:56:46,989 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (2 of 6 remaining) [2021-12-06 23:56:46,989 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (1 of 6 remaining) [2021-12-06 23:56:46,989 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2021-12-06 23:56:46,989 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-06 23:56:46,992 INFO L732 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:56:46,995 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-12-06 23:56:46,995 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-06 23:56:47,100 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 11:56:47 BasicIcfg [2021-12-06 23:56:47,100 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-06 23:56:47,100 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-06 23:56:47,100 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-06 23:56:47,101 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-06 23:56:47,101 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 11:56:38" (3/4) ... [2021-12-06 23:56:47,103 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-06 23:56:47,188 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fd9ec5b-ff28-40d3-8ca2-084b1c12878c/bin/uautomizer-DrprNOufMa/witness.graphml [2021-12-06 23:56:47,188 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-06 23:56:47,188 INFO L158 Benchmark]: Toolchain (without parser) took 9354.04ms. Allocated memory was 127.9MB in the beginning and 408.9MB in the end (delta: 281.0MB). Free memory was 88.9MB in the beginning and 305.4MB in the end (delta: -216.5MB). Peak memory consumption was 64.4MB. Max. memory is 16.1GB. [2021-12-06 23:56:47,188 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 127.9MB. Free memory is still 106.9MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-06 23:56:47,189 INFO L158 Benchmark]: CACSL2BoogieTranslator took 339.39ms. Allocated memory is still 127.9MB. Free memory was 88.7MB in the beginning and 87.2MB in the end (delta: 1.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-06 23:56:47,189 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.93ms. Allocated memory is still 127.9MB. Free memory was 87.2MB in the beginning and 84.2MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-06 23:56:47,189 INFO L158 Benchmark]: Boogie Preprocessor took 26.82ms. Allocated memory is still 127.9MB. Free memory was 84.2MB in the beginning and 82.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-06 23:56:47,190 INFO L158 Benchmark]: RCFGBuilder took 746.51ms. Allocated memory was 127.9MB in the beginning and 155.2MB in the end (delta: 27.3MB). Free memory was 82.1MB in the beginning and 92.2MB in the end (delta: -10.1MB). Peak memory consumption was 41.7MB. Max. memory is 16.1GB. [2021-12-06 23:56:47,190 INFO L158 Benchmark]: TraceAbstraction took 8104.90ms. Allocated memory was 155.2MB in the beginning and 408.9MB in the end (delta: 253.8MB). Free memory was 92.2MB in the beginning and 333.7MB in the end (delta: -241.4MB). Peak memory consumption was 194.8MB. Max. memory is 16.1GB. [2021-12-06 23:56:47,190 INFO L158 Benchmark]: Witness Printer took 87.48ms. Allocated memory is still 408.9MB. Free memory was 333.7MB in the beginning and 305.4MB in the end (delta: 28.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2021-12-06 23:56:47,192 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.13ms. Allocated memory is still 127.9MB. Free memory is still 106.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 339.39ms. Allocated memory is still 127.9MB. Free memory was 88.7MB in the beginning and 87.2MB in the end (delta: 1.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.93ms. Allocated memory is still 127.9MB. Free memory was 87.2MB in the beginning and 84.2MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.82ms. Allocated memory is still 127.9MB. Free memory was 84.2MB in the beginning and 82.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 746.51ms. Allocated memory was 127.9MB in the beginning and 155.2MB in the end (delta: 27.3MB). Free memory was 82.1MB in the beginning and 92.2MB in the end (delta: -10.1MB). Peak memory consumption was 41.7MB. Max. memory is 16.1GB. * TraceAbstraction took 8104.90ms. Allocated memory was 155.2MB in the beginning and 408.9MB in the end (delta: 253.8MB). Free memory was 92.2MB in the beginning and 333.7MB in the end (delta: -241.4MB). Peak memory consumption was 194.8MB. Max. memory is 16.1GB. * Witness Printer took 87.48ms. Allocated memory is still 408.9MB. Free memory was 333.7MB in the beginning and 305.4MB in the end (delta: 28.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L713] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L714] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0] [L715] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L717] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L718] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L719] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L720] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L721] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L722] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L723] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0] [L724] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0] [L725] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L726] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L727] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0] [L728] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0] [L729] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L730] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L731] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L732] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L733] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L735] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L736] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L737] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L818] 0 pthread_t t1876; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1876={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L819] FCALL, FORK 0 pthread_create(&t1876, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1876, ((void *)0), P0, ((void *)0))=-2, t1876={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L820] 0 pthread_t t1877; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1876={5:0}, t1877={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L821] FCALL, FORK 0 pthread_create(&t1877, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1877, ((void *)0), P1, ((void *)0))=-1, t1876={5:0}, t1877={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L822] 0 pthread_t t1878; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1876={5:0}, t1877={6:0}, t1878={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L823] FCALL, FORK 0 pthread_create(&t1878, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1878, ((void *)0), P2, ((void *)0))=0, t1876={5:0}, t1877={6:0}, t1878={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L761] 2 x$w_buff1 = x$w_buff0 [L762] 2 x$w_buff0 = 2 [L763] 2 x$w_buff1_used = x$w_buff0_used [L764] 2 x$w_buff0_used = (_Bool)1 [L765] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L765] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L766] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L767] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L768] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L769] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L770] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L790] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L793] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L741] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L744] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L747] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L747] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L747] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L747] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L748] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L748] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L749] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L749] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L750] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L750] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L751] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L751] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L776] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L776] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L778] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L779] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L780] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L796] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L796] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L796] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L796] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L797] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L797] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L798] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L798] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L799] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L799] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L800] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L800] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, 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=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1876={5:0}, t1877={6:0}, t1878={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L827] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L827] RET 0 assume_abort_if_not(main$tmp_guard0) [L829] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L829] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L829] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L829] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L830] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L830] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L831] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L831] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L832] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L832] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L833] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L833] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 x$flush_delayed = weak$$choice2 [L839] 0 x$mem_tmp = x [L840] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L840] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L841] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L841] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L841] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L841] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L842] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L842] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L842] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L842] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L843] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L843] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L843] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L843] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L844] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L844] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L845] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L845] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L845] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L846] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L846] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) [L848] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L848] 0 x = x$flush_delayed ? x$mem_tmp : x [L849] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1876={5:0}, t1877={6:0}, t1878={3:0}, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, 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=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, 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=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - 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: 819]: 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: 823]: 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: 821]: 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, 141 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: 7.9s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 689 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 689 mSDsluCounter, 598 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1127 mSDsCounter, 151 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1799 IncrementalHoareTripleChecker+Invalid, 1950 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 151 mSolverCounterUnsat, 130 mSDtfsCounter, 1799 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 183 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=559occurred in iteration=12, InterpolantAutomatonStates: 147, 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.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 1179 NumberOfCodeBlocks, 1179 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1077 ConstructedInterpolants, 0 QuantifiedInterpolants, 4914 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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! [2021-12-06 23:56:47,232 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fd9ec5b-ff28-40d3-8ca2-084b1c12878c/bin/uautomizer-DrprNOufMa/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