./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b2eff8ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87bebc62-5ff0-402a-8f48-84591e1de9b1/bin/uautomizer-UnR33cPsHg/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87bebc62-5ff0-402a-8f48-84591e1de9b1/bin/uautomizer-UnR33cPsHg/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87bebc62-5ff0-402a-8f48-84591e1de9b1/bin/uautomizer-UnR33cPsHg/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87bebc62-5ff0-402a-8f48-84591e1de9b1/bin/uautomizer-UnR33cPsHg/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87bebc62-5ff0-402a-8f48-84591e1de9b1/bin/uautomizer-UnR33cPsHg/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87bebc62-5ff0-402a-8f48-84591e1de9b1/bin/uautomizer-UnR33cPsHg --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 6e0191a7c0154db5e6d5798f5b20e5814ce0ff555e18a7acf1f1e5e323a36576 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-b2eff8b [2021-10-28 09:13:40,220 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-28 09:13:40,224 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-28 09:13:40,273 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-28 09:13:40,274 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-28 09:13:40,275 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-28 09:13:40,278 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-28 09:13:40,281 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-28 09:13:40,285 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-28 09:13:40,286 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-28 09:13:40,288 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-28 09:13:40,290 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-28 09:13:40,291 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-28 09:13:40,293 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-28 09:13:40,296 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-28 09:13:40,298 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-28 09:13:40,299 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-28 09:13:40,301 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-28 09:13:40,304 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-28 09:13:40,307 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-28 09:13:40,310 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-28 09:13:40,312 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-28 09:13:40,315 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-28 09:13:40,316 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-28 09:13:40,321 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-28 09:13:40,321 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-28 09:13:40,322 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-28 09:13:40,323 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-28 09:13:40,324 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-28 09:13:40,326 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-28 09:13:40,327 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-28 09:13:40,328 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-28 09:13:40,329 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-28 09:13:40,331 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-28 09:13:40,333 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-28 09:13:40,333 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-28 09:13:40,335 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-28 09:13:40,335 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-28 09:13:40,336 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-28 09:13:40,337 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-28 09:13:40,339 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-28 09:13:40,340 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87bebc62-5ff0-402a-8f48-84591e1de9b1/bin/uautomizer-UnR33cPsHg/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-28 09:13:40,369 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-28 09:13:40,370 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-28 09:13:40,370 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-28 09:13:40,371 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-28 09:13:40,372 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-28 09:13:40,373 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-28 09:13:40,373 INFO L138 SettingsManager]: * Use SBE=true [2021-10-28 09:13:40,374 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-28 09:13:40,374 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-28 09:13:40,374 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-28 09:13:40,375 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-28 09:13:40,375 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-28 09:13:40,376 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-28 09:13:40,376 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-28 09:13:40,376 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-28 09:13:40,377 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-28 09:13:40,377 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-28 09:13:40,377 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-28 09:13:40,378 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-28 09:13:40,378 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-28 09:13:40,378 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-28 09:13:40,378 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-28 09:13:40,379 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-28 09:13:40,379 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-28 09:13:40,379 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-28 09:13:40,379 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-28 09:13:40,380 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-28 09:13:40,380 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-28 09:13:40,380 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-10-28 09:13:40,380 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-10-28 09:13:40,381 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-28 09:13:40,381 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-28 09:13:40,381 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_87bebc62-5ff0-402a-8f48-84591e1de9b1/bin/uautomizer-UnR33cPsHg/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_87bebc62-5ff0-402a-8f48-84591e1de9b1/bin/uautomizer-UnR33cPsHg 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 -> 6e0191a7c0154db5e6d5798f5b20e5814ce0ff555e18a7acf1f1e5e323a36576 [2021-10-28 09:13:40,703 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-28 09:13:40,729 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-28 09:13:40,732 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-28 09:13:40,734 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-28 09:13:40,735 INFO L275 PluginConnector]: CDTParser initialized [2021-10-28 09:13:40,736 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87bebc62-5ff0-402a-8f48-84591e1de9b1/bin/uautomizer-UnR33cPsHg/../../sv-benchmarks/c/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i [2021-10-28 09:13:40,811 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87bebc62-5ff0-402a-8f48-84591e1de9b1/bin/uautomizer-UnR33cPsHg/data/edf2375ef/f86530182ae944718f687570ffd0f478/FLAGfd9d35b27 [2021-10-28 09:13:41,369 INFO L306 CDTParser]: Found 1 translation units. [2021-10-28 09:13:41,370 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87bebc62-5ff0-402a-8f48-84591e1de9b1/sv-benchmarks/c/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i [2021-10-28 09:13:41,394 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87bebc62-5ff0-402a-8f48-84591e1de9b1/bin/uautomizer-UnR33cPsHg/data/edf2375ef/f86530182ae944718f687570ffd0f478/FLAGfd9d35b27 [2021-10-28 09:13:41,670 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87bebc62-5ff0-402a-8f48-84591e1de9b1/bin/uautomizer-UnR33cPsHg/data/edf2375ef/f86530182ae944718f687570ffd0f478 [2021-10-28 09:13:41,673 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-28 09:13:41,675 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-28 09:13:41,677 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-28 09:13:41,678 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-28 09:13:41,693 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-28 09:13:41,694 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 09:13:41" (1/1) ... [2021-10-28 09:13:41,695 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ede69c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:13:41, skipping insertion in model container [2021-10-28 09:13:41,696 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 09:13:41" (1/1) ... [2021-10-28 09:13:41,705 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-28 09:13:41,773 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-28 09:13:41,975 WARN L228 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_87bebc62-5ff0-402a-8f48-84591e1de9b1/sv-benchmarks/c/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i[967,980] [2021-10-28 09:13:42,184 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-28 09:13:42,193 INFO L203 MainTranslator]: Completed pre-run [2021-10-28 09:13:42,207 WARN L228 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_87bebc62-5ff0-402a-8f48-84591e1de9b1/sv-benchmarks/c/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i[967,980] [2021-10-28 09:13:42,257 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-28 09:13:42,306 INFO L208 MainTranslator]: Completed translation [2021-10-28 09:13:42,306 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:13:42 WrapperNode [2021-10-28 09:13:42,307 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-28 09:13:42,309 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-28 09:13:42,309 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-28 09:13:42,310 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-28 09:13:42,318 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:13:42" (1/1) ... [2021-10-28 09:13:42,353 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:13:42" (1/1) ... [2021-10-28 09:13:42,422 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-28 09:13:42,426 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-28 09:13:42,426 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-28 09:13:42,427 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-28 09:13:42,437 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:13:42" (1/1) ... [2021-10-28 09:13:42,438 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:13:42" (1/1) ... [2021-10-28 09:13:42,456 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:13:42" (1/1) ... [2021-10-28 09:13:42,472 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:13:42" (1/1) ... [2021-10-28 09:13:42,483 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:13:42" (1/1) ... [2021-10-28 09:13:42,497 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:13:42" (1/1) ... [2021-10-28 09:13:42,500 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:13:42" (1/1) ... [2021-10-28 09:13:42,506 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-28 09:13:42,521 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-28 09:13:42,521 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-28 09:13:42,521 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-28 09:13:42,522 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:13:42" (1/1) ... [2021-10-28 09:13:42,540 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-28 09:13:42,554 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87bebc62-5ff0-402a-8f48-84591e1de9b1/bin/uautomizer-UnR33cPsHg/z3 [2021-10-28 09:13:42,568 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87bebc62-5ff0-402a-8f48-84591e1de9b1/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-28 09:13:42,585 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87bebc62-5ff0-402a-8f48-84591e1de9b1/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-28 09:13:42,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-28 09:13:42,623 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-10-28 09:13:42,623 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-28 09:13:42,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-28 09:13:42,623 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-10-28 09:13:42,623 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-10-28 09:13:42,623 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-10-28 09:13:42,623 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-10-28 09:13:42,624 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-10-28 09:13:42,624 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-10-28 09:13:42,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-28 09:13:42,624 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-10-28 09:13:42,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-28 09:13:42,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-28 09:13:42,626 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-10-28 09:13:44,845 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-28 09:13:44,846 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-10-28 09:13:44,849 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 09:13:44 BoogieIcfgContainer [2021-10-28 09:13:44,850 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-28 09:13:44,854 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-28 09:13:44,854 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-28 09:13:44,858 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-28 09:13:44,858 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.10 09:13:41" (1/3) ... [2021-10-28 09:13:44,860 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4051c1f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 09:13:44, skipping insertion in model container [2021-10-28 09:13:44,860 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:13:42" (2/3) ... [2021-10-28 09:13:44,861 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4051c1f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 09:13:44, skipping insertion in model container [2021-10-28 09:13:44,861 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 09:13:44" (3/3) ... [2021-10-28 09:13:44,866 INFO L111 eAbstractionObserver]: Analyzing ICFG safe030_power.opt_pso.opt_rmo.opt.i [2021-10-28 09:13:44,873 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-10-28 09:13:44,873 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-28 09:13:44,873 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-10-28 09:13:44,873 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-10-28 09:13:44,928 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:13:44,929 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:13:44,929 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:13:44,929 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:13:44,930 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:13:44,930 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:13:44,930 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:13:44,930 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:13:44,931 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:13:44,931 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:13:44,931 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:13:44,932 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:13:44,933 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:13:44,933 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:13:44,933 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:13:44,934 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:13:44,934 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:13:44,935 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:13:44,936 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:13:44,936 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:13:44,937 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:13:44,938 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:13:44,938 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:13:44,938 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:13:44,938 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:13:44,939 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:13:44,940 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:13:44,940 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:13:44,942 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:13:44,942 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:13:44,942 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:13:44,942 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:13:44,943 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:13:44,943 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:13:44,944 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:13:44,944 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:13:44,944 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:13:44,944 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:13:44,945 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:13:44,945 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:13:44,946 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:13:44,946 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:13:44,946 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:13:44,946 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:13:44,947 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:13:44,947 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:13:44,947 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:13:44,947 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:13:44,948 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:13:44,948 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:13:44,948 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:13:44,949 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:13:44,949 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:13:44,950 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:13:44,950 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:13:44,950 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:13:44,951 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:13:44,951 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:13:44,951 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:13:44,951 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:13:44,952 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:13:44,952 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:13:44,952 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:13:44,953 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:13:44,953 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:13:44,953 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:13:44,953 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:13:44,954 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:13:44,954 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:13:44,955 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:13:44,955 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:13:44,955 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:13:44,962 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:13:44,962 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:13:44,963 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:13:44,963 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:13:44,964 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:13:44,964 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:13:44,964 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:13:44,965 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:13:44,965 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:13:44,965 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:13:44,965 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:13:44,966 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:13:44,968 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:13:44,970 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:13:44,972 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:13:44,975 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:13:44,978 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:13:44,978 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:13:44,979 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:13:44,979 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:13:44,980 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:13:44,980 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:13:44,980 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:13:44,981 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:13:44,988 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:13:44,988 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:13:44,990 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-10-28 09:13:45,063 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-28 09:13:45,093 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-10-28 09:13:45,100 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-10-28 09:13:45,116 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 112 places, 104 transitions, 223 flow [2021-10-28 09:13:45,189 INFO L129 PetriNetUnfolder]: 2/101 cut-off events. [2021-10-28 09:13:45,190 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-10-28 09:13:45,198 INFO L84 FinitePrefix]: Finished finitePrefix Result has 111 conditions, 101 events. 2/101 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 50 event pairs, 0 based on Foata normal form. 0/97 useless extension candidates. Maximal degree in co-relation 67. Up to 2 conditions per place. [2021-10-28 09:13:45,199 INFO L82 GeneralOperation]: Start removeDead. Operand has 112 places, 104 transitions, 223 flow [2021-10-28 09:13:45,210 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 109 places, 101 transitions, 211 flow [2021-10-28 09:13:45,248 INFO L129 PetriNetUnfolder]: 0/69 cut-off events. [2021-10-28 09:13:45,249 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-10-28 09:13:45,249 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 09:13:45,250 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] [2021-10-28 09:13:45,251 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-28 09:13:45,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:13:45,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1942900053, now seen corresponding path program 1 times [2021-10-28 09:13:45,271 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:13:45,272 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098184759] [2021-10-28 09:13:45,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:13:45,274 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:13:45,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:13:45,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:13:45,709 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:13:45,709 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098184759] [2021-10-28 09:13:45,710 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098184759] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:13:45,710 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:13:45,711 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-28 09:13:45,713 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808171859] [2021-10-28 09:13:45,725 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:13:45,726 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:13:45,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:13:45,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:13:45,747 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 104 [2021-10-28 09:13:45,752 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 101 transitions, 211 flow. Second operand has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 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-10-28 09:13:45,752 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 09:13:45,752 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 104 [2021-10-28 09:13:45,754 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 09:13:45,861 INFO L129 PetriNetUnfolder]: 16/213 cut-off events. [2021-10-28 09:13:45,861 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-10-28 09:13:45,863 INFO L84 FinitePrefix]: Finished finitePrefix Result has 258 conditions, 213 events. 16/213 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 653 event pairs, 6 based on Foata normal form. 9/211 useless extension candidates. Maximal degree in co-relation 212. Up to 27 conditions per place. [2021-10-28 09:13:45,865 INFO L132 encePairwiseOnDemand]: 99/104 looper letters, 7 selfloop transitions, 2 changer transitions 0/100 dead transitions. [2021-10-28 09:13:45,866 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 100 transitions, 227 flow [2021-10-28 09:13:45,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:13:45,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-10-28 09:13:45,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 296 transitions. [2021-10-28 09:13:45,881 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9487179487179487 [2021-10-28 09:13:45,882 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 296 transitions. [2021-10-28 09:13:45,883 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 296 transitions. [2021-10-28 09:13:45,885 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 09:13:45,888 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 296 transitions. [2021-10-28 09:13:45,893 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 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-10-28 09:13:45,900 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 104.0) internal successors, (416), 4 states have internal predecessors, (416), 0 states have call successors, (0), 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-10-28 09:13:45,901 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 104.0) internal successors, (416), 4 states have internal predecessors, (416), 0 states have call successors, (0), 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-10-28 09:13:45,903 INFO L186 Difference]: Start difference. First operand has 109 places, 101 transitions, 211 flow. Second operand 3 states and 296 transitions. [2021-10-28 09:13:45,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 100 transitions, 227 flow [2021-10-28 09:13:45,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 100 transitions, 224 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-10-28 09:13:45,913 INFO L242 Difference]: Finished difference. Result has 106 places, 97 transitions, 204 flow [2021-10-28 09:13:45,916 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=104, 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=3, PETRI_FLOW=204, PETRI_PLACES=106, PETRI_TRANSITIONS=97} [2021-10-28 09:13:45,917 INFO L334 CegarLoopForPetriNet]: 109 programPoint places, -3 predicate places. [2021-10-28 09:13:45,917 INFO L470 AbstractCegarLoop]: Abstraction has has 106 places, 97 transitions, 204 flow [2021-10-28 09:13:45,918 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 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-10-28 09:13:45,918 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 09:13:45,918 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] [2021-10-28 09:13:45,918 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-28 09:13:45,919 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-28 09:13:45,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:13:45,919 INFO L85 PathProgramCache]: Analyzing trace with hash -744105614, now seen corresponding path program 1 times [2021-10-28 09:13:45,920 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:13:45,920 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141677648] [2021-10-28 09:13:45,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:13:45,920 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:13:46,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:13:46,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:13:46,327 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:13:46,327 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141677648] [2021-10-28 09:13:46,328 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141677648] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:13:46,328 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:13:46,328 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-28 09:13:46,328 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798390635] [2021-10-28 09:13:46,331 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-28 09:13:46,331 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:13:46,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-28 09:13:46,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-28 09:13:46,336 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 104 [2021-10-28 09:13:46,337 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 97 transitions, 204 flow. Second operand has 6 states, 6 states have (on average 92.16666666666667) internal successors, (553), 6 states have internal predecessors, (553), 0 states have call successors, (0), 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-10-28 09:13:46,337 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 09:13:46,337 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 104 [2021-10-28 09:13:46,338 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 09:13:46,583 INFO L129 PetriNetUnfolder]: 30/260 cut-off events. [2021-10-28 09:13:46,584 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-10-28 09:13:46,589 INFO L84 FinitePrefix]: Finished finitePrefix Result has 344 conditions, 260 events. 30/260 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1010 event pairs, 6 based on Foata normal form. 0/254 useless extension candidates. Maximal degree in co-relation 298. Up to 36 conditions per place. [2021-10-28 09:13:46,591 INFO L132 encePairwiseOnDemand]: 97/104 looper letters, 8 selfloop transitions, 3 changer transitions 31/120 dead transitions. [2021-10-28 09:13:46,592 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 120 transitions, 316 flow [2021-10-28 09:13:46,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-28 09:13:46,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-10-28 09:13:46,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 854 transitions. [2021-10-28 09:13:46,602 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9123931623931624 [2021-10-28 09:13:46,602 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 854 transitions. [2021-10-28 09:13:46,603 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 854 transitions. [2021-10-28 09:13:46,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 09:13:46,605 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 854 transitions. [2021-10-28 09:13:46,610 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 94.88888888888889) internal successors, (854), 9 states have internal predecessors, (854), 0 states have call successors, (0), 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-10-28 09:13:46,617 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 104.0) internal successors, (1040), 10 states have internal predecessors, (1040), 0 states have call successors, (0), 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-10-28 09:13:46,618 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 104.0) internal successors, (1040), 10 states have internal predecessors, (1040), 0 states have call successors, (0), 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-10-28 09:13:46,618 INFO L186 Difference]: Start difference. First operand has 106 places, 97 transitions, 204 flow. Second operand 9 states and 854 transitions. [2021-10-28 09:13:46,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 120 transitions, 316 flow [2021-10-28 09:13:46,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 120 transitions, 312 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-10-28 09:13:46,625 INFO L242 Difference]: Finished difference. Result has 119 places, 89 transitions, 223 flow [2021-10-28 09:13:46,626 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=223, PETRI_PLACES=119, PETRI_TRANSITIONS=89} [2021-10-28 09:13:46,627 INFO L334 CegarLoopForPetriNet]: 109 programPoint places, 10 predicate places. [2021-10-28 09:13:46,627 INFO L470 AbstractCegarLoop]: Abstraction has has 119 places, 89 transitions, 223 flow [2021-10-28 09:13:46,628 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.16666666666667) internal successors, (553), 6 states have internal predecessors, (553), 0 states have call successors, (0), 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-10-28 09:13:46,628 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 09:13:46,628 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] [2021-10-28 09:13:46,630 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-28 09:13:46,635 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-28 09:13:46,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:13:46,639 INFO L85 PathProgramCache]: Analyzing trace with hash -62028973, now seen corresponding path program 1 times [2021-10-28 09:13:46,639 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:13:46,639 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219806301] [2021-10-28 09:13:46,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:13:46,640 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:13:46,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:13:46,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:13:46,908 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:13:46,911 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219806301] [2021-10-28 09:13:46,911 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219806301] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:13:46,912 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:13:46,912 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-28 09:13:46,912 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924969950] [2021-10-28 09:13:46,913 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-28 09:13:46,913 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:13:46,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-28 09:13:46,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-28 09:13:46,917 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 104 [2021-10-28 09:13:46,919 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 89 transitions, 223 flow. Second operand has 6 states, 6 states have (on average 92.16666666666667) internal successors, (553), 6 states have internal predecessors, (553), 0 states have call successors, (0), 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-10-28 09:13:46,919 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 09:13:46,919 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 104 [2021-10-28 09:13:46,919 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 09:13:47,144 INFO L129 PetriNetUnfolder]: 74/326 cut-off events. [2021-10-28 09:13:47,144 INFO L130 PetriNetUnfolder]: For 305/311 co-relation queries the response was YES. [2021-10-28 09:13:47,146 INFO L84 FinitePrefix]: Finished finitePrefix Result has 694 conditions, 326 events. 74/326 cut-off events. For 305/311 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1472 event pairs, 30 based on Foata normal form. 10/324 useless extension candidates. Maximal degree in co-relation 641. Up to 60 conditions per place. [2021-10-28 09:13:47,148 INFO L132 encePairwiseOnDemand]: 97/104 looper letters, 8 selfloop transitions, 3 changer transitions 19/110 dead transitions. [2021-10-28 09:13:47,149 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 110 transitions, 343 flow [2021-10-28 09:13:47,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-28 09:13:47,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-10-28 09:13:47,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 851 transitions. [2021-10-28 09:13:47,153 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9091880341880342 [2021-10-28 09:13:47,153 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 851 transitions. [2021-10-28 09:13:47,153 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 851 transitions. [2021-10-28 09:13:47,154 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 09:13:47,154 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 851 transitions. [2021-10-28 09:13:47,158 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 94.55555555555556) internal successors, (851), 9 states have internal predecessors, (851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:13:47,161 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 104.0) internal successors, (1040), 10 states have internal predecessors, (1040), 0 states have call successors, (0), 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-10-28 09:13:47,162 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 104.0) internal successors, (1040), 10 states have internal predecessors, (1040), 0 states have call successors, (0), 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-10-28 09:13:47,163 INFO L186 Difference]: Start difference. First operand has 119 places, 89 transitions, 223 flow. Second operand 9 states and 851 transitions. [2021-10-28 09:13:47,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 110 transitions, 343 flow [2021-10-28 09:13:47,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 110 transitions, 326 flow, removed 7 selfloop flow, removed 4 redundant places. [2021-10-28 09:13:47,171 INFO L242 Difference]: Finished difference. Result has 114 places, 91 transitions, 257 flow [2021-10-28 09:13:47,171 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=257, PETRI_PLACES=114, PETRI_TRANSITIONS=91} [2021-10-28 09:13:47,171 INFO L334 CegarLoopForPetriNet]: 109 programPoint places, 5 predicate places. [2021-10-28 09:13:47,172 INFO L470 AbstractCegarLoop]: Abstraction has has 114 places, 91 transitions, 257 flow [2021-10-28 09:13:47,172 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.16666666666667) internal successors, (553), 6 states have internal predecessors, (553), 0 states have call successors, (0), 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-10-28 09:13:47,173 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 09:13:47,173 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] [2021-10-28 09:13:47,173 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-28 09:13:47,174 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-28 09:13:47,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:13:47,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1701973282, now seen corresponding path program 1 times [2021-10-28 09:13:47,174 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:13:47,175 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192116376] [2021-10-28 09:13:47,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:13:47,175 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:13:47,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:13:47,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:13:47,345 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:13:47,346 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192116376] [2021-10-28 09:13:47,346 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192116376] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:13:47,346 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:13:47,347 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-28 09:13:47,347 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094469558] [2021-10-28 09:13:47,348 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-28 09:13:47,348 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:13:47,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-28 09:13:47,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-28 09:13:47,351 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 104 [2021-10-28 09:13:47,352 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 91 transitions, 257 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-10-28 09:13:47,352 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 09:13:47,353 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 104 [2021-10-28 09:13:47,353 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 09:13:47,561 INFO L129 PetriNetUnfolder]: 35/254 cut-off events. [2021-10-28 09:13:47,562 INFO L130 PetriNetUnfolder]: For 440/489 co-relation queries the response was YES. [2021-10-28 09:13:47,564 INFO L84 FinitePrefix]: Finished finitePrefix Result has 639 conditions, 254 events. 35/254 cut-off events. For 440/489 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1074 event pairs, 16 based on Foata normal form. 8/254 useless extension candidates. Maximal degree in co-relation 581. Up to 37 conditions per place. [2021-10-28 09:13:47,566 INFO L132 encePairwiseOnDemand]: 98/104 looper letters, 12 selfloop transitions, 3 changer transitions 10/105 dead transitions. [2021-10-28 09:13:47,566 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 105 transitions, 405 flow [2021-10-28 09:13:47,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-28 09:13:47,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-10-28 09:13:47,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 845 transitions. [2021-10-28 09:13:47,571 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9027777777777778 [2021-10-28 09:13:47,571 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 845 transitions. [2021-10-28 09:13:47,571 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 845 transitions. [2021-10-28 09:13:47,572 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 09:13:47,573 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 845 transitions. [2021-10-28 09:13:47,576 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 93.88888888888889) internal successors, (845), 9 states have internal predecessors, (845), 0 states have call successors, (0), 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-10-28 09:13:47,579 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 104.0) internal successors, (1040), 10 states have internal predecessors, (1040), 0 states have call successors, (0), 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-10-28 09:13:47,580 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 104.0) internal successors, (1040), 10 states have internal predecessors, (1040), 0 states have call successors, (0), 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-10-28 09:13:47,581 INFO L186 Difference]: Start difference. First operand has 114 places, 91 transitions, 257 flow. Second operand 9 states and 845 transitions. [2021-10-28 09:13:47,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 105 transitions, 405 flow [2021-10-28 09:13:47,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 105 transitions, 374 flow, removed 14 selfloop flow, removed 4 redundant places. [2021-10-28 09:13:47,595 INFO L242 Difference]: Finished difference. Result has 119 places, 91 transitions, 269 flow [2021-10-28 09:13:47,596 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=269, PETRI_PLACES=119, PETRI_TRANSITIONS=91} [2021-10-28 09:13:47,596 INFO L334 CegarLoopForPetriNet]: 109 programPoint places, 10 predicate places. [2021-10-28 09:13:47,596 INFO L470 AbstractCegarLoop]: Abstraction has has 119 places, 91 transitions, 269 flow [2021-10-28 09:13:47,597 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-10-28 09:13:47,597 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 09:13:47,597 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] [2021-10-28 09:13:47,597 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-28 09:13:47,598 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-28 09:13:47,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:13:47,598 INFO L85 PathProgramCache]: Analyzing trace with hash -2126346828, now seen corresponding path program 1 times [2021-10-28 09:13:47,599 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:13:47,599 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291122604] [2021-10-28 09:13:47,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:13:47,599 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:13:47,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:13:48,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:13:48,000 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:13:48,001 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291122604] [2021-10-28 09:13:48,001 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291122604] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:13:48,001 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:13:48,001 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-28 09:13:48,002 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743491282] [2021-10-28 09:13:48,002 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-28 09:13:48,002 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:13:48,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-28 09:13:48,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-10-28 09:13:48,005 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 104 [2021-10-28 09:13:48,007 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 91 transitions, 269 flow. Second operand has 11 states, 11 states have (on average 84.0909090909091) internal successors, (925), 11 states have internal predecessors, (925), 0 states have call successors, (0), 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-10-28 09:13:48,007 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 09:13:48,007 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 104 [2021-10-28 09:13:48,008 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 09:13:48,610 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([827] L18-->L18-1: Formula: (= v_ULTIMATE.start___VERIFIER_assert_~expression_2 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_2|) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_2|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_2, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_2|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression][116], [Black: 156#(and (= ~x~0 0) (<= 1 ~main$tmp_guard1~0) (or (<= (+ ULTIMATE.start___VERIFIER_assert_~expression 255) 0) (<= 1 ULTIMATE.start___VERIFIER_assert_~expression)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|) (<= (+ 255 |ULTIMATE.start___VERIFIER_assert_#in~expression|) 0))), Black: 145#(= ~x~0 0), Black: 152#(and (= ~x~0 0) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|) (<= (+ 255 |ULTIMATE.start___VERIFIER_assert_#in~expression|) 0))), Black: 150#(and (= ~x~0 0) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), 86#L787true, Black: 132#(and (<= 1 ~main$tmp_guard1~0) (or (<= (+ ULTIMATE.start___VERIFIER_assert_~expression 255) 0) (<= 1 ULTIMATE.start___VERIFIER_assert_~expression)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|) (<= (+ 255 |ULTIMATE.start___VERIFIER_assert_#in~expression|) 0)) (= ~z~0 0)), 56#L743true, 43#L18-1true, Black: 128#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|) (<= (+ 255 |ULTIMATE.start___VERIFIER_assert_#in~expression|) 0)) (= ~z~0 0)), 215#(and (<= 1 ~main$tmp_guard1~0) (or (<= (+ ULTIMATE.start___VERIFIER_assert_~expression 255) 0) (<= 1 ULTIMATE.start___VERIFIER_assert_~expression)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|) (<= (+ 255 |ULTIMATE.start___VERIFIER_assert_#in~expression|) 0))), Black: 126#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z~0 0)), Black: 121#(= ~z~0 0), P1Thread1of1ForFork2InUse, P0Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, Black: 182#(and (<= 1 ~main$tmp_guard1~0) (or (<= (+ ULTIMATE.start___VERIFIER_assert_~expression 255) 0) (<= 1 ULTIMATE.start___VERIFIER_assert_~expression)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|) (<= (+ 255 |ULTIMATE.start___VERIFIER_assert_#in~expression|) 0))), Black: 170#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), 169#(= ~x~0 1), Black: 180#(and (<= 1 ~main$tmp_guard1~0) (or (<= (+ ULTIMATE.start___VERIFIER_assert_~expression 255) 0) (<= 1 ULTIMATE.start___VERIFIER_assert_~expression)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|) (<= (+ 255 |ULTIMATE.start___VERIFIER_assert_#in~expression|) 0)) (= ~x~0 1)), Black: 176#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|) (<= (+ 255 |ULTIMATE.start___VERIFIER_assert_#in~expression|) 0)) (= ~x~0 1)), Black: 174#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1)), 92#L758true, Black: 178#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|) (<= (+ 255 |ULTIMATE.start___VERIFIER_assert_#in~expression|) 0)))]) [2021-10-28 09:13:48,610 INFO L384 tUnfolder$Statistics]: this new event has 73 ancestors and is not cut-off event [2021-10-28 09:13:48,611 INFO L387 tUnfolder$Statistics]: existing Event has 73 ancestors and is not cut-off event [2021-10-28 09:13:48,611 INFO L387 tUnfolder$Statistics]: existing Event has 73 ancestors and is not cut-off event [2021-10-28 09:13:48,611 INFO L387 tUnfolder$Statistics]: existing Event has 73 ancestors and is not cut-off event [2021-10-28 09:13:48,626 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([827] L18-->L18-1: Formula: (= v_ULTIMATE.start___VERIFIER_assert_~expression_2 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_2|) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_2|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_2, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_2|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression][116], [Black: 156#(and (= ~x~0 0) (<= 1 ~main$tmp_guard1~0) (or (<= (+ ULTIMATE.start___VERIFIER_assert_~expression 255) 0) (<= 1 ULTIMATE.start___VERIFIER_assert_~expression)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|) (<= (+ 255 |ULTIMATE.start___VERIFIER_assert_#in~expression|) 0))), Black: 145#(= ~x~0 0), Black: 152#(and (= ~x~0 0) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|) (<= (+ 255 |ULTIMATE.start___VERIFIER_assert_#in~expression|) 0))), Black: 150#(and (= ~x~0 0) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), 86#L787true, Black: 132#(and (<= 1 ~main$tmp_guard1~0) (or (<= (+ ULTIMATE.start___VERIFIER_assert_~expression 255) 0) (<= 1 ULTIMATE.start___VERIFIER_assert_~expression)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|) (<= (+ 255 |ULTIMATE.start___VERIFIER_assert_#in~expression|) 0)) (= ~z~0 0)), 56#L743true, 43#L18-1true, Black: 128#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|) (<= (+ 255 |ULTIMATE.start___VERIFIER_assert_#in~expression|) 0)) (= ~z~0 0)), 215#(and (<= 1 ~main$tmp_guard1~0) (or (<= (+ ULTIMATE.start___VERIFIER_assert_~expression 255) 0) (<= 1 ULTIMATE.start___VERIFIER_assert_~expression)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|) (<= (+ 255 |ULTIMATE.start___VERIFIER_assert_#in~expression|) 0))), Black: 126#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z~0 0)), Black: 121#(= ~z~0 0), P1Thread1of1ForFork2InUse, P0Thread1of1ForFork1InUse, 69#L765true, P2Thread1of1ForFork0InUse, Black: 182#(and (<= 1 ~main$tmp_guard1~0) (or (<= (+ ULTIMATE.start___VERIFIER_assert_~expression 255) 0) (<= 1 ULTIMATE.start___VERIFIER_assert_~expression)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|) (<= (+ 255 |ULTIMATE.start___VERIFIER_assert_#in~expression|) 0))), Black: 170#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), 169#(= ~x~0 1), Black: 180#(and (<= 1 ~main$tmp_guard1~0) (or (<= (+ ULTIMATE.start___VERIFIER_assert_~expression 255) 0) (<= 1 ULTIMATE.start___VERIFIER_assert_~expression)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|) (<= (+ 255 |ULTIMATE.start___VERIFIER_assert_#in~expression|) 0)) (= ~x~0 1)), Black: 176#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|) (<= (+ 255 |ULTIMATE.start___VERIFIER_assert_#in~expression|) 0)) (= ~x~0 1)), Black: 174#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1)), Black: 178#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|) (<= (+ 255 |ULTIMATE.start___VERIFIER_assert_#in~expression|) 0)))]) [2021-10-28 09:13:48,626 INFO L384 tUnfolder$Statistics]: this new event has 74 ancestors and is not cut-off event [2021-10-28 09:13:48,627 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is not cut-off event [2021-10-28 09:13:48,627 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is not cut-off event [2021-10-28 09:13:48,627 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is not cut-off event [2021-10-28 09:13:48,636 INFO L129 PetriNetUnfolder]: 494/1176 cut-off events. [2021-10-28 09:13:48,636 INFO L130 PetriNetUnfolder]: For 3353/3401 co-relation queries the response was YES. [2021-10-28 09:13:48,645 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3535 conditions, 1176 events. 494/1176 cut-off events. For 3353/3401 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 7462 event pairs, 256 based on Foata normal form. 36/1146 useless extension candidates. Maximal degree in co-relation 3469. Up to 461 conditions per place. [2021-10-28 09:13:48,655 INFO L132 encePairwiseOnDemand]: 91/104 looper letters, 12 selfloop transitions, 11 changer transitions 34/132 dead transitions. [2021-10-28 09:13:48,655 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 132 transitions, 525 flow [2021-10-28 09:13:48,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-28 09:13:48,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-10-28 09:13:48,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1388 transitions. [2021-10-28 09:13:48,660 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8341346153846154 [2021-10-28 09:13:48,661 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1388 transitions. [2021-10-28 09:13:48,661 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1388 transitions. [2021-10-28 09:13:48,662 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 09:13:48,662 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1388 transitions. [2021-10-28 09:13:48,666 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 86.75) internal successors, (1388), 16 states have internal predecessors, (1388), 0 states have call successors, (0), 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-10-28 09:13:48,671 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 104.0) internal successors, (1768), 17 states have internal predecessors, (1768), 0 states have call successors, (0), 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-10-28 09:13:48,672 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 104.0) internal successors, (1768), 17 states have internal predecessors, (1768), 0 states have call successors, (0), 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-10-28 09:13:48,672 INFO L186 Difference]: Start difference. First operand has 119 places, 91 transitions, 269 flow. Second operand 16 states and 1388 transitions. [2021-10-28 09:13:48,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 132 transitions, 525 flow [2021-10-28 09:13:48,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 132 transitions, 480 flow, removed 21 selfloop flow, removed 7 redundant places. [2021-10-28 09:13:48,685 INFO L242 Difference]: Finished difference. Result has 132 places, 97 transitions, 340 flow [2021-10-28 09:13:48,685 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=340, PETRI_PLACES=132, PETRI_TRANSITIONS=97} [2021-10-28 09:13:48,685 INFO L334 CegarLoopForPetriNet]: 109 programPoint places, 23 predicate places. [2021-10-28 09:13:48,686 INFO L470 AbstractCegarLoop]: Abstraction has has 132 places, 97 transitions, 340 flow [2021-10-28 09:13:48,686 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 84.0909090909091) internal successors, (925), 11 states have internal predecessors, (925), 0 states have call successors, (0), 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-10-28 09:13:48,686 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 09:13:48,687 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] [2021-10-28 09:13:48,687 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-28 09:13:48,687 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-28 09:13:48,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:13:48,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1107663543, now seen corresponding path program 1 times [2021-10-28 09:13:48,688 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:13:48,688 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986730737] [2021-10-28 09:13:48,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:13:48,689 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:13:48,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:13:48,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:13:48,995 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:13:48,996 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986730737] [2021-10-28 09:13:48,996 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986730737] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:13:48,996 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:13:48,996 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-28 09:13:48,997 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677887877] [2021-10-28 09:13:48,997 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-28 09:13:48,998 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:13:48,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-28 09:13:48,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-10-28 09:13:49,001 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 104 [2021-10-28 09:13:49,002 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 97 transitions, 340 flow. Second operand has 9 states, 9 states have (on average 86.22222222222223) internal successors, (776), 9 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:13:49,003 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 09:13:49,003 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 104 [2021-10-28 09:13:49,003 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 09:13:49,663 INFO L129 PetriNetUnfolder]: 403/1018 cut-off events. [2021-10-28 09:13:49,664 INFO L130 PetriNetUnfolder]: For 4598/4683 co-relation queries the response was YES. [2021-10-28 09:13:49,720 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3871 conditions, 1018 events. 403/1018 cut-off events. For 4598/4683 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 6357 event pairs, 126 based on Foata normal form. 27/1006 useless extension candidates. Maximal degree in co-relation 3796. Up to 394 conditions per place. [2021-10-28 09:13:49,729 INFO L132 encePairwiseOnDemand]: 95/104 looper letters, 22 selfloop transitions, 7 changer transitions 25/131 dead transitions. [2021-10-28 09:13:49,729 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 131 transitions, 710 flow [2021-10-28 09:13:49,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-28 09:13:49,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-10-28 09:13:49,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1242 transitions. [2021-10-28 09:13:49,735 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.853021978021978 [2021-10-28 09:13:49,736 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1242 transitions. [2021-10-28 09:13:49,736 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1242 transitions. [2021-10-28 09:13:49,737 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 09:13:49,737 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1242 transitions. [2021-10-28 09:13:49,741 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 88.71428571428571) internal successors, (1242), 14 states have internal predecessors, (1242), 0 states have call successors, (0), 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-10-28 09:13:49,745 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 104.0) internal successors, (1560), 15 states have internal predecessors, (1560), 0 states have call successors, (0), 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-10-28 09:13:49,746 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 104.0) internal successors, (1560), 15 states have internal predecessors, (1560), 0 states have call successors, (0), 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-10-28 09:13:49,746 INFO L186 Difference]: Start difference. First operand has 132 places, 97 transitions, 340 flow. Second operand 14 states and 1242 transitions. [2021-10-28 09:13:49,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 131 transitions, 710 flow [2021-10-28 09:13:49,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 131 transitions, 680 flow, removed 12 selfloop flow, removed 6 redundant places. [2021-10-28 09:13:49,758 INFO L242 Difference]: Finished difference. Result has 140 places, 99 transitions, 385 flow [2021-10-28 09:13:49,759 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=385, PETRI_PLACES=140, PETRI_TRANSITIONS=99} [2021-10-28 09:13:49,759 INFO L334 CegarLoopForPetriNet]: 109 programPoint places, 31 predicate places. [2021-10-28 09:13:49,760 INFO L470 AbstractCegarLoop]: Abstraction has has 140 places, 99 transitions, 385 flow [2021-10-28 09:13:49,760 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 86.22222222222223) internal successors, (776), 9 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:13:49,761 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 09:13:49,761 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] [2021-10-28 09:13:49,761 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-28 09:13:49,761 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-28 09:13:49,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:13:49,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1707657508, now seen corresponding path program 1 times [2021-10-28 09:13:49,762 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:13:49,763 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36251795] [2021-10-28 09:13:49,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:13:49,763 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:13:49,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:13:49,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:13:49,873 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:13:49,874 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36251795] [2021-10-28 09:13:49,874 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36251795] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:13:49,874 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:13:49,875 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-28 09:13:49,875 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057332332] [2021-10-28 09:13:49,875 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-28 09:13:49,875 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:13:49,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-28 09:13:49,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-28 09:13:49,878 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 104 [2021-10-28 09:13:49,878 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 99 transitions, 385 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-10-28 09:13:49,879 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 09:13:49,879 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 104 [2021-10-28 09:13:49,879 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 09:13:50,312 INFO L129 PetriNetUnfolder]: 336/1158 cut-off events. [2021-10-28 09:13:50,312 INFO L130 PetriNetUnfolder]: For 9486/9738 co-relation queries the response was YES. [2021-10-28 09:13:50,328 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5167 conditions, 1158 events. 336/1158 cut-off events. For 9486/9738 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 8968 event pairs, 135 based on Foata normal form. 36/1147 useless extension candidates. Maximal degree in co-relation 5087. Up to 224 conditions per place. [2021-10-28 09:13:50,339 INFO L132 encePairwiseOnDemand]: 98/104 looper letters, 15 selfloop transitions, 12 changer transitions 0/114 dead transitions. [2021-10-28 09:13:50,340 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 114 transitions, 612 flow [2021-10-28 09:13:50,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-28 09:13:50,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-10-28 09:13:50,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 845 transitions. [2021-10-28 09:13:50,344 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9027777777777778 [2021-10-28 09:13:50,344 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 845 transitions. [2021-10-28 09:13:50,344 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 845 transitions. [2021-10-28 09:13:50,345 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 09:13:50,345 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 845 transitions. [2021-10-28 09:13:50,348 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 93.88888888888889) internal successors, (845), 9 states have internal predecessors, (845), 0 states have call successors, (0), 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-10-28 09:13:50,351 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 104.0) internal successors, (1040), 10 states have internal predecessors, (1040), 0 states have call successors, (0), 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-10-28 09:13:50,352 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 104.0) internal successors, (1040), 10 states have internal predecessors, (1040), 0 states have call successors, (0), 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-10-28 09:13:50,352 INFO L186 Difference]: Start difference. First operand has 140 places, 99 transitions, 385 flow. Second operand 9 states and 845 transitions. [2021-10-28 09:13:50,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 114 transitions, 612 flow [2021-10-28 09:13:50,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 114 transitions, 550 flow, removed 28 selfloop flow, removed 8 redundant places. [2021-10-28 09:13:50,372 INFO L242 Difference]: Finished difference. Result has 138 places, 108 transitions, 515 flow [2021-10-28 09:13:50,372 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=357, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=515, PETRI_PLACES=138, PETRI_TRANSITIONS=108} [2021-10-28 09:13:50,373 INFO L334 CegarLoopForPetriNet]: 109 programPoint places, 29 predicate places. [2021-10-28 09:13:50,373 INFO L470 AbstractCegarLoop]: Abstraction has has 138 places, 108 transitions, 515 flow [2021-10-28 09:13:50,373 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-10-28 09:13:50,374 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 09:13:50,374 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] [2021-10-28 09:13:50,374 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-28 09:13:50,374 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-28 09:13:50,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:13:50,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1527566929, now seen corresponding path program 1 times [2021-10-28 09:13:50,375 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:13:50,376 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214860106] [2021-10-28 09:13:50,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:13:50,376 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:13:50,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:13:50,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:13:50,662 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:13:50,663 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214860106] [2021-10-28 09:13:50,663 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214860106] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:13:50,663 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:13:50,663 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-28 09:13:50,663 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582528479] [2021-10-28 09:13:50,664 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-28 09:13:50,664 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:13:50,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-28 09:13:50,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-10-28 09:13:50,667 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 104 [2021-10-28 09:13:50,668 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 108 transitions, 515 flow. Second operand has 10 states, 10 states have (on average 85.3) internal successors, (853), 10 states have internal predecessors, (853), 0 states have call successors, (0), 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-10-28 09:13:50,668 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 09:13:50,668 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 104 [2021-10-28 09:13:50,668 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 09:13:51,343 INFO L129 PetriNetUnfolder]: 522/1322 cut-off events. [2021-10-28 09:13:51,344 INFO L130 PetriNetUnfolder]: For 10510/10705 co-relation queries the response was YES. [2021-10-28 09:13:51,360 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6376 conditions, 1322 events. 522/1322 cut-off events. For 10510/10705 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 8878 event pairs, 214 based on Foata normal form. 21/1299 useless extension candidates. Maximal degree in co-relation 6293. Up to 732 conditions per place. [2021-10-28 09:13:51,374 INFO L132 encePairwiseOnDemand]: 93/104 looper letters, 18 selfloop transitions, 10 changer transitions 22/126 dead transitions. [2021-10-28 09:13:51,375 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 126 transitions, 777 flow [2021-10-28 09:13:51,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-28 09:13:51,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-10-28 09:13:51,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1130 transitions. [2021-10-28 09:13:51,380 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8357988165680473 [2021-10-28 09:13:51,381 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1130 transitions. [2021-10-28 09:13:51,381 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1130 transitions. [2021-10-28 09:13:51,382 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 09:13:51,382 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1130 transitions. [2021-10-28 09:13:51,386 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 86.92307692307692) internal successors, (1130), 13 states have internal predecessors, (1130), 0 states have call successors, (0), 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-10-28 09:13:51,391 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 104.0) internal successors, (1456), 14 states have internal predecessors, (1456), 0 states have call successors, (0), 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-10-28 09:13:51,392 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 104.0) internal successors, (1456), 14 states have internal predecessors, (1456), 0 states have call successors, (0), 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-10-28 09:13:51,392 INFO L186 Difference]: Start difference. First operand has 138 places, 108 transitions, 515 flow. Second operand 13 states and 1130 transitions. [2021-10-28 09:13:51,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 126 transitions, 777 flow [2021-10-28 09:13:51,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 126 transitions, 724 flow, removed 25 selfloop flow, removed 1 redundant places. [2021-10-28 09:13:51,438 INFO L242 Difference]: Finished difference. Result has 157 places, 102 transitions, 434 flow [2021-10-28 09:13:51,438 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=468, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=434, PETRI_PLACES=157, PETRI_TRANSITIONS=102} [2021-10-28 09:13:51,439 INFO L334 CegarLoopForPetriNet]: 109 programPoint places, 48 predicate places. [2021-10-28 09:13:51,439 INFO L470 AbstractCegarLoop]: Abstraction has has 157 places, 102 transitions, 434 flow [2021-10-28 09:13:51,440 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 85.3) internal successors, (853), 10 states have internal predecessors, (853), 0 states have call successors, (0), 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-10-28 09:13:51,440 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 09:13:51,440 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] [2021-10-28 09:13:51,440 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-28 09:13:51,441 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-28 09:13:51,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:13:51,441 INFO L85 PathProgramCache]: Analyzing trace with hash -3972362, now seen corresponding path program 1 times [2021-10-28 09:13:51,441 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:13:51,442 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104667149] [2021-10-28 09:13:51,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:13:51,442 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:13:51,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:13:51,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:13:51,676 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:13:51,677 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104667149] [2021-10-28 09:13:51,677 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104667149] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:13:51,677 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:13:51,678 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-28 09:13:51,678 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318184332] [2021-10-28 09:13:51,678 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-28 09:13:51,679 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:13:51,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-28 09:13:51,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-10-28 09:13:51,682 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 104 [2021-10-28 09:13:51,683 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 102 transitions, 434 flow. Second operand has 9 states, 9 states have (on average 87.22222222222223) internal successors, (785), 9 states have internal predecessors, (785), 0 states have call successors, (0), 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-10-28 09:13:51,684 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 09:13:51,684 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 104 [2021-10-28 09:13:51,684 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 09:13:52,291 INFO L129 PetriNetUnfolder]: 418/1231 cut-off events. [2021-10-28 09:13:52,291 INFO L130 PetriNetUnfolder]: For 13412/13631 co-relation queries the response was YES. [2021-10-28 09:13:52,306 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5891 conditions, 1231 events. 418/1231 cut-off events. For 13412/13631 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 8882 event pairs, 160 based on Foata normal form. 60/1225 useless extension candidates. Maximal degree in co-relation 5798. Up to 374 conditions per place. [2021-10-28 09:13:52,315 INFO L132 encePairwiseOnDemand]: 95/104 looper letters, 19 selfloop transitions, 8 changer transitions 23/127 dead transitions. [2021-10-28 09:13:52,316 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 127 transitions, 770 flow [2021-10-28 09:13:52,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-28 09:13:52,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-10-28 09:13:52,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 988 transitions. [2021-10-28 09:13:52,320 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8636363636363636 [2021-10-28 09:13:52,320 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 988 transitions. [2021-10-28 09:13:52,320 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 988 transitions. [2021-10-28 09:13:52,321 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 09:13:52,321 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 988 transitions. [2021-10-28 09:13:52,324 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 89.81818181818181) internal successors, (988), 11 states have internal predecessors, (988), 0 states have call successors, (0), 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-10-28 09:13:52,327 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 104.0) internal successors, (1248), 12 states have internal predecessors, (1248), 0 states have call successors, (0), 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-10-28 09:13:52,328 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 104.0) internal successors, (1248), 12 states have internal predecessors, (1248), 0 states have call successors, (0), 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-10-28 09:13:52,328 INFO L186 Difference]: Start difference. First operand has 157 places, 102 transitions, 434 flow. Second operand 11 states and 988 transitions. [2021-10-28 09:13:52,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 127 transitions, 770 flow [2021-10-28 09:13:52,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 127 transitions, 676 flow, removed 41 selfloop flow, removed 19 redundant places. [2021-10-28 09:13:52,362 INFO L242 Difference]: Finished difference. Result has 143 places, 103 transitions, 433 flow [2021-10-28 09:13:52,363 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=380, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=433, PETRI_PLACES=143, PETRI_TRANSITIONS=103} [2021-10-28 09:13:52,363 INFO L334 CegarLoopForPetriNet]: 109 programPoint places, 34 predicate places. [2021-10-28 09:13:52,363 INFO L470 AbstractCegarLoop]: Abstraction has has 143 places, 103 transitions, 433 flow [2021-10-28 09:13:52,364 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 87.22222222222223) internal successors, (785), 9 states have internal predecessors, (785), 0 states have call successors, (0), 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-10-28 09:13:52,364 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 09:13:52,364 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-10-28 09:13:52,364 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-28 09:13:52,364 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-28 09:13:52,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:13:52,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1159824285, now seen corresponding path program 1 times [2021-10-28 09:13:52,365 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:13:52,365 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333964873] [2021-10-28 09:13:52,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:13:52,366 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:13:52,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:13:52,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:13:52,602 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:13:52,602 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333964873] [2021-10-28 09:13:52,602 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333964873] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:13:52,602 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:13:52,603 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-28 09:13:52,603 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297708506] [2021-10-28 09:13:52,603 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-28 09:13:52,604 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:13:52,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-28 09:13:52,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-10-28 09:13:52,606 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 104 [2021-10-28 09:13:52,607 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 103 transitions, 433 flow. Second operand has 8 states, 8 states have (on average 87.5) internal successors, (700), 8 states have internal predecessors, (700), 0 states have call successors, (0), 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-10-28 09:13:52,607 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 09:13:52,607 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 104 [2021-10-28 09:13:52,607 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 09:13:53,246 INFO L129 PetriNetUnfolder]: 365/1079 cut-off events. [2021-10-28 09:13:53,246 INFO L130 PetriNetUnfolder]: For 9618/9828 co-relation queries the response was YES. [2021-10-28 09:13:53,258 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5359 conditions, 1079 events. 365/1079 cut-off events. For 9618/9828 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 7419 event pairs, 128 based on Foata normal form. 37/1064 useless extension candidates. Maximal degree in co-relation 5274. Up to 388 conditions per place. [2021-10-28 09:13:53,268 INFO L132 encePairwiseOnDemand]: 94/104 looper letters, 23 selfloop transitions, 14 changer transitions 19/133 dead transitions. [2021-10-28 09:13:53,269 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 133 transitions, 925 flow [2021-10-28 09:13:53,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-28 09:13:53,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-10-28 09:13:53,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 993 transitions. [2021-10-28 09:13:53,274 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.868006993006993 [2021-10-28 09:13:53,274 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 993 transitions. [2021-10-28 09:13:53,274 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 993 transitions. [2021-10-28 09:13:53,275 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 09:13:53,276 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 993 transitions. [2021-10-28 09:13:53,280 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 90.27272727272727) internal successors, (993), 11 states have internal predecessors, (993), 0 states have call successors, (0), 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-10-28 09:13:53,284 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 104.0) internal successors, (1248), 12 states have internal predecessors, (1248), 0 states have call successors, (0), 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-10-28 09:13:53,285 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 104.0) internal successors, (1248), 12 states have internal predecessors, (1248), 0 states have call successors, (0), 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-10-28 09:13:53,285 INFO L186 Difference]: Start difference. First operand has 143 places, 103 transitions, 433 flow. Second operand 11 states and 993 transitions. [2021-10-28 09:13:53,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 133 transitions, 925 flow [2021-10-28 09:13:53,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 133 transitions, 880 flow, removed 16 selfloop flow, removed 7 redundant places. [2021-10-28 09:13:53,311 INFO L242 Difference]: Finished difference. Result has 148 places, 109 transitions, 550 flow [2021-10-28 09:13:53,312 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=406, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=550, PETRI_PLACES=148, PETRI_TRANSITIONS=109} [2021-10-28 09:13:53,314 INFO L334 CegarLoopForPetriNet]: 109 programPoint places, 39 predicate places. [2021-10-28 09:13:53,314 INFO L470 AbstractCegarLoop]: Abstraction has has 148 places, 109 transitions, 550 flow [2021-10-28 09:13:53,315 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 87.5) internal successors, (700), 8 states have internal predecessors, (700), 0 states have call successors, (0), 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-10-28 09:13:53,315 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 09:13:53,315 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-10-28 09:13:53,316 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-28 09:13:53,316 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-28 09:13:53,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:13:53,317 INFO L85 PathProgramCache]: Analyzing trace with hash 324286189, now seen corresponding path program 2 times [2021-10-28 09:13:53,318 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:13:53,319 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631036370] [2021-10-28 09:13:53,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:13:53,320 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:13:53,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:13:53,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-10-28 09:13:53,587 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:13:53,588 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631036370] [2021-10-28 09:13:53,588 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631036370] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:13:53,588 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:13:53,588 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-28 09:13:53,588 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670863932] [2021-10-28 09:13:53,589 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-28 09:13:53,589 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:13:53,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-28 09:13:53,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-10-28 09:13:53,592 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 104 [2021-10-28 09:13:53,593 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 109 transitions, 550 flow. Second operand has 10 states, 10 states have (on average 85.3) internal successors, (853), 10 states have internal predecessors, (853), 0 states have call successors, (0), 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-10-28 09:13:53,593 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 09:13:53,593 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 104 [2021-10-28 09:13:53,593 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 09:13:54,283 INFO L129 PetriNetUnfolder]: 368/1050 cut-off events. [2021-10-28 09:13:54,283 INFO L130 PetriNetUnfolder]: For 12274/12604 co-relation queries the response was YES. [2021-10-28 09:13:54,296 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5925 conditions, 1050 events. 368/1050 cut-off events. For 12274/12604 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 6988 event pairs, 122 based on Foata normal form. 46/1042 useless extension candidates. Maximal degree in co-relation 5836. Up to 380 conditions per place. [2021-10-28 09:13:54,308 INFO L132 encePairwiseOnDemand]: 93/104 looper letters, 21 selfloop transitions, 20 changer transitions 19/136 dead transitions. [2021-10-28 09:13:54,308 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 136 transitions, 1050 flow [2021-10-28 09:13:54,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-28 09:13:54,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-10-28 09:13:54,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1144 transitions. [2021-10-28 09:13:54,312 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8461538461538461 [2021-10-28 09:13:54,312 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1144 transitions. [2021-10-28 09:13:54,313 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1144 transitions. [2021-10-28 09:13:54,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 09:13:54,313 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1144 transitions. [2021-10-28 09:13:54,316 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 88.0) internal successors, (1144), 13 states have internal predecessors, (1144), 0 states have call successors, (0), 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-10-28 09:13:54,320 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 104.0) internal successors, (1456), 14 states have internal predecessors, (1456), 0 states have call successors, (0), 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-10-28 09:13:54,321 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 104.0) internal successors, (1456), 14 states have internal predecessors, (1456), 0 states have call successors, (0), 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-10-28 09:13:54,321 INFO L186 Difference]: Start difference. First operand has 148 places, 109 transitions, 550 flow. Second operand 13 states and 1144 transitions. [2021-10-28 09:13:54,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 136 transitions, 1050 flow [2021-10-28 09:13:54,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 136 transitions, 901 flow, removed 74 selfloop flow, removed 10 redundant places. [2021-10-28 09:13:54,356 INFO L242 Difference]: Finished difference. Result has 151 places, 111 transitions, 587 flow [2021-10-28 09:13:54,357 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=485, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=587, PETRI_PLACES=151, PETRI_TRANSITIONS=111} [2021-10-28 09:13:54,357 INFO L334 CegarLoopForPetriNet]: 109 programPoint places, 42 predicate places. [2021-10-28 09:13:54,357 INFO L470 AbstractCegarLoop]: Abstraction has has 151 places, 111 transitions, 587 flow [2021-10-28 09:13:54,358 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 85.3) internal successors, (853), 10 states have internal predecessors, (853), 0 states have call successors, (0), 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-10-28 09:13:54,358 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 09:13:54,358 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-10-28 09:13:54,358 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-28 09:13:54,359 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-28 09:13:54,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:13:54,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1751936571, now seen corresponding path program 3 times [2021-10-28 09:13:54,360 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:13:54,360 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143476080] [2021-10-28 09:13:54,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:13:54,360 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:13:54,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:13:54,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:13:54,578 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:13:54,579 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143476080] [2021-10-28 09:13:54,579 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143476080] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:13:54,579 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:13:54,579 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-28 09:13:54,579 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940372121] [2021-10-28 09:13:54,580 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-28 09:13:54,580 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:13:54,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-28 09:13:54,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-10-28 09:13:54,582 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 104 [2021-10-28 09:13:54,584 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 111 transitions, 587 flow. Second operand has 10 states, 10 states have (on average 84.4) internal successors, (844), 10 states have internal predecessors, (844), 0 states have call successors, (0), 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-10-28 09:13:54,584 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 09:13:54,584 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 104 [2021-10-28 09:13:54,584 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 09:13:55,132 INFO L129 PetriNetUnfolder]: 296/986 cut-off events. [2021-10-28 09:13:55,132 INFO L130 PetriNetUnfolder]: For 12011/12342 co-relation queries the response was YES. [2021-10-28 09:13:55,144 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5539 conditions, 986 events. 296/986 cut-off events. For 12011/12342 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 7052 event pairs, 87 based on Foata normal form. 43/980 useless extension candidates. Maximal degree in co-relation 5449. Up to 247 conditions per place. [2021-10-28 09:13:55,153 INFO L132 encePairwiseOnDemand]: 94/104 looper letters, 29 selfloop transitions, 13 changer transitions 20/137 dead transitions. [2021-10-28 09:13:55,154 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 137 transitions, 1141 flow [2021-10-28 09:13:55,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-28 09:13:55,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-10-28 09:13:55,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1043 transitions. [2021-10-28 09:13:55,157 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8357371794871795 [2021-10-28 09:13:55,157 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1043 transitions. [2021-10-28 09:13:55,158 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1043 transitions. [2021-10-28 09:13:55,158 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 09:13:55,158 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1043 transitions. [2021-10-28 09:13:55,163 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 86.91666666666667) internal successors, (1043), 12 states have internal predecessors, (1043), 0 states have call successors, (0), 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-10-28 09:13:55,166 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 104.0) internal successors, (1352), 13 states have internal predecessors, (1352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:13:55,167 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 104.0) internal successors, (1352), 13 states have internal predecessors, (1352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:13:55,167 INFO L186 Difference]: Start difference. First operand has 151 places, 111 transitions, 587 flow. Second operand 12 states and 1043 transitions. [2021-10-28 09:13:55,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 137 transitions, 1141 flow [2021-10-28 09:13:55,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 137 transitions, 1069 flow, removed 23 selfloop flow, removed 8 redundant places. [2021-10-28 09:13:55,205 INFO L242 Difference]: Finished difference. Result has 155 places, 112 transitions, 622 flow [2021-10-28 09:13:55,205 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=531, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=622, PETRI_PLACES=155, PETRI_TRANSITIONS=112} [2021-10-28 09:13:55,206 INFO L334 CegarLoopForPetriNet]: 109 programPoint places, 46 predicate places. [2021-10-28 09:13:55,206 INFO L470 AbstractCegarLoop]: Abstraction has has 155 places, 112 transitions, 622 flow [2021-10-28 09:13:55,207 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 84.4) internal successors, (844), 10 states have internal predecessors, (844), 0 states have call successors, (0), 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-10-28 09:13:55,207 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 09:13:55,207 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] [2021-10-28 09:13:55,207 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-28 09:13:55,208 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-28 09:13:55,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:13:55,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1323068969, now seen corresponding path program 1 times [2021-10-28 09:13:55,209 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:13:55,209 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129299909] [2021-10-28 09:13:55,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:13:55,209 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:13:55,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:13:55,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:13:55,673 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:13:55,673 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129299909] [2021-10-28 09:13:55,673 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129299909] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:13:55,673 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:13:55,673 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-28 09:13:55,674 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203740007] [2021-10-28 09:13:55,674 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-28 09:13:55,674 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:13:55,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-28 09:13:55,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2021-10-28 09:13:55,677 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 104 [2021-10-28 09:13:55,678 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 112 transitions, 622 flow. Second operand has 12 states, 12 states have (on average 83.33333333333333) internal successors, (1000), 12 states have internal predecessors, (1000), 0 states have call successors, (0), 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-10-28 09:13:55,679 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 09:13:55,679 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 104 [2021-10-28 09:13:55,679 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 09:13:56,294 INFO L129 PetriNetUnfolder]: 202/762 cut-off events. [2021-10-28 09:13:56,294 INFO L130 PetriNetUnfolder]: For 12468/12742 co-relation queries the response was YES. [2021-10-28 09:13:56,304 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4471 conditions, 762 events. 202/762 cut-off events. For 12468/12742 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5069 event pairs, 76 based on Foata normal form. 30/762 useless extension candidates. Maximal degree in co-relation 4376. Up to 292 conditions per place. [2021-10-28 09:13:56,318 INFO L132 encePairwiseOnDemand]: 92/104 looper letters, 29 selfloop transitions, 14 changer transitions 10/127 dead transitions. [2021-10-28 09:13:56,319 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 127 transitions, 972 flow [2021-10-28 09:13:56,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-28 09:13:56,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-10-28 09:13:56,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1186 transitions. [2021-10-28 09:13:56,322 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8145604395604396 [2021-10-28 09:13:56,322 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1186 transitions. [2021-10-28 09:13:56,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1186 transitions. [2021-10-28 09:13:56,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 09:13:56,323 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1186 transitions. [2021-10-28 09:13:56,326 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 84.71428571428571) internal successors, (1186), 14 states have internal predecessors, (1186), 0 states have call successors, (0), 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-10-28 09:13:56,329 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 104.0) internal successors, (1560), 15 states have internal predecessors, (1560), 0 states have call successors, (0), 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-10-28 09:13:56,330 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 104.0) internal successors, (1560), 15 states have internal predecessors, (1560), 0 states have call successors, (0), 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-10-28 09:13:56,331 INFO L186 Difference]: Start difference. First operand has 155 places, 112 transitions, 622 flow. Second operand 14 states and 1186 transitions. [2021-10-28 09:13:56,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 127 transitions, 972 flow [2021-10-28 09:13:56,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 127 transitions, 889 flow, removed 37 selfloop flow, removed 9 redundant places. [2021-10-28 09:13:56,371 INFO L242 Difference]: Finished difference. Result has 161 places, 115 transitions, 680 flow [2021-10-28 09:13:56,372 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=580, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=680, PETRI_PLACES=161, PETRI_TRANSITIONS=115} [2021-10-28 09:13:56,372 INFO L334 CegarLoopForPetriNet]: 109 programPoint places, 52 predicate places. [2021-10-28 09:13:56,372 INFO L470 AbstractCegarLoop]: Abstraction has has 161 places, 115 transitions, 680 flow [2021-10-28 09:13:56,373 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 83.33333333333333) internal successors, (1000), 12 states have internal predecessors, (1000), 0 states have call successors, (0), 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-10-28 09:13:56,373 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 09:13:56,373 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] [2021-10-28 09:13:56,374 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-28 09:13:56,374 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-28 09:13:56,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:13:56,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1277457581, now seen corresponding path program 2 times [2021-10-28 09:13:56,375 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:13:56,375 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437645507] [2021-10-28 09:13:56,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:13:56,375 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:13:56,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:13:56,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:13:56,728 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:13:56,728 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437645507] [2021-10-28 09:13:56,728 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437645507] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:13:56,728 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:13:56,729 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-10-28 09:13:56,729 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618971286] [2021-10-28 09:13:56,729 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-28 09:13:56,729 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:13:56,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-28 09:13:56,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2021-10-28 09:13:56,732 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 104 [2021-10-28 09:13:56,743 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 115 transitions, 680 flow. Second operand has 13 states, 13 states have (on average 83.23076923076923) internal successors, (1082), 13 states have internal predecessors, (1082), 0 states have call successors, (0), 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-10-28 09:13:56,744 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 09:13:56,744 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 104 [2021-10-28 09:13:56,744 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 09:13:57,487 INFO L129 PetriNetUnfolder]: 201/857 cut-off events. [2021-10-28 09:13:57,487 INFO L130 PetriNetUnfolder]: For 13515/13995 co-relation queries the response was YES. [2021-10-28 09:13:57,498 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4873 conditions, 857 events. 201/857 cut-off events. For 13515/13995 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 6181 event pairs, 56 based on Foata normal form. 41/864 useless extension candidates. Maximal degree in co-relation 4774. Up to 232 conditions per place. [2021-10-28 09:13:57,506 INFO L132 encePairwiseOnDemand]: 92/104 looper letters, 29 selfloop transitions, 22 changer transitions 10/135 dead transitions. [2021-10-28 09:13:57,506 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 135 transitions, 1162 flow [2021-10-28 09:13:57,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-28 09:13:57,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2021-10-28 09:13:57,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1275 transitions. [2021-10-28 09:13:57,509 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8173076923076923 [2021-10-28 09:13:57,509 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1275 transitions. [2021-10-28 09:13:57,510 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1275 transitions. [2021-10-28 09:13:57,510 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 09:13:57,510 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1275 transitions. [2021-10-28 09:13:57,514 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 85.0) internal successors, (1275), 15 states have internal predecessors, (1275), 0 states have call successors, (0), 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-10-28 09:13:57,517 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 104.0) internal successors, (1664), 16 states have internal predecessors, (1664), 0 states have call successors, (0), 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-10-28 09:13:57,518 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 104.0) internal successors, (1664), 16 states have internal predecessors, (1664), 0 states have call successors, (0), 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-10-28 09:13:57,518 INFO L186 Difference]: Start difference. First operand has 161 places, 115 transitions, 680 flow. Second operand 15 states and 1275 transitions. [2021-10-28 09:13:57,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 135 transitions, 1162 flow [2021-10-28 09:13:57,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 135 transitions, 1056 flow, removed 47 selfloop flow, removed 10 redundant places. [2021-10-28 09:13:57,563 INFO L242 Difference]: Finished difference. Result has 167 places, 119 transitions, 800 flow [2021-10-28 09:13:57,563 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=632, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=800, PETRI_PLACES=167, PETRI_TRANSITIONS=119} [2021-10-28 09:13:57,565 INFO L334 CegarLoopForPetriNet]: 109 programPoint places, 58 predicate places. [2021-10-28 09:13:57,566 INFO L470 AbstractCegarLoop]: Abstraction has has 167 places, 119 transitions, 800 flow [2021-10-28 09:13:57,566 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 83.23076923076923) internal successors, (1082), 13 states have internal predecessors, (1082), 0 states have call successors, (0), 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-10-28 09:13:57,566 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 09:13:57,567 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] [2021-10-28 09:13:57,567 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-28 09:13:57,567 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-28 09:13:57,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:13:57,568 INFO L85 PathProgramCache]: Analyzing trace with hash -636106409, now seen corresponding path program 3 times [2021-10-28 09:13:57,568 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:13:57,568 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432073870] [2021-10-28 09:13:57,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:13:57,569 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:13:57,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:13:57,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:13:57,865 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:13:57,865 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432073870] [2021-10-28 09:13:57,865 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432073870] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:13:57,865 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:13:57,865 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-28 09:13:57,865 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115464525] [2021-10-28 09:13:57,866 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-28 09:13:57,866 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:13:57,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-28 09:13:57,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-10-28 09:13:57,868 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 104 [2021-10-28 09:13:57,869 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 119 transitions, 800 flow. Second operand has 12 states, 12 states have (on average 83.33333333333333) internal successors, (1000), 12 states have internal predecessors, (1000), 0 states have call successors, (0), 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-10-28 09:13:57,869 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 09:13:57,869 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 104 [2021-10-28 09:13:57,870 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 09:13:58,379 INFO L129 PetriNetUnfolder]: 202/857 cut-off events. [2021-10-28 09:13:58,379 INFO L130 PetriNetUnfolder]: For 13240/13773 co-relation queries the response was YES. [2021-10-28 09:13:58,391 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4942 conditions, 857 events. 202/857 cut-off events. For 13240/13773 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 6172 event pairs, 58 based on Foata normal form. 30/850 useless extension candidates. Maximal degree in co-relation 4840. Up to 247 conditions per place. [2021-10-28 09:13:58,403 INFO L132 encePairwiseOnDemand]: 93/104 looper letters, 34 selfloop transitions, 15 changer transitions 7/130 dead transitions. [2021-10-28 09:13:58,403 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 130 transitions, 1092 flow [2021-10-28 09:13:58,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-28 09:13:58,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-10-28 09:13:58,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 855 transitions. [2021-10-28 09:13:58,409 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8221153846153846 [2021-10-28 09:13:58,409 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 855 transitions. [2021-10-28 09:13:58,409 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 855 transitions. [2021-10-28 09:13:58,410 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 09:13:58,410 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 855 transitions. [2021-10-28 09:13:58,412 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 85.5) internal successors, (855), 10 states have internal predecessors, (855), 0 states have call successors, (0), 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-10-28 09:13:58,414 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 104.0) internal successors, (1144), 11 states have internal predecessors, (1144), 0 states have call successors, (0), 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-10-28 09:13:58,415 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 104.0) internal successors, (1144), 11 states have internal predecessors, (1144), 0 states have call successors, (0), 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-10-28 09:13:58,415 INFO L186 Difference]: Start difference. First operand has 167 places, 119 transitions, 800 flow. Second operand 10 states and 855 transitions. [2021-10-28 09:13:58,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 130 transitions, 1092 flow [2021-10-28 09:13:58,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 130 transitions, 990 flow, removed 37 selfloop flow, removed 12 redundant places. [2021-10-28 09:13:58,462 INFO L242 Difference]: Finished difference. Result has 161 places, 118 transitions, 737 flow [2021-10-28 09:13:58,462 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=718, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=737, PETRI_PLACES=161, PETRI_TRANSITIONS=118} [2021-10-28 09:13:58,463 INFO L334 CegarLoopForPetriNet]: 109 programPoint places, 52 predicate places. [2021-10-28 09:13:58,463 INFO L470 AbstractCegarLoop]: Abstraction has has 161 places, 118 transitions, 737 flow [2021-10-28 09:13:58,463 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 83.33333333333333) internal successors, (1000), 12 states have internal predecessors, (1000), 0 states have call successors, (0), 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-10-28 09:13:58,464 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 09:13:58,464 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] [2021-10-28 09:13:58,464 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-28 09:13:58,464 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-28 09:13:58,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:13:58,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1857898007, now seen corresponding path program 4 times [2021-10-28 09:13:58,465 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:13:58,465 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856605695] [2021-10-28 09:13:58,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:13:58,466 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:13:58,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:13:58,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:13:58,794 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:13:58,794 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856605695] [2021-10-28 09:13:58,795 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856605695] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:13:58,795 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:13:58,795 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-28 09:13:58,795 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92274010] [2021-10-28 09:13:58,795 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-28 09:13:58,796 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:13:58,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-28 09:13:58,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2021-10-28 09:13:58,798 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 104 [2021-10-28 09:13:58,799 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 118 transitions, 737 flow. Second operand has 12 states, 12 states have (on average 81.5) internal successors, (978), 12 states have internal predecessors, (978), 0 states have call successors, (0), 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-10-28 09:13:58,799 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 09:13:58,799 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 104 [2021-10-28 09:13:58,799 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 09:13:59,354 INFO L129 PetriNetUnfolder]: 149/757 cut-off events. [2021-10-28 09:13:59,354 INFO L130 PetriNetUnfolder]: For 9095/9619 co-relation queries the response was YES. [2021-10-28 09:13:59,362 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3853 conditions, 757 events. 149/757 cut-off events. For 9095/9619 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 5499 event pairs, 30 based on Foata normal form. 33/759 useless extension candidates. Maximal degree in co-relation 3753. Up to 147 conditions per place. [2021-10-28 09:13:59,367 INFO L132 encePairwiseOnDemand]: 94/104 looper letters, 36 selfloop transitions, 15 changer transitions 10/133 dead transitions. [2021-10-28 09:13:59,367 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 133 transitions, 1089 flow [2021-10-28 09:13:59,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-28 09:13:59,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-10-28 09:13:59,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1081 transitions. [2021-10-28 09:13:59,370 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7995562130177515 [2021-10-28 09:13:59,370 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1081 transitions. [2021-10-28 09:13:59,370 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1081 transitions. [2021-10-28 09:13:59,370 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 09:13:59,371 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1081 transitions. [2021-10-28 09:13:59,373 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 83.15384615384616) internal successors, (1081), 13 states have internal predecessors, (1081), 0 states have call successors, (0), 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-10-28 09:13:59,375 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 104.0) internal successors, (1456), 14 states have internal predecessors, (1456), 0 states have call successors, (0), 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-10-28 09:13:59,376 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 104.0) internal successors, (1456), 14 states have internal predecessors, (1456), 0 states have call successors, (0), 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-10-28 09:13:59,377 INFO L186 Difference]: Start difference. First operand has 161 places, 118 transitions, 737 flow. Second operand 13 states and 1081 transitions. [2021-10-28 09:13:59,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 133 transitions, 1089 flow [2021-10-28 09:13:59,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 133 transitions, 1035 flow, removed 18 selfloop flow, removed 8 redundant places. [2021-10-28 09:13:59,415 INFO L242 Difference]: Finished difference. Result has 169 places, 118 transitions, 754 flow [2021-10-28 09:13:59,416 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=703, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=754, PETRI_PLACES=169, PETRI_TRANSITIONS=118} [2021-10-28 09:13:59,416 INFO L334 CegarLoopForPetriNet]: 109 programPoint places, 60 predicate places. [2021-10-28 09:13:59,417 INFO L470 AbstractCegarLoop]: Abstraction has has 169 places, 118 transitions, 754 flow [2021-10-28 09:13:59,417 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 81.5) internal successors, (978), 12 states have internal predecessors, (978), 0 states have call successors, (0), 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-10-28 09:13:59,417 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 09:13:59,417 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] [2021-10-28 09:13:59,418 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-28 09:13:59,418 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-28 09:13:59,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:13:59,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1248645963, now seen corresponding path program 1 times [2021-10-28 09:13:59,419 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:13:59,419 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588143148] [2021-10-28 09:13:59,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:13:59,419 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:13:59,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:13:59,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:13:59,521 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:13:59,522 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588143148] [2021-10-28 09:13:59,524 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588143148] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:13:59,524 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:13:59,524 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-28 09:13:59,525 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594157927] [2021-10-28 09:13:59,525 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-28 09:13:59,525 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:13:59,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-28 09:13:59,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-28 09:13:59,527 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 104 [2021-10-28 09:13:59,528 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 118 transitions, 754 flow. Second operand has 6 states, 6 states have (on average 91.16666666666667) internal successors, (547), 6 states have internal predecessors, (547), 0 states have call successors, (0), 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-10-28 09:13:59,528 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 09:13:59,528 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 104 [2021-10-28 09:13:59,529 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 09:14:00,244 INFO L129 PetriNetUnfolder]: 1249/2915 cut-off events. [2021-10-28 09:14:00,245 INFO L130 PetriNetUnfolder]: For 10926/11135 co-relation queries the response was YES. [2021-10-28 09:14:00,288 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8515 conditions, 2915 events. 1249/2915 cut-off events. For 10926/11135 co-relation queries the response was YES. Maximal size of possible extension queue 490. Compared 26343 event pairs, 88 based on Foata normal form. 3/2523 useless extension candidates. Maximal degree in co-relation 8418. Up to 815 conditions per place. [2021-10-28 09:14:00,299 INFO L132 encePairwiseOnDemand]: 94/104 looper letters, 24 selfloop transitions, 17 changer transitions 2/148 dead transitions. [2021-10-28 09:14:00,299 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 148 transitions, 896 flow [2021-10-28 09:14:00,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-28 09:14:00,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-10-28 09:14:00,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 943 transitions. [2021-10-28 09:14:00,302 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9067307692307692 [2021-10-28 09:14:00,302 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 943 transitions. [2021-10-28 09:14:00,302 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 943 transitions. [2021-10-28 09:14:00,303 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 09:14:00,303 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 943 transitions. [2021-10-28 09:14:00,305 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 94.3) internal successors, (943), 10 states have internal predecessors, (943), 0 states have call successors, (0), 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-10-28 09:14:00,308 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 104.0) internal successors, (1144), 11 states have internal predecessors, (1144), 0 states have call successors, (0), 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-10-28 09:14:00,309 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 104.0) internal successors, (1144), 11 states have internal predecessors, (1144), 0 states have call successors, (0), 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-10-28 09:14:00,309 INFO L186 Difference]: Start difference. First operand has 169 places, 118 transitions, 754 flow. Second operand 10 states and 943 transitions. [2021-10-28 09:14:00,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 148 transitions, 896 flow [2021-10-28 09:14:00,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 148 transitions, 815 flow, removed 23 selfloop flow, removed 15 redundant places. [2021-10-28 09:14:00,369 INFO L242 Difference]: Finished difference. Result has 163 places, 131 transitions, 780 flow [2021-10-28 09:14:00,370 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=673, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=780, PETRI_PLACES=163, PETRI_TRANSITIONS=131} [2021-10-28 09:14:00,370 INFO L334 CegarLoopForPetriNet]: 109 programPoint places, 54 predicate places. [2021-10-28 09:14:00,370 INFO L470 AbstractCegarLoop]: Abstraction has has 163 places, 131 transitions, 780 flow [2021-10-28 09:14:00,371 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 91.16666666666667) internal successors, (547), 6 states have internal predecessors, (547), 0 states have call successors, (0), 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-10-28 09:14:00,371 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 09:14:00,371 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-10-28 09:14:00,371 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-28 09:14:00,372 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-28 09:14:00,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:14:00,372 INFO L85 PathProgramCache]: Analyzing trace with hash -749342332, now seen corresponding path program 1 times [2021-10-28 09:14:00,373 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:14:00,373 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649295054] [2021-10-28 09:14:00,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:14:00,373 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:14:00,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:14:00,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:14:00,489 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:14:00,489 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649295054] [2021-10-28 09:14:00,490 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649295054] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:14:00,490 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:14:00,490 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-28 09:14:00,490 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360980498] [2021-10-28 09:14:00,491 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-28 09:14:00,491 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:14:00,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-28 09:14:00,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-10-28 09:14:00,493 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 104 [2021-10-28 09:14:00,494 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 131 transitions, 780 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-10-28 09:14:00,495 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 09:14:00,495 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 104 [2021-10-28 09:14:00,495 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 09:14:01,127 INFO L129 PetriNetUnfolder]: 1115/2681 cut-off events. [2021-10-28 09:14:01,128 INFO L130 PetriNetUnfolder]: For 9160/10813 co-relation queries the response was YES. [2021-10-28 09:14:01,155 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10318 conditions, 2681 events. 1115/2681 cut-off events. For 9160/10813 co-relation queries the response was YES. Maximal size of possible extension queue 461. Compared 25140 event pairs, 16 based on Foata normal form. 339/2737 useless extension candidates. Maximal degree in co-relation 10225. Up to 1190 conditions per place. [2021-10-28 09:14:01,164 INFO L132 encePairwiseOnDemand]: 94/104 looper letters, 20 selfloop transitions, 32 changer transitions 14/159 dead transitions. [2021-10-28 09:14:01,164 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 159 transitions, 1049 flow [2021-10-28 09:14:01,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-28 09:14:01,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-10-28 09:14:01,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1227 transitions. [2021-10-28 09:14:01,168 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9075443786982249 [2021-10-28 09:14:01,168 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1227 transitions. [2021-10-28 09:14:01,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1227 transitions. [2021-10-28 09:14:01,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 09:14:01,169 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1227 transitions. [2021-10-28 09:14:01,172 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 94.38461538461539) internal successors, (1227), 13 states have internal predecessors, (1227), 0 states have call successors, (0), 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-10-28 09:14:01,175 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 104.0) internal successors, (1456), 14 states have internal predecessors, (1456), 0 states have call successors, (0), 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-10-28 09:14:01,176 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 104.0) internal successors, (1456), 14 states have internal predecessors, (1456), 0 states have call successors, (0), 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-10-28 09:14:01,176 INFO L186 Difference]: Start difference. First operand has 163 places, 131 transitions, 780 flow. Second operand 13 states and 1227 transitions. [2021-10-28 09:14:01,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 159 transitions, 1049 flow [2021-10-28 09:14:01,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 159 transitions, 1012 flow, removed 10 selfloop flow, removed 5 redundant places. [2021-10-28 09:14:01,213 INFO L242 Difference]: Finished difference. Result has 174 places, 139 transitions, 855 flow [2021-10-28 09:14:01,214 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=666, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=855, PETRI_PLACES=174, PETRI_TRANSITIONS=139} [2021-10-28 09:14:01,267 INFO L334 CegarLoopForPetriNet]: 109 programPoint places, 65 predicate places. [2021-10-28 09:14:01,268 INFO L470 AbstractCegarLoop]: Abstraction has has 174 places, 139 transitions, 855 flow [2021-10-28 09:14:01,268 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-10-28 09:14:01,268 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 09:14:01,268 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-10-28 09:14:01,269 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-28 09:14:01,269 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-28 09:14:01,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:14:01,269 INFO L85 PathProgramCache]: Analyzing trace with hash 235986919, now seen corresponding path program 1 times [2021-10-28 09:14:01,269 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:14:01,270 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736771993] [2021-10-28 09:14:01,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:14:01,270 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:14:01,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:14:01,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:14:01,376 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:14:01,377 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736771993] [2021-10-28 09:14:01,377 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736771993] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:14:01,377 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:14:01,377 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-28 09:14:01,377 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217291008] [2021-10-28 09:14:01,378 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-28 09:14:01,378 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:14:01,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-28 09:14:01,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-10-28 09:14:01,380 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 104 [2021-10-28 09:14:01,381 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 139 transitions, 855 flow. Second operand has 8 states, 8 states have (on average 91.125) internal successors, (729), 8 states have internal predecessors, (729), 0 states have call successors, (0), 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-10-28 09:14:01,381 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 09:14:01,381 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 104 [2021-10-28 09:14:01,381 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 09:14:02,101 INFO L129 PetriNetUnfolder]: 837/2300 cut-off events. [2021-10-28 09:14:02,101 INFO L130 PetriNetUnfolder]: For 10357/12908 co-relation queries the response was YES. [2021-10-28 09:14:02,124 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10173 conditions, 2300 events. 837/2300 cut-off events. For 10357/12908 co-relation queries the response was YES. Maximal size of possible extension queue 453. Compared 23034 event pairs, 0 based on Foata normal form. 409/2430 useless extension candidates. Maximal degree in co-relation 10076. Up to 909 conditions per place. [2021-10-28 09:14:02,128 INFO L132 encePairwiseOnDemand]: 94/104 looper letters, 16 selfloop transitions, 32 changer transitions 36/164 dead transitions. [2021-10-28 09:14:02,128 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 164 transitions, 1162 flow [2021-10-28 09:14:02,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-28 09:14:02,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-10-28 09:14:02,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1496 transitions. [2021-10-28 09:14:02,132 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8990384615384616 [2021-10-28 09:14:02,133 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1496 transitions. [2021-10-28 09:14:02,133 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1496 transitions. [2021-10-28 09:14:02,134 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 09:14:02,134 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1496 transitions. [2021-10-28 09:14:02,137 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 93.5) internal successors, (1496), 16 states have internal predecessors, (1496), 0 states have call successors, (0), 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-10-28 09:14:02,141 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 104.0) internal successors, (1768), 17 states have internal predecessors, (1768), 0 states have call successors, (0), 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-10-28 09:14:02,142 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 104.0) internal successors, (1768), 17 states have internal predecessors, (1768), 0 states have call successors, (0), 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-10-28 09:14:02,142 INFO L186 Difference]: Start difference. First operand has 174 places, 139 transitions, 855 flow. Second operand 16 states and 1496 transitions. [2021-10-28 09:14:02,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 164 transitions, 1162 flow [2021-10-28 09:14:02,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 164 transitions, 887 flow, removed 103 selfloop flow, removed 29 redundant places. [2021-10-28 09:14:02,242 INFO L242 Difference]: Finished difference. Result has 167 places, 122 transitions, 613 flow [2021-10-28 09:14:02,243 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=601, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=613, PETRI_PLACES=167, PETRI_TRANSITIONS=122} [2021-10-28 09:14:02,243 INFO L334 CegarLoopForPetriNet]: 109 programPoint places, 58 predicate places. [2021-10-28 09:14:02,243 INFO L470 AbstractCegarLoop]: Abstraction has has 167 places, 122 transitions, 613 flow [2021-10-28 09:14:02,244 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 91.125) internal successors, (729), 8 states have internal predecessors, (729), 0 states have call successors, (0), 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-10-28 09:14:02,244 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 09:14:02,244 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] [2021-10-28 09:14:02,244 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-28 09:14:02,245 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-28 09:14:02,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:14:02,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1907594139, now seen corresponding path program 1 times [2021-10-28 09:14:02,245 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:14:02,246 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89654909] [2021-10-28 09:14:02,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:14:02,246 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:14:02,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 09:14:02,295 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 09:14:02,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 09:14:02,394 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 09:14:02,394 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-10-28 09:14:02,396 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:14:02,398 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:14:02,398 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION [2021-10-28 09:14:02,398 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION [2021-10-28 09:14:02,399 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION [2021-10-28 09:14:02,399 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:14:02,399 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-10-28 09:14:02,403 INFO L731 BasicCegarLoop]: Path program histogram: [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:14:02,409 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-10-28 09:14:02,409 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-28 09:14:02,567 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.10 09:14:02 BasicIcfg [2021-10-28 09:14:02,567 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-28 09:14:02,567 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-28 09:14:02,567 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-28 09:14:02,568 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-28 09:14:02,568 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 09:13:44" (3/4) ... [2021-10-28 09:14:02,570 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-28 09:14:02,723 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87bebc62-5ff0-402a-8f48-84591e1de9b1/bin/uautomizer-UnR33cPsHg/witness.graphml [2021-10-28 09:14:02,723 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-28 09:14:02,725 INFO L168 Benchmark]: Toolchain (without parser) took 21048.68 ms. Allocated memory was 94.4 MB in the beginning and 320.9 MB in the end (delta: 226.5 MB). Free memory was 52.4 MB in the beginning and 105.3 MB in the end (delta: -52.9 MB). Peak memory consumption was 172.1 MB. Max. memory is 16.1 GB. [2021-10-28 09:14:02,725 INFO L168 Benchmark]: CDTParser took 0.34 ms. Allocated memory is still 94.4 MB. Free memory is still 70.4 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-28 09:14:02,726 INFO L168 Benchmark]: CACSL2BoogieTranslator took 630.42 ms. Allocated memory is still 94.4 MB. Free memory was 52.2 MB in the beginning and 56.1 MB in the end (delta: -3.9 MB). Peak memory consumption was 4.5 MB. Max. memory is 16.1 GB. [2021-10-28 09:14:02,726 INFO L168 Benchmark]: Boogie Procedure Inliner took 116.46 ms. Allocated memory is still 94.4 MB. Free memory was 56.1 MB in the beginning and 53.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-28 09:14:02,727 INFO L168 Benchmark]: Boogie Preprocessor took 94.14 ms. Allocated memory is still 94.4 MB. Free memory was 53.4 MB in the beginning and 51.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-28 09:14:02,727 INFO L168 Benchmark]: RCFGBuilder took 2328.91 ms. Allocated memory was 94.4 MB in the beginning and 113.2 MB in the end (delta: 18.9 MB). Free memory was 51.0 MB in the beginning and 50.1 MB in the end (delta: 884.4 kB). Peak memory consumption was 31.6 MB. Max. memory is 16.1 GB. [2021-10-28 09:14:02,728 INFO L168 Benchmark]: TraceAbstraction took 17712.95 ms. Allocated memory was 113.2 MB in the beginning and 320.9 MB in the end (delta: 207.6 MB). Free memory was 49.3 MB in the beginning and 131.5 MB in the end (delta: -82.2 MB). Peak memory consumption was 126.0 MB. Max. memory is 16.1 GB. [2021-10-28 09:14:02,728 INFO L168 Benchmark]: Witness Printer took 155.88 ms. Allocated memory is still 320.9 MB. Free memory was 131.5 MB in the beginning and 105.3 MB in the end (delta: 26.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 16.1 GB. [2021-10-28 09:14:02,730 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.34 ms. Allocated memory is still 94.4 MB. Free memory is still 70.4 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 630.42 ms. Allocated memory is still 94.4 MB. Free memory was 52.2 MB in the beginning and 56.1 MB in the end (delta: -3.9 MB). Peak memory consumption was 4.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 116.46 ms. Allocated memory is still 94.4 MB. Free memory was 56.1 MB in the beginning and 53.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 94.14 ms. Allocated memory is still 94.4 MB. Free memory was 53.4 MB in the beginning and 51.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2328.91 ms. Allocated memory was 94.4 MB in the beginning and 113.2 MB in the end (delta: 18.9 MB). Free memory was 51.0 MB in the beginning and 50.1 MB in the end (delta: 884.4 kB). Peak memory consumption was 31.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 17712.95 ms. Allocated memory was 113.2 MB in the beginning and 320.9 MB in the end (delta: 207.6 MB). Free memory was 49.3 MB in the beginning and 131.5 MB in the end (delta: -82.2 MB). Peak memory consumption was 126.0 MB. Max. memory is 16.1 GB. * Witness Printer took 155.88 ms. Allocated memory is still 320.9 MB. Free memory was 131.5 MB in the beginning and 105.3 MB in the end (delta: 26.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 16.1 GB. * 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] [L710] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0] [L711] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0] [L713] 0 int x = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L715] 0 int y = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L716] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L717] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L718] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L719] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L720] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L721] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L722] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L723] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L724] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L725] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L726] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L727] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L728] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L729] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L730] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L731] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L733] 0 int z = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L734] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L735] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L811] 0 pthread_t t2492; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L812] FCALL, FORK 0 pthread_create(&t2492, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L813] 0 pthread_t t2493; VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L814] FCALL, FORK 0 pthread_create(&t2493, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L815] 0 pthread_t t2494; VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L816] FCALL, FORK 0 pthread_create(&t2494, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L774] 3 y$w_buff1 = y$w_buff0 [L775] 3 y$w_buff0 = 2 [L776] 3 y$w_buff1_used = y$w_buff0_used [L777] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L779] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L780] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L781] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L782] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L783] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L786] 3 z = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L739] 1 z = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L742] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L754] 2 x = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L757] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L789] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L789] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L790] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L790] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L791] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L792] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L792] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L793] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L760] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L760] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L760] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L760] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L761] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L761] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L762] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L762] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L763] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L763] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L764] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L764] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=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, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L767] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L796] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L822] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L822] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L822] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L822] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L823] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L823] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L824] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L825] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L825] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L826] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L829] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L830] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L831] 0 y$flush_delayed = weak$$choice2 [L832] 0 y$mem_tmp = y [L833] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L833] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L834] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L834] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L835] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L835] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L836] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L836] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L837] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L837] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L838] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L838] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L839] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L839] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) [L841] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L841] 0 y = y$flush_delayed ? y$mem_tmp : y [L842] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L18] 0 reach_error() VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=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: 814]: 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: 812]: 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: 816]: 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, 130 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: 17.3s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 11.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 209 SDtfs, 634 SDslu, 846 SDs, 0 SdLazy, 1533 SolverSat, 291 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 285 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 245 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=855occurred in iteration=18, InterpolantAutomatonStates: 220, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 1434 NumberOfCodeBlocks, 1434 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1335 ConstructedInterpolants, 0 QuantifiedInterpolants, 7572 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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-10-28 09:14:02,772 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87bebc62-5ff0-402a-8f48-84591e1de9b1/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...