./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b2eff8ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cda5133-efef-4784-9475-97e2c425e490/bin/uautomizer-UnR33cPsHg/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cda5133-efef-4784-9475-97e2c425e490/bin/uautomizer-UnR33cPsHg/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cda5133-efef-4784-9475-97e2c425e490/bin/uautomizer-UnR33cPsHg/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cda5133-efef-4784-9475-97e2c425e490/bin/uautomizer-UnR33cPsHg/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cda5133-efef-4784-9475-97e2c425e490/bin/uautomizer-UnR33cPsHg/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cda5133-efef-4784-9475-97e2c425e490/bin/uautomizer-UnR33cPsHg --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8e0bd33ffca0122f84e298c52bb9fdae01e72661c94f68aaa49ed0f187d88b87 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-b2eff8b [2021-10-28 08:55:48,729 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-28 08:55:48,732 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-28 08:55:48,797 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-28 08:55:48,798 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-28 08:55:48,800 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-28 08:55:48,802 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-28 08:55:48,805 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-28 08:55:48,809 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-28 08:55:48,810 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-28 08:55:48,812 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-28 08:55:48,814 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-28 08:55:48,815 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-28 08:55:48,817 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-28 08:55:48,819 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-28 08:55:48,834 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-28 08:55:48,839 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-28 08:55:48,841 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-28 08:55:48,845 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-28 08:55:48,850 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-28 08:55:48,857 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-28 08:55:48,859 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-28 08:55:48,863 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-28 08:55:48,865 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-28 08:55:48,873 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-28 08:55:48,879 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-28 08:55:48,879 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-28 08:55:48,881 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-28 08:55:48,883 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-28 08:55:48,885 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-28 08:55:48,885 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-28 08:55:48,887 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-28 08:55:48,890 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-28 08:55:48,891 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-28 08:55:48,893 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-28 08:55:48,894 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-28 08:55:48,895 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-28 08:55:48,895 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-28 08:55:48,896 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-28 08:55:48,897 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-28 08:55:48,898 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-28 08:55:48,899 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cda5133-efef-4784-9475-97e2c425e490/bin/uautomizer-UnR33cPsHg/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-28 08:55:48,961 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-28 08:55:48,961 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-28 08:55:48,962 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-28 08:55:48,963 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-28 08:55:48,970 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-28 08:55:48,971 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-28 08:55:48,971 INFO L138 SettingsManager]: * Use SBE=true [2021-10-28 08:55:48,971 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-28 08:55:48,971 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-28 08:55:48,971 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-28 08:55:48,972 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-28 08:55:48,972 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-28 08:55:48,972 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-28 08:55:48,972 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-28 08:55:48,972 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-28 08:55:48,972 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-28 08:55:48,972 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-28 08:55:48,973 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-28 08:55:48,973 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-28 08:55:48,973 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-28 08:55:48,973 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-28 08:55:48,974 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-28 08:55:48,974 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-28 08:55:48,974 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-28 08:55:48,975 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-28 08:55:48,975 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-28 08:55:48,975 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-28 08:55:48,975 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-28 08:55:48,976 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-10-28 08:55:48,976 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-10-28 08:55:48,976 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-28 08:55:48,977 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-28 08:55:48,977 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_2cda5133-efef-4784-9475-97e2c425e490/bin/uautomizer-UnR33cPsHg/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cda5133-efef-4784-9475-97e2c425e490/bin/uautomizer-UnR33cPsHg Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8e0bd33ffca0122f84e298c52bb9fdae01e72661c94f68aaa49ed0f187d88b87 [2021-10-28 08:55:49,311 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-28 08:55:49,338 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-28 08:55:49,342 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-28 08:55:49,343 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-28 08:55:49,344 INFO L275 PluginConnector]: CDTParser initialized [2021-10-28 08:55:49,346 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cda5133-efef-4784-9475-97e2c425e490/bin/uautomizer-UnR33cPsHg/../../sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2021-10-28 08:55:49,421 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cda5133-efef-4784-9475-97e2c425e490/bin/uautomizer-UnR33cPsHg/data/d88648577/bb8c8248b63c4e2cb38d722503feabe9/FLAGd2e491e52 [2021-10-28 08:55:50,163 INFO L306 CDTParser]: Found 1 translation units. [2021-10-28 08:55:50,163 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cda5133-efef-4784-9475-97e2c425e490/sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2021-10-28 08:55:50,184 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cda5133-efef-4784-9475-97e2c425e490/bin/uautomizer-UnR33cPsHg/data/d88648577/bb8c8248b63c4e2cb38d722503feabe9/FLAGd2e491e52 [2021-10-28 08:55:50,436 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cda5133-efef-4784-9475-97e2c425e490/bin/uautomizer-UnR33cPsHg/data/d88648577/bb8c8248b63c4e2cb38d722503feabe9 [2021-10-28 08:55:50,441 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-28 08:55:50,442 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-28 08:55:50,451 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-28 08:55:50,451 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-28 08:55:50,456 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-28 08:55:50,457 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 08:55:50" (1/1) ... [2021-10-28 08:55:50,458 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48e8ba03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:55:50, skipping insertion in model container [2021-10-28 08:55:50,458 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 08:55:50" (1/1) ... [2021-10-28 08:55:50,467 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-28 08:55:50,554 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-28 08:55:50,742 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_2cda5133-efef-4784-9475-97e2c425e490/sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2021-10-28 08:55:51,208 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-28 08:55:51,220 INFO L203 MainTranslator]: Completed pre-run [2021-10-28 08:55:51,236 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_2cda5133-efef-4784-9475-97e2c425e490/sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2021-10-28 08:55:51,346 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-28 08:55:51,419 INFO L208 MainTranslator]: Completed translation [2021-10-28 08:55:51,420 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:55:51 WrapperNode [2021-10-28 08:55:51,420 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-28 08:55:51,422 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-28 08:55:51,422 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-28 08:55:51,423 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-28 08:55:51,433 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:55:51" (1/1) ... [2021-10-28 08:55:51,495 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:55:51" (1/1) ... [2021-10-28 08:55:51,565 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-28 08:55:51,579 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-28 08:55:51,580 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-28 08:55:51,580 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-28 08:55:51,591 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:55:51" (1/1) ... [2021-10-28 08:55:51,592 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:55:51" (1/1) ... [2021-10-28 08:55:51,599 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:55:51" (1/1) ... [2021-10-28 08:55:51,600 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:55:51" (1/1) ... [2021-10-28 08:55:51,621 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:55:51" (1/1) ... [2021-10-28 08:55:51,629 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:55:51" (1/1) ... [2021-10-28 08:55:51,636 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:55:51" (1/1) ... [2021-10-28 08:55:51,646 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-28 08:55:51,647 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-28 08:55:51,647 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-28 08:55:51,648 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-28 08:55:51,649 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:55:51" (1/1) ... [2021-10-28 08:55:51,659 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-28 08:55:51,679 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cda5133-efef-4784-9475-97e2c425e490/bin/uautomizer-UnR33cPsHg/z3 [2021-10-28 08:55:51,736 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cda5133-efef-4784-9475-97e2c425e490/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-28 08:55:51,784 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cda5133-efef-4784-9475-97e2c425e490/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-28 08:55:51,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-28 08:55:51,815 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-10-28 08:55:51,815 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-28 08:55:51,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-28 08:55:51,815 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-10-28 08:55:51,816 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-10-28 08:55:51,816 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-10-28 08:55:51,816 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-10-28 08:55:51,816 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-10-28 08:55:51,816 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-10-28 08:55:51,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-28 08:55:51,817 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-10-28 08:55:51,817 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-28 08:55:51,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-28 08:55:51,820 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-10-28 08:55:56,064 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-28 08:55:56,064 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-10-28 08:55:56,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 08:55:56 BoogieIcfgContainer [2021-10-28 08:55:56,069 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-28 08:55:56,072 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-28 08:55:56,072 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-28 08:55:56,076 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-28 08:55:56,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.10 08:55:50" (1/3) ... [2021-10-28 08:55:56,078 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e791840 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 08:55:56, skipping insertion in model container [2021-10-28 08:55:56,078 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:55:51" (2/3) ... [2021-10-28 08:55:56,079 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e791840 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 08:55:56, skipping insertion in model container [2021-10-28 08:55:56,079 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 08:55:56" (3/3) ... [2021-10-28 08:55:56,081 INFO L111 eAbstractionObserver]: Analyzing ICFG safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2021-10-28 08:55:56,088 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-10-28 08:55:56,088 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-28 08:55:56,089 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-10-28 08:55:56,089 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-10-28 08:55:56,155 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,155 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,155 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,156 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,156 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,156 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,156 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,156 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,157 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,157 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,157 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,157 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,158 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,158 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,158 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,158 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,159 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,160 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,160 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,160 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,161 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,165 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,165 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,166 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,166 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,167 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,167 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,167 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,169 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,169 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,169 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,169 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,170 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,170 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,171 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,171 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,171 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,172 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,172 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,173 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,173 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,174 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,174 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,174 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,174 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,174 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,176 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,176 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,177 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,177 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,178 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,179 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,179 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,179 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,180 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,180 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,180 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,180 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,180 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,181 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,181 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,181 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,181 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,181 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,182 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,182 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,182 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,182 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,182 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,182 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,183 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,183 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,183 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,183 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,184 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,184 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,184 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,185 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,185 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,185 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,185 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,185 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,185 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,186 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,188 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,190 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,192 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,195 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,196 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,196 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,196 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,197 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,198 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,198 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,198 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,198 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,204 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,204 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,205 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,205 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,205 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,205 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,205 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,207 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,208 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,208 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,208 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,208 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,209 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,209 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,209 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,210 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,210 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,210 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,210 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,210 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,210 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,211 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,211 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,211 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,211 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,211 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,211 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,212 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,212 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,212 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,212 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,212 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,213 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,213 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,213 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,213 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,213 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,213 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,214 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,214 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,214 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,214 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,214 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,215 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,215 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,216 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,216 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,216 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,216 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,216 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,217 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,217 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,219 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,219 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,219 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,219 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,219 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,220 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,220 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,221 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,221 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,221 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,221 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,222 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,224 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,225 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,225 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,225 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,225 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,225 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,226 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,226 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,226 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,226 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,226 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,226 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,227 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,227 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,227 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,227 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,227 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,227 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,228 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,228 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,228 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,228 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,228 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,228 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,229 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,229 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,231 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,231 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,231 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,231 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,232 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,232 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,232 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,233 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,233 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,233 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,233 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,233 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,233 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,234 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,234 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,234 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,235 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,235 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,236 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,236 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,237 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,237 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,237 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,237 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,237 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,237 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,238 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,239 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,244 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,244 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,245 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,245 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,245 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,245 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,246 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,246 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,246 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,246 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,249 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,250 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,250 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,250 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,251 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,251 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,251 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,252 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,252 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,252 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,253 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,253 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,253 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,254 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,263 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,263 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,263 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,263 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,264 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,274 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,274 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,274 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,275 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,275 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,275 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,275 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,278 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,278 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,278 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,278 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,279 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,279 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,279 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,279 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,279 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,280 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,280 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,280 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,280 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,280 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,281 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,281 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,281 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,281 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,281 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,281 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,282 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,282 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,282 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,282 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,282 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,283 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,283 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,285 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,286 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,286 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,286 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,286 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,287 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,287 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,287 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,287 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,287 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,288 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,288 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,288 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,288 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,288 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,289 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,289 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,289 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,289 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,289 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,289 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,290 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,290 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,290 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,290 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,290 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,291 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,291 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,291 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,291 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,291 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,292 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,292 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,292 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,292 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,292 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,293 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,293 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,293 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 08:55:56,295 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-10-28 08:55:56,371 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-28 08:55:56,388 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-10-28 08:55:56,389 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-10-28 08:55:56,415 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 114 places, 106 transitions, 227 flow [2021-10-28 08:55:56,496 INFO L129 PetriNetUnfolder]: 2/103 cut-off events. [2021-10-28 08:55:56,496 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-10-28 08:55:56,505 INFO L84 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 57 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2021-10-28 08:55:56,505 INFO L82 GeneralOperation]: Start removeDead. Operand has 114 places, 106 transitions, 227 flow [2021-10-28 08:55:56,516 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 103 transitions, 215 flow [2021-10-28 08:55:56,552 INFO L129 PetriNetUnfolder]: 0/71 cut-off events. [2021-10-28 08:55:56,553 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-10-28 08:55:56,553 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 08:55:56,554 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-10-28 08:55:56,555 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-28 08:55:56,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:55:56,564 INFO L85 PathProgramCache]: Analyzing trace with hash -2112839515, now seen corresponding path program 1 times [2021-10-28 08:55:56,575 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:55:56,577 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823684888] [2021-10-28 08:55:56,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:55:56,579 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:55:56,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:55:57,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 08:55:57,105 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 08:55:57,106 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823684888] [2021-10-28 08:55:57,107 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823684888] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 08:55:57,108 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 08:55:57,108 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-28 08:55:57,110 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504735875] [2021-10-28 08:55:57,123 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 08:55:57,124 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 08:55:57,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 08:55:57,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 08:55:57,148 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 106 [2021-10-28 08:55:57,156 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 103 transitions, 215 flow. Second operand has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:55:57,157 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 08:55:57,157 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 106 [2021-10-28 08:55:57,159 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 08:55:57,659 INFO L129 PetriNetUnfolder]: 115/689 cut-off events. [2021-10-28 08:55:57,660 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-10-28 08:55:57,666 INFO L84 FinitePrefix]: Finished finitePrefix Result has 887 conditions, 689 events. 115/689 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 4516 event pairs, 39 based on Foata normal form. 34/676 useless extension candidates. Maximal degree in co-relation 840. Up to 141 conditions per place. [2021-10-28 08:55:57,674 INFO L132 encePairwiseOnDemand]: 101/106 looper letters, 13 selfloop transitions, 2 changer transitions 0/105 dead transitions. [2021-10-28 08:55:57,674 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 105 transitions, 249 flow [2021-10-28 08:55:57,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 08:55:57,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-10-28 08:55:57,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 299 transitions. [2021-10-28 08:55:57,702 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.940251572327044 [2021-10-28 08:55:57,703 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 299 transitions. [2021-10-28 08:55:57,703 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 299 transitions. [2021-10-28 08:55:57,709 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 08:55:57,712 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 299 transitions. [2021-10-28 08:55:57,717 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:55:57,725 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:55:57,726 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:55:57,729 INFO L186 Difference]: Start difference. First operand has 111 places, 103 transitions, 215 flow. Second operand 3 states and 299 transitions. [2021-10-28 08:55:57,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 105 transitions, 249 flow [2021-10-28 08:55:57,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 105 transitions, 246 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-10-28 08:55:57,739 INFO L242 Difference]: Finished difference. Result has 108 places, 99 transitions, 208 flow [2021-10-28 08:55:57,742 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=208, PETRI_PLACES=108, PETRI_TRANSITIONS=99} [2021-10-28 08:55:57,743 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, -3 predicate places. [2021-10-28 08:55:57,743 INFO L470 AbstractCegarLoop]: Abstraction has has 108 places, 99 transitions, 208 flow [2021-10-28 08:55:57,744 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:55:57,744 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 08:55:57,745 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] [2021-10-28 08:55:57,745 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-28 08:55:57,745 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-28 08:55:57,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:55:57,746 INFO L85 PathProgramCache]: Analyzing trace with hash 2032541159, now seen corresponding path program 1 times [2021-10-28 08:55:57,746 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:55:57,747 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520025042] [2021-10-28 08:55:57,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:55:57,747 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:55:57,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:55:58,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 08:55:58,112 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 08:55:58,112 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520025042] [2021-10-28 08:55:58,113 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520025042] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 08:55:58,113 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 08:55:58,113 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-28 08:55:58,113 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999045591] [2021-10-28 08:55:58,116 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-28 08:55:58,116 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 08:55:58,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-28 08:55:58,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-28 08:55:58,120 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 106 [2021-10-28 08:55:58,121 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 99 transitions, 208 flow. Second operand has 6 states, 6 states have (on average 95.16666666666667) internal successors, (571), 6 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:55:58,121 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 08:55:58,122 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 106 [2021-10-28 08:55:58,122 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 08:55:58,343 INFO L129 PetriNetUnfolder]: 4/135 cut-off events. [2021-10-28 08:55:58,343 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-10-28 08:55:58,345 INFO L84 FinitePrefix]: Finished finitePrefix Result has 169 conditions, 135 events. 4/135 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 191 event pairs, 0 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 129. Up to 8 conditions per place. [2021-10-28 08:55:58,346 INFO L132 encePairwiseOnDemand]: 100/106 looper letters, 6 selfloop transitions, 2 changer transitions 23/111 dead transitions. [2021-10-28 08:55:58,346 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 111 transitions, 274 flow [2021-10-28 08:55:58,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-28 08:55:58,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-10-28 08:55:58,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 869 transitions. [2021-10-28 08:55:58,352 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.910901467505241 [2021-10-28 08:55:58,353 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 869 transitions. [2021-10-28 08:55:58,353 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 869 transitions. [2021-10-28 08:55:58,354 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 08:55:58,354 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 869 transitions. [2021-10-28 08:55:58,359 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 96.55555555555556) internal successors, (869), 9 states have internal predecessors, (869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:55:58,371 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 106.0) internal successors, (1060), 10 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:55:58,373 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 106.0) internal successors, (1060), 10 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:55:58,373 INFO L186 Difference]: Start difference. First operand has 108 places, 99 transitions, 208 flow. Second operand 9 states and 869 transitions. [2021-10-28 08:55:58,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 111 transitions, 274 flow [2021-10-28 08:55:58,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 111 transitions, 270 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-10-28 08:55:58,381 INFO L242 Difference]: Finished difference. Result has 121 places, 88 transitions, 202 flow [2021-10-28 08:55:58,381 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=202, PETRI_PLACES=121, PETRI_TRANSITIONS=88} [2021-10-28 08:55:58,382 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 10 predicate places. [2021-10-28 08:55:58,382 INFO L470 AbstractCegarLoop]: Abstraction has has 121 places, 88 transitions, 202 flow [2021-10-28 08:55:58,383 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 95.16666666666667) internal successors, (571), 6 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:55:58,383 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 08:55:58,384 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 08:55:58,384 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-28 08:55:58,384 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-28 08:55:58,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:55:58,385 INFO L85 PathProgramCache]: Analyzing trace with hash -485725339, now seen corresponding path program 1 times [2021-10-28 08:55:58,386 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:55:58,386 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477700372] [2021-10-28 08:55:58,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:55:58,387 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:55:58,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:55:58,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 08:55:58,805 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 08:55:58,805 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477700372] [2021-10-28 08:55:58,806 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477700372] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 08:55:58,807 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 08:55:58,807 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-28 08:55:58,808 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124045604] [2021-10-28 08:55:58,810 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-28 08:55:58,810 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 08:55:58,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-28 08:55:58,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-28 08:55:58,814 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 106 [2021-10-28 08:55:58,816 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 88 transitions, 202 flow. Second operand has 6 states, 6 states have (on average 94.16666666666667) internal successors, (565), 6 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:55:58,816 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 08:55:58,816 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 106 [2021-10-28 08:55:58,816 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 08:55:59,056 INFO L129 PetriNetUnfolder]: 24/185 cut-off events. [2021-10-28 08:55:59,056 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-10-28 08:55:59,058 INFO L84 FinitePrefix]: Finished finitePrefix Result has 302 conditions, 185 events. 24/185 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 557 event pairs, 5 based on Foata normal form. 4/187 useless extension candidates. Maximal degree in co-relation 273. Up to 31 conditions per place. [2021-10-28 08:55:59,059 INFO L132 encePairwiseOnDemand]: 99/106 looper letters, 8 selfloop transitions, 3 changer transitions 19/109 dead transitions. [2021-10-28 08:55:59,059 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 109 transitions, 322 flow [2021-10-28 08:55:59,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-28 08:55:59,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-10-28 08:55:59,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 869 transitions. [2021-10-28 08:55:59,065 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.910901467505241 [2021-10-28 08:55:59,065 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 869 transitions. [2021-10-28 08:55:59,065 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 869 transitions. [2021-10-28 08:55:59,066 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 08:55:59,067 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 869 transitions. [2021-10-28 08:55:59,070 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 96.55555555555556) internal successors, (869), 9 states have internal predecessors, (869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:55:59,074 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 106.0) internal successors, (1060), 10 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:55:59,075 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 106.0) internal successors, (1060), 10 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:55:59,076 INFO L186 Difference]: Start difference. First operand has 121 places, 88 transitions, 202 flow. Second operand 9 states and 869 transitions. [2021-10-28 08:55:59,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 109 transitions, 322 flow [2021-10-28 08:55:59,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 109 transitions, 290 flow, removed 14 selfloop flow, removed 8 redundant places. [2021-10-28 08:55:59,088 INFO L242 Difference]: Finished difference. Result has 111 places, 90 transitions, 229 flow [2021-10-28 08:55:59,088 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=229, PETRI_PLACES=111, PETRI_TRANSITIONS=90} [2021-10-28 08:55:59,089 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 0 predicate places. [2021-10-28 08:55:59,089 INFO L470 AbstractCegarLoop]: Abstraction has has 111 places, 90 transitions, 229 flow [2021-10-28 08:55:59,091 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 94.16666666666667) internal successors, (565), 6 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:55:59,091 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 08:55:59,092 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 08:55:59,092 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-28 08:55:59,092 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-28 08:55:59,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:55:59,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1144558454, now seen corresponding path program 1 times [2021-10-28 08:55:59,093 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:55:59,093 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846819898] [2021-10-28 08:55:59,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:55:59,094 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:55:59,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:56:00,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 08:56:00,037 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 08:56:00,037 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846819898] [2021-10-28 08:56:00,038 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846819898] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 08:56:00,038 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 08:56:00,038 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-28 08:56:00,038 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340749855] [2021-10-28 08:56:00,041 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-28 08:56:00,041 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 08:56:00,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-28 08:56:00,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-10-28 08:56:00,052 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 106 [2021-10-28 08:56:00,055 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 90 transitions, 229 flow. Second operand has 12 states, 12 states have (on average 83.25) internal successors, (999), 12 states have internal predecessors, (999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:56:00,055 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 08:56:00,055 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 106 [2021-10-28 08:56:00,056 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 08:56:01,510 INFO L129 PetriNetUnfolder]: 468/1083 cut-off events. [2021-10-28 08:56:01,511 INFO L130 PetriNetUnfolder]: For 806/807 co-relation queries the response was YES. [2021-10-28 08:56:01,519 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2496 conditions, 1083 events. 468/1083 cut-off events. For 806/807 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 6285 event pairs, 43 based on Foata normal form. 30/1068 useless extension candidates. Maximal degree in co-relation 2437. Up to 347 conditions per place. [2021-10-28 08:56:01,528 INFO L132 encePairwiseOnDemand]: 91/106 looper letters, 28 selfloop transitions, 14 changer transitions 47/160 dead transitions. [2021-10-28 08:56:01,528 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 160 transitions, 606 flow [2021-10-28 08:56:01,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-10-28 08:56:01,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2021-10-28 08:56:01,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1733 transitions. [2021-10-28 08:56:01,536 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8174528301886792 [2021-10-28 08:56:01,537 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 1733 transitions. [2021-10-28 08:56:01,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 1733 transitions. [2021-10-28 08:56:01,539 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 08:56:01,539 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 1733 transitions. [2021-10-28 08:56:01,546 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 86.65) internal successors, (1733), 20 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-10-28 08:56:01,553 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 106.0) internal successors, (2226), 21 states have internal predecessors, (2226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:56:01,555 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 106.0) internal successors, (2226), 21 states have internal predecessors, (2226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:56:01,555 INFO L186 Difference]: Start difference. First operand has 111 places, 90 transitions, 229 flow. Second operand 20 states and 1733 transitions. [2021-10-28 08:56:01,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 160 transitions, 606 flow [2021-10-28 08:56:01,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 160 transitions, 575 flow, removed 14 selfloop flow, removed 4 redundant places. [2021-10-28 08:56:01,571 INFO L242 Difference]: Finished difference. Result has 134 places, 98 transitions, 339 flow [2021-10-28 08:56:01,571 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=339, PETRI_PLACES=134, PETRI_TRANSITIONS=98} [2021-10-28 08:56:01,572 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 23 predicate places. [2021-10-28 08:56:01,572 INFO L470 AbstractCegarLoop]: Abstraction has has 134 places, 98 transitions, 339 flow [2021-10-28 08:56:01,573 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 83.25) internal successors, (999), 12 states have internal predecessors, (999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:56:01,573 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 08:56:01,574 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 08:56:01,574 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-28 08:56:01,574 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-28 08:56:01,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:56:01,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1298427205, now seen corresponding path program 1 times [2021-10-28 08:56:01,575 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:56:01,576 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941151835] [2021-10-28 08:56:01,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:56:01,576 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:56:01,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:56:02,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 08:56:02,265 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 08:56:02,265 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941151835] [2021-10-28 08:56:02,265 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941151835] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 08:56:02,266 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 08:56:02,266 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-10-28 08:56:02,266 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89689859] [2021-10-28 08:56:02,266 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-10-28 08:56:02,267 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 08:56:02,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-10-28 08:56:02,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2021-10-28 08:56:02,271 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 106 [2021-10-28 08:56:02,274 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 98 transitions, 339 flow. Second operand has 17 states, 17 states have (on average 79.17647058823529) internal successors, (1346), 17 states have internal predecessors, (1346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:56:02,274 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 08:56:02,274 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 106 [2021-10-28 08:56:02,275 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 08:56:03,607 INFO L129 PetriNetUnfolder]: 382/926 cut-off events. [2021-10-28 08:56:03,607 INFO L130 PetriNetUnfolder]: For 4156/4348 co-relation queries the response was YES. [2021-10-28 08:56:03,617 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3729 conditions, 926 events. 382/926 cut-off events. For 4156/4348 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 5254 event pairs, 39 based on Foata normal form. 21/891 useless extension candidates. Maximal degree in co-relation 3651. Up to 372 conditions per place. [2021-10-28 08:56:03,628 INFO L132 encePairwiseOnDemand]: 87/106 looper letters, 26 selfloop transitions, 15 changer transitions 47/155 dead transitions. [2021-10-28 08:56:03,628 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 155 transitions, 941 flow [2021-10-28 08:56:03,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-10-28 08:56:03,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2021-10-28 08:56:03,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 1880 transitions. [2021-10-28 08:56:03,638 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.771123872026251 [2021-10-28 08:56:03,638 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 1880 transitions. [2021-10-28 08:56:03,638 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 1880 transitions. [2021-10-28 08:56:03,640 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 08:56:03,641 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 1880 transitions. [2021-10-28 08:56:03,648 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 81.73913043478261) internal successors, (1880), 23 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:56:03,656 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 106.0) internal successors, (2544), 24 states have internal predecessors, (2544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:56:03,658 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 106.0) internal successors, (2544), 24 states have internal predecessors, (2544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:56:03,658 INFO L186 Difference]: Start difference. First operand has 134 places, 98 transitions, 339 flow. Second operand 23 states and 1880 transitions. [2021-10-28 08:56:03,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 155 transitions, 941 flow [2021-10-28 08:56:03,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 155 transitions, 870 flow, removed 33 selfloop flow, removed 12 redundant places. [2021-10-28 08:56:03,676 INFO L242 Difference]: Finished difference. Result has 145 places, 102 transitions, 422 flow [2021-10-28 08:56:03,677 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=422, PETRI_PLACES=145, PETRI_TRANSITIONS=102} [2021-10-28 08:56:03,677 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 34 predicate places. [2021-10-28 08:56:03,677 INFO L470 AbstractCegarLoop]: Abstraction has has 145 places, 102 transitions, 422 flow [2021-10-28 08:56:03,679 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 79.17647058823529) internal successors, (1346), 17 states have internal predecessors, (1346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:56:03,679 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 08:56:03,679 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 08:56:03,679 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-28 08:56:03,680 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-28 08:56:03,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:56:03,680 INFO L85 PathProgramCache]: Analyzing trace with hash 590906097, now seen corresponding path program 1 times [2021-10-28 08:56:03,681 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:56:03,681 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133927722] [2021-10-28 08:56:03,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:56:03,681 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:56:03,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:56:04,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 08:56:04,449 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 08:56:04,450 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133927722] [2021-10-28 08:56:04,450 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133927722] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 08:56:04,450 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 08:56:04,450 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-10-28 08:56:04,450 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036113155] [2021-10-28 08:56:04,451 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-10-28 08:56:04,451 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 08:56:04,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-10-28 08:56:04,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2021-10-28 08:56:04,455 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 106 [2021-10-28 08:56:04,457 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 102 transitions, 422 flow. Second operand has 15 states, 15 states have (on average 80.26666666666667) internal successors, (1204), 15 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:56:04,457 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 08:56:04,457 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 106 [2021-10-28 08:56:04,457 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 08:56:05,586 INFO L129 PetriNetUnfolder]: 416/982 cut-off events. [2021-10-28 08:56:05,586 INFO L130 PetriNetUnfolder]: For 7807/8616 co-relation queries the response was YES. [2021-10-28 08:56:05,598 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5137 conditions, 982 events. 416/982 cut-off events. For 7807/8616 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 5568 event pairs, 72 based on Foata normal form. 33/957 useless extension candidates. Maximal degree in co-relation 5051. Up to 412 conditions per place. [2021-10-28 08:56:05,613 INFO L132 encePairwiseOnDemand]: 91/106 looper letters, 35 selfloop transitions, 16 changer transitions 25/144 dead transitions. [2021-10-28 08:56:05,613 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 144 transitions, 1088 flow [2021-10-28 08:56:05,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-28 08:56:05,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-10-28 08:56:05,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1330 transitions. [2021-10-28 08:56:05,621 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7841981132075472 [2021-10-28 08:56:05,621 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1330 transitions. [2021-10-28 08:56:05,621 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1330 transitions. [2021-10-28 08:56:05,623 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 08:56:05,623 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1330 transitions. [2021-10-28 08:56:05,630 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 83.125) internal successors, (1330), 16 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:56:05,637 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 106.0) internal successors, (1802), 17 states have internal predecessors, (1802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:56:05,639 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 106.0) internal successors, (1802), 17 states have internal predecessors, (1802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:56:05,639 INFO L186 Difference]: Start difference. First operand has 145 places, 102 transitions, 422 flow. Second operand 16 states and 1330 transitions. [2021-10-28 08:56:05,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 144 transitions, 1088 flow [2021-10-28 08:56:05,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 144 transitions, 911 flow, removed 76 selfloop flow, removed 20 redundant places. [2021-10-28 08:56:05,659 INFO L242 Difference]: Finished difference. Result has 136 places, 109 transitions, 503 flow [2021-10-28 08:56:05,660 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=503, PETRI_PLACES=136, PETRI_TRANSITIONS=109} [2021-10-28 08:56:05,660 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 25 predicate places. [2021-10-28 08:56:05,661 INFO L470 AbstractCegarLoop]: Abstraction has has 136 places, 109 transitions, 503 flow [2021-10-28 08:56:05,662 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 80.26666666666667) internal successors, (1204), 15 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:56:05,662 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 08:56:05,663 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 08:56:05,663 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-28 08:56:05,663 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-28 08:56:05,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:56:05,664 INFO L85 PathProgramCache]: Analyzing trace with hash 870162517, now seen corresponding path program 2 times [2021-10-28 08:56:05,664 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:56:05,665 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143905710] [2021-10-28 08:56:05,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:56:05,665 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:56:05,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:56:05,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 08:56:05,829 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 08:56:05,830 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143905710] [2021-10-28 08:56:05,830 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143905710] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 08:56:05,830 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 08:56:05,830 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-28 08:56:05,831 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183111001] [2021-10-28 08:56:05,831 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-28 08:56:05,832 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 08:56:05,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-28 08:56:05,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-28 08:56:05,841 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 106 [2021-10-28 08:56:05,842 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 109 transitions, 503 flow. Second operand has 6 states, 6 states have (on average 94.33333333333333) internal successors, (566), 6 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:56:05,843 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 08:56:05,843 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 106 [2021-10-28 08:56:05,843 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 08:56:06,366 INFO L129 PetriNetUnfolder]: 405/1097 cut-off events. [2021-10-28 08:56:06,367 INFO L130 PetriNetUnfolder]: For 7980/8402 co-relation queries the response was YES. [2021-10-28 08:56:06,379 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5297 conditions, 1097 events. 405/1097 cut-off events. For 7980/8402 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 7097 event pairs, 189 based on Foata normal form. 42/1072 useless extension candidates. Maximal degree in co-relation 5223. Up to 467 conditions per place. [2021-10-28 08:56:06,391 INFO L132 encePairwiseOnDemand]: 100/106 looper letters, 12 selfloop transitions, 3 changer transitions 10/123 dead transitions. [2021-10-28 08:56:06,392 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 123 transitions, 673 flow [2021-10-28 08:56:06,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-28 08:56:06,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-10-28 08:56:06,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 863 transitions. [2021-10-28 08:56:06,396 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9046121593291404 [2021-10-28 08:56:06,397 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 863 transitions. [2021-10-28 08:56:06,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 863 transitions. [2021-10-28 08:56:06,398 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 08:56:06,398 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 863 transitions. [2021-10-28 08:56:06,402 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 95.88888888888889) internal successors, (863), 9 states have internal predecessors, (863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:56:06,406 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 106.0) internal successors, (1060), 10 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:56:06,407 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 106.0) internal successors, (1060), 10 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:56:06,407 INFO L186 Difference]: Start difference. First operand has 136 places, 109 transitions, 503 flow. Second operand 9 states and 863 transitions. [2021-10-28 08:56:06,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 123 transitions, 673 flow [2021-10-28 08:56:06,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 123 transitions, 582 flow, removed 35 selfloop flow, removed 13 redundant places. [2021-10-28 08:56:06,425 INFO L242 Difference]: Finished difference. Result has 132 places, 109 transitions, 469 flow [2021-10-28 08:56:06,426 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=446, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=469, PETRI_PLACES=132, PETRI_TRANSITIONS=109} [2021-10-28 08:56:06,426 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 21 predicate places. [2021-10-28 08:56:06,426 INFO L470 AbstractCegarLoop]: Abstraction has has 132 places, 109 transitions, 469 flow [2021-10-28 08:56:06,427 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 94.33333333333333) internal successors, (566), 6 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:56:06,427 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 08:56:06,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] [2021-10-28 08:56:06,428 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-28 08:56:06,428 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-28 08:56:06,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:56:06,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1138767380, now seen corresponding path program 1 times [2021-10-28 08:56:06,429 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:56:06,429 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156572801] [2021-10-28 08:56:06,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:56:06,430 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:56:06,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:56:06,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 08:56:06,909 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 08:56:06,909 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156572801] [2021-10-28 08:56:06,909 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156572801] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 08:56:06,909 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 08:56:06,910 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-28 08:56:06,910 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691200805] [2021-10-28 08:56:06,911 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-28 08:56:06,911 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 08:56:06,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-28 08:56:06,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-10-28 08:56:06,914 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 106 [2021-10-28 08:56:06,916 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 109 transitions, 469 flow. Second operand has 10 states, 10 states have (on average 83.7) internal successors, (837), 10 states have internal predecessors, (837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:56:06,916 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 08:56:06,916 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 106 [2021-10-28 08:56:06,917 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 08:56:08,014 INFO L129 PetriNetUnfolder]: 468/1279 cut-off events. [2021-10-28 08:56:08,014 INFO L130 PetriNetUnfolder]: For 6981/8267 co-relation queries the response was YES. [2021-10-28 08:56:08,027 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5864 conditions, 1279 events. 468/1279 cut-off events. For 6981/8267 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 8832 event pairs, 45 based on Foata normal form. 69/1283 useless extension candidates. Maximal degree in co-relation 5789. Up to 533 conditions per place. [2021-10-28 08:56:08,038 INFO L132 encePairwiseOnDemand]: 95/106 looper letters, 39 selfloop transitions, 13 changer transitions 26/148 dead transitions. [2021-10-28 08:56:08,038 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 148 transitions, 1072 flow [2021-10-28 08:56:08,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-28 08:56:08,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-10-28 08:56:08,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1128 transitions. [2021-10-28 08:56:08,044 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.818577648766328 [2021-10-28 08:56:08,044 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1128 transitions. [2021-10-28 08:56:08,045 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1128 transitions. [2021-10-28 08:56:08,046 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 08:56:08,046 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1128 transitions. [2021-10-28 08:56:08,052 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 86.76923076923077) internal successors, (1128), 13 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:56:08,058 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 106.0) internal successors, (1484), 14 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:56:08,059 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 106.0) internal successors, (1484), 14 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:56:08,059 INFO L186 Difference]: Start difference. First operand has 132 places, 109 transitions, 469 flow. Second operand 13 states and 1128 transitions. [2021-10-28 08:56:08,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 148 transitions, 1072 flow [2021-10-28 08:56:08,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 148 transitions, 1035 flow, removed 17 selfloop flow, removed 7 redundant places. [2021-10-28 08:56:08,080 INFO L242 Difference]: Finished difference. Result has 139 places, 114 transitions, 566 flow [2021-10-28 08:56:08,081 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=448, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=566, PETRI_PLACES=139, PETRI_TRANSITIONS=114} [2021-10-28 08:56:08,082 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 28 predicate places. [2021-10-28 08:56:08,082 INFO L470 AbstractCegarLoop]: Abstraction has has 139 places, 114 transitions, 566 flow [2021-10-28 08:56:08,083 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 83.7) internal successors, (837), 10 states have internal predecessors, (837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:56:08,083 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 08:56:08,083 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] [2021-10-28 08:56:08,083 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-28 08:56:08,084 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-28 08:56:08,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:56:08,085 INFO L85 PathProgramCache]: Analyzing trace with hash -270559419, now seen corresponding path program 1 times [2021-10-28 08:56:08,085 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:56:08,085 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036036077] [2021-10-28 08:56:08,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:56:08,086 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:56:08,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:56:08,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 08:56:08,623 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 08:56:08,624 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036036077] [2021-10-28 08:56:08,624 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036036077] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 08:56:08,624 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 08:56:08,624 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-10-28 08:56:08,625 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062129634] [2021-10-28 08:56:08,625 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-10-28 08:56:08,625 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 08:56:08,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-10-28 08:56:08,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2021-10-28 08:56:08,630 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 106 [2021-10-28 08:56:08,632 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 114 transitions, 566 flow. Second operand has 16 states, 16 states have (on average 78.375) internal successors, (1254), 16 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:56:08,633 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 08:56:08,633 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 106 [2021-10-28 08:56:08,633 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 08:56:09,921 INFO L129 PetriNetUnfolder]: 364/1104 cut-off events. [2021-10-28 08:56:09,922 INFO L130 PetriNetUnfolder]: For 5999/6813 co-relation queries the response was YES. [2021-10-28 08:56:09,932 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5105 conditions, 1104 events. 364/1104 cut-off events. For 5999/6813 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 7862 event pairs, 35 based on Foata normal form. 106/1160 useless extension candidates. Maximal degree in co-relation 5022. Up to 449 conditions per place. [2021-10-28 08:56:09,943 INFO L132 encePairwiseOnDemand]: 89/106 looper letters, 35 selfloop transitions, 22 changer transitions 29/152 dead transitions. [2021-10-28 08:56:09,943 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 152 transitions, 1167 flow [2021-10-28 08:56:09,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-28 08:56:09,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2021-10-28 08:56:09,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1457 transitions. [2021-10-28 08:56:09,952 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7636268343815513 [2021-10-28 08:56:09,952 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1457 transitions. [2021-10-28 08:56:09,952 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1457 transitions. [2021-10-28 08:56:09,954 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 08:56:09,954 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1457 transitions. [2021-10-28 08:56:09,961 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 80.94444444444444) internal successors, (1457), 18 states have internal predecessors, (1457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:56:09,968 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 106.0) internal successors, (2014), 19 states have internal predecessors, (2014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:56:09,970 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 106.0) internal successors, (2014), 19 states have internal predecessors, (2014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:56:09,971 INFO L186 Difference]: Start difference. First operand has 139 places, 114 transitions, 566 flow. Second operand 18 states and 1457 transitions. [2021-10-28 08:56:09,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 152 transitions, 1167 flow [2021-10-28 08:56:09,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 152 transitions, 1100 flow, removed 30 selfloop flow, removed 9 redundant places. [2021-10-28 08:56:09,989 INFO L242 Difference]: Finished difference. Result has 150 places, 118 transitions, 645 flow [2021-10-28 08:56:09,989 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=519, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=645, PETRI_PLACES=150, PETRI_TRANSITIONS=118} [2021-10-28 08:56:09,990 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 39 predicate places. [2021-10-28 08:56:09,990 INFO L470 AbstractCegarLoop]: Abstraction has has 150 places, 118 transitions, 645 flow [2021-10-28 08:56:09,991 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 78.375) internal successors, (1254), 16 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:56:09,991 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 08:56:09,992 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] [2021-10-28 08:56:09,992 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-28 08:56:09,993 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-28 08:56:09,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:56:09,993 INFO L85 PathProgramCache]: Analyzing trace with hash -2133532283, now seen corresponding path program 2 times [2021-10-28 08:56:09,994 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:56:09,994 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081488960] [2021-10-28 08:56:09,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:56:09,994 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:56:10,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:56:10,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 08:56:10,509 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 08:56:10,509 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081488960] [2021-10-28 08:56:10,509 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081488960] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 08:56:10,510 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 08:56:10,510 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-10-28 08:56:10,510 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299169887] [2021-10-28 08:56:10,512 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-10-28 08:56:10,512 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 08:56:10,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-10-28 08:56:10,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2021-10-28 08:56:10,521 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 106 [2021-10-28 08:56:10,525 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 118 transitions, 645 flow. Second operand has 15 states, 15 states have (on average 80.33333333333333) internal successors, (1205), 15 states have internal predecessors, (1205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:56:10,525 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 08:56:10,526 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 106 [2021-10-28 08:56:10,526 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 08:56:11,643 INFO L129 PetriNetUnfolder]: 353/1063 cut-off events. [2021-10-28 08:56:11,643 INFO L130 PetriNetUnfolder]: For 9739/10933 co-relation queries the response was YES. [2021-10-28 08:56:11,653 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5765 conditions, 1063 events. 353/1063 cut-off events. For 9739/10933 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 7537 event pairs, 34 based on Foata normal form. 78/1091 useless extension candidates. Maximal degree in co-relation 5678. Up to 444 conditions per place. [2021-10-28 08:56:11,665 INFO L132 encePairwiseOnDemand]: 92/106 looper letters, 42 selfloop transitions, 17 changer transitions 20/147 dead transitions. [2021-10-28 08:56:11,665 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 147 transitions, 1259 flow [2021-10-28 08:56:11,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-28 08:56:11,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-10-28 08:56:11,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1165 transitions. [2021-10-28 08:56:11,670 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7850404312668463 [2021-10-28 08:56:11,670 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1165 transitions. [2021-10-28 08:56:11,671 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1165 transitions. [2021-10-28 08:56:11,672 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 08:56:11,672 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1165 transitions. [2021-10-28 08:56:11,681 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 83.21428571428571) internal successors, (1165), 14 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:56:11,686 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 106.0) internal successors, (1590), 15 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:56:11,687 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 106.0) internal successors, (1590), 15 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:56:11,687 INFO L186 Difference]: Start difference. First operand has 150 places, 118 transitions, 645 flow. Second operand 14 states and 1165 transitions. [2021-10-28 08:56:11,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 147 transitions, 1259 flow [2021-10-28 08:56:11,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 147 transitions, 1076 flow, removed 85 selfloop flow, removed 14 redundant places. [2021-10-28 08:56:11,716 INFO L242 Difference]: Finished difference. Result has 147 places, 120 transitions, 668 flow [2021-10-28 08:56:11,718 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=584, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=668, PETRI_PLACES=147, PETRI_TRANSITIONS=120} [2021-10-28 08:56:11,718 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 36 predicate places. [2021-10-28 08:56:11,719 INFO L470 AbstractCegarLoop]: Abstraction has has 147 places, 120 transitions, 668 flow [2021-10-28 08:56:11,719 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 80.33333333333333) internal successors, (1205), 15 states have internal predecessors, (1205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:56:11,720 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 08:56:11,720 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] [2021-10-28 08:56:11,720 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-28 08:56:11,721 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-28 08:56:11,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:56:11,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1398382989, now seen corresponding path program 3 times [2021-10-28 08:56:11,723 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:56:11,725 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002038609] [2021-10-28 08:56:11,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:56:11,726 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:56:11,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:56:12,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 08:56:12,116 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 08:56:12,116 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002038609] [2021-10-28 08:56:12,117 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002038609] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 08:56:12,117 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 08:56:12,117 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-28 08:56:12,118 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511814373] [2021-10-28 08:56:12,118 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-28 08:56:12,119 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 08:56:12,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-28 08:56:12,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-10-28 08:56:12,122 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 106 [2021-10-28 08:56:12,123 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 120 transitions, 668 flow. Second operand has 9 states, 9 states have (on average 84.0) internal successors, (756), 9 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:56:12,124 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 08:56:12,124 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 106 [2021-10-28 08:56:12,124 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 08:56:12,918 INFO L129 PetriNetUnfolder]: 349/1150 cut-off events. [2021-10-28 08:56:12,919 INFO L130 PetriNetUnfolder]: For 7335/8931 co-relation queries the response was YES. [2021-10-28 08:56:12,930 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5465 conditions, 1150 events. 349/1150 cut-off events. For 7335/8931 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 8591 event pairs, 27 based on Foata normal form. 46/1143 useless extension candidates. Maximal degree in co-relation 5382. Up to 435 conditions per place. [2021-10-28 08:56:12,941 INFO L132 encePairwiseOnDemand]: 93/106 looper letters, 48 selfloop transitions, 16 changer transitions 19/153 dead transitions. [2021-10-28 08:56:12,941 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 153 transitions, 1215 flow [2021-10-28 08:56:12,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-28 08:56:12,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-10-28 08:56:12,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1040 transitions. [2021-10-28 08:56:12,945 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8176100628930818 [2021-10-28 08:56:12,945 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1040 transitions. [2021-10-28 08:56:12,945 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1040 transitions. [2021-10-28 08:56:12,946 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 08:56:12,946 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1040 transitions. [2021-10-28 08:56:12,949 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 86.66666666666667) internal successors, (1040), 12 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:56:12,953 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 106.0) internal successors, (1378), 13 states have internal predecessors, (1378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:56:12,954 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 106.0) internal successors, (1378), 13 states have internal predecessors, (1378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:56:12,955 INFO L186 Difference]: Start difference. First operand has 147 places, 120 transitions, 668 flow. Second operand 12 states and 1040 transitions. [2021-10-28 08:56:12,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 153 transitions, 1215 flow [2021-10-28 08:56:12,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 153 transitions, 1144 flow, removed 27 selfloop flow, removed 11 redundant places. [2021-10-28 08:56:12,981 INFO L242 Difference]: Finished difference. Result has 149 places, 125 transitions, 770 flow [2021-10-28 08:56:12,982 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=634, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=770, PETRI_PLACES=149, PETRI_TRANSITIONS=125} [2021-10-28 08:56:12,982 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 38 predicate places. [2021-10-28 08:56:12,983 INFO L470 AbstractCegarLoop]: Abstraction has has 149 places, 125 transitions, 770 flow [2021-10-28 08:56:12,983 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 84.0) internal successors, (756), 9 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:56:12,983 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 08:56:12,984 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] [2021-10-28 08:56:12,984 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-28 08:56:12,984 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-28 08:56:12,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:56:12,985 INFO L85 PathProgramCache]: Analyzing trace with hash 649933147, now seen corresponding path program 4 times [2021-10-28 08:56:12,985 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:56:12,985 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804867820] [2021-10-28 08:56:12,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:56:12,986 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:56:13,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:56:13,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 08:56:13,642 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 08:56:13,642 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804867820] [2021-10-28 08:56:13,642 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804867820] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 08:56:13,642 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 08:56:13,643 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-10-28 08:56:13,643 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146706640] [2021-10-28 08:56:13,643 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-28 08:56:13,643 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 08:56:13,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-28 08:56:13,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2021-10-28 08:56:13,647 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 106 [2021-10-28 08:56:13,649 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 125 transitions, 770 flow. Second operand has 13 states, 13 states have (on average 77.76923076923077) internal successors, (1011), 13 states have internal predecessors, (1011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:56:13,649 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 08:56:13,649 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 106 [2021-10-28 08:56:13,650 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 08:56:14,770 INFO L129 PetriNetUnfolder]: 328/1156 cut-off events. [2021-10-28 08:56:14,770 INFO L130 PetriNetUnfolder]: For 8978/10538 co-relation queries the response was YES. [2021-10-28 08:56:14,784 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5927 conditions, 1156 events. 328/1156 cut-off events. For 8978/10538 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 8981 event pairs, 8 based on Foata normal form. 73/1173 useless extension candidates. Maximal degree in co-relation 5838. Up to 426 conditions per place. [2021-10-28 08:56:14,791 INFO L132 encePairwiseOnDemand]: 92/106 looper letters, 52 selfloop transitions, 19 changer transitions 28/164 dead transitions. [2021-10-28 08:56:14,792 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 164 transitions, 1556 flow [2021-10-28 08:56:14,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-28 08:56:14,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2021-10-28 08:56:14,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1202 transitions. [2021-10-28 08:56:14,800 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7559748427672957 [2021-10-28 08:56:14,800 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1202 transitions. [2021-10-28 08:56:14,800 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1202 transitions. [2021-10-28 08:56:14,801 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 08:56:14,801 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1202 transitions. [2021-10-28 08:56:14,817 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 80.13333333333334) internal successors, (1202), 15 states have internal predecessors, (1202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:56:14,832 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 106.0) internal successors, (1696), 16 states have internal predecessors, (1696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:56:14,833 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 106.0) internal successors, (1696), 16 states have internal predecessors, (1696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:56:14,834 INFO L186 Difference]: Start difference. First operand has 149 places, 125 transitions, 770 flow. Second operand 15 states and 1202 transitions. [2021-10-28 08:56:14,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 164 transitions, 1556 flow [2021-10-28 08:56:14,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 164 transitions, 1403 flow, removed 73 selfloop flow, removed 9 redundant places. [2021-10-28 08:56:14,870 INFO L242 Difference]: Finished difference. Result has 156 places, 126 transitions, 836 flow [2021-10-28 08:56:14,871 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=723, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=836, PETRI_PLACES=156, PETRI_TRANSITIONS=126} [2021-10-28 08:56:14,871 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 45 predicate places. [2021-10-28 08:56:14,871 INFO L470 AbstractCegarLoop]: Abstraction has has 156 places, 126 transitions, 836 flow [2021-10-28 08:56:14,872 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 77.76923076923077) internal successors, (1011), 13 states have internal predecessors, (1011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:56:14,872 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 08:56:14,872 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 08:56:14,872 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-28 08:56:14,873 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-28 08:56:14,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:56:14,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1082867155, now seen corresponding path program 1 times [2021-10-28 08:56:14,874 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:56:14,874 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553500317] [2021-10-28 08:56:14,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:56:14,874 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:56:14,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:56:15,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 08:56:15,044 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 08:56:15,045 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553500317] [2021-10-28 08:56:15,045 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553500317] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 08:56:15,045 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 08:56:15,045 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-28 08:56:15,046 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268181603] [2021-10-28 08:56:15,046 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-28 08:56:15,046 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 08:56:15,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-28 08:56:15,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-28 08:56:15,050 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 106 [2021-10-28 08:56:15,051 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 126 transitions, 836 flow. Second operand has 6 states, 6 states have (on average 93.16666666666667) internal successors, (559), 6 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:56:15,051 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 08:56:15,052 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 106 [2021-10-28 08:56:15,052 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 08:56:16,053 INFO L129 PetriNetUnfolder]: 1309/3331 cut-off events. [2021-10-28 08:56:16,053 INFO L130 PetriNetUnfolder]: For 6623/6863 co-relation queries the response was YES. [2021-10-28 08:56:16,105 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8786 conditions, 3331 events. 1309/3331 cut-off events. For 6623/6863 co-relation queries the response was YES. Maximal size of possible extension queue 505. Compared 32410 event pairs, 132 based on Foata normal form. 110/3145 useless extension candidates. Maximal degree in co-relation 8702. Up to 1020 conditions per place. [2021-10-28 08:56:16,126 INFO L132 encePairwiseOnDemand]: 97/106 looper letters, 19 selfloop transitions, 16 changer transitions 0/146 dead transitions. [2021-10-28 08:56:16,126 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 146 transitions, 904 flow [2021-10-28 08:56:16,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-28 08:56:16,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-10-28 08:56:16,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 865 transitions. [2021-10-28 08:56:16,129 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9067085953878407 [2021-10-28 08:56:16,129 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 865 transitions. [2021-10-28 08:56:16,130 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 865 transitions. [2021-10-28 08:56:16,130 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 08:56:16,131 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 865 transitions. [2021-10-28 08:56:16,133 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 96.11111111111111) internal successors, (865), 9 states have internal predecessors, (865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:56:16,213 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 106.0) internal successors, (1060), 10 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:56:16,214 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 106.0) internal successors, (1060), 10 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:56:16,214 INFO L186 Difference]: Start difference. First operand has 156 places, 126 transitions, 836 flow. Second operand 9 states and 865 transitions. [2021-10-28 08:56:16,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 146 transitions, 904 flow [2021-10-28 08:56:16,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 146 transitions, 846 flow, removed 14 selfloop flow, removed 17 redundant places. [2021-10-28 08:56:16,259 INFO L242 Difference]: Finished difference. Result has 146 places, 135 transitions, 837 flow [2021-10-28 08:56:16,260 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=726, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=837, PETRI_PLACES=146, PETRI_TRANSITIONS=135} [2021-10-28 08:56:16,260 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 35 predicate places. [2021-10-28 08:56:16,261 INFO L470 AbstractCegarLoop]: Abstraction has has 146 places, 135 transitions, 837 flow [2021-10-28 08:56:16,261 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.16666666666667) internal successors, (559), 6 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:56:16,261 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 08:56:16,262 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 08:56:16,264 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-28 08:56:16,264 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-28 08:56:16,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:56:16,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1024960113, now seen corresponding path program 1 times [2021-10-28 08:56:16,265 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:56:16,265 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600997314] [2021-10-28 08:56:16,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:56:16,266 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:56:16,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:56:16,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 08:56:16,431 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 08:56:16,432 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600997314] [2021-10-28 08:56:16,432 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600997314] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 08:56:16,432 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 08:56:16,432 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-28 08:56:16,433 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042225924] [2021-10-28 08:56:16,434 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-28 08:56:16,434 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 08:56:16,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-28 08:56:16,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-10-28 08:56:16,436 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 106 [2021-10-28 08:56:16,438 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 135 transitions, 837 flow. Second operand has 7 states, 7 states have (on average 93.14285714285714) internal successors, (652), 7 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:56:16,438 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 08:56:16,438 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 106 [2021-10-28 08:56:16,438 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 08:56:17,435 INFO L129 PetriNetUnfolder]: 1146/3270 cut-off events. [2021-10-28 08:56:17,436 INFO L130 PetriNetUnfolder]: For 9461/11434 co-relation queries the response was YES. [2021-10-28 08:56:17,473 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11553 conditions, 3270 events. 1146/3270 cut-off events. For 9461/11434 co-relation queries the response was YES. Maximal size of possible extension queue 527. Compared 34269 event pairs, 27 based on Foata normal form. 635/3683 useless extension candidates. Maximal degree in co-relation 11477. Up to 1165 conditions per place. [2021-10-28 08:56:17,483 INFO L132 encePairwiseOnDemand]: 97/106 looper letters, 15 selfloop transitions, 31 changer transitions 8/156 dead transitions. [2021-10-28 08:56:17,483 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 156 transitions, 1019 flow [2021-10-28 08:56:17,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-28 08:56:17,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-10-28 08:56:17,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1154 transitions. [2021-10-28 08:56:17,486 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9072327044025157 [2021-10-28 08:56:17,487 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1154 transitions. [2021-10-28 08:56:17,487 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1154 transitions. [2021-10-28 08:56:17,488 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 08:56:17,488 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1154 transitions. [2021-10-28 08:56:17,491 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 96.16666666666667) internal successors, (1154), 12 states have internal predecessors, (1154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:56:17,494 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 106.0) internal successors, (1378), 13 states have internal predecessors, (1378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:56:17,495 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 106.0) internal successors, (1378), 13 states have internal predecessors, (1378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:56:17,495 INFO L186 Difference]: Start difference. First operand has 146 places, 135 transitions, 837 flow. Second operand 12 states and 1154 transitions. [2021-10-28 08:56:17,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 156 transitions, 1019 flow [2021-10-28 08:56:17,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 156 transitions, 997 flow, removed 2 selfloop flow, removed 4 redundant places. [2021-10-28 08:56:17,530 INFO L242 Difference]: Finished difference. Result has 156 places, 145 transitions, 927 flow [2021-10-28 08:56:17,530 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=712, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=927, PETRI_PLACES=156, PETRI_TRANSITIONS=145} [2021-10-28 08:56:17,531 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 45 predicate places. [2021-10-28 08:56:17,531 INFO L470 AbstractCegarLoop]: Abstraction has has 156 places, 145 transitions, 927 flow [2021-10-28 08:56:17,532 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 93.14285714285714) internal successors, (652), 7 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:56:17,532 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 08:56:17,532 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 08:56:17,532 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-28 08:56:17,534 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-28 08:56:17,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:56:17,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1185117170, now seen corresponding path program 1 times [2021-10-28 08:56:17,535 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:56:17,535 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429051344] [2021-10-28 08:56:17,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:56:17,536 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:56:17,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:56:17,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 08:56:17,735 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 08:56:17,735 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429051344] [2021-10-28 08:56:17,736 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429051344] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 08:56:17,736 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 08:56:17,736 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-28 08:56:17,736 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952244256] [2021-10-28 08:56:17,737 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-28 08:56:17,737 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 08:56:17,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-28 08:56:17,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-10-28 08:56:17,740 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 106 [2021-10-28 08:56:17,741 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 145 transitions, 927 flow. Second operand has 8 states, 8 states have (on average 93.125) internal successors, (745), 8 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:56:17,741 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 08:56:17,742 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 106 [2021-10-28 08:56:17,742 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 08:56:18,691 INFO L129 PetriNetUnfolder]: 927/3010 cut-off events. [2021-10-28 08:56:18,691 INFO L130 PetriNetUnfolder]: For 11171/12784 co-relation queries the response was YES. [2021-10-28 08:56:18,733 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11960 conditions, 3010 events. 927/3010 cut-off events. For 11171/12784 co-relation queries the response was YES. Maximal size of possible extension queue 520. Compared 33114 event pairs, 4 based on Foata normal form. 549/3351 useless extension candidates. Maximal degree in co-relation 11880. Up to 990 conditions per place. [2021-10-28 08:56:18,741 INFO L132 encePairwiseOnDemand]: 97/106 looper letters, 10 selfloop transitions, 36 changer transitions 26/164 dead transitions. [2021-10-28 08:56:18,741 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 164 transitions, 1181 flow [2021-10-28 08:56:18,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-28 08:56:18,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2021-10-28 08:56:18,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1431 transitions. [2021-10-28 08:56:18,746 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9 [2021-10-28 08:56:18,746 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1431 transitions. [2021-10-28 08:56:18,746 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1431 transitions. [2021-10-28 08:56:18,747 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 08:56:18,748 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1431 transitions. [2021-10-28 08:56:18,751 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 95.4) internal successors, (1431), 15 states have internal predecessors, (1431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:56:18,756 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 106.0) internal successors, (1696), 16 states have internal predecessors, (1696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:56:18,757 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 106.0) internal successors, (1696), 16 states have internal predecessors, (1696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:56:18,757 INFO L186 Difference]: Start difference. First operand has 156 places, 145 transitions, 927 flow. Second operand 15 states and 1431 transitions. [2021-10-28 08:56:18,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 164 transitions, 1181 flow [2021-10-28 08:56:18,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 164 transitions, 971 flow, removed 79 selfloop flow, removed 10 redundant places. [2021-10-28 08:56:18,943 INFO L242 Difference]: Finished difference. Result has 166 places, 135 transitions, 760 flow [2021-10-28 08:56:18,944 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=749, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=760, PETRI_PLACES=166, PETRI_TRANSITIONS=135} [2021-10-28 08:56:18,944 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 55 predicate places. [2021-10-28 08:56:18,945 INFO L470 AbstractCegarLoop]: Abstraction has has 166 places, 135 transitions, 760 flow [2021-10-28 08:56:18,945 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 93.125) internal successors, (745), 8 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:56:18,945 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 08:56:18,946 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 08:56:18,946 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-28 08:56:18,946 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-28 08:56:18,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:56:18,947 INFO L85 PathProgramCache]: Analyzing trace with hash -2077692411, now seen corresponding path program 1 times [2021-10-28 08:56:18,947 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:56:18,947 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644052405] [2021-10-28 08:56:18,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:56:18,948 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:56:19,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:56:19,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 08:56:19,201 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 08:56:19,201 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644052405] [2021-10-28 08:56:19,201 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644052405] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 08:56:19,201 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 08:56:19,202 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-28 08:56:19,202 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210138276] [2021-10-28 08:56:19,203 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-28 08:56:19,203 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 08:56:19,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-28 08:56:19,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-10-28 08:56:19,206 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 106 [2021-10-28 08:56:19,207 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 135 transitions, 760 flow. Second operand has 9 states, 9 states have (on average 86.0) internal successors, (774), 9 states have internal predecessors, (774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:56:19,207 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 08:56:19,207 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 106 [2021-10-28 08:56:19,208 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 08:56:19,911 INFO L129 PetriNetUnfolder]: 714/2805 cut-off events. [2021-10-28 08:56:19,911 INFO L130 PetriNetUnfolder]: For 5903/6058 co-relation queries the response was YES. [2021-10-28 08:56:19,947 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8400 conditions, 2805 events. 714/2805 cut-off events. For 5903/6058 co-relation queries the response was YES. Maximal size of possible extension queue 491. Compared 32335 event pairs, 6 based on Foata normal form. 7/2646 useless extension candidates. Maximal degree in co-relation 8315. Up to 396 conditions per place. [2021-10-28 08:56:19,953 INFO L132 encePairwiseOnDemand]: 96/106 looper letters, 21 selfloop transitions, 5 changer transitions 15/144 dead transitions. [2021-10-28 08:56:19,954 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 144 transitions, 912 flow [2021-10-28 08:56:19,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-28 08:56:19,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-10-28 08:56:19,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 871 transitions. [2021-10-28 08:56:19,957 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8216981132075472 [2021-10-28 08:56:19,957 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 871 transitions. [2021-10-28 08:56:19,958 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 871 transitions. [2021-10-28 08:56:19,958 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 08:56:19,959 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 871 transitions. [2021-10-28 08:56:19,961 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 87.1) internal successors, (871), 10 states have internal predecessors, (871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:56:19,964 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 106.0) internal successors, (1166), 11 states have internal predecessors, (1166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:56:19,965 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 106.0) internal successors, (1166), 11 states have internal predecessors, (1166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:56:19,965 INFO L186 Difference]: Start difference. First operand has 166 places, 135 transitions, 760 flow. Second operand 10 states and 871 transitions. [2021-10-28 08:56:19,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 144 transitions, 912 flow [2021-10-28 08:56:20,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 144 transitions, 768 flow, removed 36 selfloop flow, removed 21 redundant places. [2021-10-28 08:56:20,116 INFO L242 Difference]: Finished difference. Result has 153 places, 129 transitions, 609 flow [2021-10-28 08:56:20,116 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=632, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=609, PETRI_PLACES=153, PETRI_TRANSITIONS=129} [2021-10-28 08:56:20,117 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 42 predicate places. [2021-10-28 08:56:20,117 INFO L470 AbstractCegarLoop]: Abstraction has has 153 places, 129 transitions, 609 flow [2021-10-28 08:56:20,118 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 86.0) internal successors, (774), 9 states have internal predecessors, (774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:56:20,118 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 08:56:20,118 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 08:56:20,118 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-28 08:56:20,121 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-28 08:56:20,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:56:20,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1814228607, now seen corresponding path program 2 times [2021-10-28 08:56:20,122 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:56:20,122 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950222431] [2021-10-28 08:56:20,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:56:20,123 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:56:20,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:56:20,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 08:56:20,649 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 08:56:20,650 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950222431] [2021-10-28 08:56:20,650 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950222431] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 08:56:20,650 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 08:56:20,650 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-10-28 08:56:20,650 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430454452] [2021-10-28 08:56:20,651 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-10-28 08:56:20,651 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 08:56:20,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-10-28 08:56:20,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2021-10-28 08:56:20,657 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 106 [2021-10-28 08:56:20,659 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 129 transitions, 609 flow. Second operand has 14 states, 14 states have (on average 79.64285714285714) internal successors, (1115), 14 states have internal predecessors, (1115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:56:20,659 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 08:56:20,660 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 106 [2021-10-28 08:56:20,660 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 08:56:21,527 INFO L129 PetriNetUnfolder]: 327/1357 cut-off events. [2021-10-28 08:56:21,527 INFO L130 PetriNetUnfolder]: For 1595/1615 co-relation queries the response was YES. [2021-10-28 08:56:21,538 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3663 conditions, 1357 events. 327/1357 cut-off events. For 1595/1615 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 13279 event pairs, 0 based on Foata normal form. 4/1295 useless extension candidates. Maximal degree in co-relation 3632. Up to 186 conditions per place. [2021-10-28 08:56:21,542 INFO L132 encePairwiseOnDemand]: 92/106 looper letters, 20 selfloop transitions, 14 changer transitions 14/146 dead transitions. [2021-10-28 08:56:21,543 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 146 transitions, 821 flow [2021-10-28 08:56:21,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-28 08:56:21,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-10-28 08:56:21,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1136 transitions. [2021-10-28 08:56:21,547 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7654986522911051 [2021-10-28 08:56:21,547 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1136 transitions. [2021-10-28 08:56:21,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1136 transitions. [2021-10-28 08:56:21,548 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 08:56:21,548 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1136 transitions. [2021-10-28 08:56:21,552 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 81.14285714285714) internal successors, (1136), 14 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:56:21,556 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 106.0) internal successors, (1590), 15 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:56:21,557 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 106.0) internal successors, (1590), 15 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:56:21,557 INFO L186 Difference]: Start difference. First operand has 153 places, 129 transitions, 609 flow. Second operand 14 states and 1136 transitions. [2021-10-28 08:56:21,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 146 transitions, 821 flow [2021-10-28 08:56:21,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 146 transitions, 741 flow, removed 19 selfloop flow, removed 16 redundant places. [2021-10-28 08:56:21,591 INFO L242 Difference]: Finished difference. Result has 152 places, 129 transitions, 622 flow [2021-10-28 08:56:21,592 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=559, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=622, PETRI_PLACES=152, PETRI_TRANSITIONS=129} [2021-10-28 08:56:21,593 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 41 predicate places. [2021-10-28 08:56:21,593 INFO L470 AbstractCegarLoop]: Abstraction has has 152 places, 129 transitions, 622 flow [2021-10-28 08:56:21,594 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 79.64285714285714) internal successors, (1115), 14 states have internal predecessors, (1115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:56:21,594 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 08:56:21,594 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 08:56:21,594 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-28 08:56:21,595 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-28 08:56:21,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:56:21,595 INFO L85 PathProgramCache]: Analyzing trace with hash -421198147, now seen corresponding path program 3 times [2021-10-28 08:56:21,596 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:56:21,596 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20649346] [2021-10-28 08:56:21,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:56:21,596 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:56:21,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:56:22,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 08:56:22,153 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 08:56:22,153 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20649346] [2021-10-28 08:56:22,153 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20649346] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 08:56:22,153 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 08:56:22,154 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-10-28 08:56:22,154 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223422764] [2021-10-28 08:56:22,154 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-28 08:56:22,154 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 08:56:22,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-28 08:56:22,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-10-28 08:56:22,159 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 106 [2021-10-28 08:56:22,161 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 129 transitions, 622 flow. Second operand has 13 states, 13 states have (on average 77.92307692307692) internal successors, (1013), 13 states have internal predecessors, (1013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:56:22,161 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 08:56:22,161 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 106 [2021-10-28 08:56:22,162 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 08:56:22,858 INFO L129 PetriNetUnfolder]: 204/867 cut-off events. [2021-10-28 08:56:22,859 INFO L130 PetriNetUnfolder]: For 1001/1019 co-relation queries the response was YES. [2021-10-28 08:56:22,865 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2336 conditions, 867 events. 204/867 cut-off events. For 1001/1019 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 7277 event pairs, 1 based on Foata normal form. 2/817 useless extension candidates. Maximal degree in co-relation 2308. Up to 120 conditions per place. [2021-10-28 08:56:22,868 INFO L132 encePairwiseOnDemand]: 92/106 looper letters, 18 selfloop transitions, 9 changer transitions 18/137 dead transitions. [2021-10-28 08:56:22,868 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 137 transitions, 743 flow [2021-10-28 08:56:22,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-28 08:56:22,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2021-10-28 08:56:22,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1179 transitions. [2021-10-28 08:56:22,872 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7415094339622641 [2021-10-28 08:56:22,872 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1179 transitions. [2021-10-28 08:56:22,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1179 transitions. [2021-10-28 08:56:22,874 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 08:56:22,874 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1179 transitions. [2021-10-28 08:56:22,878 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 78.6) internal successors, (1179), 15 states have internal predecessors, (1179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:56:22,882 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 106.0) internal successors, (1696), 16 states have internal predecessors, (1696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:56:22,883 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 106.0) internal successors, (1696), 16 states have internal predecessors, (1696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:56:22,883 INFO L186 Difference]: Start difference. First operand has 152 places, 129 transitions, 622 flow. Second operand 15 states and 1179 transitions. [2021-10-28 08:56:22,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 137 transitions, 743 flow [2021-10-28 08:56:22,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 137 transitions, 691 flow, removed 15 selfloop flow, removed 10 redundant places. [2021-10-28 08:56:22,903 INFO L242 Difference]: Finished difference. Result has 157 places, 119 transitions, 525 flow [2021-10-28 08:56:22,904 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=580, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=525, PETRI_PLACES=157, PETRI_TRANSITIONS=119} [2021-10-28 08:56:22,904 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 46 predicate places. [2021-10-28 08:56:22,905 INFO L470 AbstractCegarLoop]: Abstraction has has 157 places, 119 transitions, 525 flow [2021-10-28 08:56:22,905 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 77.92307692307692) internal successors, (1013), 13 states have internal predecessors, (1013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 08:56:22,905 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 08:56:22,906 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 08:56:22,906 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-28 08:56:22,906 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-28 08:56:22,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:56:22,907 INFO L85 PathProgramCache]: Analyzing trace with hash 874127459, now seen corresponding path program 4 times [2021-10-28 08:56:22,907 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:56:22,907 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123393793] [2021-10-28 08:56:22,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:56:22,908 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:56:23,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 08:56:23,012 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 08:56:23,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 08:56:23,255 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 08:56:23,255 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-10-28 08:56:23,258 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 08:56:23,260 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 08:56:23,260 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION [2021-10-28 08:56:23,261 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION [2021-10-28 08:56:23,261 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION [2021-10-28 08:56:23,261 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 08:56:23,262 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-28 08:56:23,275 INFO L731 BasicCegarLoop]: Path program histogram: [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 08:56:23,283 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-10-28 08:56:23,283 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-28 08:56:23,628 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.10 08:56:23 BasicIcfg [2021-10-28 08:56:23,629 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-28 08:56:23,630 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-28 08:56:23,630 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-28 08:56:23,630 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-28 08:56:23,631 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 08:55:56" (3/4) ... [2021-10-28 08:56:23,635 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-28 08:56:23,846 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cda5133-efef-4784-9475-97e2c425e490/bin/uautomizer-UnR33cPsHg/witness.graphml [2021-10-28 08:56:23,846 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-28 08:56:23,848 INFO L168 Benchmark]: Toolchain (without parser) took 33404.81 ms. Allocated memory was 92.3 MB in the beginning and 362.8 MB in the end (delta: 270.5 MB). Free memory was 57.6 MB in the beginning and 95.0 MB in the end (delta: -37.4 MB). Peak memory consumption was 233.2 MB. Max. memory is 16.1 GB. [2021-10-28 08:56:23,849 INFO L168 Benchmark]: CDTParser took 0.38 ms. Allocated memory is still 92.3 MB. Free memory is still 58.9 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-28 08:56:23,849 INFO L168 Benchmark]: CACSL2BoogieTranslator took 969.98 ms. Allocated memory was 92.3 MB in the beginning and 113.2 MB in the end (delta: 21.0 MB). Free memory was 57.3 MB in the beginning and 77.8 MB in the end (delta: -20.5 MB). Peak memory consumption was 16.9 MB. Max. memory is 16.1 GB. [2021-10-28 08:56:23,850 INFO L168 Benchmark]: Boogie Procedure Inliner took 156.42 ms. Allocated memory is still 113.2 MB. Free memory was 77.8 MB in the beginning and 74.4 MB in the end (delta: 3.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-28 08:56:23,850 INFO L168 Benchmark]: Boogie Preprocessor took 66.82 ms. Allocated memory is still 113.2 MB. Free memory was 74.4 MB in the beginning and 71.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-28 08:56:23,851 INFO L168 Benchmark]: RCFGBuilder took 4422.47 ms. Allocated memory was 113.2 MB in the beginning and 157.3 MB in the end (delta: 44.0 MB). Free memory was 71.5 MB in the beginning and 110.0 MB in the end (delta: -38.4 MB). Peak memory consumption was 61.9 MB. Max. memory is 16.1 GB. [2021-10-28 08:56:23,852 INFO L168 Benchmark]: TraceAbstraction took 27557.00 ms. Allocated memory was 157.3 MB in the beginning and 362.8 MB in the end (delta: 205.5 MB). Free memory was 110.0 MB in the beginning and 138.0 MB in the end (delta: -28.0 MB). Peak memory consumption was 177.5 MB. Max. memory is 16.1 GB. [2021-10-28 08:56:23,852 INFO L168 Benchmark]: Witness Printer took 216.95 ms. Allocated memory is still 362.8 MB. Free memory was 138.0 MB in the beginning and 95.0 MB in the end (delta: 43.0 MB). Peak memory consumption was 41.9 MB. Max. memory is 16.1 GB. [2021-10-28 08:56:23,855 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.38 ms. Allocated memory is still 92.3 MB. Free memory is still 58.9 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 969.98 ms. Allocated memory was 92.3 MB in the beginning and 113.2 MB in the end (delta: 21.0 MB). Free memory was 57.3 MB in the beginning and 77.8 MB in the end (delta: -20.5 MB). Peak memory consumption was 16.9 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 156.42 ms. Allocated memory is still 113.2 MB. Free memory was 77.8 MB in the beginning and 74.4 MB in the end (delta: 3.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 66.82 ms. Allocated memory is still 113.2 MB. Free memory was 74.4 MB in the beginning and 71.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 4422.47 ms. Allocated memory was 113.2 MB in the beginning and 157.3 MB in the end (delta: 44.0 MB). Free memory was 71.5 MB in the beginning and 110.0 MB in the end (delta: -38.4 MB). Peak memory consumption was 61.9 MB. Max. memory is 16.1 GB. * TraceAbstraction took 27557.00 ms. Allocated memory was 157.3 MB in the beginning and 362.8 MB in the end (delta: 205.5 MB). Free memory was 110.0 MB in the beginning and 138.0 MB in the end (delta: -28.0 MB). Peak memory consumption was 177.5 MB. Max. memory is 16.1 GB. * Witness Printer took 216.95 ms. Allocated memory is still 362.8 MB. Free memory was 138.0 MB in the beginning and 95.0 MB in the end (delta: 43.0 MB). Peak memory consumption was 41.9 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: 19]: 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_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L714] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L715] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L716] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L718] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L719] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L720] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L721] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L722] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L723] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L724] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L725] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0] [L726] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L727] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L728] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0] [L729] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0] [L730] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L731] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L732] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L733] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L734] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L736] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L737] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L738] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L849] 0 pthread_t t2537; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L850] FCALL, FORK 0 pthread_create(&t2537, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L851] 0 pthread_t t2538; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L852] FCALL, FORK 0 pthread_create(&t2538, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L853] 0 pthread_t t2539; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L854] FCALL, FORK 0 pthread_create(&t2539, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L812] 3 x$w_buff1 = x$w_buff0 [L813] 3 x$w_buff0 = 2 [L814] 3 x$w_buff1_used = x$w_buff0_used [L815] 3 x$w_buff0_used = (_Bool)1 [L19] COND FALSE 3 !(!expression) [L817] 3 x$r_buff1_thd0 = x$r_buff0_thd0 [L818] 3 x$r_buff1_thd1 = x$r_buff0_thd1 [L819] 3 x$r_buff1_thd2 = x$r_buff0_thd2 [L820] 3 x$r_buff1_thd3 = x$r_buff0_thd3 [L821] 3 x$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L824] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L742] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L747] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L748] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L749] 1 x$flush_delayed = weak$$choice2 [L750] 1 x$mem_tmp = x [L751] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L751] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L752] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L752] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L753] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L753] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L754] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L754] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L755] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L756] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L757] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 __unbuffered_p0_EAX = x [L759] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L759] 1 x = x$flush_delayed ? x$mem_tmp : x [L760] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=255, 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=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L772] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=255, x=1, 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=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L775] 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) [L775] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L775] 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) [L775] 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) [L776] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L777] 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 [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L778] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L779] 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 [L782] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L783] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L784] 2 x$flush_delayed = weak$$choice2 [L785] 2 x$mem_tmp = x [L786] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L786] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L787] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L787] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0) [L787] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L787] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L788] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L788] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1) [L788] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L788] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L789] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L789] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used) [L789] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L789] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L790] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L790] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L790] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L790] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L791] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L791] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2) [L791] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L791] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L792] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L792] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L792] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L792] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L793] 2 __unbuffered_p1_EAX = x [L794] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L794] 2 x = x$flush_delayed ? x$mem_tmp : x [L795] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=67, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] 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) [L798] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L798] 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) [L798] 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) [L799] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L799] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L800] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L800] 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 [L801] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L801] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L802] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L802] 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 [L827] 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) [L827] 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) [L828] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L828] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L829] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L829] 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 [L830] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L830] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L831] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L831] 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 [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=67, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L834] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=67, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L805] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=67, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L856] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=67, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L4] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=67, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L860] 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) [L860] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L860] 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) [L860] 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) [L861] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L861] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L862] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L862] 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 [L863] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L863] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L864] 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 [L867] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L868] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L869] 0 x$flush_delayed = weak$$choice2 [L870] 0 x$mem_tmp = x [L871] 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) [L871] 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) [L872] 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)) [L872] 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)) [L873] 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)) [L873] 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)) [L874] 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)) [L874] 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)) [L875] 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)) [L875] 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)) [L876] 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)) [L876] 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)) [L877] 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)) [L877] 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)) [L878] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1) [L879] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L879] 0 x = x$flush_delayed ? x$mem_tmp : x [L880] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=68, 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=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L19] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=68, 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=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L19] 0 reach_error() VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=68, 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=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - UnprovableResult [Line: 19]: 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: 854]: 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: 850]: 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: 852]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 133 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 26.9s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 17.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 220 SDtfs, 739 SDslu, 984 SDs, 0 SdLazy, 2036 SolverSat, 691 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 330 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 286 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 938 ImplicationChecksByTransitivity, 4.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=927occurred in iteration=14, InterpolantAutomatonStates: 236, 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.8s SatisfiabilityAnalysisTime, 6.1s InterpolantComputationTime, 1430 NumberOfCodeBlocks, 1430 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1330 ConstructedInterpolants, 0 QuantifiedInterpolants, 8914 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-10-28 08:56:23,927 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cda5133-efef-4784-9475-97e2c425e490/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...