./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe023_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 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea2ba402-9649-46ef-b6a7-8adfbcb688a3/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea2ba402-9649-46ef-b6a7-8adfbcb688a3/bin/uautomizer-DrprNOufMa/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea2ba402-9649-46ef-b6a7-8adfbcb688a3/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea2ba402-9649-46ef-b6a7-8adfbcb688a3/bin/uautomizer-DrprNOufMa/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea2ba402-9649-46ef-b6a7-8adfbcb688a3/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea2ba402-9649-46ef-b6a7-8adfbcb688a3/bin/uautomizer-DrprNOufMa --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2b11be791089901ed5596869d293da40c27b85c1e89c21a55cf2181db7595687 --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-12-06 18:30:41,214 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-06 18:30:41,216 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-06 18:30:41,247 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-06 18:30:41,248 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-06 18:30:41,249 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-06 18:30:41,251 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-06 18:30:41,253 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-06 18:30:41,255 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-06 18:30:41,256 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-06 18:30:41,257 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-06 18:30:41,259 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-06 18:30:41,259 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-06 18:30:41,260 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-06 18:30:41,262 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-06 18:30:41,263 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-06 18:30:41,264 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-06 18:30:41,265 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-06 18:30:41,267 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-06 18:30:41,269 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-06 18:30:41,271 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-06 18:30:41,273 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-06 18:30:41,274 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-06 18:30:41,275 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-06 18:30:41,279 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-06 18:30:41,279 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-06 18:30:41,279 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-06 18:30:41,280 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-06 18:30:41,281 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-06 18:30:41,282 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-06 18:30:41,282 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-06 18:30:41,283 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-06 18:30:41,284 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-06 18:30:41,284 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-06 18:30:41,285 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-06 18:30:41,285 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-06 18:30:41,286 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-06 18:30:41,286 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-06 18:30:41,286 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-06 18:30:41,287 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-06 18:30:41,287 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-06 18:30:41,288 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea2ba402-9649-46ef-b6a7-8adfbcb688a3/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-06 18:30:41,311 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-06 18:30:41,311 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-06 18:30:41,311 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-06 18:30:41,311 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-06 18:30:41,312 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-06 18:30:41,312 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-06 18:30:41,313 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-06 18:30:41,313 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-06 18:30:41,313 INFO L138 SettingsManager]: * Use SBE=true [2021-12-06 18:30:41,313 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-06 18:30:41,314 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-06 18:30:41,314 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-06 18:30:41,314 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-06 18:30:41,314 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-06 18:30:41,314 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-06 18:30:41,314 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-06 18:30:41,315 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-06 18:30:41,315 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-06 18:30:41,315 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-06 18:30:41,315 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-06 18:30:41,315 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-06 18:30:41,316 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-06 18:30:41,316 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-06 18:30:41,316 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-06 18:30:41,316 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 18:30:41,316 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-06 18:30:41,316 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-06 18:30:41,317 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-06 18:30:41,317 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-06 18:30:41,317 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-06 18:30:41,317 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-06 18:30:41,317 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-06 18:30:41,317 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-06 18:30:41,318 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-06 18:30:41,318 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_ea2ba402-9649-46ef-b6a7-8adfbcb688a3/bin/uautomizer-DrprNOufMa/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea2ba402-9649-46ef-b6a7-8adfbcb688a3/bin/uautomizer-DrprNOufMa Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2b11be791089901ed5596869d293da40c27b85c1e89c21a55cf2181db7595687 [2021-12-06 18:30:41,508 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-06 18:30:41,523 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-06 18:30:41,525 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-06 18:30:41,526 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-06 18:30:41,526 INFO L275 PluginConnector]: CDTParser initialized [2021-12-06 18:30:41,527 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea2ba402-9649-46ef-b6a7-8adfbcb688a3/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/pthread-wmm/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2021-12-06 18:30:41,567 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea2ba402-9649-46ef-b6a7-8adfbcb688a3/bin/uautomizer-DrprNOufMa/data/a34e3b00f/f52cda2a2d0d4d538da394863a3a5335/FLAG99fe87e63 [2021-12-06 18:30:42,002 INFO L306 CDTParser]: Found 1 translation units. [2021-12-06 18:30:42,003 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea2ba402-9649-46ef-b6a7-8adfbcb688a3/sv-benchmarks/c/pthread-wmm/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2021-12-06 18:30:42,014 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea2ba402-9649-46ef-b6a7-8adfbcb688a3/bin/uautomizer-DrprNOufMa/data/a34e3b00f/f52cda2a2d0d4d538da394863a3a5335/FLAG99fe87e63 [2021-12-06 18:30:42,024 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea2ba402-9649-46ef-b6a7-8adfbcb688a3/bin/uautomizer-DrprNOufMa/data/a34e3b00f/f52cda2a2d0d4d538da394863a3a5335 [2021-12-06 18:30:42,026 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-06 18:30:42,028 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-06 18:30:42,029 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-06 18:30:42,029 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-06 18:30:42,033 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-06 18:30:42,033 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:30:42" (1/1) ... [2021-12-06 18:30:42,034 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@218962a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:30:42, skipping insertion in model container [2021-12-06 18:30:42,035 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:30:42" (1/1) ... [2021-12-06 18:30:42,041 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-06 18:30:42,074 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-06 18:30:42,204 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea2ba402-9649-46ef-b6a7-8adfbcb688a3/sv-benchmarks/c/pthread-wmm/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2021-12-06 18:30:42,344 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 18:30:42,350 INFO L203 MainTranslator]: Completed pre-run [2021-12-06 18:30:42,359 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea2ba402-9649-46ef-b6a7-8adfbcb688a3/sv-benchmarks/c/pthread-wmm/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2021-12-06 18:30:42,406 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 18:30:42,433 INFO L208 MainTranslator]: Completed translation [2021-12-06 18:30:42,433 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:30:42 WrapperNode [2021-12-06 18:30:42,433 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-06 18:30:42,434 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-06 18:30:42,434 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-06 18:30:42,434 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-06 18:30:42,439 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:30:42" (1/1) ... [2021-12-06 18:30:42,455 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:30:42" (1/1) ... [2021-12-06 18:30:42,479 INFO L137 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 275 [2021-12-06 18:30:42,480 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-06 18:30:42,480 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-06 18:30:42,480 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-06 18:30:42,480 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-06 18:30:42,487 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:30:42" (1/1) ... [2021-12-06 18:30:42,487 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:30:42" (1/1) ... [2021-12-06 18:30:42,491 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:30:42" (1/1) ... [2021-12-06 18:30:42,492 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:30:42" (1/1) ... [2021-12-06 18:30:42,503 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:30:42" (1/1) ... [2021-12-06 18:30:42,507 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:30:42" (1/1) ... [2021-12-06 18:30:42,510 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:30:42" (1/1) ... [2021-12-06 18:30:42,515 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-06 18:30:42,516 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-06 18:30:42,516 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-06 18:30:42,516 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-06 18:30:42,517 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:30:42" (1/1) ... [2021-12-06 18:30:42,523 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 18:30:42,535 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea2ba402-9649-46ef-b6a7-8adfbcb688a3/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 18:30:42,547 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea2ba402-9649-46ef-b6a7-8adfbcb688a3/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-06 18:30:42,549 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea2ba402-9649-46ef-b6a7-8adfbcb688a3/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-06 18:30:42,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-06 18:30:42,585 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-12-06 18:30:42,585 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-06 18:30:42,585 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-06 18:30:42,585 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-06 18:30:42,585 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-12-06 18:30:42,585 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-12-06 18:30:42,585 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-12-06 18:30:42,585 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-12-06 18:30:42,585 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-12-06 18:30:42,586 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-12-06 18:30:42,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-06 18:30:42,586 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-12-06 18:30:42,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-06 18:30:42,586 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-06 18:30:42,588 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-12-06 18:30:42,694 INFO L236 CfgBuilder]: Building ICFG [2021-12-06 18:30:42,695 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-06 18:30:43,196 INFO L277 CfgBuilder]: Performing block encoding [2021-12-06 18:30:43,600 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-06 18:30:43,600 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-06 18:30:43,602 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:30:43 BoogieIcfgContainer [2021-12-06 18:30:43,603 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-06 18:30:43,605 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-06 18:30:43,605 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-06 18:30:43,608 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-06 18:30:43,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 06:30:42" (1/3) ... [2021-12-06 18:30:43,609 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@676f5a41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:30:43, skipping insertion in model container [2021-12-06 18:30:43,609 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:30:42" (2/3) ... [2021-12-06 18:30:43,609 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@676f5a41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:30:43, skipping insertion in model container [2021-12-06 18:30:43,610 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:30:43" (3/3) ... [2021-12-06 18:30:43,611 INFO L111 eAbstractionObserver]: Analyzing ICFG safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2021-12-06 18:30:43,616 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-12-06 18:30:43,617 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-06 18:30:43,617 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-12-06 18:30:43,617 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-12-06 18:30:43,654 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,654 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,654 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,655 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,655 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,655 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,655 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,655 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,655 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,655 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,656 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,656 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,656 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,656 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,656 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,657 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,657 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,657 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,657 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,657 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,657 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,657 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,658 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,658 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,658 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,658 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,658 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,658 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,659 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,659 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,659 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,659 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,659 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,659 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,659 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,659 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,659 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,660 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,660 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,660 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,660 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,660 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,660 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,660 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,660 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,660 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,661 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,661 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,661 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,661 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,661 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,661 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,661 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,661 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,662 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,662 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,662 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,662 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,662 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,662 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,663 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,664 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,664 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,664 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,664 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,664 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,664 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,664 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,664 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,665 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,665 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,665 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,665 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,665 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,665 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,665 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,665 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,666 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,666 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,666 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,666 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,666 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,666 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,666 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,666 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,667 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,667 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,667 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,667 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,667 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,667 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,667 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,668 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,668 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,668 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,668 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,668 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,668 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,669 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,670 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,670 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,670 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,670 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,670 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,670 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,671 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,671 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,671 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,671 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,671 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,671 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,671 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,672 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,672 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,672 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,672 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,672 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,673 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,673 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,673 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,673 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,673 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,673 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,673 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,673 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,674 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,674 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,674 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,674 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,674 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,674 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,675 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,675 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,675 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,675 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,675 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,675 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,675 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,675 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,676 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,676 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,676 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,676 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,676 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,676 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,677 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,677 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,677 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,677 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,677 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,678 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,678 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,678 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,678 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,678 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,678 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,679 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,679 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,679 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,679 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,679 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,679 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,679 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,679 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,680 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,680 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,680 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,680 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,680 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,680 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,680 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,680 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,680 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,681 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,681 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,681 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,681 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,681 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,681 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,681 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,681 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,682 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,682 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,682 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,682 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,682 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,682 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,682 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,682 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,682 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,683 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,683 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,683 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,683 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,683 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,683 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,684 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,685 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,685 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,685 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,685 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,685 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,685 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,685 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,685 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,686 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,686 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,686 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,686 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,686 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,686 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,686 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,686 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,686 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,686 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,687 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,687 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,687 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,687 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,687 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,687 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,687 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,687 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,687 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,687 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,688 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,688 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,688 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,688 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,688 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,688 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,688 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,688 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,688 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,690 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,690 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,690 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,690 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,690 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,690 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,691 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,691 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,691 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,691 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,691 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,691 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,691 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,692 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,692 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,692 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,692 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,692 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,695 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,695 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,696 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,696 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,696 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,696 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,696 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,696 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,696 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,696 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,697 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,697 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,698 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,698 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,698 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,698 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,698 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,698 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,698 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,699 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,699 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,699 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,699 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,699 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,699 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,699 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,700 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,700 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,700 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,700 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,700 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,700 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,700 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,701 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,701 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,701 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,701 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,701 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,701 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,701 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,701 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,702 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,702 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,702 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,702 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,703 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,703 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,703 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,703 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,703 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,703 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,704 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,704 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,704 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,704 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,704 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,704 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,704 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,705 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,705 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,705 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,705 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,705 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,705 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,705 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,706 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,706 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,714 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,714 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,714 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,714 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,714 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,714 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,714 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,715 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,715 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,715 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,715 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,715 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,715 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,715 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,716 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,716 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,716 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 18:30:43,716 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-12-06 18:30:43,763 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-06 18:30:43,770 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-06 18:30:43,770 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-12-06 18:30:43,782 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 124 places, 116 transitions, 247 flow [2021-12-06 18:30:43,829 INFO L129 PetriNetUnfolder]: 2/113 cut-off events. [2021-12-06 18:30:43,829 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-12-06 18:30:43,833 INFO L84 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 113 events. 2/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 59 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2021-12-06 18:30:43,833 INFO L82 GeneralOperation]: Start removeDead. Operand has 124 places, 116 transitions, 247 flow [2021-12-06 18:30:43,838 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 121 places, 113 transitions, 235 flow [2021-12-06 18:30:43,851 INFO L129 PetriNetUnfolder]: 0/61 cut-off events. [2021-12-06 18:30:43,852 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-12-06 18:30:43,852 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 18:30:43,852 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] [2021-12-06 18:30:43,853 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-06 18:30:43,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:30:43,858 INFO L85 PathProgramCache]: Analyzing trace with hash -16800889, now seen corresponding path program 1 times [2021-12-06 18:30:43,866 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:30:43,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140806158] [2021-12-06 18:30:43,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:30:43,867 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:30:43,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:30:44,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 18:30:44,089 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:30:44,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140806158] [2021-12-06 18:30:44,090 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140806158] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:30:44,090 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:30:44,090 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-06 18:30:44,091 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698892734] [2021-12-06 18:30:44,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:30:44,097 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 18:30:44,097 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:30:44,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 18:30:44,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 18:30:44,121 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 116 [2021-12-06 18:30:44,125 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 113 transitions, 235 flow. Second operand has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:30:44,125 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 18:30:44,125 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 116 [2021-12-06 18:30:44,126 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 18:30:44,380 INFO L129 PetriNetUnfolder]: 210/818 cut-off events. [2021-12-06 18:30:44,380 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2021-12-06 18:30:44,384 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1192 conditions, 818 events. 210/818 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 5120 event pairs, 46 based on Foata normal form. 39/810 useless extension candidates. Maximal degree in co-relation 1140. Up to 245 conditions per place. [2021-12-06 18:30:44,389 INFO L132 encePairwiseOnDemand]: 111/116 looper letters, 19 selfloop transitions, 2 changer transitions 0/117 dead transitions. [2021-12-06 18:30:44,389 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 117 transitions, 288 flow [2021-12-06 18:30:44,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 18:30:44,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-12-06 18:30:44,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 323 transitions. [2021-12-06 18:30:44,400 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9281609195402298 [2021-12-06 18:30:44,400 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 323 transitions. [2021-12-06 18:30:44,400 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 323 transitions. [2021-12-06 18:30:44,402 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 18:30:44,403 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 323 transitions. [2021-12-06 18:30:44,407 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:30:44,411 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 116.0) internal successors, (464), 4 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:30:44,412 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 116.0) internal successors, (464), 4 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:30:44,413 INFO L186 Difference]: Start difference. First operand has 121 places, 113 transitions, 235 flow. Second operand 3 states and 323 transitions. [2021-12-06 18:30:44,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 117 transitions, 288 flow [2021-12-06 18:30:44,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 117 transitions, 284 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-12-06 18:30:44,421 INFO L242 Difference]: Finished difference. Result has 118 places, 109 transitions, 228 flow [2021-12-06 18:30:44,422 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=228, PETRI_PLACES=118, PETRI_TRANSITIONS=109} [2021-12-06 18:30:44,425 INFO L334 CegarLoopForPetriNet]: 121 programPoint places, -3 predicate places. [2021-12-06 18:30:44,425 INFO L470 AbstractCegarLoop]: Abstraction has has 118 places, 109 transitions, 228 flow [2021-12-06 18:30:44,425 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:30:44,425 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 18:30:44,425 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-12-06 18:30:44,426 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-06 18:30:44,426 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-06 18:30:44,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:30:44,427 INFO L85 PathProgramCache]: Analyzing trace with hash 659796401, now seen corresponding path program 1 times [2021-12-06 18:30:44,427 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:30:44,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795231293] [2021-12-06 18:30:44,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:30:44,427 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:30:44,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:30:44,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 18:30:44,655 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:30:44,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795231293] [2021-12-06 18:30:44,655 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795231293] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:30:44,655 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:30:44,656 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 18:30:44,656 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49815082] [2021-12-06 18:30:44,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:30:44,657 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 18:30:44,657 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:30:44,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 18:30:44,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-06 18:30:44,660 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 116 [2021-12-06 18:30:44,661 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 109 transitions, 228 flow. Second operand has 6 states, 6 states have (on average 94.83333333333333) internal successors, (569), 6 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:30:44,661 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 18:30:44,661 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 116 [2021-12-06 18:30:44,661 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 18:30:45,198 INFO L129 PetriNetUnfolder]: 690/1888 cut-off events. [2021-12-06 18:30:45,198 INFO L130 PetriNetUnfolder]: For 124/124 co-relation queries the response was YES. [2021-12-06 18:30:45,202 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3118 conditions, 1888 events. 690/1888 cut-off events. For 124/124 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 13603 event pairs, 312 based on Foata normal form. 0/1820 useless extension candidates. Maximal degree in co-relation 3066. Up to 429 conditions per place. [2021-12-06 18:30:45,207 INFO L132 encePairwiseOnDemand]: 110/116 looper letters, 23 selfloop transitions, 2 changer transitions 54/158 dead transitions. [2021-12-06 18:30:45,207 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 158 transitions, 480 flow [2021-12-06 18:30:45,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-06 18:30:45,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-06 18:30:45,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 907 transitions. [2021-12-06 18:30:45,213 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8687739463601533 [2021-12-06 18:30:45,213 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 907 transitions. [2021-12-06 18:30:45,213 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 907 transitions. [2021-12-06 18:30:45,214 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 18:30:45,214 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 907 transitions. [2021-12-06 18:30:45,218 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 100.77777777777777) internal successors, (907), 9 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:30:45,223 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 116.0) internal successors, (1160), 10 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:30:45,225 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 116.0) internal successors, (1160), 10 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:30:45,225 INFO L186 Difference]: Start difference. First operand has 118 places, 109 transitions, 228 flow. Second operand 9 states and 907 transitions. [2021-12-06 18:30:45,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 158 transitions, 480 flow [2021-12-06 18:30:45,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 158 transitions, 462 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-12-06 18:30:45,231 INFO L242 Difference]: Finished difference. Result has 131 places, 97 transitions, 220 flow [2021-12-06 18:30:45,232 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=220, PETRI_PLACES=131, PETRI_TRANSITIONS=97} [2021-12-06 18:30:45,233 INFO L334 CegarLoopForPetriNet]: 121 programPoint places, 10 predicate places. [2021-12-06 18:30:45,233 INFO L470 AbstractCegarLoop]: Abstraction has has 131 places, 97 transitions, 220 flow [2021-12-06 18:30:45,234 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 94.83333333333333) internal successors, (569), 6 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:30:45,234 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 18:30:45,234 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 18:30:45,234 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-06 18:30:45,234 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-06 18:30:45,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:30:45,235 INFO L85 PathProgramCache]: Analyzing trace with hash -726916817, now seen corresponding path program 1 times [2021-12-06 18:30:45,235 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:30:45,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651421934] [2021-12-06 18:30:45,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:30:45,236 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:30:45,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:30:45,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 18:30:45,384 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:30:45,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651421934] [2021-12-06 18:30:45,384 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651421934] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:30:45,384 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:30:45,384 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 18:30:45,384 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122945721] [2021-12-06 18:30:45,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:30:45,385 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 18:30:45,385 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:30:45,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 18:30:45,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-06 18:30:45,386 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 116 [2021-12-06 18:30:45,387 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 97 transitions, 220 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-12-06 18:30:45,387 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 18:30:45,387 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 116 [2021-12-06 18:30:45,387 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 18:30:45,771 INFO L129 PetriNetUnfolder]: 512/1064 cut-off events. [2021-12-06 18:30:45,772 INFO L130 PetriNetUnfolder]: For 256/256 co-relation queries the response was YES. [2021-12-06 18:30:45,774 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2205 conditions, 1064 events. 512/1064 cut-off events. For 256/256 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5693 event pairs, 103 based on Foata normal form. 24/1042 useless extension candidates. Maximal degree in co-relation 2146. Up to 466 conditions per place. [2021-12-06 18:30:45,780 INFO L132 encePairwiseOnDemand]: 110/116 looper letters, 23 selfloop transitions, 2 changer transitions 34/137 dead transitions. [2021-12-06 18:30:45,780 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 137 transitions, 439 flow [2021-12-06 18:30:45,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-06 18:30:45,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-06 18:30:45,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 889 transitions. [2021-12-06 18:30:45,784 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8515325670498084 [2021-12-06 18:30:45,785 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 889 transitions. [2021-12-06 18:30:45,785 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 889 transitions. [2021-12-06 18:30:45,785 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 18:30:45,786 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 889 transitions. [2021-12-06 18:30:45,789 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 98.77777777777777) internal successors, (889), 9 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:30:45,792 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 116.0) internal successors, (1160), 10 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:30:45,793 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 116.0) internal successors, (1160), 10 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:30:45,793 INFO L186 Difference]: Start difference. First operand has 131 places, 97 transitions, 220 flow. Second operand 9 states and 889 transitions. [2021-12-06 18:30:45,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 137 transitions, 439 flow [2021-12-06 18:30:45,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 137 transitions, 405 flow, removed 14 selfloop flow, removed 8 redundant places. [2021-12-06 18:30:45,805 INFO L242 Difference]: Finished difference. Result has 120 places, 97 transitions, 224 flow [2021-12-06 18:30:45,806 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=224, PETRI_PLACES=120, PETRI_TRANSITIONS=97} [2021-12-06 18:30:45,806 INFO L334 CegarLoopForPetriNet]: 121 programPoint places, -1 predicate places. [2021-12-06 18:30:45,807 INFO L470 AbstractCegarLoop]: Abstraction has has 120 places, 97 transitions, 224 flow [2021-12-06 18:30:45,807 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-12-06 18:30:45,807 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 18:30:45,807 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-12-06 18:30:45,808 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-06 18:30:45,808 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-06 18:30:45,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:30:45,808 INFO L85 PathProgramCache]: Analyzing trace with hash -74082386, now seen corresponding path program 1 times [2021-12-06 18:30:45,809 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:30:45,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713512946] [2021-12-06 18:30:45,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:30:45,809 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:30:45,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:30:45,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 18:30:45,991 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:30:45,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713512946] [2021-12-06 18:30:45,991 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713512946] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:30:45,991 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:30:45,991 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 18:30:45,991 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087968822] [2021-12-06 18:30:45,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:30:45,992 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 18:30:45,992 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:30:45,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 18:30:45,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 18:30:45,993 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 116 [2021-12-06 18:30:45,994 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 97 transitions, 224 flow. Second operand has 7 states, 7 states have (on average 92.14285714285714) internal successors, (645), 7 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:30:45,994 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 18:30:45,994 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 116 [2021-12-06 18:30:45,994 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 18:30:46,478 INFO L129 PetriNetUnfolder]: 604/1340 cut-off events. [2021-12-06 18:30:46,479 INFO L130 PetriNetUnfolder]: For 293/293 co-relation queries the response was YES. [2021-12-06 18:30:46,482 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2706 conditions, 1340 events. 604/1340 cut-off events. For 293/293 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 7879 event pairs, 170 based on Foata normal form. 24/1285 useless extension candidates. Maximal degree in co-relation 2645. Up to 293 conditions per place. [2021-12-06 18:30:46,486 INFO L132 encePairwiseOnDemand]: 108/116 looper letters, 27 selfloop transitions, 4 changer transitions 40/147 dead transitions. [2021-12-06 18:30:46,486 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 147 transitions, 497 flow [2021-12-06 18:30:46,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 18:30:46,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-06 18:30:46,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 973 transitions. [2021-12-06 18:30:46,489 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8387931034482758 [2021-12-06 18:30:46,489 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 973 transitions. [2021-12-06 18:30:46,489 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 973 transitions. [2021-12-06 18:30:46,489 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 18:30:46,490 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 973 transitions. [2021-12-06 18:30:46,492 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 97.3) internal successors, (973), 10 states have internal predecessors, (973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:30:46,494 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 116.0) internal successors, (1276), 11 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:30:46,495 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 116.0) internal successors, (1276), 11 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:30:46,495 INFO L186 Difference]: Start difference. First operand has 120 places, 97 transitions, 224 flow. Second operand 10 states and 973 transitions. [2021-12-06 18:30:46,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 147 transitions, 497 flow [2021-12-06 18:30:46,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 147 transitions, 463 flow, removed 14 selfloop flow, removed 8 redundant places. [2021-12-06 18:30:46,510 INFO L242 Difference]: Finished difference. Result has 123 places, 97 transitions, 238 flow [2021-12-06 18:30:46,510 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=238, PETRI_PLACES=123, PETRI_TRANSITIONS=97} [2021-12-06 18:30:46,511 INFO L334 CegarLoopForPetriNet]: 121 programPoint places, 2 predicate places. [2021-12-06 18:30:46,511 INFO L470 AbstractCegarLoop]: Abstraction has has 123 places, 97 transitions, 238 flow [2021-12-06 18:30:46,512 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 92.14285714285714) internal successors, (645), 7 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:30:46,512 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 18:30:46,512 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 18:30:46,512 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-06 18:30:46,512 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-06 18:30:46,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:30:46,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1217105744, now seen corresponding path program 1 times [2021-12-06 18:30:46,513 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:30:46,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665821103] [2021-12-06 18:30:46,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:30:46,513 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:30:46,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:30:46,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 18:30:46,710 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:30:46,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665821103] [2021-12-06 18:30:46,710 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665821103] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:30:46,710 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:30:46,710 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-06 18:30:46,710 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196783734] [2021-12-06 18:30:46,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:30:46,711 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-06 18:30:46,711 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:30:46,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-06 18:30:46,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-12-06 18:30:46,712 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 116 [2021-12-06 18:30:46,713 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 97 transitions, 238 flow. Second operand has 9 states, 9 states have (on average 89.22222222222223) internal successors, (803), 9 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:30:46,713 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 18:30:46,713 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 116 [2021-12-06 18:30:46,713 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 18:30:47,211 INFO L129 PetriNetUnfolder]: 383/953 cut-off events. [2021-12-06 18:30:47,211 INFO L130 PetriNetUnfolder]: For 299/302 co-relation queries the response was YES. [2021-12-06 18:30:47,214 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1913 conditions, 953 events. 383/953 cut-off events. For 299/302 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 4997 event pairs, 132 based on Foata normal form. 17/905 useless extension candidates. Maximal degree in co-relation 1844. Up to 376 conditions per place. [2021-12-06 18:30:47,217 INFO L132 encePairwiseOnDemand]: 102/116 looper letters, 27 selfloop transitions, 10 changer transitions 31/141 dead transitions. [2021-12-06 18:30:47,217 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 141 transitions, 491 flow [2021-12-06 18:30:47,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-06 18:30:47,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-12-06 18:30:47,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1114 transitions. [2021-12-06 18:30:47,221 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8002873563218391 [2021-12-06 18:30:47,221 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1114 transitions. [2021-12-06 18:30:47,221 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1114 transitions. [2021-12-06 18:30:47,221 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 18:30:47,221 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1114 transitions. [2021-12-06 18:30:47,224 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 92.83333333333333) internal successors, (1114), 12 states have internal predecessors, (1114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:30:47,226 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 116.0) internal successors, (1508), 13 states have internal predecessors, (1508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:30:47,227 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 116.0) internal successors, (1508), 13 states have internal predecessors, (1508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:30:47,227 INFO L186 Difference]: Start difference. First operand has 123 places, 97 transitions, 238 flow. Second operand 12 states and 1114 transitions. [2021-12-06 18:30:47,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 141 transitions, 491 flow [2021-12-06 18:30:47,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 141 transitions, 445 flow, removed 18 selfloop flow, removed 10 redundant places. [2021-12-06 18:30:47,231 INFO L242 Difference]: Finished difference. Result has 126 places, 104 transitions, 314 flow [2021-12-06 18:30:47,231 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=314, PETRI_PLACES=126, PETRI_TRANSITIONS=104} [2021-12-06 18:30:47,232 INFO L334 CegarLoopForPetriNet]: 121 programPoint places, 5 predicate places. [2021-12-06 18:30:47,232 INFO L470 AbstractCegarLoop]: Abstraction has has 126 places, 104 transitions, 314 flow [2021-12-06 18:30:47,233 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 89.22222222222223) internal successors, (803), 9 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:30:47,233 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 18:30:47,233 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 18:30:47,233 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-06 18:30:47,233 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-06 18:30:47,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:30:47,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1109589376, now seen corresponding path program 2 times [2021-12-06 18:30:47,233 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:30:47,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290700330] [2021-12-06 18:30:47,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:30:47,234 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:30:47,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:30:47,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 18:30:47,447 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:30:47,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290700330] [2021-12-06 18:30:47,447 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290700330] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:30:47,448 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:30:47,448 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-12-06 18:30:47,448 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669225195] [2021-12-06 18:30:47,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:30:47,448 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-06 18:30:47,449 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:30:47,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-06 18:30:47,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2021-12-06 18:30:47,450 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 116 [2021-12-06 18:30:47,452 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 104 transitions, 314 flow. Second operand has 14 states, 14 states have (on average 87.5) internal successors, (1225), 14 states have internal predecessors, (1225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:30:47,452 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 18:30:47,452 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 116 [2021-12-06 18:30:47,452 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 18:30:47,953 INFO L129 PetriNetUnfolder]: 369/1005 cut-off events. [2021-12-06 18:30:47,953 INFO L130 PetriNetUnfolder]: For 1992/2068 co-relation queries the response was YES. [2021-12-06 18:30:47,956 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3325 conditions, 1005 events. 369/1005 cut-off events. For 1992/2068 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 5642 event pairs, 107 based on Foata normal form. 14/948 useless extension candidates. Maximal degree in co-relation 3255. Up to 429 conditions per place. [2021-12-06 18:30:47,961 INFO L132 encePairwiseOnDemand]: 100/116 looper letters, 37 selfloop transitions, 13 changer transitions 28/150 dead transitions. [2021-12-06 18:30:47,961 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 150 transitions, 817 flow [2021-12-06 18:30:47,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-06 18:30:47,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-12-06 18:30:47,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1279 transitions. [2021-12-06 18:30:47,964 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7875615763546798 [2021-12-06 18:30:47,964 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1279 transitions. [2021-12-06 18:30:47,964 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1279 transitions. [2021-12-06 18:30:47,965 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 18:30:47,965 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1279 transitions. [2021-12-06 18:30:47,968 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 91.35714285714286) internal successors, (1279), 14 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:30:47,971 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 116.0) internal successors, (1740), 15 states have internal predecessors, (1740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:30:47,971 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 116.0) internal successors, (1740), 15 states have internal predecessors, (1740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:30:47,971 INFO L186 Difference]: Start difference. First operand has 126 places, 104 transitions, 314 flow. Second operand 14 states and 1279 transitions. [2021-12-06 18:30:47,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 150 transitions, 817 flow [2021-12-06 18:30:47,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 150 transitions, 797 flow, removed 7 selfloop flow, removed 6 redundant places. [2021-12-06 18:30:47,976 INFO L242 Difference]: Finished difference. Result has 135 places, 111 transitions, 429 flow [2021-12-06 18:30:47,976 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=303, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=429, PETRI_PLACES=135, PETRI_TRANSITIONS=111} [2021-12-06 18:30:47,977 INFO L334 CegarLoopForPetriNet]: 121 programPoint places, 14 predicate places. [2021-12-06 18:30:47,977 INFO L470 AbstractCegarLoop]: Abstraction has has 135 places, 111 transitions, 429 flow [2021-12-06 18:30:47,978 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 87.5) internal successors, (1225), 14 states have internal predecessors, (1225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:30:47,978 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 18:30:47,978 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 18:30:47,978 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-06 18:30:47,978 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-06 18:30:47,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:30:47,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1737122624, now seen corresponding path program 3 times [2021-12-06 18:30:47,978 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:30:47,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202656251] [2021-12-06 18:30:47,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:30:47,979 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:30:48,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:30:48,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 18:30:48,201 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:30:48,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202656251] [2021-12-06 18:30:48,201 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202656251] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:30:48,202 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:30:48,202 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-06 18:30:48,202 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939006947] [2021-12-06 18:30:48,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:30:48,203 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-06 18:30:48,203 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:30:48,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-06 18:30:48,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-12-06 18:30:48,205 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 116 [2021-12-06 18:30:48,207 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 111 transitions, 429 flow. Second operand has 12 states, 12 states have (on average 89.58333333333333) internal successors, (1075), 12 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:30:48,207 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 18:30:48,207 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 116 [2021-12-06 18:30:48,207 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 18:30:48,667 INFO L129 PetriNetUnfolder]: 394/1009 cut-off events. [2021-12-06 18:30:48,667 INFO L130 PetriNetUnfolder]: For 6068/6527 co-relation queries the response was YES. [2021-12-06 18:30:48,670 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4644 conditions, 1009 events. 394/1009 cut-off events. For 6068/6527 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 5934 event pairs, 95 based on Foata normal form. 40/997 useless extension candidates. Maximal degree in co-relation 4569. Up to 421 conditions per place. [2021-12-06 18:30:48,676 INFO L132 encePairwiseOnDemand]: 104/116 looper letters, 37 selfloop transitions, 14 changer transitions 31/156 dead transitions. [2021-12-06 18:30:48,676 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 156 transitions, 1144 flow [2021-12-06 18:30:48,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-06 18:30:48,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-12-06 18:30:48,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1210 transitions. [2021-12-06 18:30:48,680 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8023872679045093 [2021-12-06 18:30:48,680 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1210 transitions. [2021-12-06 18:30:48,680 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1210 transitions. [2021-12-06 18:30:48,680 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 18:30:48,681 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1210 transitions. [2021-12-06 18:30:48,683 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 93.07692307692308) internal successors, (1210), 13 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:30:48,685 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 116.0) internal successors, (1624), 14 states have internal predecessors, (1624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:30:48,686 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 116.0) internal successors, (1624), 14 states have internal predecessors, (1624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:30:48,686 INFO L186 Difference]: Start difference. First operand has 135 places, 111 transitions, 429 flow. Second operand 13 states and 1210 transitions. [2021-12-06 18:30:48,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 156 transitions, 1144 flow [2021-12-06 18:30:48,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 156 transitions, 932 flow, removed 99 selfloop flow, removed 10 redundant places. [2021-12-06 18:30:48,693 INFO L242 Difference]: Finished difference. Result has 138 places, 117 transitions, 494 flow [2021-12-06 18:30:48,693 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=494, PETRI_PLACES=138, PETRI_TRANSITIONS=117} [2021-12-06 18:30:48,694 INFO L334 CegarLoopForPetriNet]: 121 programPoint places, 17 predicate places. [2021-12-06 18:30:48,694 INFO L470 AbstractCegarLoop]: Abstraction has has 138 places, 117 transitions, 494 flow [2021-12-06 18:30:48,695 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 89.58333333333333) internal successors, (1075), 12 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:30:48,695 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 18:30:48,695 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 18:30:48,695 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-06 18:30:48,695 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-06 18:30:48,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:30:48,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1243850095, now seen corresponding path program 1 times [2021-12-06 18:30:48,696 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:30:48,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660942445] [2021-12-06 18:30:48,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:30:48,696 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:30:48,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:30:48,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 18:30:48,777 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:30:48,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660942445] [2021-12-06 18:30:48,777 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660942445] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:30:48,777 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:30:48,777 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 18:30:48,778 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025587945] [2021-12-06 18:30:48,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:30:48,778 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 18:30:48,778 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:30:48,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 18:30:48,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-06 18:30:48,779 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 116 [2021-12-06 18:30:48,780 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 117 transitions, 494 flow. Second operand has 6 states, 6 states have (on average 91.66666666666667) internal successors, (550), 6 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:30:48,780 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 18:30:48,780 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 116 [2021-12-06 18:30:48,780 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 18:30:49,685 INFO L129 PetriNetUnfolder]: 2776/5102 cut-off events. [2021-12-06 18:30:49,685 INFO L130 PetriNetUnfolder]: For 33751/34318 co-relation queries the response was YES. [2021-12-06 18:30:49,696 INFO L84 FinitePrefix]: Finished finitePrefix Result has 20184 conditions, 5102 events. 2776/5102 cut-off events. For 33751/34318 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 35122 event pairs, 117 based on Foata normal form. 256/5257 useless extension candidates. Maximal degree in co-relation 20111. Up to 1674 conditions per place. [2021-12-06 18:30:49,715 INFO L132 encePairwiseOnDemand]: 106/116 looper letters, 84 selfloop transitions, 6 changer transitions 135/300 dead transitions. [2021-12-06 18:30:49,715 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 300 transitions, 2562 flow [2021-12-06 18:30:49,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 18:30:49,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-06 18:30:49,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 996 transitions. [2021-12-06 18:30:49,718 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8586206896551725 [2021-12-06 18:30:49,718 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 996 transitions. [2021-12-06 18:30:49,718 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 996 transitions. [2021-12-06 18:30:49,719 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 18:30:49,719 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 996 transitions. [2021-12-06 18:30:49,720 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 99.6) internal successors, (996), 10 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:30:49,722 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 116.0) internal successors, (1276), 11 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:30:49,722 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 116.0) internal successors, (1276), 11 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:30:49,723 INFO L186 Difference]: Start difference. First operand has 138 places, 117 transitions, 494 flow. Second operand 10 states and 996 transitions. [2021-12-06 18:30:49,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 300 transitions, 2562 flow [2021-12-06 18:30:49,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 300 transitions, 2330 flow, removed 79 selfloop flow, removed 11 redundant places. [2021-12-06 18:30:49,735 INFO L242 Difference]: Finished difference. Result has 136 places, 119 transitions, 498 flow [2021-12-06 18:30:49,735 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=444, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=498, PETRI_PLACES=136, PETRI_TRANSITIONS=119} [2021-12-06 18:30:49,736 INFO L334 CegarLoopForPetriNet]: 121 programPoint places, 15 predicate places. [2021-12-06 18:30:49,736 INFO L470 AbstractCegarLoop]: Abstraction has has 136 places, 119 transitions, 498 flow [2021-12-06 18:30:49,736 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 91.66666666666667) internal successors, (550), 6 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:30:49,736 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 18:30:49,736 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 18:30:49,736 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-06 18:30:49,736 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-06 18:30:49,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:30:49,737 INFO L85 PathProgramCache]: Analyzing trace with hash -922878089, now seen corresponding path program 1 times [2021-12-06 18:30:49,737 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:30:49,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720923332] [2021-12-06 18:30:49,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:30:49,737 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:30:49,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:30:49,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 18:30:49,832 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:30:49,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720923332] [2021-12-06 18:30:49,833 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720923332] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:30:49,833 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:30:49,833 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 18:30:49,833 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393953168] [2021-12-06 18:30:49,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:30:49,833 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 18:30:49,833 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:30:49,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 18:30:49,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-06 18:30:49,835 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 116 [2021-12-06 18:30:49,836 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 119 transitions, 498 flow. Second operand has 7 states, 7 states have (on average 91.42857142857143) internal successors, (640), 7 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:30:49,836 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 18:30:49,836 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 116 [2021-12-06 18:30:49,836 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 18:30:50,390 INFO L129 PetriNetUnfolder]: 899/2070 cut-off events. [2021-12-06 18:30:50,390 INFO L130 PetriNetUnfolder]: For 9330/9539 co-relation queries the response was YES. [2021-12-06 18:30:50,395 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8268 conditions, 2070 events. 899/2070 cut-off events. For 9330/9539 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 13759 event pairs, 41 based on Foata normal form. 149/2201 useless extension candidates. Maximal degree in co-relation 8197. Up to 592 conditions per place. [2021-12-06 18:30:50,403 INFO L132 encePairwiseOnDemand]: 107/116 looper letters, 83 selfloop transitions, 9 changer transitions 83/250 dead transitions. [2021-12-06 18:30:50,403 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 250 transitions, 2069 flow [2021-12-06 18:30:50,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 18:30:50,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-06 18:30:50,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 990 transitions. [2021-12-06 18:30:50,406 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.853448275862069 [2021-12-06 18:30:50,406 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 990 transitions. [2021-12-06 18:30:50,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 990 transitions. [2021-12-06 18:30:50,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 18:30:50,407 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 990 transitions. [2021-12-06 18:30:50,409 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 99.0) internal successors, (990), 10 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:30:50,410 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 116.0) internal successors, (1276), 11 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:30:50,411 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 116.0) internal successors, (1276), 11 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:30:50,411 INFO L186 Difference]: Start difference. First operand has 136 places, 119 transitions, 498 flow. Second operand 10 states and 990 transitions. [2021-12-06 18:30:50,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 250 transitions, 2069 flow [2021-12-06 18:30:50,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 250 transitions, 2038 flow, removed 8 selfloop flow, removed 6 redundant places. [2021-12-06 18:30:50,421 INFO L242 Difference]: Finished difference. Result has 139 places, 121 transitions, 557 flow [2021-12-06 18:30:50,422 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=475, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=557, PETRI_PLACES=139, PETRI_TRANSITIONS=121} [2021-12-06 18:30:50,422 INFO L334 CegarLoopForPetriNet]: 121 programPoint places, 18 predicate places. [2021-12-06 18:30:50,422 INFO L470 AbstractCegarLoop]: Abstraction has has 139 places, 121 transitions, 557 flow [2021-12-06 18:30:50,423 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 91.42857142857143) internal successors, (640), 7 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:30:50,423 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 18:30:50,423 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 18:30:50,423 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-06 18:30:50,423 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-06 18:30:50,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:30:50,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1425785692, now seen corresponding path program 1 times [2021-12-06 18:30:50,424 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:30:50,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168181317] [2021-12-06 18:30:50,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:30:50,424 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:30:50,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:30:50,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 18:30:50,523 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:30:50,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168181317] [2021-12-06 18:30:50,523 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168181317] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:30:50,523 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:30:50,524 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-06 18:30:50,524 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522899578] [2021-12-06 18:30:50,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:30:50,524 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-06 18:30:50,524 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:30:50,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-06 18:30:50,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-06 18:30:50,525 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 116 [2021-12-06 18:30:50,526 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 121 transitions, 557 flow. Second operand has 8 states, 8 states have (on average 91.375) internal successors, (731), 8 states have internal predecessors, (731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:30:50,526 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 18:30:50,526 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 116 [2021-12-06 18:30:50,526 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 18:30:50,882 INFO L129 PetriNetUnfolder]: 313/929 cut-off events. [2021-12-06 18:30:50,882 INFO L130 PetriNetUnfolder]: For 3813/3922 co-relation queries the response was YES. [2021-12-06 18:30:50,885 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3661 conditions, 929 events. 313/929 cut-off events. For 3813/3922 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 5531 event pairs, 41 based on Foata normal form. 34/947 useless extension candidates. Maximal degree in co-relation 3608. Up to 235 conditions per place. [2021-12-06 18:30:50,889 INFO L132 encePairwiseOnDemand]: 107/116 looper letters, 67 selfloop transitions, 12 changer transitions 36/190 dead transitions. [2021-12-06 18:30:50,889 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 190 transitions, 1468 flow [2021-12-06 18:30:50,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-06 18:30:50,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-12-06 18:30:50,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1050 transitions. [2021-12-06 18:30:50,893 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.822884012539185 [2021-12-06 18:30:50,893 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1050 transitions. [2021-12-06 18:30:50,893 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1050 transitions. [2021-12-06 18:30:50,893 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 18:30:50,893 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1050 transitions. [2021-12-06 18:30:50,896 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 95.45454545454545) internal successors, (1050), 11 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:30:50,898 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 116.0) internal successors, (1392), 12 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:30:50,899 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 116.0) internal successors, (1392), 12 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:30:50,899 INFO L186 Difference]: Start difference. First operand has 139 places, 121 transitions, 557 flow. Second operand 11 states and 1050 transitions. [2021-12-06 18:30:50,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 190 transitions, 1468 flow [2021-12-06 18:30:50,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 190 transitions, 1349 flow, removed 45 selfloop flow, removed 11 redundant places. [2021-12-06 18:30:50,907 INFO L242 Difference]: Finished difference. Result has 140 places, 121 transitions, 527 flow [2021-12-06 18:30:50,907 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=481, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=527, PETRI_PLACES=140, PETRI_TRANSITIONS=121} [2021-12-06 18:30:50,908 INFO L334 CegarLoopForPetriNet]: 121 programPoint places, 19 predicate places. [2021-12-06 18:30:50,908 INFO L470 AbstractCegarLoop]: Abstraction has has 140 places, 121 transitions, 527 flow [2021-12-06 18:30:50,909 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 91.375) internal successors, (731), 8 states have internal predecessors, (731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:30:50,909 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 18:30:50,909 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 18:30:50,909 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-06 18:30:50,909 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-06 18:30:50,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:30:50,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1549455016, now seen corresponding path program 1 times [2021-12-06 18:30:50,909 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:30:50,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961464435] [2021-12-06 18:30:50,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:30:50,910 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:30:50,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:30:51,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 18:30:51,213 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:30:51,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961464435] [2021-12-06 18:30:51,214 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961464435] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:30:51,214 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:30:51,214 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-12-06 18:30:51,214 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806232031] [2021-12-06 18:30:51,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:30:51,214 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-06 18:30:51,214 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:30:51,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-06 18:30:51,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2021-12-06 18:30:51,216 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 116 [2021-12-06 18:30:51,217 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 121 transitions, 527 flow. Second operand has 17 states, 17 states have (on average 85.58823529411765) internal successors, (1455), 17 states have internal predecessors, (1455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:30:51,217 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 18:30:51,217 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 116 [2021-12-06 18:30:51,217 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 18:30:51,760 INFO L129 PetriNetUnfolder]: 173/739 cut-off events. [2021-12-06 18:30:51,760 INFO L130 PetriNetUnfolder]: For 1560/1706 co-relation queries the response was YES. [2021-12-06 18:30:51,763 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2478 conditions, 739 events. 173/739 cut-off events. For 1560/1706 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 4714 event pairs, 25 based on Foata normal form. 22/735 useless extension candidates. Maximal degree in co-relation 2397. Up to 171 conditions per place. [2021-12-06 18:30:51,767 INFO L132 encePairwiseOnDemand]: 101/116 looper letters, 55 selfloop transitions, 18 changer transitions 23/171 dead transitions. [2021-12-06 18:30:51,767 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 171 transitions, 1061 flow [2021-12-06 18:30:51,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-06 18:30:51,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2021-12-06 18:30:51,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1336 transitions. [2021-12-06 18:30:51,770 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.767816091954023 [2021-12-06 18:30:51,770 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1336 transitions. [2021-12-06 18:30:51,770 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1336 transitions. [2021-12-06 18:30:51,771 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 18:30:51,771 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1336 transitions. [2021-12-06 18:30:51,773 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 89.06666666666666) internal successors, (1336), 15 states have internal predecessors, (1336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:30:51,776 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 116.0) internal successors, (1856), 16 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:30:51,777 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 116.0) internal successors, (1856), 16 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:30:51,777 INFO L186 Difference]: Start difference. First operand has 140 places, 121 transitions, 527 flow. Second operand 15 states and 1336 transitions. [2021-12-06 18:30:51,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 171 transitions, 1061 flow [2021-12-06 18:30:51,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 171 transitions, 871 flow, removed 76 selfloop flow, removed 18 redundant places. [2021-12-06 18:30:51,784 INFO L242 Difference]: Finished difference. Result has 138 places, 122 transitions, 470 flow [2021-12-06 18:30:51,784 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=403, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=470, PETRI_PLACES=138, PETRI_TRANSITIONS=122} [2021-12-06 18:30:51,784 INFO L334 CegarLoopForPetriNet]: 121 programPoint places, 17 predicate places. [2021-12-06 18:30:51,784 INFO L470 AbstractCegarLoop]: Abstraction has has 138 places, 122 transitions, 470 flow [2021-12-06 18:30:51,785 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 85.58823529411765) internal successors, (1455), 17 states have internal predecessors, (1455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:30:51,785 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 18:30:51,785 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 18:30:51,785 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-06 18:30:51,785 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-06 18:30:51,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:30:51,786 INFO L85 PathProgramCache]: Analyzing trace with hash 40793630, now seen corresponding path program 2 times [2021-12-06 18:30:51,786 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:30:51,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337419780] [2021-12-06 18:30:51,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:30:51,786 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:30:51,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:30:51,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 18:30:51,923 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:30:51,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337419780] [2021-12-06 18:30:51,924 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337419780] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:30:51,924 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:30:51,924 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-06 18:30:51,924 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785723248] [2021-12-06 18:30:51,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:30:51,924 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-06 18:30:51,925 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:30:51,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-06 18:30:51,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-12-06 18:30:51,926 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 116 [2021-12-06 18:30:51,927 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 122 transitions, 470 flow. Second operand has 9 states, 9 states have (on average 88.77777777777777) internal successors, (799), 9 states have internal predecessors, (799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:30:51,927 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 18:30:51,927 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 116 [2021-12-06 18:30:51,927 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 18:30:52,260 INFO L129 PetriNetUnfolder]: 182/863 cut-off events. [2021-12-06 18:30:52,260 INFO L130 PetriNetUnfolder]: For 628/683 co-relation queries the response was YES. [2021-12-06 18:30:52,263 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2190 conditions, 863 events. 182/863 cut-off events. For 628/683 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 6029 event pairs, 12 based on Foata normal form. 20/858 useless extension candidates. Maximal degree in co-relation 2169. Up to 200 conditions per place. [2021-12-06 18:30:52,265 INFO L132 encePairwiseOnDemand]: 103/116 looper letters, 45 selfloop transitions, 15 changer transitions 21/158 dead transitions. [2021-12-06 18:30:52,266 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 158 transitions, 881 flow [2021-12-06 18:30:52,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 18:30:52,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-06 18:30:52,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 916 transitions. [2021-12-06 18:30:52,267 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7896551724137931 [2021-12-06 18:30:52,267 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 916 transitions. [2021-12-06 18:30:52,267 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 916 transitions. [2021-12-06 18:30:52,267 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 18:30:52,267 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 916 transitions. [2021-12-06 18:30:52,268 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 91.6) internal successors, (916), 10 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:30:52,270 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 116.0) internal successors, (1276), 11 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:30:52,270 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 116.0) internal successors, (1276), 11 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:30:52,270 INFO L186 Difference]: Start difference. First operand has 138 places, 122 transitions, 470 flow. Second operand 10 states and 916 transitions. [2021-12-06 18:30:52,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 158 transitions, 881 flow [2021-12-06 18:30:52,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 158 transitions, 824 flow, removed 12 selfloop flow, removed 12 redundant places. [2021-12-06 18:30:52,276 INFO L242 Difference]: Finished difference. Result has 137 places, 130 transitions, 569 flow [2021-12-06 18:30:52,276 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=430, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=569, PETRI_PLACES=137, PETRI_TRANSITIONS=130} [2021-12-06 18:30:52,277 INFO L334 CegarLoopForPetriNet]: 121 programPoint places, 16 predicate places. [2021-12-06 18:30:52,277 INFO L470 AbstractCegarLoop]: Abstraction has has 137 places, 130 transitions, 569 flow [2021-12-06 18:30:52,277 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 88.77777777777777) internal successors, (799), 9 states have internal predecessors, (799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:30:52,277 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 18:30:52,278 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 18:30:52,278 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-06 18:30:52,278 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-06 18:30:52,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:30:52,278 INFO L85 PathProgramCache]: Analyzing trace with hash -583906966, now seen corresponding path program 3 times [2021-12-06 18:30:52,279 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:30:52,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396213339] [2021-12-06 18:30:52,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:30:52,279 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:30:52,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:30:52,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 18:30:52,543 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:30:52,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396213339] [2021-12-06 18:30:52,543 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396213339] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:30:52,543 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:30:52,543 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-12-06 18:30:52,543 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382653699] [2021-12-06 18:30:52,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:30:52,544 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-06 18:30:52,544 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:30:52,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-06 18:30:52,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2021-12-06 18:30:52,546 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 116 [2021-12-06 18:30:52,547 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 130 transitions, 569 flow. Second operand has 13 states, 13 states have (on average 86.07692307692308) internal successors, (1119), 13 states have internal predecessors, (1119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:30:52,547 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 18:30:52,547 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 116 [2021-12-06 18:30:52,547 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 18:30:52,910 INFO L129 PetriNetUnfolder]: 156/728 cut-off events. [2021-12-06 18:30:52,910 INFO L130 PetriNetUnfolder]: For 866/904 co-relation queries the response was YES. [2021-12-06 18:30:52,913 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2069 conditions, 728 events. 156/728 cut-off events. For 866/904 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 4753 event pairs, 15 based on Foata normal form. 11/717 useless extension candidates. Maximal degree in co-relation 2050. Up to 151 conditions per place. [2021-12-06 18:30:52,915 INFO L132 encePairwiseOnDemand]: 103/116 looper letters, 47 selfloop transitions, 13 changer transitions 23/158 dead transitions. [2021-12-06 18:30:52,915 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 158 transitions, 943 flow [2021-12-06 18:30:52,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-06 18:30:52,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-12-06 18:30:52,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1143 transitions. [2021-12-06 18:30:52,916 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7579575596816976 [2021-12-06 18:30:52,916 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1143 transitions. [2021-12-06 18:30:52,916 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1143 transitions. [2021-12-06 18:30:52,917 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 18:30:52,917 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1143 transitions. [2021-12-06 18:30:52,918 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 87.92307692307692) internal successors, (1143), 13 states have internal predecessors, (1143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:30:52,920 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 116.0) internal successors, (1624), 14 states have internal predecessors, (1624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:30:52,920 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 116.0) internal successors, (1624), 14 states have internal predecessors, (1624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:30:52,920 INFO L186 Difference]: Start difference. First operand has 137 places, 130 transitions, 569 flow. Second operand 13 states and 1143 transitions. [2021-12-06 18:30:52,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 158 transitions, 943 flow [2021-12-06 18:30:52,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 158 transitions, 898 flow, removed 22 selfloop flow, removed 6 redundant places. [2021-12-06 18:30:52,925 INFO L242 Difference]: Finished difference. Result has 144 places, 119 transitions, 503 flow [2021-12-06 18:30:52,925 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=546, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=503, PETRI_PLACES=144, PETRI_TRANSITIONS=119} [2021-12-06 18:30:52,925 INFO L334 CegarLoopForPetriNet]: 121 programPoint places, 23 predicate places. [2021-12-06 18:30:52,926 INFO L470 AbstractCegarLoop]: Abstraction has has 144 places, 119 transitions, 503 flow [2021-12-06 18:30:52,926 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 86.07692307692308) internal successors, (1119), 13 states have internal predecessors, (1119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:30:52,926 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 18:30:52,927 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 18:30:52,927 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-06 18:30:52,927 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-06 18:30:52,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:30:52,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1941676790, now seen corresponding path program 4 times [2021-12-06 18:30:52,927 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:30:52,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227020338] [2021-12-06 18:30:52,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:30:52,927 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:30:52,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:30:53,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 18:30:53,088 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:30:53,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227020338] [2021-12-06 18:30:53,088 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227020338] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:30:53,088 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:30:53,088 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-06 18:30:53,088 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530780746] [2021-12-06 18:30:53,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:30:53,089 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-06 18:30:53,089 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:30:53,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-06 18:30:53,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-12-06 18:30:53,090 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 116 [2021-12-06 18:30:53,092 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 119 transitions, 503 flow. Second operand has 10 states, 10 states have (on average 89.4) internal successors, (894), 10 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:30:53,092 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 18:30:53,092 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 116 [2021-12-06 18:30:53,092 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 18:30:53,418 INFO L129 PetriNetUnfolder]: 111/585 cut-off events. [2021-12-06 18:30:53,418 INFO L130 PetriNetUnfolder]: For 618/636 co-relation queries the response was YES. [2021-12-06 18:30:53,420 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1582 conditions, 585 events. 111/585 cut-off events. For 618/636 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 3588 event pairs, 21 based on Foata normal form. 9/586 useless extension candidates. Maximal degree in co-relation 1558. Up to 120 conditions per place. [2021-12-06 18:30:53,422 INFO L132 encePairwiseOnDemand]: 106/116 looper letters, 54 selfloop transitions, 9 changer transitions 13/154 dead transitions. [2021-12-06 18:30:53,422 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 154 transitions, 888 flow [2021-12-06 18:30:53,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-06 18:30:53,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-12-06 18:30:53,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1013 transitions. [2021-12-06 18:30:53,423 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7938871473354232 [2021-12-06 18:30:53,423 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1013 transitions. [2021-12-06 18:30:53,423 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1013 transitions. [2021-12-06 18:30:53,423 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 18:30:53,423 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1013 transitions. [2021-12-06 18:30:53,424 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 92.0909090909091) internal successors, (1013), 11 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-12-06 18:30:53,425 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 116.0) internal successors, (1392), 12 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:30:53,426 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 116.0) internal successors, (1392), 12 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:30:53,426 INFO L186 Difference]: Start difference. First operand has 144 places, 119 transitions, 503 flow. Second operand 11 states and 1013 transitions. [2021-12-06 18:30:53,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 154 transitions, 888 flow [2021-12-06 18:30:53,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 154 transitions, 770 flow, removed 36 selfloop flow, removed 14 redundant places. [2021-12-06 18:30:53,429 INFO L242 Difference]: Finished difference. Result has 137 places, 119 transitions, 467 flow [2021-12-06 18:30:53,430 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=436, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=467, PETRI_PLACES=137, PETRI_TRANSITIONS=119} [2021-12-06 18:30:53,430 INFO L334 CegarLoopForPetriNet]: 121 programPoint places, 16 predicate places. [2021-12-06 18:30:53,430 INFO L470 AbstractCegarLoop]: Abstraction has has 137 places, 119 transitions, 467 flow [2021-12-06 18:30:53,430 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 89.4) internal successors, (894), 10 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:30:53,430 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 18:30:53,430 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 18:30:53,431 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-06 18:30:53,431 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-06 18:30:53,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:30:53,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1597800010, now seen corresponding path program 5 times [2021-12-06 18:30:53,431 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:30:53,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194031857] [2021-12-06 18:30:53,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:30:53,431 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:30:53,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:30:53,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 18:30:53,663 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:30:53,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194031857] [2021-12-06 18:30:53,663 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194031857] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:30:53,663 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:30:53,663 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-06 18:30:53,663 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631087933] [2021-12-06 18:30:53,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:30:53,663 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-06 18:30:53,664 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:30:53,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-06 18:30:53,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2021-12-06 18:30:53,665 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 116 [2021-12-06 18:30:53,665 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 119 transitions, 467 flow. Second operand has 11 states, 11 states have (on average 87.36363636363636) internal successors, (961), 11 states have internal predecessors, (961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:30:53,665 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 18:30:53,665 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 116 [2021-12-06 18:30:53,665 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 18:30:53,962 INFO L129 PetriNetUnfolder]: 116/652 cut-off events. [2021-12-06 18:30:53,963 INFO L130 PetriNetUnfolder]: For 384/439 co-relation queries the response was YES. [2021-12-06 18:30:53,964 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1561 conditions, 652 events. 116/652 cut-off events. For 384/439 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4230 event pairs, 3 based on Foata normal form. 9/650 useless extension candidates. Maximal degree in co-relation 1539. Up to 114 conditions per place. [2021-12-06 18:30:53,966 INFO L132 encePairwiseOnDemand]: 105/116 looper letters, 42 selfloop transitions, 23 changer transitions 9/150 dead transitions. [2021-12-06 18:30:53,966 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 150 transitions, 815 flow [2021-12-06 18:30:53,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-06 18:30:53,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-12-06 18:30:53,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 984 transitions. [2021-12-06 18:30:53,967 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7711598746081505 [2021-12-06 18:30:53,967 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 984 transitions. [2021-12-06 18:30:53,967 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 984 transitions. [2021-12-06 18:30:53,968 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 18:30:53,968 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 984 transitions. [2021-12-06 18:30:53,969 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 89.45454545454545) internal successors, (984), 11 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:30:53,970 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 116.0) internal successors, (1392), 12 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:30:53,970 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 116.0) internal successors, (1392), 12 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:30:53,970 INFO L186 Difference]: Start difference. First operand has 137 places, 119 transitions, 467 flow. Second operand 11 states and 984 transitions. [2021-12-06 18:30:53,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 150 transitions, 815 flow [2021-12-06 18:30:53,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 150 transitions, 776 flow, removed 9 selfloop flow, removed 9 redundant places. [2021-12-06 18:30:53,973 INFO L242 Difference]: Finished difference. Result has 138 places, 130 transitions, 607 flow [2021-12-06 18:30:53,973 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=434, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=607, PETRI_PLACES=138, PETRI_TRANSITIONS=130} [2021-12-06 18:30:53,974 INFO L334 CegarLoopForPetriNet]: 121 programPoint places, 17 predicate places. [2021-12-06 18:30:53,974 INFO L470 AbstractCegarLoop]: Abstraction has has 138 places, 130 transitions, 607 flow [2021-12-06 18:30:53,974 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 87.36363636363636) internal successors, (961), 11 states have internal predecessors, (961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:30:53,974 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 18:30:53,974 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 18:30:53,974 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-06 18:30:53,974 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-06 18:30:53,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:30:53,975 INFO L85 PathProgramCache]: Analyzing trace with hash -38603464, now seen corresponding path program 6 times [2021-12-06 18:30:53,975 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:30:53,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831997782] [2021-12-06 18:30:53,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:30:53,975 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:30:54,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:30:54,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 18:30:54,106 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:30:54,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831997782] [2021-12-06 18:30:54,106 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831997782] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:30:54,106 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:30:54,106 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-06 18:30:54,106 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218241925] [2021-12-06 18:30:54,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:30:54,107 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-06 18:30:54,107 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:30:54,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-06 18:30:54,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-12-06 18:30:54,108 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 116 [2021-12-06 18:30:54,108 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 130 transitions, 607 flow. Second operand has 10 states, 10 states have (on average 90.3) internal successors, (903), 10 states have internal predecessors, (903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:30:54,108 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 18:30:54,108 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 116 [2021-12-06 18:30:54,108 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 18:30:54,377 INFO L129 PetriNetUnfolder]: 126/681 cut-off events. [2021-12-06 18:30:54,377 INFO L130 PetriNetUnfolder]: For 611/684 co-relation queries the response was YES. [2021-12-06 18:30:54,379 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1746 conditions, 681 events. 126/681 cut-off events. For 611/684 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 4590 event pairs, 5 based on Foata normal form. 10/679 useless extension candidates. Maximal degree in co-relation 1727. Up to 138 conditions per place. [2021-12-06 18:30:54,380 INFO L132 encePairwiseOnDemand]: 104/116 looper letters, 43 selfloop transitions, 10 changer transitions 23/155 dead transitions. [2021-12-06 18:30:54,381 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 155 transitions, 958 flow [2021-12-06 18:30:54,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-06 18:30:54,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-12-06 18:30:54,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1099 transitions. [2021-12-06 18:30:54,382 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7895114942528736 [2021-12-06 18:30:54,382 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1099 transitions. [2021-12-06 18:30:54,382 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1099 transitions. [2021-12-06 18:30:54,382 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 18:30:54,382 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1099 transitions. [2021-12-06 18:30:54,383 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 91.58333333333333) internal successors, (1099), 12 states have internal predecessors, (1099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:30:54,384 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 116.0) internal successors, (1508), 13 states have internal predecessors, (1508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:30:54,385 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 116.0) internal successors, (1508), 13 states have internal predecessors, (1508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:30:54,385 INFO L186 Difference]: Start difference. First operand has 138 places, 130 transitions, 607 flow. Second operand 12 states and 1099 transitions. [2021-12-06 18:30:54,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 155 transitions, 958 flow [2021-12-06 18:30:54,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 155 transitions, 935 flow, removed 9 selfloop flow, removed 6 redundant places. [2021-12-06 18:30:54,389 INFO L242 Difference]: Finished difference. Result has 146 places, 130 transitions, 630 flow [2021-12-06 18:30:54,389 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=590, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=630, PETRI_PLACES=146, PETRI_TRANSITIONS=130} [2021-12-06 18:30:54,389 INFO L334 CegarLoopForPetriNet]: 121 programPoint places, 25 predicate places. [2021-12-06 18:30:54,389 INFO L470 AbstractCegarLoop]: Abstraction has has 146 places, 130 transitions, 630 flow [2021-12-06 18:30:54,390 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 90.3) internal successors, (903), 10 states have internal predecessors, (903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:30:54,390 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 18:30:54,390 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 18:30:54,390 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-06 18:30:54,390 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-06 18:30:54,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:30:54,390 INFO L85 PathProgramCache]: Analyzing trace with hash -404006584, now seen corresponding path program 7 times [2021-12-06 18:30:54,390 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:30:54,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488529043] [2021-12-06 18:30:54,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:30:54,390 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:30:54,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:30:54,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 18:30:54,855 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:30:54,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488529043] [2021-12-06 18:30:54,855 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488529043] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:30:54,855 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:30:54,855 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-12-06 18:30:54,855 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997349725] [2021-12-06 18:30:54,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:30:54,856 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-12-06 18:30:54,856 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:30:54,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-12-06 18:30:54,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2021-12-06 18:30:54,857 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 116 [2021-12-06 18:30:54,858 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 130 transitions, 630 flow. Second operand has 18 states, 18 states have (on average 81.72222222222223) internal successors, (1471), 18 states have internal predecessors, (1471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:30:54,858 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 18:30:54,858 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 116 [2021-12-06 18:30:54,858 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 18:30:55,792 INFO L129 PetriNetUnfolder]: 97/565 cut-off events. [2021-12-06 18:30:55,792 INFO L130 PetriNetUnfolder]: For 616/687 co-relation queries the response was YES. [2021-12-06 18:30:55,794 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1482 conditions, 565 events. 97/565 cut-off events. For 616/687 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3450 event pairs, 4 based on Foata normal form. 16/572 useless extension candidates. Maximal degree in co-relation 1460. Up to 99 conditions per place. [2021-12-06 18:30:55,795 INFO L132 encePairwiseOnDemand]: 103/116 looper letters, 39 selfloop transitions, 12 changer transitions 34/156 dead transitions. [2021-12-06 18:30:55,795 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 156 transitions, 945 flow [2021-12-06 18:30:55,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-06 18:30:55,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2021-12-06 18:30:55,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1503 transitions. [2021-12-06 18:30:55,797 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7198275862068966 [2021-12-06 18:30:55,797 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1503 transitions. [2021-12-06 18:30:55,797 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1503 transitions. [2021-12-06 18:30:55,797 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 18:30:55,797 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1503 transitions. [2021-12-06 18:30:55,799 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 83.5) internal successors, (1503), 18 states have internal predecessors, (1503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:30:55,800 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 116.0) internal successors, (2204), 19 states have internal predecessors, (2204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:30:55,800 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 116.0) internal successors, (2204), 19 states have internal predecessors, (2204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:30:55,801 INFO L186 Difference]: Start difference. First operand has 146 places, 130 transitions, 630 flow. Second operand 18 states and 1503 transitions. [2021-12-06 18:30:55,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 156 transitions, 945 flow [2021-12-06 18:30:55,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 156 transitions, 912 flow, removed 12 selfloop flow, removed 10 redundant places. [2021-12-06 18:30:55,805 INFO L242 Difference]: Finished difference. Result has 156 places, 117 transitions, 500 flow [2021-12-06 18:30:55,805 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=609, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=500, PETRI_PLACES=156, PETRI_TRANSITIONS=117} [2021-12-06 18:30:55,805 INFO L334 CegarLoopForPetriNet]: 121 programPoint places, 35 predicate places. [2021-12-06 18:30:55,805 INFO L470 AbstractCegarLoop]: Abstraction has has 156 places, 117 transitions, 500 flow [2021-12-06 18:30:55,806 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 81.72222222222223) internal successors, (1471), 18 states have internal predecessors, (1471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:30:55,806 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 18:30:55,806 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 18:30:55,806 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-06 18:30:55,806 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-06 18:30:55,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:30:55,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1177671462, now seen corresponding path program 8 times [2021-12-06 18:30:55,806 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:30:55,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566506260] [2021-12-06 18:30:55,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:30:55,807 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:30:55,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:30:55,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 18:30:55,962 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:30:55,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566506260] [2021-12-06 18:30:55,962 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566506260] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:30:55,962 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:30:55,962 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-06 18:30:55,963 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086341829] [2021-12-06 18:30:55,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:30:55,963 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-06 18:30:55,963 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:30:55,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-06 18:30:55,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-12-06 18:30:55,964 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 116 [2021-12-06 18:30:55,965 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 117 transitions, 500 flow. Second operand has 12 states, 12 states have (on average 88.08333333333333) internal successors, (1057), 12 states have internal predecessors, (1057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:30:55,965 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 18:30:55,966 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 116 [2021-12-06 18:30:55,966 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 18:30:56,230 INFO L129 PetriNetUnfolder]: 53/350 cut-off events. [2021-12-06 18:30:56,230 INFO L130 PetriNetUnfolder]: For 395/405 co-relation queries the response was YES. [2021-12-06 18:30:56,231 INFO L84 FinitePrefix]: Finished finitePrefix Result has 937 conditions, 350 events. 53/350 cut-off events. For 395/405 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1721 event pairs, 5 based on Foata normal form. 2/348 useless extension candidates. Maximal degree in co-relation 912. Up to 64 conditions per place. [2021-12-06 18:30:56,232 INFO L132 encePairwiseOnDemand]: 105/116 looper letters, 27 selfloop transitions, 10 changer transitions 20/134 dead transitions. [2021-12-06 18:30:56,232 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 134 transitions, 734 flow [2021-12-06 18:30:56,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-06 18:30:56,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-12-06 18:30:56,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1074 transitions. [2021-12-06 18:30:56,233 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.771551724137931 [2021-12-06 18:30:56,233 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1074 transitions. [2021-12-06 18:30:56,233 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1074 transitions. [2021-12-06 18:30:56,234 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 18:30:56,234 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1074 transitions. [2021-12-06 18:30:56,235 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 89.5) internal successors, (1074), 12 states have internal predecessors, (1074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:30:56,236 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 116.0) internal successors, (1508), 13 states have internal predecessors, (1508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:30:56,236 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 116.0) internal successors, (1508), 13 states have internal predecessors, (1508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:30:56,236 INFO L186 Difference]: Start difference. First operand has 156 places, 117 transitions, 500 flow. Second operand 12 states and 1074 transitions. [2021-12-06 18:30:56,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 134 transitions, 734 flow [2021-12-06 18:30:56,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 134 transitions, 621 flow, removed 21 selfloop flow, removed 24 redundant places. [2021-12-06 18:30:56,239 INFO L242 Difference]: Finished difference. Result has 136 places, 112 transitions, 396 flow [2021-12-06 18:30:56,239 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=412, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=396, PETRI_PLACES=136, PETRI_TRANSITIONS=112} [2021-12-06 18:30:56,240 INFO L334 CegarLoopForPetriNet]: 121 programPoint places, 15 predicate places. [2021-12-06 18:30:56,240 INFO L470 AbstractCegarLoop]: Abstraction has has 136 places, 112 transitions, 396 flow [2021-12-06 18:30:56,240 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 88.08333333333333) internal successors, (1057), 12 states have internal predecessors, (1057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:30:56,240 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 18:30:56,240 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 18:30:56,240 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-06 18:30:56,240 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-06 18:30:56,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:30:56,240 INFO L85 PathProgramCache]: Analyzing trace with hash 25109472, now seen corresponding path program 9 times [2021-12-06 18:30:56,241 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:30:56,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289242954] [2021-12-06 18:30:56,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:30:56,241 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:30:56,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 18:30:56,287 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-06 18:30:56,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 18:30:56,396 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-06 18:30:56,396 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-06 18:30:56,397 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2021-12-06 18:30:56,398 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2021-12-06 18:30:56,398 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (3 of 6 remaining) [2021-12-06 18:30:56,399 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (2 of 6 remaining) [2021-12-06 18:30:56,399 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (1 of 6 remaining) [2021-12-06 18:30:56,399 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2021-12-06 18:30:56,399 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-06 18:30:56,402 INFO L732 BasicCegarLoop]: Path program histogram: [9, 3, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 18:30:56,405 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-12-06 18:30:56,405 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-06 18:30:56,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 06:30:56 BasicIcfg [2021-12-06 18:30:56,510 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-06 18:30:56,510 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-06 18:30:56,510 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-06 18:30:56,510 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-06 18:30:56,510 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:30:43" (3/4) ... [2021-12-06 18:30:56,512 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-06 18:30:56,603 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea2ba402-9649-46ef-b6a7-8adfbcb688a3/bin/uautomizer-DrprNOufMa/witness.graphml [2021-12-06 18:30:56,603 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-06 18:30:56,604 INFO L158 Benchmark]: Toolchain (without parser) took 14575.70ms. Allocated memory was 104.9MB in the beginning and 390.1MB in the end (delta: 285.2MB). Free memory was 66.6MB in the beginning and 109.5MB in the end (delta: -42.9MB). Peak memory consumption was 241.3MB. Max. memory is 16.1GB. [2021-12-06 18:30:56,604 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 104.9MB. Free memory is still 84.6MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-06 18:30:56,604 INFO L158 Benchmark]: CACSL2BoogieTranslator took 404.07ms. Allocated memory is still 104.9MB. Free memory was 66.3MB in the beginning and 64.5MB in the end (delta: 1.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-06 18:30:56,605 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.01ms. Allocated memory is still 104.9MB. Free memory was 64.5MB in the beginning and 61.6MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-06 18:30:56,605 INFO L158 Benchmark]: Boogie Preprocessor took 35.13ms. Allocated memory is still 104.9MB. Free memory was 61.6MB in the beginning and 58.7MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-06 18:30:56,605 INFO L158 Benchmark]: RCFGBuilder took 1086.70ms. Allocated memory was 104.9MB in the beginning and 142.6MB in the end (delta: 37.7MB). Free memory was 58.7MB in the beginning and 78.1MB in the end (delta: -19.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2021-12-06 18:30:56,606 INFO L158 Benchmark]: TraceAbstraction took 12905.17ms. Allocated memory was 142.6MB in the beginning and 390.1MB in the end (delta: 247.5MB). Free memory was 77.0MB in the beginning and 153.5MB in the end (delta: -76.6MB). Peak memory consumption was 169.7MB. Max. memory is 16.1GB. [2021-12-06 18:30:56,606 INFO L158 Benchmark]: Witness Printer took 92.98ms. Allocated memory is still 390.1MB. Free memory was 153.5MB in the beginning and 109.5MB in the end (delta: 44.0MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. [2021-12-06 18:30:56,608 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.15ms. Allocated memory is still 104.9MB. Free memory is still 84.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 404.07ms. Allocated memory is still 104.9MB. Free memory was 66.3MB in the beginning and 64.5MB in the end (delta: 1.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.01ms. Allocated memory is still 104.9MB. Free memory was 64.5MB in the beginning and 61.6MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.13ms. Allocated memory is still 104.9MB. Free memory was 61.6MB in the beginning and 58.7MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1086.70ms. Allocated memory was 104.9MB in the beginning and 142.6MB in the end (delta: 37.7MB). Free memory was 58.7MB in the beginning and 78.1MB in the end (delta: -19.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 12905.17ms. Allocated memory was 142.6MB in the beginning and 390.1MB in the end (delta: 247.5MB). Free memory was 77.0MB in the beginning and 153.5MB in the end (delta: -76.6MB). Peak memory consumption was 169.7MB. Max. memory is 16.1GB. * Witness Printer took 92.98ms. Allocated memory is still 390.1MB. Free memory was 153.5MB in the beginning and 109.5MB in the end (delta: 44.0MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 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_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0] [L716] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L717] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0] [L718] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L720] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L722] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L723] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L724] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L725] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L726] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L727] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L728] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L729] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L730] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L731] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L732] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L733] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L734] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L735] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L736] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L737] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L738] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L739] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L740] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L854] 0 pthread_t t2321; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2321={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L855] FCALL, FORK 0 pthread_create(&t2321, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2321, ((void *)0), P0, ((void *)0))=-2, t2321={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L856] 0 pthread_t t2322; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2321={5:0}, t2322={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L857] FCALL, FORK 0 pthread_create(&t2322, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2322, ((void *)0), P1, ((void *)0))=-1, t2321={5:0}, t2322={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L784] 2 y$w_buff1 = y$w_buff0 [L785] 2 y$w_buff0 = 2 [L786] 2 y$w_buff1_used = y$w_buff0_used [L787] 2 y$w_buff0_used = (_Bool)1 [L788] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L788] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L789] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L790] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L791] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L792] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L793] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L796] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L858] 0 pthread_t t2323; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2321={5:0}, t2322={6:0}, t2323={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L859] FCALL, FORK 0 pthread_create(&t2323, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2323, ((void *)0), P2, ((void *)0))=0, t2321={5:0}, t2322={6:0}, t2323={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L813] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L816] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L817] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L818] 3 y$flush_delayed = weak$$choice2 [L819] 3 y$mem_tmp = y [L820] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L820] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L821] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L821] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0) [L821] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L821] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L822] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L822] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1) [L822] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L822] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L823] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L823] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used) [L823] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L823] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L824] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L824] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L824] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L824] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L825] EXPR 3 weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L825] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3) [L825] EXPR 3 weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L825] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L826] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L826] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L826] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L826] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L827] 3 __unbuffered_p2_EBX = y [L828] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L828] 3 y = y$flush_delayed ? y$mem_tmp : y [L829] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=68, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L744] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=68, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L747] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L747] EXPR 1 y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y [L747] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L747] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L748] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L748] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L749] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L749] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L750] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L750] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L751] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L751] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L754] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 1 y$flush_delayed = weak$$choice2 [L757] 1 y$mem_tmp = y [L758] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L758] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L759] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L759] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L760] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L760] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L761] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L761] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L762] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L762] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L763] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L763] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L764] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L764] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] 1 __unbuffered_p0_EAX = y [L766] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L766] 1 y = y$flush_delayed ? y$mem_tmp : y [L767] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L770] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L770] EXPR 1 y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y [L770] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L770] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L771] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L771] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L772] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L772] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L773] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L773] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L774] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L774] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L799] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L799] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L800] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L800] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L801] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L801] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L802] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L802] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L803] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L803] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L806] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L832] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L832] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L832] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L832] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L833] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L833] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L834] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L834] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L835] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L835] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L836] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L836] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L839] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L861] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2321={5:0}, t2322={6:0}, t2323={3:0}, weak$$choice0=66, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L863] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L863] RET 0 assume_abort_if_not(main$tmp_guard0) [L865] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L865] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L865] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L865] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L866] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L866] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L867] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L867] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L868] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L868] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L869] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L869] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L872] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L873] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L874] 0 y$flush_delayed = weak$$choice2 [L875] 0 y$mem_tmp = y [L876] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L876] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L877] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L877] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L878] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L878] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L879] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L879] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L880] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L880] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L881] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L881] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L882] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L882] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L883] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L884] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L884] 0 y = y$flush_delayed ? y$mem_tmp : y [L885] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2321={5:0}, t2322={6:0}, t2323={3:0}, weak$$choice0=70, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L887] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=70, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=70, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - 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: 855]: 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: 859]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 857]: 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, 144 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: 12.6s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 9, EmptinessCheckTime: 0.0s, AutomataDifference: 8.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 951 SdHoareTripleChecker+Valid, 3.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 951 mSDsluCounter, 1101 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1774 mSDsCounter, 473 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3284 IncrementalHoareTripleChecker+Invalid, 3757 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 473 mSolverCounterUnsat, 185 mSDtfsCounter, 3284 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 291 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 246 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 575 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=630occurred in iteration=16, InterpolantAutomatonStates: 203, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 1599 NumberOfCodeBlocks, 1599 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1491 ConstructedInterpolants, 0 QuantifiedInterpolants, 9026 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-12-06 18:30:56,640 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea2ba402-9649-46ef-b6a7-8adfbcb688a3/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE