./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix037_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9ad7fb26 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4bf7f29f-0880-4519-9619-ec6e14746f34/bin/uautomizer-tBqnrhUYjU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4bf7f29f-0880-4519-9619-ec6e14746f34/bin/uautomizer-tBqnrhUYjU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4bf7f29f-0880-4519-9619-ec6e14746f34/bin/uautomizer-tBqnrhUYjU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4bf7f29f-0880-4519-9619-ec6e14746f34/bin/uautomizer-tBqnrhUYjU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix037_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4bf7f29f-0880-4519-9619-ec6e14746f34/bin/uautomizer-tBqnrhUYjU/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4bf7f29f-0880-4519-9619-ec6e14746f34/bin/uautomizer-tBqnrhUYjU --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 526eb61a43a151355b0c30c3cdf9498dba5b0f807210313241440694b1deb106 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-9ad7fb2 [2021-11-02 23:02:35,374 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-02 23:02:35,378 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-02 23:02:35,440 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-02 23:02:35,440 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-02 23:02:35,445 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-02 23:02:35,447 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-02 23:02:35,452 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-02 23:02:35,455 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-02 23:02:35,462 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-02 23:02:35,464 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-02 23:02:35,465 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-02 23:02:35,466 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-02 23:02:35,469 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-02 23:02:35,471 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-02 23:02:35,477 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-02 23:02:35,478 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-02 23:02:35,481 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-02 23:02:35,485 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-02 23:02:35,489 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-02 23:02:35,494 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-02 23:02:35,496 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-02 23:02:35,499 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-02 23:02:35,501 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-02 23:02:35,507 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-02 23:02:35,508 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-02 23:02:35,508 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-02 23:02:35,510 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-02 23:02:35,510 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-02 23:02:35,512 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-02 23:02:35,512 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-02 23:02:35,513 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-02 23:02:35,515 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-02 23:02:35,516 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-02 23:02:35,518 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-02 23:02:35,518 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-02 23:02:35,519 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-02 23:02:35,519 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-02 23:02:35,519 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-02 23:02:35,520 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-02 23:02:35,521 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-02 23:02:35,522 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4bf7f29f-0880-4519-9619-ec6e14746f34/bin/uautomizer-tBqnrhUYjU/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-11-02 23:02:35,571 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-02 23:02:35,571 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-02 23:02:35,572 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-02 23:02:35,572 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-02 23:02:35,574 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-02 23:02:35,575 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-02 23:02:35,575 INFO L138 SettingsManager]: * Use SBE=true [2021-11-02 23:02:35,575 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-02 23:02:35,575 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-02 23:02:35,576 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-02 23:02:35,576 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-02 23:02:35,577 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-02 23:02:35,577 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-02 23:02:35,577 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-02 23:02:35,577 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-02 23:02:35,577 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-02 23:02:35,578 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-02 23:02:35,578 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-02 23:02:35,578 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-02 23:02:35,578 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-02 23:02:35,578 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-02 23:02:35,579 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-02 23:02:35,579 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-02 23:02:35,579 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-02 23:02:35,579 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-02 23:02:35,579 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-02 23:02:35,580 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-02 23:02:35,580 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-02 23:02:35,580 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-02 23:02:35,581 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-02 23:02:35,582 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-02 23:02:35,582 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-02 23:02:35,582 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_4bf7f29f-0880-4519-9619-ec6e14746f34/bin/uautomizer-tBqnrhUYjU/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_4bf7f29f-0880-4519-9619-ec6e14746f34/bin/uautomizer-tBqnrhUYjU 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 -> 526eb61a43a151355b0c30c3cdf9498dba5b0f807210313241440694b1deb106 [2021-11-02 23:02:35,892 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-02 23:02:35,927 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-02 23:02:35,930 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-02 23:02:35,931 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-02 23:02:35,932 INFO L275 PluginConnector]: CDTParser initialized [2021-11-02 23:02:35,933 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4bf7f29f-0880-4519-9619-ec6e14746f34/bin/uautomizer-tBqnrhUYjU/../../sv-benchmarks/c/pthread-wmm/mix037_tso.oepc.i [2021-11-02 23:02:36,005 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4bf7f29f-0880-4519-9619-ec6e14746f34/bin/uautomizer-tBqnrhUYjU/data/7c24bf4cc/72c2e314058a41aeba34a61bb95e4066/FLAG9b822fef9 [2021-11-02 23:02:36,620 INFO L306 CDTParser]: Found 1 translation units. [2021-11-02 23:02:36,620 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4bf7f29f-0880-4519-9619-ec6e14746f34/sv-benchmarks/c/pthread-wmm/mix037_tso.oepc.i [2021-11-02 23:02:36,658 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4bf7f29f-0880-4519-9619-ec6e14746f34/bin/uautomizer-tBqnrhUYjU/data/7c24bf4cc/72c2e314058a41aeba34a61bb95e4066/FLAG9b822fef9 [2021-11-02 23:02:36,864 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4bf7f29f-0880-4519-9619-ec6e14746f34/bin/uautomizer-tBqnrhUYjU/data/7c24bf4cc/72c2e314058a41aeba34a61bb95e4066 [2021-11-02 23:02:36,867 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-02 23:02:36,869 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-02 23:02:36,872 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-02 23:02:36,872 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-02 23:02:36,876 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-02 23:02:36,877 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 11:02:36" (1/1) ... [2021-11-02 23:02:36,879 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63abef1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:02:36, skipping insertion in model container [2021-11-02 23:02:36,880 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 11:02:36" (1/1) ... [2021-11-02 23:02:36,887 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-02 23:02:36,953 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-02 23:02:37,178 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_4bf7f29f-0880-4519-9619-ec6e14746f34/sv-benchmarks/c/pthread-wmm/mix037_tso.oepc.i[949,962] [2021-11-02 23:02:37,507 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-02 23:02:37,521 INFO L203 MainTranslator]: Completed pre-run [2021-11-02 23:02:37,535 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_4bf7f29f-0880-4519-9619-ec6e14746f34/sv-benchmarks/c/pthread-wmm/mix037_tso.oepc.i[949,962] [2021-11-02 23:02:37,629 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-02 23:02:37,681 INFO L208 MainTranslator]: Completed translation [2021-11-02 23:02:37,682 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:02:37 WrapperNode [2021-11-02 23:02:37,682 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-02 23:02:37,684 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-02 23:02:37,684 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-02 23:02:37,684 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-02 23:02:37,692 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:02:37" (1/1) ... [2021-11-02 23:02:37,711 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:02:37" (1/1) ... [2021-11-02 23:02:37,745 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-02 23:02:37,750 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-02 23:02:37,751 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-02 23:02:37,751 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-02 23:02:37,760 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:02:37" (1/1) ... [2021-11-02 23:02:37,760 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:02:37" (1/1) ... [2021-11-02 23:02:37,773 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:02:37" (1/1) ... [2021-11-02 23:02:37,779 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:02:37" (1/1) ... [2021-11-02 23:02:37,790 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:02:37" (1/1) ... [2021-11-02 23:02:37,812 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:02:37" (1/1) ... [2021-11-02 23:02:37,816 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:02:37" (1/1) ... [2021-11-02 23:02:37,821 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-02 23:02:37,822 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-02 23:02:37,822 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-02 23:02:37,823 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-02 23:02:37,824 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:02:37" (1/1) ... [2021-11-02 23:02:37,832 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-02 23:02:37,848 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4bf7f29f-0880-4519-9619-ec6e14746f34/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 23:02:37,861 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4bf7f29f-0880-4519-9619-ec6e14746f34/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-02 23:02:37,894 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4bf7f29f-0880-4519-9619-ec6e14746f34/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-02 23:02:37,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-02 23:02:37,910 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-11-02 23:02:37,910 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-02 23:02:37,910 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-02 23:02:37,911 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-11-02 23:02:37,911 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-11-02 23:02:37,911 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-11-02 23:02:37,911 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-11-02 23:02:37,911 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-11-02 23:02:37,912 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-11-02 23:02:37,912 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-11-02 23:02:37,912 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-11-02 23:02:37,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-02 23:02:37,912 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-11-02 23:02:37,913 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-02 23:02:37,913 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-02 23:02:37,915 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-11-02 23:02:40,032 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-02 23:02:40,032 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-11-02 23:02:40,035 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 11:02:40 BoogieIcfgContainer [2021-11-02 23:02:40,035 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-02 23:02:40,037 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-02 23:02:40,037 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-02 23:02:40,041 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-02 23:02:40,041 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 11:02:36" (1/3) ... [2021-11-02 23:02:40,042 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49fb3e81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 11:02:40, skipping insertion in model container [2021-11-02 23:02:40,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:02:37" (2/3) ... [2021-11-02 23:02:40,043 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49fb3e81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 11:02:40, skipping insertion in model container [2021-11-02 23:02:40,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 11:02:40" (3/3) ... [2021-11-02 23:02:40,045 INFO L111 eAbstractionObserver]: Analyzing ICFG mix037_tso.oepc.i [2021-11-02 23:02:40,050 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-11-02 23:02:40,051 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-02 23:02:40,051 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-11-02 23:02:40,051 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-11-02 23:02:40,090 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,090 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,091 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,091 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,091 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,091 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,091 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,092 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,092 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,092 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,092 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,093 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,093 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,093 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,093 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,094 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,094 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,094 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,094 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,094 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,095 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,095 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,095 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,096 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,096 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,096 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,097 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,097 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,097 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,097 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,097 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,098 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,098 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,098 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,098 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,098 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,099 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,099 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,099 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,099 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,100 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,100 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,100 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,100 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,100 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,101 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,101 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,101 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,101 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,102 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,102 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,102 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,102 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,102 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,103 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,103 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,103 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,104 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,104 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,104 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,104 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,105 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,105 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,105 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,105 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,105 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,106 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,106 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,106 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,106 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,106 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,107 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,107 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,107 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,107 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,108 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,108 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,108 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,108 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,108 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,109 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,109 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,109 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,110 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,110 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,110 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,111 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,111 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,111 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,111 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,111 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,112 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,112 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,112 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,112 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,113 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,113 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,113 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,113 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,113 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,114 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,114 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,114 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,114 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,115 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,115 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,115 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,115 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,116 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,116 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,116 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,116 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,119 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,120 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,120 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,120 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,120 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,121 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,121 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,121 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,121 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,121 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,124 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,124 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,124 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,124 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,125 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,125 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,125 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,125 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,126 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,126 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,126 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,126 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,128 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,129 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,129 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,129 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,129 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,130 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,130 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,130 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,130 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,130 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,132 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,133 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,133 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,133 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,133 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,133 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,134 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,134 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,134 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,134 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-02 23:02:40,136 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-11-02 23:02:40,186 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-02 23:02:40,193 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-11-02 23:02:40,193 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-11-02 23:02:40,208 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 143 places, 132 transitions, 284 flow [2021-11-02 23:02:40,261 INFO L129 PetriNetUnfolder]: 2/128 cut-off events. [2021-11-02 23:02:40,261 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-11-02 23:02:40,265 INFO L84 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 128 events. 2/128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 76 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 88. Up to 2 conditions per place. [2021-11-02 23:02:40,265 INFO L82 GeneralOperation]: Start removeDead. Operand has 143 places, 132 transitions, 284 flow [2021-11-02 23:02:40,271 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 139 places, 128 transitions, 268 flow [2021-11-02 23:02:40,284 INFO L129 PetriNetUnfolder]: 0/63 cut-off events. [2021-11-02 23:02:40,284 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-11-02 23:02:40,284 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-02 23:02:40,285 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] [2021-11-02 23:02:40,286 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-02 23:02:40,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:02:40,291 INFO L85 PathProgramCache]: Analyzing trace with hash -93660115, now seen corresponding path program 1 times [2021-11-02 23:02:40,300 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:02:40,301 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643670058] [2021-11-02 23:02:40,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:02:40,302 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:02:40,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:02:40,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 23:02:40,731 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:02:40,731 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643670058] [2021-11-02 23:02:40,732 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643670058] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 23:02:40,732 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 23:02:40,733 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-02 23:02:40,734 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437484264] [2021-11-02 23:02:40,744 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-02 23:02:40,745 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:02:40,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-02 23:02:40,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 23:02:40,763 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 132 [2021-11-02 23:02:40,767 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 128 transitions, 268 flow. Second operand has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 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-11-02 23:02:40,767 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-02 23:02:40,768 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 132 [2021-11-02 23:02:40,769 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-02 23:02:41,042 INFO L129 PetriNetUnfolder]: 133/827 cut-off events. [2021-11-02 23:02:41,042 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-11-02 23:02:41,048 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1046 conditions, 827 events. 133/827 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 5478 event pairs, 87 based on Foata normal form. 37/813 useless extension candidates. Maximal degree in co-relation 991. Up to 153 conditions per place. [2021-11-02 23:02:41,055 INFO L132 encePairwiseOnDemand]: 127/132 looper letters, 11 selfloop transitions, 2 changer transitions 0/129 dead transitions. [2021-11-02 23:02:41,055 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 129 transitions, 296 flow [2021-11-02 23:02:41,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-02 23:02:41,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-11-02 23:02:41,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 378 transitions. [2021-11-02 23:02:41,070 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9545454545454546 [2021-11-02 23:02:41,071 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 378 transitions. [2021-11-02 23:02:41,072 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 378 transitions. [2021-11-02 23:02:41,074 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-02 23:02:41,076 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 378 transitions. [2021-11-02 23:02:41,084 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 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-11-02 23:02:41,090 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 132.0) internal successors, (528), 4 states have internal predecessors, (528), 0 states have call successors, (0), 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-11-02 23:02:41,091 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 132.0) internal successors, (528), 4 states have internal predecessors, (528), 0 states have call successors, (0), 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-11-02 23:02:41,093 INFO L186 Difference]: Start difference. First operand has 139 places, 128 transitions, 268 flow. Second operand 3 states and 378 transitions. [2021-11-02 23:02:41,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 129 transitions, 296 flow [2021-11-02 23:02:41,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 129 transitions, 292 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-11-02 23:02:41,103 INFO L242 Difference]: Finished difference. Result has 135 places, 124 transitions, 260 flow [2021-11-02 23:02:41,106 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=260, PETRI_PLACES=135, PETRI_TRANSITIONS=124} [2021-11-02 23:02:41,107 INFO L334 CegarLoopForPetriNet]: 139 programPoint places, -4 predicate places. [2021-11-02 23:02:41,107 INFO L470 AbstractCegarLoop]: Abstraction has has 135 places, 124 transitions, 260 flow [2021-11-02 23:02:41,108 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 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-11-02 23:02:41,108 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-02 23:02:41,108 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 23:02:41,109 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-02 23:02:41,109 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-02 23:02:41,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:02:41,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1247601524, now seen corresponding path program 1 times [2021-11-02 23:02:41,110 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:02:41,110 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336428696] [2021-11-02 23:02:41,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:02:41,111 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:02:41,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:02:41,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 23:02:41,451 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:02:41,451 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336428696] [2021-11-02 23:02:41,451 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336428696] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 23:02:41,451 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 23:02:41,451 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-02 23:02:41,452 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309725898] [2021-11-02 23:02:41,453 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-02 23:02:41,453 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:02:41,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-02 23:02:41,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-02 23:02:41,456 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 132 [2021-11-02 23:02:41,458 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 124 transitions, 260 flow. Second operand has 6 states, 6 states have (on average 121.16666666666667) internal successors, (727), 6 states have internal predecessors, (727), 0 states have call successors, (0), 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-11-02 23:02:41,458 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-02 23:02:41,458 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 132 [2021-11-02 23:02:41,458 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-02 23:02:41,648 INFO L129 PetriNetUnfolder]: 4/165 cut-off events. [2021-11-02 23:02:41,648 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-11-02 23:02:41,649 INFO L84 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 165 events. 4/165 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 229 event pairs, 0 based on Foata normal form. 0/163 useless extension candidates. Maximal degree in co-relation 155. Up to 8 conditions per place. [2021-11-02 23:02:41,650 INFO L132 encePairwiseOnDemand]: 126/132 looper letters, 6 selfloop transitions, 2 changer transitions 25/136 dead transitions. [2021-11-02 23:02:41,650 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 136 transitions, 326 flow [2021-11-02 23:02:41,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-02 23:02:41,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-11-02 23:02:41,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1103 transitions. [2021-11-02 23:02:41,659 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9284511784511784 [2021-11-02 23:02:41,659 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1103 transitions. [2021-11-02 23:02:41,659 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1103 transitions. [2021-11-02 23:02:41,660 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-02 23:02:41,660 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1103 transitions. [2021-11-02 23:02:41,664 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 122.55555555555556) internal successors, (1103), 9 states have internal predecessors, (1103), 0 states have call successors, (0), 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-11-02 23:02:41,671 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 132.0) internal successors, (1320), 10 states have internal predecessors, (1320), 0 states have call successors, (0), 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-11-02 23:02:41,672 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 132.0) internal successors, (1320), 10 states have internal predecessors, (1320), 0 states have call successors, (0), 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-11-02 23:02:41,672 INFO L186 Difference]: Start difference. First operand has 135 places, 124 transitions, 260 flow. Second operand 9 states and 1103 transitions. [2021-11-02 23:02:41,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 136 transitions, 326 flow [2021-11-02 23:02:41,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 136 transitions, 322 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-11-02 23:02:41,680 INFO L242 Difference]: Finished difference. Result has 148 places, 111 transitions, 250 flow [2021-11-02 23:02:41,680 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=250, PETRI_PLACES=148, PETRI_TRANSITIONS=111} [2021-11-02 23:02:41,681 INFO L334 CegarLoopForPetriNet]: 139 programPoint places, 9 predicate places. [2021-11-02 23:02:41,681 INFO L470 AbstractCegarLoop]: Abstraction has has 148 places, 111 transitions, 250 flow [2021-11-02 23:02:41,682 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 121.16666666666667) internal successors, (727), 6 states have internal predecessors, (727), 0 states have call successors, (0), 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-11-02 23:02:41,682 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-02 23:02:41,682 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 23:02:41,682 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-02 23:02:41,683 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-02 23:02:41,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:02:41,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1647923150, now seen corresponding path program 1 times [2021-11-02 23:02:41,684 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:02:41,684 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856600697] [2021-11-02 23:02:41,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:02:41,685 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:02:41,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:02:42,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 23:02:42,068 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:02:42,068 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856600697] [2021-11-02 23:02:42,068 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856600697] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 23:02:42,069 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 23:02:42,069 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-02 23:02:42,069 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994925428] [2021-11-02 23:02:42,070 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-02 23:02:42,070 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:02:42,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-02 23:02:42,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-11-02 23:02:42,073 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 132 [2021-11-02 23:02:42,075 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 111 transitions, 250 flow. Second operand has 10 states, 10 states have (on average 111.1) internal successors, (1111), 10 states have internal predecessors, (1111), 0 states have call successors, (0), 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-11-02 23:02:42,075 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-02 23:02:42,075 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 132 [2021-11-02 23:02:42,075 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-02 23:02:42,996 INFO L129 PetriNetUnfolder]: 815/1766 cut-off events. [2021-11-02 23:02:42,996 INFO L130 PetriNetUnfolder]: For 382/382 co-relation queries the response was YES. [2021-11-02 23:02:43,004 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3376 conditions, 1766 events. 815/1766 cut-off events. For 382/382 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 12018 event pairs, 395 based on Foata normal form. 36/1763 useless extension candidates. Maximal degree in co-relation 3312. Up to 752 conditions per place. [2021-11-02 23:02:43,016 INFO L132 encePairwiseOnDemand]: 119/132 looper letters, 15 selfloop transitions, 12 changer transitions 53/174 dead transitions. [2021-11-02 23:02:43,017 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 174 transitions, 564 flow [2021-11-02 23:02:43,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-02 23:02:43,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2021-11-02 23:02:43,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1733 transitions. [2021-11-02 23:02:43,024 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8752525252525253 [2021-11-02 23:02:43,024 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1733 transitions. [2021-11-02 23:02:43,024 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1733 transitions. [2021-11-02 23:02:43,026 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-02 23:02:43,026 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1733 transitions. [2021-11-02 23:02:43,032 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 115.53333333333333) internal successors, (1733), 15 states have internal predecessors, (1733), 0 states have call successors, (0), 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-11-02 23:02:43,038 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 132.0) internal successors, (2112), 16 states have internal predecessors, (2112), 0 states have call successors, (0), 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-11-02 23:02:43,041 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 132.0) internal successors, (2112), 16 states have internal predecessors, (2112), 0 states have call successors, (0), 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-11-02 23:02:43,041 INFO L186 Difference]: Start difference. First operand has 148 places, 111 transitions, 250 flow. Second operand 15 states and 1733 transitions. [2021-11-02 23:02:43,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 174 transitions, 564 flow [2021-11-02 23:02:43,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 174 transitions, 524 flow, removed 18 selfloop flow, removed 8 redundant places. [2021-11-02 23:02:43,066 INFO L242 Difference]: Finished difference. Result has 146 places, 119 transitions, 330 flow [2021-11-02 23:02:43,066 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=330, PETRI_PLACES=146, PETRI_TRANSITIONS=119} [2021-11-02 23:02:43,066 INFO L334 CegarLoopForPetriNet]: 139 programPoint places, 7 predicate places. [2021-11-02 23:02:43,067 INFO L470 AbstractCegarLoop]: Abstraction has has 146 places, 119 transitions, 330 flow [2021-11-02 23:02:43,067 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 111.1) internal successors, (1111), 10 states have internal predecessors, (1111), 0 states have call successors, (0), 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-11-02 23:02:43,068 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-02 23:02:43,068 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 23:02:43,068 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-02 23:02:43,069 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-02 23:02:43,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:02:43,069 INFO L85 PathProgramCache]: Analyzing trace with hash -344978577, now seen corresponding path program 1 times [2021-11-02 23:02:43,069 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:02:43,070 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650617846] [2021-11-02 23:02:43,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:02:43,070 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:02:43,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:02:43,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 23:02:43,606 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:02:43,606 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650617846] [2021-11-02 23:02:43,606 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650617846] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 23:02:43,606 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 23:02:43,607 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-02 23:02:43,607 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069788718] [2021-11-02 23:02:43,608 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-02 23:02:43,609 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:02:43,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-02 23:02:43,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2021-11-02 23:02:43,617 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 132 [2021-11-02 23:02:43,622 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 119 transitions, 330 flow. Second operand has 14 states, 14 states have (on average 108.07142857142857) internal successors, (1513), 14 states have internal predecessors, (1513), 0 states have call successors, (0), 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-11-02 23:02:43,622 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-02 23:02:43,622 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 132 [2021-11-02 23:02:43,622 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-02 23:02:44,380 INFO L129 PetriNetUnfolder]: 599/1277 cut-off events. [2021-11-02 23:02:44,380 INFO L130 PetriNetUnfolder]: For 2506/2626 co-relation queries the response was YES. [2021-11-02 23:02:44,387 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3848 conditions, 1277 events. 599/1277 cut-off events. For 2506/2626 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 7840 event pairs, 369 based on Foata normal form. 32/1270 useless extension candidates. Maximal degree in co-relation 3772. Up to 704 conditions per place. [2021-11-02 23:02:44,399 INFO L132 encePairwiseOnDemand]: 117/132 looper letters, 17 selfloop transitions, 19 changer transitions 44/171 dead transitions. [2021-11-02 23:02:44,399 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 171 transitions, 798 flow [2021-11-02 23:02:44,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-02 23:02:44,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2021-11-02 23:02:44,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2003 transitions. [2021-11-02 23:02:44,410 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.843013468013468 [2021-11-02 23:02:44,410 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 2003 transitions. [2021-11-02 23:02:44,410 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 2003 transitions. [2021-11-02 23:02:44,412 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-02 23:02:44,412 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 2003 transitions. [2021-11-02 23:02:44,418 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 111.27777777777777) internal successors, (2003), 18 states have internal predecessors, (2003), 0 states have call successors, (0), 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-11-02 23:02:44,424 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 132.0) internal successors, (2508), 19 states have internal predecessors, (2508), 0 states have call successors, (0), 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-11-02 23:02:44,425 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 132.0) internal successors, (2508), 19 states have internal predecessors, (2508), 0 states have call successors, (0), 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-11-02 23:02:44,425 INFO L186 Difference]: Start difference. First operand has 146 places, 119 transitions, 330 flow. Second operand 18 states and 2003 transitions. [2021-11-02 23:02:44,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 171 transitions, 798 flow [2021-11-02 23:02:44,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 171 transitions, 776 flow, removed 9 selfloop flow, removed 5 redundant places. [2021-11-02 23:02:44,439 INFO L242 Difference]: Finished difference. Result has 160 places, 125 transitions, 453 flow [2021-11-02 23:02:44,440 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=453, PETRI_PLACES=160, PETRI_TRANSITIONS=125} [2021-11-02 23:02:44,440 INFO L334 CegarLoopForPetriNet]: 139 programPoint places, 21 predicate places. [2021-11-02 23:02:44,440 INFO L470 AbstractCegarLoop]: Abstraction has has 160 places, 125 transitions, 453 flow [2021-11-02 23:02:44,441 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 108.07142857142857) internal successors, (1513), 14 states have internal predecessors, (1513), 0 states have call successors, (0), 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-11-02 23:02:44,441 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-02 23:02:44,442 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 23:02:44,442 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-02 23:02:44,442 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-02 23:02:44,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:02:44,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1608841156, now seen corresponding path program 1 times [2021-11-02 23:02:44,443 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:02:44,443 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126313474] [2021-11-02 23:02:44,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:02:44,443 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:02:44,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:02:44,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 23:02:44,707 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:02:44,708 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126313474] [2021-11-02 23:02:44,708 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126313474] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 23:02:44,708 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 23:02:44,709 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-02 23:02:44,709 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683805247] [2021-11-02 23:02:44,710 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-02 23:02:44,710 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:02:44,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-02 23:02:44,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-11-02 23:02:44,712 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 132 [2021-11-02 23:02:44,714 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 125 transitions, 453 flow. Second operand has 9 states, 9 states have (on average 112.22222222222223) internal successors, (1010), 9 states have internal predecessors, (1010), 0 states have call successors, (0), 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-11-02 23:02:44,714 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-02 23:02:44,714 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 132 [2021-11-02 23:02:44,715 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-02 23:02:45,654 INFO L129 PetriNetUnfolder]: 739/1685 cut-off events. [2021-11-02 23:02:45,654 INFO L130 PetriNetUnfolder]: For 10048/10257 co-relation queries the response was YES. [2021-11-02 23:02:45,667 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6346 conditions, 1685 events. 739/1685 cut-off events. For 10048/10257 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 11510 event pairs, 68 based on Foata normal form. 44/1694 useless extension candidates. Maximal degree in co-relation 6259. Up to 555 conditions per place. [2021-11-02 23:02:45,683 INFO L132 encePairwiseOnDemand]: 120/132 looper letters, 36 selfloop transitions, 13 changer transitions 46/190 dead transitions. [2021-11-02 23:02:45,684 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 190 transitions, 1143 flow [2021-11-02 23:02:45,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-02 23:02:45,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-11-02 23:02:45,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1638 transitions. [2021-11-02 23:02:45,690 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8863636363636364 [2021-11-02 23:02:45,690 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1638 transitions. [2021-11-02 23:02:45,690 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1638 transitions. [2021-11-02 23:02:45,695 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-02 23:02:45,695 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1638 transitions. [2021-11-02 23:02:45,700 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 117.0) internal successors, (1638), 14 states have internal predecessors, (1638), 0 states have call successors, (0), 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-11-02 23:02:45,706 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 132.0) internal successors, (1980), 15 states have internal predecessors, (1980), 0 states have call successors, (0), 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-11-02 23:02:45,708 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 132.0) internal successors, (1980), 15 states have internal predecessors, (1980), 0 states have call successors, (0), 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-11-02 23:02:45,708 INFO L186 Difference]: Start difference. First operand has 160 places, 125 transitions, 453 flow. Second operand 14 states and 1638 transitions. [2021-11-02 23:02:45,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 190 transitions, 1143 flow [2021-11-02 23:02:45,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 190 transitions, 937 flow, removed 98 selfloop flow, removed 14 redundant places. [2021-11-02 23:02:45,729 INFO L242 Difference]: Finished difference. Result has 161 places, 131 transitions, 520 flow [2021-11-02 23:02:45,729 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=397, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=520, PETRI_PLACES=161, PETRI_TRANSITIONS=131} [2021-11-02 23:02:45,729 INFO L334 CegarLoopForPetriNet]: 139 programPoint places, 22 predicate places. [2021-11-02 23:02:45,730 INFO L470 AbstractCegarLoop]: Abstraction has has 161 places, 131 transitions, 520 flow [2021-11-02 23:02:45,730 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 112.22222222222223) internal successors, (1010), 9 states have internal predecessors, (1010), 0 states have call successors, (0), 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-11-02 23:02:45,730 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-02 23:02:45,730 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 23:02:45,731 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-02 23:02:45,731 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-02 23:02:45,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:02:45,731 INFO L85 PathProgramCache]: Analyzing trace with hash -296479472, now seen corresponding path program 2 times [2021-11-02 23:02:45,731 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:02:45,732 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986331680] [2021-11-02 23:02:45,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:02:45,732 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:02:45,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:02:45,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 23:02:45,941 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:02:45,942 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986331680] [2021-11-02 23:02:45,942 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986331680] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 23:02:45,942 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 23:02:45,942 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-02 23:02:45,942 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451748698] [2021-11-02 23:02:45,943 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-02 23:02:45,943 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:02:45,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-02 23:02:45,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-11-02 23:02:45,945 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 132 [2021-11-02 23:02:45,946 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 131 transitions, 520 flow. Second operand has 10 states, 10 states have (on average 111.2) internal successors, (1112), 10 states have internal predecessors, (1112), 0 states have call successors, (0), 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-11-02 23:02:45,946 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-02 23:02:45,947 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 132 [2021-11-02 23:02:45,947 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-02 23:02:46,999 INFO L129 PetriNetUnfolder]: 853/1768 cut-off events. [2021-11-02 23:02:47,000 INFO L130 PetriNetUnfolder]: For 11354/13104 co-relation queries the response was YES. [2021-11-02 23:02:47,013 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8804 conditions, 1768 events. 853/1768 cut-off events. For 11354/13104 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 11303 event pairs, 205 based on Foata normal form. 71/1800 useless extension candidates. Maximal degree in co-relation 8716. Up to 701 conditions per place. [2021-11-02 23:02:47,034 INFO L132 encePairwiseOnDemand]: 119/132 looper letters, 39 selfloop transitions, 24 changer transitions 62/219 dead transitions. [2021-11-02 23:02:47,034 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 219 transitions, 1747 flow [2021-11-02 23:02:47,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-02 23:02:47,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2021-11-02 23:02:47,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2201 transitions. [2021-11-02 23:02:47,042 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8775917065390749 [2021-11-02 23:02:47,042 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 2201 transitions. [2021-11-02 23:02:47,042 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 2201 transitions. [2021-11-02 23:02:47,044 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-02 23:02:47,044 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 2201 transitions. [2021-11-02 23:02:47,050 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 115.84210526315789) internal successors, (2201), 19 states have internal predecessors, (2201), 0 states have call successors, (0), 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-11-02 23:02:47,057 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 132.0) internal successors, (2640), 20 states have internal predecessors, (2640), 0 states have call successors, (0), 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-11-02 23:02:47,059 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 132.0) internal successors, (2640), 20 states have internal predecessors, (2640), 0 states have call successors, (0), 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-11-02 23:02:47,059 INFO L186 Difference]: Start difference. First operand has 161 places, 131 transitions, 520 flow. Second operand 19 states and 2201 transitions. [2021-11-02 23:02:47,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 219 transitions, 1747 flow [2021-11-02 23:02:47,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 219 transitions, 1645 flow, removed 44 selfloop flow, removed 8 redundant places. [2021-11-02 23:02:47,080 INFO L242 Difference]: Finished difference. Result has 176 places, 139 transitions, 741 flow [2021-11-02 23:02:47,080 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=493, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=741, PETRI_PLACES=176, PETRI_TRANSITIONS=139} [2021-11-02 23:02:47,081 INFO L334 CegarLoopForPetriNet]: 139 programPoint places, 37 predicate places. [2021-11-02 23:02:47,081 INFO L470 AbstractCegarLoop]: Abstraction has has 176 places, 139 transitions, 741 flow [2021-11-02 23:02:47,082 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 111.2) internal successors, (1112), 10 states have internal predecessors, (1112), 0 states have call successors, (0), 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-11-02 23:02:47,082 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-02 23:02:47,082 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 23:02:47,082 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-02 23:02:47,082 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-02 23:02:47,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:02:47,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1441834384, now seen corresponding path program 1 times [2021-11-02 23:02:47,083 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:02:47,083 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730007461] [2021-11-02 23:02:47,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:02:47,084 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:02:47,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:02:47,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 23:02:47,319 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:02:47,319 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730007461] [2021-11-02 23:02:47,319 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730007461] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 23:02:47,319 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 23:02:47,319 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-02 23:02:47,320 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221505030] [2021-11-02 23:02:47,320 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-02 23:02:47,320 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:02:47,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-02 23:02:47,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-11-02 23:02:47,327 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 132 [2021-11-02 23:02:47,329 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 139 transitions, 741 flow. Second operand has 11 states, 11 states have (on average 110.27272727272727) internal successors, (1213), 11 states have internal predecessors, (1213), 0 states have call successors, (0), 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-11-02 23:02:47,329 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-02 23:02:47,329 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 132 [2021-11-02 23:02:47,330 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-02 23:02:48,123 INFO L129 PetriNetUnfolder]: 665/1398 cut-off events. [2021-11-02 23:02:48,124 INFO L130 PetriNetUnfolder]: For 29828/33007 co-relation queries the response was YES. [2021-11-02 23:02:48,138 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10518 conditions, 1398 events. 665/1398 cut-off events. For 29828/33007 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 8472 event pairs, 206 based on Foata normal form. 50/1408 useless extension candidates. Maximal degree in co-relation 10419. Up to 673 conditions per place. [2021-11-02 23:02:48,171 INFO L132 encePairwiseOnDemand]: 119/132 looper letters, 44 selfloop transitions, 19 changer transitions 25/181 dead transitions. [2021-11-02 23:02:48,171 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 181 transitions, 1731 flow [2021-11-02 23:02:48,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-02 23:02:48,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-11-02 23:02:48,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1481 transitions. [2021-11-02 23:02:48,177 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8630536130536131 [2021-11-02 23:02:48,177 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1481 transitions. [2021-11-02 23:02:48,177 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1481 transitions. [2021-11-02 23:02:48,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-02 23:02:48,179 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1481 transitions. [2021-11-02 23:02:48,183 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 113.92307692307692) internal successors, (1481), 13 states have internal predecessors, (1481), 0 states have call successors, (0), 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-11-02 23:02:48,188 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 132.0) internal successors, (1848), 14 states have internal predecessors, (1848), 0 states have call successors, (0), 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-11-02 23:02:48,189 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 132.0) internal successors, (1848), 14 states have internal predecessors, (1848), 0 states have call successors, (0), 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-11-02 23:02:48,189 INFO L186 Difference]: Start difference. First operand has 176 places, 139 transitions, 741 flow. Second operand 13 states and 1481 transitions. [2021-11-02 23:02:48,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 181 transitions, 1731 flow [2021-11-02 23:02:48,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 181 transitions, 1494 flow, removed 109 selfloop flow, removed 12 redundant places. [2021-11-02 23:02:48,223 INFO L242 Difference]: Finished difference. Result has 171 places, 143 transitions, 802 flow [2021-11-02 23:02:48,223 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=670, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=802, PETRI_PLACES=171, PETRI_TRANSITIONS=143} [2021-11-02 23:02:48,223 INFO L334 CegarLoopForPetriNet]: 139 programPoint places, 32 predicate places. [2021-11-02 23:02:48,224 INFO L470 AbstractCegarLoop]: Abstraction has has 171 places, 143 transitions, 802 flow [2021-11-02 23:02:48,224 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 110.27272727272727) internal successors, (1213), 11 states have internal predecessors, (1213), 0 states have call successors, (0), 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-11-02 23:02:48,225 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-02 23:02:48,225 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 23:02:48,225 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-02 23:02:48,225 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-02 23:02:48,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:02:48,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1415377332, now seen corresponding path program 2 times [2021-11-02 23:02:48,226 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:02:48,226 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981943857] [2021-11-02 23:02:48,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:02:48,227 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:02:48,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:02:48,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 23:02:48,535 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:02:48,536 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981943857] [2021-11-02 23:02:48,536 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981943857] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 23:02:48,536 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 23:02:48,536 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-02 23:02:48,536 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019198467] [2021-11-02 23:02:48,537 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-02 23:02:48,537 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:02:48,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-02 23:02:48,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-11-02 23:02:48,540 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 132 [2021-11-02 23:02:48,541 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 143 transitions, 802 flow. Second operand has 11 states, 11 states have (on average 111.18181818181819) internal successors, (1223), 11 states have internal predecessors, (1223), 0 states have call successors, (0), 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-11-02 23:02:48,541 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-02 23:02:48,542 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 132 [2021-11-02 23:02:48,542 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-02 23:02:49,316 INFO L129 PetriNetUnfolder]: 669/1484 cut-off events. [2021-11-02 23:02:49,316 INFO L130 PetriNetUnfolder]: For 23267/26560 co-relation queries the response was YES. [2021-11-02 23:02:49,331 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9888 conditions, 1484 events. 669/1484 cut-off events. For 23267/26560 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 9456 event pairs, 170 based on Foata normal form. 64/1508 useless extension candidates. Maximal degree in co-relation 9790. Up to 671 conditions per place. [2021-11-02 23:02:49,363 INFO L132 encePairwiseOnDemand]: 121/132 looper letters, 44 selfloop transitions, 21 changer transitions 37/196 dead transitions. [2021-11-02 23:02:49,364 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 196 transitions, 1961 flow [2021-11-02 23:02:49,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-02 23:02:49,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2021-11-02 23:02:49,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1726 transitions. [2021-11-02 23:02:49,370 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8717171717171717 [2021-11-02 23:02:49,371 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1726 transitions. [2021-11-02 23:02:49,371 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1726 transitions. [2021-11-02 23:02:49,373 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-02 23:02:49,373 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1726 transitions. [2021-11-02 23:02:49,379 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 115.06666666666666) internal successors, (1726), 15 states have internal predecessors, (1726), 0 states have call successors, (0), 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-11-02 23:02:49,385 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 132.0) internal successors, (2112), 16 states have internal predecessors, (2112), 0 states have call successors, (0), 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-11-02 23:02:49,386 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 132.0) internal successors, (2112), 16 states have internal predecessors, (2112), 0 states have call successors, (0), 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-11-02 23:02:49,386 INFO L186 Difference]: Start difference. First operand has 171 places, 143 transitions, 802 flow. Second operand 15 states and 1726 transitions. [2021-11-02 23:02:49,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 196 transitions, 1961 flow [2021-11-02 23:02:49,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 196 transitions, 1849 flow, removed 36 selfloop flow, removed 11 redundant places. [2021-11-02 23:02:49,425 INFO L242 Difference]: Finished difference. Result has 178 places, 146 transitions, 908 flow [2021-11-02 23:02:49,425 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=752, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=908, PETRI_PLACES=178, PETRI_TRANSITIONS=146} [2021-11-02 23:02:49,425 INFO L334 CegarLoopForPetriNet]: 139 programPoint places, 39 predicate places. [2021-11-02 23:02:49,426 INFO L470 AbstractCegarLoop]: Abstraction has has 178 places, 146 transitions, 908 flow [2021-11-02 23:02:49,426 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 111.18181818181819) internal successors, (1223), 11 states have internal predecessors, (1223), 0 states have call successors, (0), 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-11-02 23:02:49,427 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-02 23:02:49,427 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 23:02:49,427 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-02 23:02:49,427 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-02 23:02:49,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:02:49,428 INFO L85 PathProgramCache]: Analyzing trace with hash -826403599, now seen corresponding path program 1 times [2021-11-02 23:02:49,428 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:02:49,428 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715528389] [2021-11-02 23:02:49,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:02:49,428 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:02:49,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:02:49,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 23:02:49,559 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:02:49,559 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715528389] [2021-11-02 23:02:49,559 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715528389] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 23:02:49,560 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 23:02:49,560 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-02 23:02:49,560 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478273293] [2021-11-02 23:02:49,560 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-02 23:02:49,560 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:02:49,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-02 23:02:49,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-02 23:02:49,562 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 132 [2021-11-02 23:02:49,563 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 146 transitions, 908 flow. Second operand has 6 states, 6 states have (on average 118.16666666666667) internal successors, (709), 6 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 23:02:49,564 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-02 23:02:49,564 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 132 [2021-11-02 23:02:49,564 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-02 23:02:50,764 INFO L129 PetriNetUnfolder]: 1931/4314 cut-off events. [2021-11-02 23:02:50,765 INFO L130 PetriNetUnfolder]: For 47987/49860 co-relation queries the response was YES. [2021-11-02 23:02:50,827 INFO L84 FinitePrefix]: Finished finitePrefix Result has 19307 conditions, 4314 events. 1931/4314 cut-off events. For 47987/49860 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 38846 event pairs, 507 based on Foata normal form. 166/4150 useless extension candidates. Maximal degree in co-relation 19209. Up to 929 conditions per place. [2021-11-02 23:02:50,885 INFO L132 encePairwiseOnDemand]: 122/132 looper letters, 23 selfloop transitions, 19 changer transitions 0/177 dead transitions. [2021-11-02 23:02:50,885 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 177 transitions, 1054 flow [2021-11-02 23:02:50,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-02 23:02:50,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-11-02 23:02:50,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1097 transitions. [2021-11-02 23:02:50,889 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9234006734006734 [2021-11-02 23:02:50,889 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1097 transitions. [2021-11-02 23:02:50,889 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1097 transitions. [2021-11-02 23:02:50,890 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-02 23:02:50,890 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1097 transitions. [2021-11-02 23:02:50,892 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 121.88888888888889) internal successors, (1097), 9 states have internal predecessors, (1097), 0 states have call successors, (0), 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-11-02 23:02:50,895 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 132.0) internal successors, (1320), 10 states have internal predecessors, (1320), 0 states have call successors, (0), 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-11-02 23:02:50,896 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 132.0) internal successors, (1320), 10 states have internal predecessors, (1320), 0 states have call successors, (0), 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-11-02 23:02:50,897 INFO L186 Difference]: Start difference. First operand has 178 places, 146 transitions, 908 flow. Second operand 9 states and 1097 transitions. [2021-11-02 23:02:50,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 177 transitions, 1054 flow [2021-11-02 23:02:50,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 177 transitions, 1000 flow, removed 21 selfloop flow, removed 12 redundant places. [2021-11-02 23:02:50,951 INFO L242 Difference]: Finished difference. Result has 170 places, 163 transitions, 988 flow [2021-11-02 23:02:50,952 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=854, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=988, PETRI_PLACES=170, PETRI_TRANSITIONS=163} [2021-11-02 23:02:50,952 INFO L334 CegarLoopForPetriNet]: 139 programPoint places, 31 predicate places. [2021-11-02 23:02:50,952 INFO L470 AbstractCegarLoop]: Abstraction has has 170 places, 163 transitions, 988 flow [2021-11-02 23:02:50,953 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 118.16666666666667) internal successors, (709), 6 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 23:02:50,953 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-02 23:02:50,953 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 23:02:50,953 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-02 23:02:50,954 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-02 23:02:50,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:02:50,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1850785584, now seen corresponding path program 1 times [2021-11-02 23:02:50,955 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:02:50,955 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612572906] [2021-11-02 23:02:50,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:02:50,955 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:02:51,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:02:51,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 23:02:51,168 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:02:51,169 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612572906] [2021-11-02 23:02:51,169 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612572906] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 23:02:51,169 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 23:02:51,169 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-02 23:02:51,169 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905037247] [2021-11-02 23:02:51,170 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-02 23:02:51,170 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:02:51,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-02 23:02:51,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-02 23:02:51,172 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 132 [2021-11-02 23:02:51,174 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 163 transitions, 988 flow. Second operand has 7 states, 7 states have (on average 118.14285714285714) internal successors, (827), 7 states have internal predecessors, (827), 0 states have call successors, (0), 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-11-02 23:02:51,174 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-02 23:02:51,174 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 132 [2021-11-02 23:02:51,174 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-02 23:02:52,200 INFO L129 PetriNetUnfolder]: 1362/3451 cut-off events. [2021-11-02 23:02:52,200 INFO L130 PetriNetUnfolder]: For 19437/24973 co-relation queries the response was YES. [2021-11-02 23:02:52,252 INFO L84 FinitePrefix]: Finished finitePrefix Result has 14094 conditions, 3451 events. 1362/3451 cut-off events. For 19437/24973 co-relation queries the response was YES. Maximal size of possible extension queue 372. Compared 31870 event pairs, 124 based on Foata normal form. 466/3638 useless extension candidates. Maximal degree in co-relation 14000. Up to 1142 conditions per place. [2021-11-02 23:02:52,285 INFO L132 encePairwiseOnDemand]: 122/132 looper letters, 25 selfloop transitions, 37 changer transitions 0/195 dead transitions. [2021-11-02 23:02:52,285 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 195 transitions, 1309 flow [2021-11-02 23:02:52,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-02 23:02:52,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-11-02 23:02:52,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1464 transitions. [2021-11-02 23:02:52,288 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9242424242424242 [2021-11-02 23:02:52,288 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1464 transitions. [2021-11-02 23:02:52,289 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1464 transitions. [2021-11-02 23:02:52,289 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-02 23:02:52,290 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1464 transitions. [2021-11-02 23:02:52,293 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 122.0) internal successors, (1464), 12 states have internal predecessors, (1464), 0 states have call successors, (0), 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-11-02 23:02:52,296 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 132.0) internal successors, (1716), 13 states have internal predecessors, (1716), 0 states have call successors, (0), 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-11-02 23:02:52,297 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 132.0) internal successors, (1716), 13 states have internal predecessors, (1716), 0 states have call successors, (0), 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-11-02 23:02:52,298 INFO L186 Difference]: Start difference. First operand has 170 places, 163 transitions, 988 flow. Second operand 12 states and 1464 transitions. [2021-11-02 23:02:52,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 195 transitions, 1309 flow [2021-11-02 23:02:52,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 195 transitions, 1307 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-11-02 23:02:52,331 INFO L242 Difference]: Finished difference. Result has 185 places, 180 transitions, 1234 flow [2021-11-02 23:02:52,332 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=954, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1234, PETRI_PLACES=185, PETRI_TRANSITIONS=180} [2021-11-02 23:02:52,332 INFO L334 CegarLoopForPetriNet]: 139 programPoint places, 46 predicate places. [2021-11-02 23:02:52,332 INFO L470 AbstractCegarLoop]: Abstraction has has 185 places, 180 transitions, 1234 flow [2021-11-02 23:02:52,333 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 118.14285714285714) internal successors, (827), 7 states have internal predecessors, (827), 0 states have call successors, (0), 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-11-02 23:02:52,333 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-02 23:02:52,334 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 23:02:52,334 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-02 23:02:52,334 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-02 23:02:52,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:02:52,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1202270667, now seen corresponding path program 1 times [2021-11-02 23:02:52,335 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:02:52,335 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955381600] [2021-11-02 23:02:52,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:02:52,336 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:02:52,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:02:52,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 23:02:52,465 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:02:52,465 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955381600] [2021-11-02 23:02:52,466 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955381600] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 23:02:52,466 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 23:02:52,466 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-02 23:02:52,466 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891249126] [2021-11-02 23:02:52,467 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-02 23:02:52,467 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:02:52,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-02 23:02:52,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-02 23:02:52,469 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 132 [2021-11-02 23:02:52,470 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 180 transitions, 1234 flow. Second operand has 7 states, 7 states have (on average 119.42857142857143) internal successors, (836), 7 states have internal predecessors, (836), 0 states have call successors, (0), 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-11-02 23:02:52,470 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-02 23:02:52,470 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 132 [2021-11-02 23:02:52,470 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-02 23:02:53,857 INFO L129 PetriNetUnfolder]: 1847/5821 cut-off events. [2021-11-02 23:02:53,857 INFO L130 PetriNetUnfolder]: For 42633/47477 co-relation queries the response was YES. [2021-11-02 23:02:53,933 INFO L84 FinitePrefix]: Finished finitePrefix Result has 26055 conditions, 5821 events. 1847/5821 cut-off events. For 42633/47477 co-relation queries the response was YES. Maximal size of possible extension queue 574. Compared 64537 event pairs, 270 based on Foata normal form. 162/5618 useless extension candidates. Maximal degree in co-relation 25953. Up to 1561 conditions per place. [2021-11-02 23:02:53,987 INFO L132 encePairwiseOnDemand]: 126/132 looper letters, 19 selfloop transitions, 5 changer transitions 0/194 dead transitions. [2021-11-02 23:02:53,988 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 194 transitions, 1410 flow [2021-11-02 23:02:53,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-02 23:02:53,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-11-02 23:02:53,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 851 transitions. [2021-11-02 23:02:53,990 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.920995670995671 [2021-11-02 23:02:53,990 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 851 transitions. [2021-11-02 23:02:53,991 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 851 transitions. [2021-11-02 23:02:53,994 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-02 23:02:53,995 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 851 transitions. [2021-11-02 23:02:53,997 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 121.57142857142857) internal successors, (851), 7 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-11-02 23:02:53,999 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 132.0) internal successors, (1056), 8 states have internal predecessors, (1056), 0 states have call successors, (0), 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-11-02 23:02:53,999 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 132.0) internal successors, (1056), 8 states have internal predecessors, (1056), 0 states have call successors, (0), 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-11-02 23:02:54,000 INFO L186 Difference]: Start difference. First operand has 185 places, 180 transitions, 1234 flow. Second operand 7 states and 851 transitions. [2021-11-02 23:02:54,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 194 transitions, 1410 flow [2021-11-02 23:02:54,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 194 transitions, 1315 flow, removed 38 selfloop flow, removed 4 redundant places. [2021-11-02 23:02:54,487 INFO L242 Difference]: Finished difference. Result has 192 places, 184 transitions, 1210 flow [2021-11-02 23:02:54,487 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=1139, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1210, PETRI_PLACES=192, PETRI_TRANSITIONS=184} [2021-11-02 23:02:54,488 INFO L334 CegarLoopForPetriNet]: 139 programPoint places, 53 predicate places. [2021-11-02 23:02:54,488 INFO L470 AbstractCegarLoop]: Abstraction has has 192 places, 184 transitions, 1210 flow [2021-11-02 23:02:54,488 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 119.42857142857143) internal successors, (836), 7 states have internal predecessors, (836), 0 states have call successors, (0), 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-11-02 23:02:54,488 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-02 23:02:54,489 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 23:02:54,489 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-02 23:02:54,489 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-02 23:02:54,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:02:54,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1986460389, now seen corresponding path program 2 times [2021-11-02 23:02:54,490 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:02:54,490 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357621149] [2021-11-02 23:02:54,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:02:54,490 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:02:54,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:02:55,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 23:02:55,017 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:02:55,017 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357621149] [2021-11-02 23:02:55,017 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357621149] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 23:02:55,017 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 23:02:55,017 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-11-02 23:02:55,018 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129340406] [2021-11-02 23:02:55,018 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-02 23:02:55,018 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:02:55,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-02 23:02:55,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2021-11-02 23:02:55,021 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 132 [2021-11-02 23:02:55,024 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 184 transitions, 1210 flow. Second operand has 17 states, 17 states have (on average 106.11764705882354) internal successors, (1804), 17 states have internal predecessors, (1804), 0 states have call successors, (0), 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-11-02 23:02:55,024 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-02 23:02:55,024 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 132 [2021-11-02 23:02:55,024 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-02 23:02:56,977 INFO L129 PetriNetUnfolder]: 2039/6075 cut-off events. [2021-11-02 23:02:56,977 INFO L130 PetriNetUnfolder]: For 52220/56895 co-relation queries the response was YES. [2021-11-02 23:02:57,115 INFO L84 FinitePrefix]: Finished finitePrefix Result has 27482 conditions, 6075 events. 2039/6075 cut-off events. For 52220/56895 co-relation queries the response was YES. Maximal size of possible extension queue 577. Compared 66582 event pairs, 371 based on Foata normal form. 146/5855 useless extension candidates. Maximal degree in co-relation 27369. Up to 1225 conditions per place. [2021-11-02 23:02:57,160 INFO L132 encePairwiseOnDemand]: 118/132 looper letters, 77 selfloop transitions, 32 changer transitions 6/241 dead transitions. [2021-11-02 23:02:57,160 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 241 transitions, 2444 flow [2021-11-02 23:02:57,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-02 23:02:57,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2021-11-02 23:02:57,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1858 transitions. [2021-11-02 23:02:57,172 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8279857397504456 [2021-11-02 23:02:57,173 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1858 transitions. [2021-11-02 23:02:57,173 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1858 transitions. [2021-11-02 23:02:57,176 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-02 23:02:57,176 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1858 transitions. [2021-11-02 23:02:57,183 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 109.29411764705883) internal successors, (1858), 17 states have internal predecessors, (1858), 0 states have call successors, (0), 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-11-02 23:02:57,187 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 132.0) internal successors, (2376), 18 states have internal predecessors, (2376), 0 states have call successors, (0), 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-11-02 23:02:57,188 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 132.0) internal successors, (2376), 18 states have internal predecessors, (2376), 0 states have call successors, (0), 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-11-02 23:02:57,188 INFO L186 Difference]: Start difference. First operand has 192 places, 184 transitions, 1210 flow. Second operand 17 states and 1858 transitions. [2021-11-02 23:02:57,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 241 transitions, 2444 flow [2021-11-02 23:02:57,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 241 transitions, 2437 flow, removed 3 selfloop flow, removed 1 redundant places. [2021-11-02 23:02:57,410 INFO L242 Difference]: Finished difference. Result has 214 places, 198 transitions, 1533 flow [2021-11-02 23:02:57,411 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=1207, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1533, PETRI_PLACES=214, PETRI_TRANSITIONS=198} [2021-11-02 23:02:57,411 INFO L334 CegarLoopForPetriNet]: 139 programPoint places, 75 predicate places. [2021-11-02 23:02:57,411 INFO L470 AbstractCegarLoop]: Abstraction has has 214 places, 198 transitions, 1533 flow [2021-11-02 23:02:57,412 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 106.11764705882354) internal successors, (1804), 17 states have internal predecessors, (1804), 0 states have call successors, (0), 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-11-02 23:02:57,412 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-02 23:02:57,412 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 23:02:57,413 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-02 23:02:57,413 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-02 23:02:57,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:02:57,414 INFO L85 PathProgramCache]: Analyzing trace with hash -152300736, now seen corresponding path program 1 times [2021-11-02 23:02:57,414 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:02:57,414 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942907634] [2021-11-02 23:02:57,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:02:57,414 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:02:57,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:02:57,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 23:02:57,543 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:02:57,543 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942907634] [2021-11-02 23:02:57,544 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942907634] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 23:02:57,544 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 23:02:57,544 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-02 23:02:57,544 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978801143] [2021-11-02 23:02:57,544 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-02 23:02:57,545 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:02:57,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-02 23:02:57,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-02 23:02:57,547 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 132 [2021-11-02 23:02:57,548 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 198 transitions, 1533 flow. Second operand has 8 states, 8 states have (on average 118.125) internal successors, (945), 8 states have internal predecessors, (945), 0 states have call successors, (0), 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-11-02 23:02:57,548 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-02 23:02:57,548 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 132 [2021-11-02 23:02:57,549 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-02 23:02:58,919 INFO L129 PetriNetUnfolder]: 2153/5968 cut-off events. [2021-11-02 23:02:58,919 INFO L130 PetriNetUnfolder]: For 34069/43742 co-relation queries the response was YES. [2021-11-02 23:02:58,985 INFO L84 FinitePrefix]: Finished finitePrefix Result has 24333 conditions, 5968 events. 2153/5968 cut-off events. For 34069/43742 co-relation queries the response was YES. Maximal size of possible extension queue 735. Compared 64712 event pairs, 46 based on Foata normal form. 1376/6894 useless extension candidates. Maximal degree in co-relation 24213. Up to 1562 conditions per place. [2021-11-02 23:02:59,146 INFO L132 encePairwiseOnDemand]: 122/132 looper letters, 19 selfloop transitions, 57 changer transitions 24/230 dead transitions. [2021-11-02 23:02:59,147 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 230 transitions, 2015 flow [2021-11-02 23:02:59,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-02 23:02:59,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2021-11-02 23:02:59,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1831 transitions. [2021-11-02 23:02:59,150 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9247474747474748 [2021-11-02 23:02:59,151 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1831 transitions. [2021-11-02 23:02:59,151 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1831 transitions. [2021-11-02 23:02:59,152 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-02 23:02:59,152 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1831 transitions. [2021-11-02 23:02:59,168 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 122.06666666666666) internal successors, (1831), 15 states have internal predecessors, (1831), 0 states have call successors, (0), 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-11-02 23:02:59,177 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 132.0) internal successors, (2112), 16 states have internal predecessors, (2112), 0 states have call successors, (0), 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-11-02 23:02:59,178 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 132.0) internal successors, (2112), 16 states have internal predecessors, (2112), 0 states have call successors, (0), 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-11-02 23:02:59,178 INFO L186 Difference]: Start difference. First operand has 214 places, 198 transitions, 1533 flow. Second operand 15 states and 1831 transitions. [2021-11-02 23:02:59,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 230 transitions, 2015 flow [2021-11-02 23:02:59,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 230 transitions, 1821 flow, removed 79 selfloop flow, removed 10 redundant places. [2021-11-02 23:02:59,406 INFO L242 Difference]: Finished difference. Result has 221 places, 202 transitions, 1487 flow [2021-11-02 23:02:59,407 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=1255, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1487, PETRI_PLACES=221, PETRI_TRANSITIONS=202} [2021-11-02 23:02:59,407 INFO L334 CegarLoopForPetriNet]: 139 programPoint places, 82 predicate places. [2021-11-02 23:02:59,407 INFO L470 AbstractCegarLoop]: Abstraction has has 221 places, 202 transitions, 1487 flow [2021-11-02 23:02:59,408 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 118.125) internal successors, (945), 8 states have internal predecessors, (945), 0 states have call successors, (0), 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-11-02 23:02:59,408 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-02 23:02:59,408 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 23:02:59,408 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-02 23:02:59,408 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-02 23:02:59,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:02:59,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1188231813, now seen corresponding path program 1 times [2021-11-02 23:02:59,409 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:02:59,409 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677558448] [2021-11-02 23:02:59,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:02:59,410 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:02:59,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:02:59,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 23:02:59,551 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:02:59,552 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677558448] [2021-11-02 23:02:59,552 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677558448] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 23:02:59,552 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 23:02:59,552 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-02 23:02:59,552 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206259548] [2021-11-02 23:02:59,553 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-02 23:02:59,553 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:02:59,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-02 23:02:59,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-11-02 23:02:59,555 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 132 [2021-11-02 23:02:59,556 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 202 transitions, 1487 flow. Second operand has 9 states, 9 states have (on average 118.11111111111111) internal successors, (1063), 9 states have internal predecessors, (1063), 0 states have call successors, (0), 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-11-02 23:02:59,556 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-02 23:02:59,557 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 132 [2021-11-02 23:02:59,557 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-02 23:03:00,761 INFO L129 PetriNetUnfolder]: 2013/5720 cut-off events. [2021-11-02 23:03:00,762 INFO L130 PetriNetUnfolder]: For 32879/40028 co-relation queries the response was YES. [2021-11-02 23:03:00,827 INFO L84 FinitePrefix]: Finished finitePrefix Result has 25241 conditions, 5720 events. 2013/5720 cut-off events. For 32879/40028 co-relation queries the response was YES. Maximal size of possible extension queue 749. Compared 63374 event pairs, 14 based on Foata normal form. 1133/6422 useless extension candidates. Maximal degree in co-relation 25179. Up to 1477 conditions per place. [2021-11-02 23:03:00,844 INFO L132 encePairwiseOnDemand]: 122/132 looper letters, 12 selfloop transitions, 63 changer transitions 21/224 dead transitions. [2021-11-02 23:03:00,844 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 224 transitions, 1892 flow [2021-11-02 23:03:00,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-02 23:03:00,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2021-11-02 23:03:00,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2182 transitions. [2021-11-02 23:03:00,847 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9183501683501684 [2021-11-02 23:03:00,848 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 2182 transitions. [2021-11-02 23:03:00,848 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 2182 transitions. [2021-11-02 23:03:00,849 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-02 23:03:00,849 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 2182 transitions. [2021-11-02 23:03:00,853 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 121.22222222222223) internal successors, (2182), 18 states have internal predecessors, (2182), 0 states have call successors, (0), 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-11-02 23:03:00,857 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 132.0) internal successors, (2508), 19 states have internal predecessors, (2508), 0 states have call successors, (0), 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-11-02 23:03:00,858 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 132.0) internal successors, (2508), 19 states have internal predecessors, (2508), 0 states have call successors, (0), 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-11-02 23:03:00,858 INFO L186 Difference]: Start difference. First operand has 221 places, 202 transitions, 1487 flow. Second operand 18 states and 2182 transitions. [2021-11-02 23:03:00,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 224 transitions, 1892 flow [2021-11-02 23:03:01,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 224 transitions, 1365 flow, removed 202 selfloop flow, removed 31 redundant places. [2021-11-02 23:03:01,897 INFO L242 Difference]: Finished difference. Result has 204 places, 199 transitions, 1180 flow [2021-11-02 23:03:01,898 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=1016, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1180, PETRI_PLACES=204, PETRI_TRANSITIONS=199} [2021-11-02 23:03:01,898 INFO L334 CegarLoopForPetriNet]: 139 programPoint places, 65 predicate places. [2021-11-02 23:03:01,898 INFO L470 AbstractCegarLoop]: Abstraction has has 204 places, 199 transitions, 1180 flow [2021-11-02 23:03:01,899 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 118.11111111111111) internal successors, (1063), 9 states have internal predecessors, (1063), 0 states have call successors, (0), 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-11-02 23:03:01,899 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-02 23:03:01,899 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 23:03:01,899 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-02 23:03:01,900 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-02 23:03:01,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:03:01,900 INFO L85 PathProgramCache]: Analyzing trace with hash -605222311, now seen corresponding path program 1 times [2021-11-02 23:03:01,900 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:03:01,900 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958488314] [2021-11-02 23:03:01,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:03:01,900 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:03:01,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:03:02,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 23:03:02,050 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:03:02,051 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958488314] [2021-11-02 23:03:02,051 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958488314] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 23:03:02,051 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 23:03:02,051 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-02 23:03:02,051 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874729129] [2021-11-02 23:03:02,052 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-02 23:03:02,052 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:03:02,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-02 23:03:02,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-02 23:03:02,054 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 132 [2021-11-02 23:03:02,055 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 199 transitions, 1180 flow. Second operand has 7 states, 7 states have (on average 119.42857142857143) internal successors, (836), 7 states have internal predecessors, (836), 0 states have call successors, (0), 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-11-02 23:03:02,055 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-02 23:03:02,055 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 132 [2021-11-02 23:03:02,055 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-02 23:03:03,843 INFO L129 PetriNetUnfolder]: 2951/9031 cut-off events. [2021-11-02 23:03:03,844 INFO L130 PetriNetUnfolder]: For 22592/24413 co-relation queries the response was YES. [2021-11-02 23:03:03,911 INFO L84 FinitePrefix]: Finished finitePrefix Result has 29299 conditions, 9031 events. 2951/9031 cut-off events. For 22592/24413 co-relation queries the response was YES. Maximal size of possible extension queue 1187. Compared 112799 event pairs, 28 based on Foata normal form. 10/8464 useless extension candidates. Maximal degree in co-relation 29200. Up to 1126 conditions per place. [2021-11-02 23:03:03,925 INFO L132 encePairwiseOnDemand]: 126/132 looper letters, 9 selfloop transitions, 2 changer transitions 4/204 dead transitions. [2021-11-02 23:03:03,925 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 204 transitions, 1222 flow [2021-11-02 23:03:03,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-02 23:03:03,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-11-02 23:03:03,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 842 transitions. [2021-11-02 23:03:03,927 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9112554112554112 [2021-11-02 23:03:03,927 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 842 transitions. [2021-11-02 23:03:03,927 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 842 transitions. [2021-11-02 23:03:03,928 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-02 23:03:03,928 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 842 transitions. [2021-11-02 23:03:03,929 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 120.28571428571429) internal successors, (842), 7 states have internal predecessors, (842), 0 states have call successors, (0), 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-11-02 23:03:03,931 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 132.0) internal successors, (1056), 8 states have internal predecessors, (1056), 0 states have call successors, (0), 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-11-02 23:03:03,931 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 132.0) internal successors, (1056), 8 states have internal predecessors, (1056), 0 states have call successors, (0), 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-11-02 23:03:03,932 INFO L186 Difference]: Start difference. First operand has 204 places, 199 transitions, 1180 flow. Second operand 7 states and 842 transitions. [2021-11-02 23:03:03,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 204 transitions, 1222 flow [2021-11-02 23:03:04,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 204 transitions, 1076 flow, removed 25 selfloop flow, removed 20 redundant places. [2021-11-02 23:03:04,875 INFO L242 Difference]: Finished difference. Result has 193 places, 200 transitions, 1053 flow [2021-11-02 23:03:04,875 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=1034, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1053, PETRI_PLACES=193, PETRI_TRANSITIONS=200} [2021-11-02 23:03:04,875 INFO L334 CegarLoopForPetriNet]: 139 programPoint places, 54 predicate places. [2021-11-02 23:03:04,876 INFO L470 AbstractCegarLoop]: Abstraction has has 193 places, 200 transitions, 1053 flow [2021-11-02 23:03:04,876 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 119.42857142857143) internal successors, (836), 7 states have internal predecessors, (836), 0 states have call successors, (0), 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-11-02 23:03:04,876 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-02 23:03:04,876 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 23:03:04,876 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-02 23:03:04,877 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-02 23:03:04,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:03:04,877 INFO L85 PathProgramCache]: Analyzing trace with hash 500994019, now seen corresponding path program 2 times [2021-11-02 23:03:04,877 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:03:04,877 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096600078] [2021-11-02 23:03:04,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:03:04,878 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:03:04,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:03:05,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 23:03:05,119 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:03:05,119 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096600078] [2021-11-02 23:03:05,119 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096600078] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 23:03:05,119 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 23:03:05,120 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-02 23:03:05,120 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007836879] [2021-11-02 23:03:05,120 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-02 23:03:05,120 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:03:05,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-02 23:03:05,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-11-02 23:03:05,122 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 132 [2021-11-02 23:03:05,124 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 200 transitions, 1053 flow. Second operand has 12 states, 12 states have (on average 107.75) internal successors, (1293), 12 states have internal predecessors, (1293), 0 states have call successors, (0), 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-11-02 23:03:05,124 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-02 23:03:05,124 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 132 [2021-11-02 23:03:05,124 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-02 23:03:07,920 INFO L129 PetriNetUnfolder]: 5873/17565 cut-off events. [2021-11-02 23:03:07,920 INFO L130 PetriNetUnfolder]: For 26759/28759 co-relation queries the response was YES. [2021-11-02 23:03:08,090 INFO L84 FinitePrefix]: Finished finitePrefix Result has 49555 conditions, 17565 events. 5873/17565 cut-off events. For 26759/28759 co-relation queries the response was YES. Maximal size of possible extension queue 2257. Compared 241699 event pairs, 46 based on Foata normal form. 67/16407 useless extension candidates. Maximal degree in co-relation 49517. Up to 2065 conditions per place. [2021-11-02 23:03:08,256 INFO L132 encePairwiseOnDemand]: 119/132 looper letters, 45 selfloop transitions, 17 changer transitions 43/257 dead transitions. [2021-11-02 23:03:08,256 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 257 transitions, 1684 flow [2021-11-02 23:03:08,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-02 23:03:08,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-11-02 23:03:08,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1322 transitions. [2021-11-02 23:03:08,272 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8345959595959596 [2021-11-02 23:03:08,272 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1322 transitions. [2021-11-02 23:03:08,273 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1322 transitions. [2021-11-02 23:03:08,273 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-02 23:03:08,273 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1322 transitions. [2021-11-02 23:03:08,284 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 110.16666666666667) internal successors, (1322), 12 states have internal predecessors, (1322), 0 states have call successors, (0), 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-11-02 23:03:08,288 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 132.0) internal successors, (1716), 13 states have internal predecessors, (1716), 0 states have call successors, (0), 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-11-02 23:03:08,288 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 132.0) internal successors, (1716), 13 states have internal predecessors, (1716), 0 states have call successors, (0), 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-11-02 23:03:08,288 INFO L186 Difference]: Start difference. First operand has 193 places, 200 transitions, 1053 flow. Second operand 12 states and 1322 transitions. [2021-11-02 23:03:08,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 257 transitions, 1684 flow [2021-11-02 23:03:11,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 257 transitions, 1673 flow, removed 5 selfloop flow, removed 4 redundant places. [2021-11-02 23:03:11,858 INFO L242 Difference]: Finished difference. Result has 204 places, 202 transitions, 1123 flow [2021-11-02 23:03:11,859 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=1046, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1123, PETRI_PLACES=204, PETRI_TRANSITIONS=202} [2021-11-02 23:03:11,859 INFO L334 CegarLoopForPetriNet]: 139 programPoint places, 65 predicate places. [2021-11-02 23:03:11,859 INFO L470 AbstractCegarLoop]: Abstraction has has 204 places, 202 transitions, 1123 flow [2021-11-02 23:03:11,859 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 107.75) internal successors, (1293), 12 states have internal predecessors, (1293), 0 states have call successors, (0), 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-11-02 23:03:11,860 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-02 23:03:11,860 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 23:03:11,860 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-02 23:03:11,860 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-02 23:03:11,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:03:11,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1228947155, now seen corresponding path program 3 times [2021-11-02 23:03:11,861 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:03:11,861 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729213983] [2021-11-02 23:03:11,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:03:11,861 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:03:11,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 23:03:12,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 23:03:12,513 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 23:03:12,513 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729213983] [2021-11-02 23:03:12,513 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729213983] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 23:03:12,513 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 23:03:12,513 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-11-02 23:03:12,514 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385510000] [2021-11-02 23:03:12,514 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-02 23:03:12,514 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 23:03:12,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-02 23:03:12,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2021-11-02 23:03:12,517 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 132 [2021-11-02 23:03:12,519 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 202 transitions, 1123 flow. Second operand has 17 states, 17 states have (on average 104.41176470588235) internal successors, (1775), 17 states have internal predecessors, (1775), 0 states have call successors, (0), 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-11-02 23:03:12,519 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-02 23:03:12,519 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 132 [2021-11-02 23:03:12,520 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-02 23:03:14,572 INFO L129 PetriNetUnfolder]: 4265/12777 cut-off events. [2021-11-02 23:03:14,572 INFO L130 PetriNetUnfolder]: For 19517/21170 co-relation queries the response was YES. [2021-11-02 23:03:14,730 INFO L84 FinitePrefix]: Finished finitePrefix Result has 36039 conditions, 12777 events. 4265/12777 cut-off events. For 19517/21170 co-relation queries the response was YES. Maximal size of possible extension queue 1797. Compared 169213 event pairs, 16 based on Foata normal form. 55/11893 useless extension candidates. Maximal degree in co-relation 35997. Up to 1592 conditions per place. [2021-11-02 23:03:14,743 INFO L132 encePairwiseOnDemand]: 118/132 looper letters, 28 selfloop transitions, 9 changer transitions 33/218 dead transitions. [2021-11-02 23:03:14,743 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 218 transitions, 1365 flow [2021-11-02 23:03:14,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-02 23:03:14,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-11-02 23:03:14,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1486 transitions. [2021-11-02 23:03:14,747 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8041125541125541 [2021-11-02 23:03:14,747 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1486 transitions. [2021-11-02 23:03:14,747 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1486 transitions. [2021-11-02 23:03:14,748 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-02 23:03:14,748 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1486 transitions. [2021-11-02 23:03:14,751 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 106.14285714285714) internal successors, (1486), 14 states have internal predecessors, (1486), 0 states have call successors, (0), 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-11-02 23:03:14,755 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 132.0) internal successors, (1980), 15 states have internal predecessors, (1980), 0 states have call successors, (0), 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-11-02 23:03:14,755 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 132.0) internal successors, (1980), 15 states have internal predecessors, (1980), 0 states have call successors, (0), 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-11-02 23:03:14,756 INFO L186 Difference]: Start difference. First operand has 204 places, 202 transitions, 1123 flow. Second operand 14 states and 1486 transitions. [2021-11-02 23:03:14,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 218 transitions, 1365 flow [2021-11-02 23:03:16,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 218 transitions, 1322 flow, removed 7 selfloop flow, removed 9 redundant places. [2021-11-02 23:03:16,563 INFO L242 Difference]: Finished difference. Result has 209 places, 182 transitions, 926 flow [2021-11-02 23:03:16,563 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=1086, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=926, PETRI_PLACES=209, PETRI_TRANSITIONS=182} [2021-11-02 23:03:16,563 INFO L334 CegarLoopForPetriNet]: 139 programPoint places, 70 predicate places. [2021-11-02 23:03:16,563 INFO L470 AbstractCegarLoop]: Abstraction has has 209 places, 182 transitions, 926 flow [2021-11-02 23:03:16,564 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 104.41176470588235) internal successors, (1775), 17 states have internal predecessors, (1775), 0 states have call successors, (0), 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-11-02 23:03:16,564 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-02 23:03:16,732 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 23:03:16,733 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-02 23:03:16,733 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-02 23:03:16,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 23:03:16,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1936979151, now seen corresponding path program 4 times [2021-11-02 23:03:16,733 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 23:03:16,733 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373574534] [2021-11-02 23:03:16,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 23:03:16,734 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 23:03:16,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 23:03:16,828 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 23:03:16,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 23:03:16,995 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 23:03:16,996 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-11-02 23:03:16,997 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-02 23:03:16,999 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-02 23:03:16,999 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION [2021-11-02 23:03:16,999 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION [2021-11-02 23:03:16,999 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION [2021-11-02 23:03:17,000 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATION [2021-11-02 23:03:17,000 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-02 23:03:17,000 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-02 23:03:17,006 INFO L731 BasicCegarLoop]: Path program histogram: [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 23:03:17,012 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-11-02 23:03:17,012 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-02 23:03:17,279 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 11:03:17 BasicIcfg [2021-11-02 23:03:17,280 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-02 23:03:17,280 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-02 23:03:17,280 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-02 23:03:17,281 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-02 23:03:17,281 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 11:02:40" (3/4) ... [2021-11-02 23:03:17,283 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-11-02 23:03:17,487 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4bf7f29f-0880-4519-9619-ec6e14746f34/bin/uautomizer-tBqnrhUYjU/witness.graphml [2021-11-02 23:03:17,487 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-02 23:03:17,489 INFO L168 Benchmark]: Toolchain (without parser) took 40619.12 ms. Allocated memory was 121.6 MB in the beginning and 8.3 GB in the end (delta: 8.1 GB). Free memory was 84.1 MB in the beginning and 7.2 GB in the end (delta: -7.1 GB). Peak memory consumption was 987.2 MB. Max. memory is 16.1 GB. [2021-11-02 23:03:17,489 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 121.6 MB. Free memory was 93.4 MB in the beginning and 93.4 MB in the end (delta: 21.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-02 23:03:17,490 INFO L168 Benchmark]: CACSL2BoogieTranslator took 810.70 ms. Allocated memory is still 121.6 MB. Free memory was 84.1 MB in the beginning and 80.1 MB in the end (delta: 3.9 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-11-02 23:03:17,490 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.97 ms. Allocated memory is still 121.6 MB. Free memory was 80.1 MB in the beginning and 77.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-02 23:03:17,491 INFO L168 Benchmark]: Boogie Preprocessor took 71.41 ms. Allocated memory is still 121.6 MB. Free memory was 77.4 MB in the beginning and 74.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-02 23:03:17,491 INFO L168 Benchmark]: RCFGBuilder took 2213.19 ms. Allocated memory was 121.6 MB in the beginning and 146.8 MB in the end (delta: 25.2 MB). Free memory was 74.6 MB in the beginning and 81.5 MB in the end (delta: -6.9 MB). Peak memory consumption was 49.7 MB. Max. memory is 16.1 GB. [2021-11-02 23:03:17,492 INFO L168 Benchmark]: TraceAbstraction took 37242.86 ms. Allocated memory was 146.8 MB in the beginning and 8.3 GB in the end (delta: 8.1 GB). Free memory was 81.5 MB in the beginning and 7.3 GB in the end (delta: -7.2 GB). Peak memory consumption was 906.4 MB. Max. memory is 16.1 GB. [2021-11-02 23:03:17,492 INFO L168 Benchmark]: Witness Printer took 207.32 ms. Allocated memory is still 8.3 GB. Free memory was 7.3 GB in the beginning and 7.2 GB in the end (delta: 53.5 MB). Peak memory consumption was 54.5 MB. Max. memory is 16.1 GB. [2021-11-02 23:03:17,494 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.26 ms. Allocated memory is still 121.6 MB. Free memory was 93.4 MB in the beginning and 93.4 MB in the end (delta: 21.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 810.70 ms. Allocated memory is still 121.6 MB. Free memory was 84.1 MB in the beginning and 80.1 MB in the end (delta: 3.9 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 65.97 ms. Allocated memory is still 121.6 MB. Free memory was 80.1 MB in the beginning and 77.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 71.41 ms. Allocated memory is still 121.6 MB. Free memory was 77.4 MB in the beginning and 74.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2213.19 ms. Allocated memory was 121.6 MB in the beginning and 146.8 MB in the end (delta: 25.2 MB). Free memory was 74.6 MB in the beginning and 81.5 MB in the end (delta: -6.9 MB). Peak memory consumption was 49.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 37242.86 ms. Allocated memory was 146.8 MB in the beginning and 8.3 GB in the end (delta: 8.1 GB). Free memory was 81.5 MB in the beginning and 7.3 GB in the end (delta: -7.2 GB). Peak memory consumption was 906.4 MB. Max. memory is 16.1 GB. * Witness Printer took 207.32 ms. Allocated memory is still 8.3 GB. Free memory was 7.3 GB in the beginning and 7.2 GB in the end (delta: 53.5 MB). Peak memory consumption was 54.5 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: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L714] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0] [L716] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0] [L718] 0 int __unbuffered_p3_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0] [L720] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0] [L722] 0 int b = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0] [L723] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0] [L724] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0] [L726] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L727] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L728] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L729] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L730] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L731] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L732] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0] [L733] 0 _Bool x$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0] [L734] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0] [L735] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L736] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L737] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0] [L738] 0 _Bool x$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0] [L739] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0] [L740] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L741] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L742] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L743] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L744] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L746] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L748] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L749] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L750] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L858] 0 pthread_t t993; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L859] FCALL, FORK 0 pthread_create(&t993, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L860] 0 pthread_t t994; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L861] FCALL, FORK 0 pthread_create(&t994, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 2 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L784] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L862] 0 pthread_t t995; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L863] FCALL, FORK 0 pthread_create(&t995, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L787] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L804] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L807] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L864] 0 pthread_t t996; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L865] FCALL, FORK 0 pthread_create(&t996, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L824] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L827] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L830] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L833] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L754] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L757] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L760] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L760] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L760] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L760] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L761] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L761] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L762] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L762] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L763] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L763] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L764] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L764] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L810] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L810] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L810] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L810] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L811] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L811] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L812] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L812] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L813] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L813] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L814] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L814] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L790] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L790] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L791] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L791] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L792] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L793] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L793] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L794] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L794] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L817] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L836] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L836] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L836] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L836] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L837] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L837] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L838] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L838] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L839] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L839] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L840] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L840] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L843] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L867] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L871] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L871] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L871] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L871] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L872] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L872] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L873] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L873] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L874] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L874] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L875] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L875] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L878] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L879] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L880] 0 x$flush_delayed = weak$$choice2 [L881] 0 x$mem_tmp = x [L882] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L882] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L883] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L883] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L884] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L884] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L885] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L885] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L886] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L886] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L887] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L887] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L888] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L888] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L889] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L890] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L890] 0 x = x$flush_delayed ? x$mem_tmp : x [L891] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L18] 0 reach_error() VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 859]: 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: 861]: 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: 865]: 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: 863]: 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 9 procedures, 170 locations, 7 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: 36.8s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 31.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 206 SDtfs, 720 SDslu, 850 SDs, 0 SdLazy, 1799 SolverSat, 498 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 283 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 250 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 739 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1533occurred in iteration=12, InterpolantAutomatonStates: 217, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 1630 NumberOfCodeBlocks, 1630 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1510 ConstructedInterpolants, 0 QuantifiedInterpolants, 10465 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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-11-02 23:03:17,548 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4bf7f29f-0880-4519-9619-ec6e14746f34/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE