/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix053_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 10:13:45,541 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 10:13:45,542 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 10:13:45,574 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 10:13:45,575 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 10:13:45,578 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 10:13:45,580 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 10:13:45,585 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 10:13:45,587 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 10:13:45,590 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 10:13:45,591 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 10:13:45,592 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 10:13:45,593 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 10:13:45,594 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 10:13:45,596 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 10:13:45,597 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 10:13:45,599 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 10:13:45,600 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 10:13:45,602 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 10:13:45,610 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 10:13:45,611 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 10:13:45,612 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 10:13:45,613 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 10:13:45,615 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 10:13:45,620 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 10:13:45,621 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 10:13:45,621 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 10:13:45,621 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 10:13:45,622 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 10:13:45,622 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 10:13:45,623 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 10:13:45,623 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 10:13:45,625 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 10:13:45,625 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 10:13:45,626 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 10:13:45,627 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 10:13:45,627 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 10:13:45,628 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 10:13:45,628 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 10:13:45,628 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 10:13:45,629 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 10:13:45,633 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2021-03-26 10:13:45,665 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 10:13:45,665 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 10:13:45,666 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 10:13:45,666 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 10:13:45,666 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 10:13:45,666 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 10:13:45,667 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 10:13:45,667 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 10:13:45,667 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 10:13:45,667 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 10:13:45,667 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 10:13:45,667 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 10:13:45,667 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 10:13:45,668 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 10:13:45,668 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 10:13:45,668 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 10:13:45,668 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 10:13:45,668 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 10:13:45,668 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 10:13:45,668 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 10:13:45,669 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 10:13:45,669 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 10:13:45,669 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 10:13:45,669 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 10:13:45,669 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 10:13:45,669 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 10:13:45,669 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 10:13:45,670 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES_DISJUNCTIVE [2021-03-26 10:13:45,670 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 10:13:45,670 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 10:13:45,670 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2021-03-26 10:13:45,980 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 10:13:46,006 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 10:13:46,008 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 10:13:46,009 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 10:13:46,010 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 10:13:46,011 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix053_rmo.opt.i [2021-03-26 10:13:46,072 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b47b4a755/5567f7c9feab442c8c7bbdced2ee5883/FLAGce40c7156 [2021-03-26 10:13:46,593 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 10:13:46,593 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix053_rmo.opt.i [2021-03-26 10:13:46,609 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b47b4a755/5567f7c9feab442c8c7bbdced2ee5883/FLAGce40c7156 [2021-03-26 10:13:46,892 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b47b4a755/5567f7c9feab442c8c7bbdced2ee5883 [2021-03-26 10:13:46,897 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 10:13:46,898 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 10:13:46,901 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 10:13:46,901 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 10:13:46,904 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 10:13:46,905 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 10:13:46" (1/1) ... [2021-03-26 10:13:46,906 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@460444dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:13:46, skipping insertion in model container [2021-03-26 10:13:46,907 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 10:13:46" (1/1) ... [2021-03-26 10:13:46,915 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 10:13:46,962 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 10:13:47,069 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix053_rmo.opt.i[948,961] [2021-03-26 10:13:47,262 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 10:13:47,269 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 10:13:47,277 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix053_rmo.opt.i[948,961] [2021-03-26 10:13:47,326 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 10:13:47,399 INFO L208 MainTranslator]: Completed translation [2021-03-26 10:13:47,399 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:13:47 WrapperNode [2021-03-26 10:13:47,400 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 10:13:47,401 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 10:13:47,401 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 10:13:47,401 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 10:13:47,406 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:13:47" (1/1) ... [2021-03-26 10:13:47,420 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:13:47" (1/1) ... [2021-03-26 10:13:47,441 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 10:13:47,442 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 10:13:47,442 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 10:13:47,442 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 10:13:47,449 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:13:47" (1/1) ... [2021-03-26 10:13:47,449 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:13:47" (1/1) ... [2021-03-26 10:13:47,453 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:13:47" (1/1) ... [2021-03-26 10:13:47,454 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:13:47" (1/1) ... [2021-03-26 10:13:47,461 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:13:47" (1/1) ... [2021-03-26 10:13:47,464 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:13:47" (1/1) ... [2021-03-26 10:13:47,467 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:13:47" (1/1) ... [2021-03-26 10:13:47,471 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 10:13:47,471 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 10:13:47,472 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 10:13:47,472 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 10:13:47,472 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:13:47" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 10:13:47,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 10:13:47,532 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 10:13:47,532 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 10:13:47,532 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 10:13:47,532 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 10:13:47,532 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 10:13:47,532 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 10:13:47,532 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 10:13:47,533 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-26 10:13:47,533 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-26 10:13:47,533 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-03-26 10:13:47,533 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-03-26 10:13:47,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 10:13:47,533 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 10:13:47,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 10:13:47,533 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 10:13:47,535 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-26 10:13:48,933 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 10:13:48,933 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-26 10:13:48,934 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 10:13:48 BoogieIcfgContainer [2021-03-26 10:13:48,934 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 10:13:48,936 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 10:13:48,936 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 10:13:48,938 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 10:13:48,939 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 10:13:46" (1/3) ... [2021-03-26 10:13:48,939 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c04530e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 10:13:48, skipping insertion in model container [2021-03-26 10:13:48,939 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:13:47" (2/3) ... [2021-03-26 10:13:48,940 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c04530e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 10:13:48, skipping insertion in model container [2021-03-26 10:13:48,940 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 10:13:48" (3/3) ... [2021-03-26 10:13:48,941 INFO L111 eAbstractionObserver]: Analyzing ICFG mix053_rmo.opt.i [2021-03-26 10:13:48,945 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 10:13:48,948 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-26 10:13:48,948 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 10:13:48,978 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,978 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,978 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,978 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,979 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,979 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,979 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,979 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,979 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,979 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,979 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,980 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,980 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,980 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,980 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,980 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,980 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,980 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,980 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,981 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,981 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,981 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,981 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,981 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,981 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,982 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,982 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,982 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,982 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,982 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,982 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,982 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,982 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,983 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,983 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,983 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,983 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,983 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,983 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,983 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,983 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,983 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,984 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,984 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,984 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,984 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,984 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,984 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,984 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,984 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,984 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,984 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,985 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,985 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,985 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,985 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,985 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,985 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,985 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,985 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,985 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,985 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,985 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,986 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,986 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,986 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,986 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,986 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,986 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,986 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,988 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,988 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,988 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,988 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,988 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,988 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,988 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,989 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,989 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,989 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,989 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,989 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,989 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,989 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,989 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,989 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,990 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,990 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,990 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,990 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,990 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,990 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,990 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,990 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,990 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,990 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,991 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,991 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,991 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,991 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,991 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,991 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,991 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,991 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,991 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,992 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,992 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,992 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,993 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,994 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,994 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,994 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,994 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,994 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,994 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,995 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,995 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,995 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,995 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,995 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,995 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,995 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,995 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,996 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,996 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,996 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,996 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,996 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,996 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,996 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,997 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,997 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,997 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,997 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,997 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,997 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,997 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,998 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,998 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,998 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,998 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,998 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,998 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,998 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,999 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:48,999 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:49,000 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:49,001 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:49,001 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:49,001 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:49,002 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:49,002 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:49,002 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:49,003 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:49,003 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:49,003 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:49,003 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:49,003 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:49,003 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:49,003 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:49,003 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:49,004 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:49,004 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:49,004 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:49,004 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:49,004 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:49,004 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:49,004 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:49,004 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:49,004 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:49,005 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:49,005 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:49,005 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:49,005 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:49,005 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:49,005 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:49,005 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:49,006 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:49,007 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:49,007 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:49,007 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:49,007 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:49,007 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:49,007 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:49,007 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:49,007 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:49,007 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:49,008 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:49,008 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:49,009 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:49,009 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:49,009 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:49,009 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:13:49,010 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 10:13:49,026 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-03-26 10:13:49,043 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 10:13:49,043 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 10:13:49,043 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 10:13:49,043 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 10:13:49,043 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 10:13:49,043 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 10:13:49,044 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 10:13:49,044 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 10:13:49,054 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 123 places, 112 transitions, 244 flow [2021-03-26 10:13:49,089 INFO L129 PetriNetUnfolder]: 2/108 cut-off events. [2021-03-26 10:13:49,089 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:13:49,093 INFO L84 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 108 events. 2/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 72 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2021-03-26 10:13:49,093 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 112 transitions, 244 flow [2021-03-26 10:13:49,098 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 108 transitions, 228 flow [2021-03-26 10:13:49,099 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:13:49,111 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 108 transitions, 228 flow [2021-03-26 10:13:49,113 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 108 transitions, 228 flow [2021-03-26 10:13:49,115 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 119 places, 108 transitions, 228 flow [2021-03-26 10:13:49,133 INFO L129 PetriNetUnfolder]: 2/108 cut-off events. [2021-03-26 10:13:49,133 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:13:49,134 INFO L84 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 108 events. 2/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 80 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2021-03-26 10:13:49,136 INFO L142 LiptonReduction]: Number of co-enabled transitions 2300 [2021-03-26 10:13:50,393 WARN L205 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 10:13:50,737 WARN L205 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-26 10:13:50,869 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-26 10:13:52,257 INFO L154 LiptonReduction]: Checked pairs total: 3631 [2021-03-26 10:13:52,257 INFO L156 LiptonReduction]: Total number of compositions: 72 [2021-03-26 10:13:52,259 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3161 [2021-03-26 10:13:52,268 INFO L129 PetriNetUnfolder]: 0/27 cut-off events. [2021-03-26 10:13:52,269 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:13:52,269 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:13:52,269 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:13:52,270 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:13:52,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:13:52,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1070938441, now seen corresponding path program 1 times [2021-03-26 10:13:52,281 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:13:52,281 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250963344] [2021-03-26 10:13:52,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:13:52,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:13:52,494 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:13:52,495 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:13:52,496 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:13:52,496 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:13:52,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:13:52,503 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250963344] [2021-03-26 10:13:52,503 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:13:52,503 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:13:52,504 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362249403] [2021-03-26 10:13:52,510 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:13:52,510 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:13:52,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:13:52,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:13:52,525 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 184 [2021-03-26 10:13:52,529 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 43 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:52,530 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:13:52,530 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 184 [2021-03-26 10:13:52,531 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:13:52,587 INFO L129 PetriNetUnfolder]: 9/63 cut-off events. [2021-03-26 10:13:52,588 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:13:52,589 INFO L84 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 63 events. 9/63 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 139 event pairs, 1 based on Foata normal form. 5/65 useless extension candidates. Maximal degree in co-relation 77. Up to 17 conditions per place. [2021-03-26 10:13:52,590 INFO L132 encePairwiseOnDemand]: 180/184 looper letters, 5 selfloop transitions, 2 changer transitions 0/42 dead transitions. [2021-03-26 10:13:52,590 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 42 transitions, 110 flow [2021-03-26 10:13:52,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:13:52,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:13:52,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 508 transitions. [2021-03-26 10:13:52,630 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9202898550724637 [2021-03-26 10:13:52,630 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 508 transitions. [2021-03-26 10:13:52,631 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 508 transitions. [2021-03-26 10:13:52,634 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:13:52,636 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 508 transitions. [2021-03-26 10:13:52,641 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 169.33333333333334) internal successors, (508), 3 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:52,653 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 184.0) internal successors, (736), 4 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:52,654 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 184.0) internal successors, (736), 4 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:52,655 INFO L185 Difference]: Start difference. First operand has 55 places, 43 transitions, 98 flow. Second operand 3 states and 508 transitions. [2021-03-26 10:13:52,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 42 transitions, 110 flow [2021-03-26 10:13:52,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 42 transitions, 106 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-26 10:13:52,659 INFO L241 Difference]: Finished difference. Result has 51 places, 40 transitions, 92 flow [2021-03-26 10:13:52,661 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=184, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=51, PETRI_TRANSITIONS=40} [2021-03-26 10:13:52,662 INFO L343 CegarLoopForPetriNet]: 55 programPoint places, -4 predicate places. [2021-03-26 10:13:52,662 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:13:52,662 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 40 transitions, 92 flow [2021-03-26 10:13:52,663 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 40 transitions, 92 flow [2021-03-26 10:13:52,663 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 51 places, 40 transitions, 92 flow [2021-03-26 10:13:52,667 INFO L129 PetriNetUnfolder]: 0/40 cut-off events. [2021-03-26 10:13:52,668 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:13:52,668 INFO L84 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 40 events. 0/40 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 35 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-26 10:13:52,669 INFO L142 LiptonReduction]: Number of co-enabled transitions 432 [2021-03-26 10:13:53,708 INFO L154 LiptonReduction]: Checked pairs total: 1559 [2021-03-26 10:13:53,709 INFO L156 LiptonReduction]: Total number of compositions: 12 [2021-03-26 10:13:53,709 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1047 [2021-03-26 10:13:53,710 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 70 flow [2021-03-26 10:13:53,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:53,711 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:13:53,711 INFO L263 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] [2021-03-26 10:13:53,711 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 10:13:53,711 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:13:53,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:13:53,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1308224493, now seen corresponding path program 1 times [2021-03-26 10:13:53,712 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:13:53,712 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398923216] [2021-03-26 10:13:53,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:13:53,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:13:53,839 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:13:53,839 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:13:53,845 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-03-26 10:13:53,846 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 10:13:53,857 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-26 10:13:53,858 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 10:13:53,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:13:53,861 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398923216] [2021-03-26 10:13:53,861 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:13:53,862 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:13:53,862 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364346418] [2021-03-26 10:13:53,862 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:13:53,862 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:13:53,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:13:53,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:13:53,864 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 196 [2021-03-26 10:13:53,865 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 161.0) internal successors, (644), 4 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:53,865 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:13:53,865 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 196 [2021-03-26 10:13:53,865 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:13:54,020 INFO L129 PetriNetUnfolder]: 303/672 cut-off events. [2021-03-26 10:13:54,021 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:13:54,023 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1168 conditions, 672 events. 303/672 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 4166 event pairs, 54 based on Foata normal form. 0/604 useless extension candidates. Maximal degree in co-relation 1157. Up to 189 conditions per place. [2021-03-26 10:13:54,026 INFO L132 encePairwiseOnDemand]: 187/196 looper letters, 7 selfloop transitions, 7 changer transitions 15/48 dead transitions. [2021-03-26 10:13:54,026 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 48 transitions, 164 flow [2021-03-26 10:13:54,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:13:54,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:13:54,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 829 transitions. [2021-03-26 10:13:54,029 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8459183673469388 [2021-03-26 10:13:54,030 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 829 transitions. [2021-03-26 10:13:54,030 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 829 transitions. [2021-03-26 10:13:54,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:13:54,030 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 829 transitions. [2021-03-26 10:13:54,032 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 165.8) internal successors, (829), 5 states have internal predecessors, (829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:54,034 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 196.0) internal successors, (1176), 6 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:54,035 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 196.0) internal successors, (1176), 6 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:54,035 INFO L185 Difference]: Start difference. First operand has 40 places, 29 transitions, 70 flow. Second operand 5 states and 829 transitions. [2021-03-26 10:13:54,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 48 transitions, 164 flow [2021-03-26 10:13:54,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 48 transitions, 160 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 10:13:54,037 INFO L241 Difference]: Finished difference. Result has 46 places, 33 transitions, 128 flow [2021-03-26 10:13:54,037 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=128, PETRI_PLACES=46, PETRI_TRANSITIONS=33} [2021-03-26 10:13:54,037 INFO L343 CegarLoopForPetriNet]: 55 programPoint places, -9 predicate places. [2021-03-26 10:13:54,038 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:13:54,038 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 33 transitions, 128 flow [2021-03-26 10:13:54,038 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 33 transitions, 128 flow [2021-03-26 10:13:54,039 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 42 places, 33 transitions, 128 flow [2021-03-26 10:13:54,081 INFO L129 PetriNetUnfolder]: 158/383 cut-off events. [2021-03-26 10:13:54,082 INFO L130 PetriNetUnfolder]: For 138/174 co-relation queries the response was YES. [2021-03-26 10:13:54,083 INFO L84 FinitePrefix]: Finished finitePrefix Result has 904 conditions, 383 events. 158/383 cut-off events. For 138/174 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2299 event pairs, 54 based on Foata normal form. 0/359 useless extension candidates. Maximal degree in co-relation 891. Up to 189 conditions per place. [2021-03-26 10:13:54,088 INFO L142 LiptonReduction]: Number of co-enabled transitions 392 [2021-03-26 10:13:54,739 WARN L205 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 120 [2021-03-26 10:13:54,883 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2021-03-26 10:13:55,269 WARN L205 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 120 [2021-03-26 10:13:55,424 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2021-03-26 10:13:55,437 INFO L154 LiptonReduction]: Checked pairs total: 438 [2021-03-26 10:13:55,437 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 10:13:55,437 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1399 [2021-03-26 10:13:55,438 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 31 transitions, 124 flow [2021-03-26 10:13:55,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 161.0) internal successors, (644), 4 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:55,439 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:13:55,439 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:13:55,439 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 10:13:55,439 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:13:55,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:13:55,440 INFO L82 PathProgramCache]: Analyzing trace with hash -265045011, now seen corresponding path program 1 times [2021-03-26 10:13:55,440 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:13:55,440 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574068243] [2021-03-26 10:13:55,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:13:55,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:13:55,513 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:13:55,514 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:13:55,517 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-03-26 10:13:55,518 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 10:13:55,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:13:55,526 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574068243] [2021-03-26 10:13:55,526 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:13:55,526 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:13:55,526 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327417100] [2021-03-26 10:13:55,527 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:13:55,527 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:13:55,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:13:55,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:13:55,529 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 198 [2021-03-26 10:13:55,529 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 124 flow. Second operand has 4 states, 4 states have (on average 165.75) internal successors, (663), 4 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:55,530 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:13:55,530 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 198 [2021-03-26 10:13:55,530 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:13:55,609 INFO L129 PetriNetUnfolder]: 133/316 cut-off events. [2021-03-26 10:13:55,609 INFO L130 PetriNetUnfolder]: For 183/740 co-relation queries the response was YES. [2021-03-26 10:13:55,610 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1003 conditions, 316 events. 133/316 cut-off events. For 183/740 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1688 event pairs, 12 based on Foata normal form. 8/303 useless extension candidates. Maximal degree in co-relation 990. Up to 163 conditions per place. [2021-03-26 10:13:55,612 INFO L132 encePairwiseOnDemand]: 190/198 looper letters, 13 selfloop transitions, 11 changer transitions 0/41 dead transitions. [2021-03-26 10:13:55,612 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 41 transitions, 232 flow [2021-03-26 10:13:55,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:13:55,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:13:55,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 680 transitions. [2021-03-26 10:13:55,614 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8585858585858586 [2021-03-26 10:13:55,614 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 680 transitions. [2021-03-26 10:13:55,614 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 680 transitions. [2021-03-26 10:13:55,614 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:13:55,615 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 680 transitions. [2021-03-26 10:13:55,616 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 170.0) internal successors, (680), 4 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:55,618 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 198.0) internal successors, (990), 5 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-03-26 10:13:55,618 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 198.0) internal successors, (990), 5 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-03-26 10:13:55,618 INFO L185 Difference]: Start difference. First operand has 40 places, 31 transitions, 124 flow. Second operand 4 states and 680 transitions. [2021-03-26 10:13:55,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 41 transitions, 232 flow [2021-03-26 10:13:55,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 41 transitions, 186 flow, removed 11 selfloop flow, removed 4 redundant places. [2021-03-26 10:13:55,623 INFO L241 Difference]: Finished difference. Result has 42 places, 38 transitions, 182 flow [2021-03-26 10:13:55,623 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=182, PETRI_PLACES=42, PETRI_TRANSITIONS=38} [2021-03-26 10:13:55,624 INFO L343 CegarLoopForPetriNet]: 55 programPoint places, -13 predicate places. [2021-03-26 10:13:55,624 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:13:55,624 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 38 transitions, 182 flow [2021-03-26 10:13:55,625 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 38 transitions, 182 flow [2021-03-26 10:13:55,625 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 42 places, 38 transitions, 182 flow [2021-03-26 10:13:55,654 INFO L129 PetriNetUnfolder]: 133/308 cut-off events. [2021-03-26 10:13:55,655 INFO L130 PetriNetUnfolder]: For 190/296 co-relation queries the response was YES. [2021-03-26 10:13:55,656 INFO L84 FinitePrefix]: Finished finitePrefix Result has 815 conditions, 308 events. 133/308 cut-off events. For 190/296 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1601 event pairs, 25 based on Foata normal form. 1/287 useless extension candidates. Maximal degree in co-relation 803. Up to 163 conditions per place. [2021-03-26 10:13:55,659 INFO L142 LiptonReduction]: Number of co-enabled transitions 508 [2021-03-26 10:13:55,669 INFO L154 LiptonReduction]: Checked pairs total: 286 [2021-03-26 10:13:55,669 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:13:55,670 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 46 [2021-03-26 10:13:55,673 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 38 transitions, 182 flow [2021-03-26 10:13:55,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 165.75) internal successors, (663), 4 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:55,673 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:13:55,674 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:13:55,674 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 10:13:55,674 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:13:55,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:13:55,674 INFO L82 PathProgramCache]: Analyzing trace with hash 442859875, now seen corresponding path program 1 times [2021-03-26 10:13:55,674 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:13:55,674 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403081466] [2021-03-26 10:13:55,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:13:55,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:13:55,752 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:13:55,753 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:13:55,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:13:55,756 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403081466] [2021-03-26 10:13:55,756 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:13:55,756 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-26 10:13:55,756 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040764483] [2021-03-26 10:13:55,756 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:13:55,756 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:13:55,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:13:55,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:13:55,758 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 198 [2021-03-26 10:13:55,759 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 38 transitions, 182 flow. Second operand has 3 states, 3 states have (on average 176.66666666666666) internal successors, (530), 3 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:55,759 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:13:55,759 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 198 [2021-03-26 10:13:55,759 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:13:55,802 INFO L129 PetriNetUnfolder]: 117/295 cut-off events. [2021-03-26 10:13:55,802 INFO L130 PetriNetUnfolder]: For 326/547 co-relation queries the response was YES. [2021-03-26 10:13:55,803 INFO L84 FinitePrefix]: Finished finitePrefix Result has 831 conditions, 295 events. 117/295 cut-off events. For 326/547 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1595 event pairs, 30 based on Foata normal form. 4/279 useless extension candidates. Maximal degree in co-relation 817. Up to 143 conditions per place. [2021-03-26 10:13:55,805 INFO L132 encePairwiseOnDemand]: 194/198 looper letters, 7 selfloop transitions, 6 changer transitions 0/43 dead transitions. [2021-03-26 10:13:55,806 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 43 transitions, 236 flow [2021-03-26 10:13:55,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:13:55,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:13:55,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 535 transitions. [2021-03-26 10:13:55,808 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9006734006734006 [2021-03-26 10:13:55,808 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 535 transitions. [2021-03-26 10:13:55,808 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 535 transitions. [2021-03-26 10:13:55,808 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:13:55,808 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 535 transitions. [2021-03-26 10:13:55,809 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 178.33333333333334) internal successors, (535), 3 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:55,811 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:55,811 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:55,811 INFO L185 Difference]: Start difference. First operand has 42 places, 38 transitions, 182 flow. Second operand 3 states and 535 transitions. [2021-03-26 10:13:55,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 43 transitions, 236 flow [2021-03-26 10:13:55,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 43 transitions, 236 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-26 10:13:55,816 INFO L241 Difference]: Finished difference. Result has 45 places, 43 transitions, 240 flow [2021-03-26 10:13:55,817 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=240, PETRI_PLACES=45, PETRI_TRANSITIONS=43} [2021-03-26 10:13:55,817 INFO L343 CegarLoopForPetriNet]: 55 programPoint places, -10 predicate places. [2021-03-26 10:13:55,817 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:13:55,817 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 43 transitions, 240 flow [2021-03-26 10:13:55,817 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 43 transitions, 240 flow [2021-03-26 10:13:55,818 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 45 places, 43 transitions, 240 flow [2021-03-26 10:13:55,845 INFO L129 PetriNetUnfolder]: 117/277 cut-off events. [2021-03-26 10:13:55,845 INFO L130 PetriNetUnfolder]: For 270/468 co-relation queries the response was YES. [2021-03-26 10:13:55,846 INFO L84 FinitePrefix]: Finished finitePrefix Result has 822 conditions, 277 events. 117/277 cut-off events. For 270/468 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1433 event pairs, 15 based on Foata normal form. 1/258 useless extension candidates. Maximal degree in co-relation 807. Up to 143 conditions per place. [2021-03-26 10:13:55,849 INFO L142 LiptonReduction]: Number of co-enabled transitions 586 [2021-03-26 10:13:55,856 INFO L154 LiptonReduction]: Checked pairs total: 459 [2021-03-26 10:13:55,856 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:13:55,856 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 39 [2021-03-26 10:13:55,862 INFO L480 AbstractCegarLoop]: Abstraction has has 45 places, 43 transitions, 240 flow [2021-03-26 10:13:55,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 176.66666666666666) internal successors, (530), 3 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:55,862 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:13:55,862 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:13:55,863 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 10:13:55,863 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:13:55,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:13:55,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1468881612, now seen corresponding path program 1 times [2021-03-26 10:13:55,864 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:13:55,864 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588486710] [2021-03-26 10:13:55,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:13:55,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:13:55,921 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:13:55,921 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:13:55,925 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 10:13:55,925 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 10:13:55,931 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:13:55,932 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:13:55,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:13:55,932 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588486710] [2021-03-26 10:13:55,932 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:13:55,932 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:13:55,933 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457079197] [2021-03-26 10:13:55,933 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:13:55,933 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:13:55,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:13:55,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:13:55,934 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 198 [2021-03-26 10:13:55,935 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 43 transitions, 240 flow. Second operand has 4 states, 4 states have (on average 162.75) internal successors, (651), 4 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:55,935 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:13:55,935 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 198 [2021-03-26 10:13:55,936 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:13:56,112 INFO L129 PetriNetUnfolder]: 894/1669 cut-off events. [2021-03-26 10:13:56,112 INFO L130 PetriNetUnfolder]: For 515/652 co-relation queries the response was YES. [2021-03-26 10:13:56,120 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3823 conditions, 1669 events. 894/1669 cut-off events. For 515/652 co-relation queries the response was YES. Maximal size of possible extension queue 280. Compared 12125 event pairs, 378 based on Foata normal form. 115/1452 useless extension candidates. Maximal degree in co-relation 3806. Up to 1135 conditions per place. [2021-03-26 10:13:56,128 INFO L132 encePairwiseOnDemand]: 191/198 looper letters, 12 selfloop transitions, 10 changer transitions 0/57 dead transitions. [2021-03-26 10:13:56,128 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 57 transitions, 312 flow [2021-03-26 10:13:56,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:13:56,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:13:56,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 834 transitions. [2021-03-26 10:13:56,131 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8424242424242424 [2021-03-26 10:13:56,131 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 834 transitions. [2021-03-26 10:13:56,131 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 834 transitions. [2021-03-26 10:13:56,132 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:13:56,132 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 834 transitions. [2021-03-26 10:13:56,134 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 166.8) internal successors, (834), 5 states have internal predecessors, (834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:56,135 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 198.0) internal successors, (1188), 6 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:56,136 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 198.0) internal successors, (1188), 6 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:56,136 INFO L185 Difference]: Start difference. First operand has 45 places, 43 transitions, 240 flow. Second operand 5 states and 834 transitions. [2021-03-26 10:13:56,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 57 transitions, 312 flow [2021-03-26 10:13:56,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 57 transitions, 306 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 10:13:56,140 INFO L241 Difference]: Finished difference. Result has 51 places, 52 transitions, 309 flow [2021-03-26 10:13:56,140 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=309, PETRI_PLACES=51, PETRI_TRANSITIONS=52} [2021-03-26 10:13:56,141 INFO L343 CegarLoopForPetriNet]: 55 programPoint places, -4 predicate places. [2021-03-26 10:13:56,141 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:13:56,141 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 52 transitions, 309 flow [2021-03-26 10:13:56,141 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 52 transitions, 309 flow [2021-03-26 10:13:56,142 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 51 places, 52 transitions, 309 flow [2021-03-26 10:13:56,274 INFO L129 PetriNetUnfolder]: 725/1414 cut-off events. [2021-03-26 10:13:56,274 INFO L130 PetriNetUnfolder]: For 1321/1677 co-relation queries the response was YES. [2021-03-26 10:13:56,282 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4289 conditions, 1414 events. 725/1414 cut-off events. For 1321/1677 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 10323 event pairs, 284 based on Foata normal form. 13/1281 useless extension candidates. Maximal degree in co-relation 4270. Up to 882 conditions per place. [2021-03-26 10:13:56,295 INFO L142 LiptonReduction]: Number of co-enabled transitions 874 [2021-03-26 10:13:56,352 INFO L154 LiptonReduction]: Checked pairs total: 573 [2021-03-26 10:13:56,352 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:13:56,352 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 211 [2021-03-26 10:13:56,355 INFO L480 AbstractCegarLoop]: Abstraction has has 51 places, 51 transitions, 303 flow [2021-03-26 10:13:56,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 162.75) internal successors, (651), 4 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:56,355 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:13:56,355 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:13:56,355 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 10:13:56,355 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:13:56,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:13:56,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1110831777, now seen corresponding path program 1 times [2021-03-26 10:13:56,356 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:13:56,356 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412295296] [2021-03-26 10:13:56,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:13:56,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:13:56,416 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:13:56,416 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:13:56,417 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:13:56,418 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:13:56,422 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-03-26 10:13:56,422 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 10:13:56,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:13:56,433 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412295296] [2021-03-26 10:13:56,433 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:13:56,433 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:13:56,433 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755670033] [2021-03-26 10:13:56,434 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:13:56,434 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:13:56,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:13:56,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:13:56,436 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 198 [2021-03-26 10:13:56,437 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 51 transitions, 303 flow. Second operand has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:56,437 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:13:56,437 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 198 [2021-03-26 10:13:56,437 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:13:56,609 INFO L129 PetriNetUnfolder]: 834/1577 cut-off events. [2021-03-26 10:13:56,609 INFO L130 PetriNetUnfolder]: For 1791/2961 co-relation queries the response was YES. [2021-03-26 10:13:56,618 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5021 conditions, 1577 events. 834/1577 cut-off events. For 1791/2961 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 11125 event pairs, 394 based on Foata normal form. 70/1463 useless extension candidates. Maximal degree in co-relation 5000. Up to 1080 conditions per place. [2021-03-26 10:13:56,628 INFO L132 encePairwiseOnDemand]: 190/198 looper letters, 19 selfloop transitions, 18 changer transitions 0/58 dead transitions. [2021-03-26 10:13:56,628 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 58 transitions, 429 flow [2021-03-26 10:13:56,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:13:56,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:13:56,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 679 transitions. [2021-03-26 10:13:56,630 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8573232323232324 [2021-03-26 10:13:56,630 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 679 transitions. [2021-03-26 10:13:56,630 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 679 transitions. [2021-03-26 10:13:56,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:13:56,631 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 679 transitions. [2021-03-26 10:13:56,632 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 169.75) internal successors, (679), 4 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:56,633 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 198.0) internal successors, (990), 5 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-03-26 10:13:56,633 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 198.0) internal successors, (990), 5 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-03-26 10:13:56,634 INFO L185 Difference]: Start difference. First operand has 51 places, 51 transitions, 303 flow. Second operand 4 states and 679 transitions. [2021-03-26 10:13:56,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 58 transitions, 429 flow [2021-03-26 10:13:56,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 58 transitions, 422 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-26 10:13:56,653 INFO L241 Difference]: Finished difference. Result has 53 places, 54 transitions, 414 flow [2021-03-26 10:13:56,653 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=414, PETRI_PLACES=53, PETRI_TRANSITIONS=54} [2021-03-26 10:13:56,653 INFO L343 CegarLoopForPetriNet]: 55 programPoint places, -2 predicate places. [2021-03-26 10:13:56,653 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:13:56,654 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 54 transitions, 414 flow [2021-03-26 10:13:56,654 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 54 transitions, 414 flow [2021-03-26 10:13:56,654 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 53 places, 54 transitions, 414 flow [2021-03-26 10:13:56,781 INFO L129 PetriNetUnfolder]: 831/1562 cut-off events. [2021-03-26 10:13:56,781 INFO L130 PetriNetUnfolder]: For 2018/2702 co-relation queries the response was YES. [2021-03-26 10:13:56,790 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4841 conditions, 1562 events. 831/1562 cut-off events. For 2018/2702 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 11214 event pairs, 351 based on Foata normal form. 5/1424 useless extension candidates. Maximal degree in co-relation 4819. Up to 1038 conditions per place. [2021-03-26 10:13:56,806 INFO L142 LiptonReduction]: Number of co-enabled transitions 818 [2021-03-26 10:13:56,845 INFO L154 LiptonReduction]: Checked pairs total: 291 [2021-03-26 10:13:56,845 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:13:56,845 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 192 [2021-03-26 10:13:56,851 INFO L480 AbstractCegarLoop]: Abstraction has has 53 places, 54 transitions, 414 flow [2021-03-26 10:13:56,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:56,852 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:13:56,852 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:13:56,852 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 10:13:56,852 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:13:56,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:13:56,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1186813785, now seen corresponding path program 1 times [2021-03-26 10:13:56,853 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:13:56,853 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145593368] [2021-03-26 10:13:56,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:13:56,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:13:56,899 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:13:56,899 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:13:56,903 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:13:56,903 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:13:56,908 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 10:13:56,909 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 10:13:56,915 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:13:56,915 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:13:56,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:13:56,916 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145593368] [2021-03-26 10:13:56,916 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:13:56,916 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:13:56,916 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470028822] [2021-03-26 10:13:56,916 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:13:56,916 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:13:56,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:13:56,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:13:56,918 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 198 [2021-03-26 10:13:56,919 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 54 transitions, 414 flow. Second operand has 5 states, 5 states have (on average 162.8) internal successors, (814), 5 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:56,919 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:13:56,919 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 198 [2021-03-26 10:13:56,919 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:13:57,155 INFO L129 PetriNetUnfolder]: 893/1737 cut-off events. [2021-03-26 10:13:57,155 INFO L130 PetriNetUnfolder]: For 2104/3352 co-relation queries the response was YES. [2021-03-26 10:13:57,174 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6335 conditions, 1737 events. 893/1737 cut-off events. For 2104/3352 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 12982 event pairs, 116 based on Foata normal form. 268/1807 useless extension candidates. Maximal degree in co-relation 6311. Up to 1242 conditions per place. [2021-03-26 10:13:57,184 INFO L132 encePairwiseOnDemand]: 191/198 looper letters, 13 selfloop transitions, 14 changer transitions 0/69 dead transitions. [2021-03-26 10:13:57,184 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 69 transitions, 548 flow [2021-03-26 10:13:57,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 10:13:57,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 10:13:57,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1001 transitions. [2021-03-26 10:13:57,187 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8425925925925926 [2021-03-26 10:13:57,187 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1001 transitions. [2021-03-26 10:13:57,187 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1001 transitions. [2021-03-26 10:13:57,187 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:13:57,187 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1001 transitions. [2021-03-26 10:13:57,189 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 166.83333333333334) internal successors, (1001), 6 states have internal predecessors, (1001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:57,191 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 198.0) internal successors, (1386), 7 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:57,191 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 198.0) internal successors, (1386), 7 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:57,191 INFO L185 Difference]: Start difference. First operand has 53 places, 54 transitions, 414 flow. Second operand 6 states and 1001 transitions. [2021-03-26 10:13:57,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 69 transitions, 548 flow [2021-03-26 10:13:57,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 69 transitions, 540 flow, removed 4 selfloop flow, removed 0 redundant places. [2021-03-26 10:13:57,198 INFO L241 Difference]: Finished difference. Result has 61 places, 63 transitions, 526 flow [2021-03-26 10:13:57,198 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=406, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=526, PETRI_PLACES=61, PETRI_TRANSITIONS=63} [2021-03-26 10:13:57,198 INFO L343 CegarLoopForPetriNet]: 55 programPoint places, 6 predicate places. [2021-03-26 10:13:57,198 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:13:57,198 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 63 transitions, 526 flow [2021-03-26 10:13:57,199 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 63 transitions, 526 flow [2021-03-26 10:13:57,199 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 61 places, 63 transitions, 526 flow [2021-03-26 10:13:57,313 INFO L129 PetriNetUnfolder]: 589/1262 cut-off events. [2021-03-26 10:13:57,313 INFO L130 PetriNetUnfolder]: For 3361/4480 co-relation queries the response was YES. [2021-03-26 10:13:57,322 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5671 conditions, 1262 events. 589/1262 cut-off events. For 3361/4480 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 9321 event pairs, 88 based on Foata normal form. 38/1239 useless extension candidates. Maximal degree in co-relation 5644. Up to 919 conditions per place. [2021-03-26 10:13:57,335 INFO L142 LiptonReduction]: Number of co-enabled transitions 1146 [2021-03-26 10:13:57,472 INFO L154 LiptonReduction]: Checked pairs total: 729 [2021-03-26 10:13:57,473 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:13:57,473 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 275 [2021-03-26 10:13:57,473 INFO L480 AbstractCegarLoop]: Abstraction has has 61 places, 62 transitions, 518 flow [2021-03-26 10:13:57,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 162.8) internal successors, (814), 5 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:57,474 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:13:57,474 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:13:57,474 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 10:13:57,474 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:13:57,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:13:57,475 INFO L82 PathProgramCache]: Analyzing trace with hash -774732234, now seen corresponding path program 1 times [2021-03-26 10:13:57,475 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:13:57,475 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087160507] [2021-03-26 10:13:57,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:13:57,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:13:57,540 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:13:57,541 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:13:57,543 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:13:57,544 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:13:57,547 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:13:57,547 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:13:57,553 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 10:13:57,554 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 10:13:57,561 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:13:57,561 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:13:57,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:13:57,562 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087160507] [2021-03-26 10:13:57,562 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:13:57,562 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 10:13:57,562 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563723985] [2021-03-26 10:13:57,562 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 10:13:57,563 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:13:57,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 10:13:57,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 10:13:57,564 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 198 [2021-03-26 10:13:57,565 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 62 transitions, 518 flow. Second operand has 6 states, 6 states have (on average 162.83333333333334) internal successors, (977), 6 states have internal predecessors, (977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:57,565 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:13:57,565 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 198 [2021-03-26 10:13:57,565 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:13:57,754 INFO L129 PetriNetUnfolder]: 615/1206 cut-off events. [2021-03-26 10:13:57,754 INFO L130 PetriNetUnfolder]: For 3274/4938 co-relation queries the response was YES. [2021-03-26 10:13:57,762 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5828 conditions, 1206 events. 615/1206 cut-off events. For 3274/4938 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 8182 event pairs, 23 based on Foata normal form. 277/1335 useless extension candidates. Maximal degree in co-relation 5799. Up to 838 conditions per place. [2021-03-26 10:13:57,769 INFO L132 encePairwiseOnDemand]: 191/198 looper letters, 10 selfloop transitions, 18 changer transitions 4/74 dead transitions. [2021-03-26 10:13:57,770 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 74 transitions, 674 flow [2021-03-26 10:13:57,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 10:13:57,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 10:13:57,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1168 transitions. [2021-03-26 10:13:57,773 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8427128427128427 [2021-03-26 10:13:57,773 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1168 transitions. [2021-03-26 10:13:57,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1168 transitions. [2021-03-26 10:13:57,774 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:13:57,774 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1168 transitions. [2021-03-26 10:13:57,776 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 166.85714285714286) internal successors, (1168), 7 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:57,778 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 198.0) internal successors, (1584), 8 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:57,780 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 198.0) internal successors, (1584), 8 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:57,780 INFO L185 Difference]: Start difference. First operand has 61 places, 62 transitions, 518 flow. Second operand 7 states and 1168 transitions. [2021-03-26 10:13:57,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 74 transitions, 674 flow [2021-03-26 10:13:57,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 74 transitions, 612 flow, removed 26 selfloop flow, removed 4 redundant places. [2021-03-26 10:13:57,802 INFO L241 Difference]: Finished difference. Result has 64 places, 67 transitions, 578 flow [2021-03-26 10:13:57,802 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=440, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=578, PETRI_PLACES=64, PETRI_TRANSITIONS=67} [2021-03-26 10:13:57,803 INFO L343 CegarLoopForPetriNet]: 55 programPoint places, 9 predicate places. [2021-03-26 10:13:57,803 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:13:57,803 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 67 transitions, 578 flow [2021-03-26 10:13:57,803 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 67 transitions, 578 flow [2021-03-26 10:13:57,804 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 64 places, 67 transitions, 578 flow [2021-03-26 10:13:57,908 INFO L129 PetriNetUnfolder]: 303/725 cut-off events. [2021-03-26 10:13:57,908 INFO L130 PetriNetUnfolder]: For 1978/2436 co-relation queries the response was YES. [2021-03-26 10:13:57,913 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3268 conditions, 725 events. 303/725 cut-off events. For 1978/2436 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 4898 event pairs, 10 based on Foata normal form. 3/693 useless extension candidates. Maximal degree in co-relation 3240. Up to 462 conditions per place. [2021-03-26 10:13:57,921 INFO L142 LiptonReduction]: Number of co-enabled transitions 1084 [2021-03-26 10:13:57,968 INFO L154 LiptonReduction]: Checked pairs total: 726 [2021-03-26 10:13:57,968 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:13:57,968 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 165 [2021-03-26 10:13:57,969 INFO L480 AbstractCegarLoop]: Abstraction has has 64 places, 66 transitions, 568 flow [2021-03-26 10:13:57,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 162.83333333333334) internal successors, (977), 6 states have internal predecessors, (977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:57,969 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:13:57,970 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:13:57,970 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 10:13:57,970 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:13:57,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:13:57,970 INFO L82 PathProgramCache]: Analyzing trace with hash -886447996, now seen corresponding path program 1 times [2021-03-26 10:13:57,970 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:13:57,970 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23205541] [2021-03-26 10:13:57,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:13:58,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:13:58,024 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:13:58,025 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:13:58,028 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:13:58,028 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:13:58,032 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:13:58,033 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:13:58,037 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:13:58,038 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:13:58,044 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 10:13:58,045 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 10:13:58,056 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:13:58,056 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:13:58,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:13:58,057 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23205541] [2021-03-26 10:13:58,057 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:13:58,057 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-26 10:13:58,057 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020345232] [2021-03-26 10:13:58,057 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 10:13:58,057 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:13:58,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 10:13:58,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-26 10:13:58,060 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 198 [2021-03-26 10:13:58,061 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 66 transitions, 568 flow. Second operand has 7 states, 7 states have (on average 162.85714285714286) internal successors, (1140), 7 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:58,061 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:13:58,061 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 198 [2021-03-26 10:13:58,061 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:13:58,263 INFO L129 PetriNetUnfolder]: 522/972 cut-off events. [2021-03-26 10:13:58,263 INFO L130 PetriNetUnfolder]: For 2624/3708 co-relation queries the response was YES. [2021-03-26 10:13:58,270 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4369 conditions, 972 events. 522/972 cut-off events. For 2624/3708 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 5997 event pairs, 13 based on Foata normal form. 143/974 useless extension candidates. Maximal degree in co-relation 4339. Up to 536 conditions per place. [2021-03-26 10:13:58,274 INFO L132 encePairwiseOnDemand]: 191/198 looper letters, 6 selfloop transitions, 18 changer transitions 14/71 dead transitions. [2021-03-26 10:13:58,274 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 71 transitions, 634 flow [2021-03-26 10:13:58,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-26 10:13:58,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-26 10:13:58,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1327 transitions. [2021-03-26 10:13:58,277 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8377525252525253 [2021-03-26 10:13:58,277 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1327 transitions. [2021-03-26 10:13:58,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1327 transitions. [2021-03-26 10:13:58,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:13:58,278 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1327 transitions. [2021-03-26 10:13:58,280 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 165.875) internal successors, (1327), 8 states have internal predecessors, (1327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:58,282 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 198.0) internal successors, (1782), 9 states have internal predecessors, (1782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:58,283 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 198.0) internal successors, (1782), 9 states have internal predecessors, (1782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:58,283 INFO L185 Difference]: Start difference. First operand has 64 places, 66 transitions, 568 flow. Second operand 8 states and 1327 transitions. [2021-03-26 10:13:58,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 71 transitions, 634 flow [2021-03-26 10:13:58,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 71 transitions, 589 flow, removed 16 selfloop flow, removed 4 redundant places. [2021-03-26 10:13:58,304 INFO L241 Difference]: Finished difference. Result has 68 places, 54 transitions, 445 flow [2021-03-26 10:13:58,304 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=475, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=445, PETRI_PLACES=68, PETRI_TRANSITIONS=54} [2021-03-26 10:13:58,304 INFO L343 CegarLoopForPetriNet]: 55 programPoint places, 13 predicate places. [2021-03-26 10:13:58,304 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:13:58,304 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 54 transitions, 445 flow [2021-03-26 10:13:58,304 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 54 transitions, 445 flow [2021-03-26 10:13:58,305 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 67 places, 54 transitions, 445 flow [2021-03-26 10:13:58,329 INFO L129 PetriNetUnfolder]: 111/279 cut-off events. [2021-03-26 10:13:58,329 INFO L130 PetriNetUnfolder]: For 695/837 co-relation queries the response was YES. [2021-03-26 10:13:58,331 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1184 conditions, 279 events. 111/279 cut-off events. For 695/837 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1459 event pairs, 3 based on Foata normal form. 1/260 useless extension candidates. Maximal degree in co-relation 1155. Up to 102 conditions per place. [2021-03-26 10:13:58,333 INFO L142 LiptonReduction]: Number of co-enabled transitions 620 [2021-03-26 10:13:58,662 WARN L205 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2021-03-26 10:13:58,785 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2021-03-26 10:13:59,113 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2021-03-26 10:13:59,274 WARN L205 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2021-03-26 10:13:59,284 INFO L154 LiptonReduction]: Checked pairs total: 839 [2021-03-26 10:13:59,284 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 10:13:59,285 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 981 [2021-03-26 10:13:59,285 INFO L480 AbstractCegarLoop]: Abstraction has has 64 places, 51 transitions, 429 flow [2021-03-26 10:13:59,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 162.85714285714286) internal successors, (1140), 7 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:59,286 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:13:59,286 INFO L263 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] [2021-03-26 10:13:59,286 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 10:13:59,286 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:13:59,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:13:59,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1307434838, now seen corresponding path program 1 times [2021-03-26 10:13:59,287 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:13:59,287 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031853621] [2021-03-26 10:13:59,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:13:59,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:13:59,351 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:13:59,351 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:13:59,351 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:13:59,352 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:13:59,354 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:13:59,354 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:13:59,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:13:59,359 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031853621] [2021-03-26 10:13:59,359 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:13:59,359 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:13:59,359 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989517723] [2021-03-26 10:13:59,359 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:13:59,359 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:13:59,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:13:59,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:13:59,361 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 200 [2021-03-26 10:13:59,361 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 51 transitions, 429 flow. Second operand has 4 states, 4 states have (on average 175.0) internal successors, (700), 4 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:59,362 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:13:59,362 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 200 [2021-03-26 10:13:59,362 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:13:59,419 INFO L129 PetriNetUnfolder]: 193/448 cut-off events. [2021-03-26 10:13:59,420 INFO L130 PetriNetUnfolder]: For 1952/2143 co-relation queries the response was YES. [2021-03-26 10:13:59,422 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1878 conditions, 448 events. 193/448 cut-off events. For 1952/2143 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 2720 event pairs, 16 based on Foata normal form. 29/447 useless extension candidates. Maximal degree in co-relation 1848. Up to 158 conditions per place. [2021-03-26 10:13:59,424 INFO L132 encePairwiseOnDemand]: 197/200 looper letters, 4 selfloop transitions, 1 changer transitions 8/54 dead transitions. [2021-03-26 10:13:59,424 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 54 transitions, 477 flow [2021-03-26 10:13:59,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:13:59,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:13:59,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 702 transitions. [2021-03-26 10:13:59,426 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8775 [2021-03-26 10:13:59,427 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 702 transitions. [2021-03-26 10:13:59,427 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 702 transitions. [2021-03-26 10:13:59,427 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:13:59,427 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 702 transitions. [2021-03-26 10:13:59,429 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 175.5) internal successors, (702), 4 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:59,430 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 200.0) internal successors, (1000), 5 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:59,430 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 200.0) internal successors, (1000), 5 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:59,431 INFO L185 Difference]: Start difference. First operand has 64 places, 51 transitions, 429 flow. Second operand 4 states and 702 transitions. [2021-03-26 10:13:59,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 54 transitions, 477 flow [2021-03-26 10:13:59,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 54 transitions, 388 flow, removed 19 selfloop flow, removed 10 redundant places. [2021-03-26 10:13:59,440 INFO L241 Difference]: Finished difference. Result has 59 places, 46 transitions, 309 flow [2021-03-26 10:13:59,441 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=309, PETRI_PLACES=59, PETRI_TRANSITIONS=46} [2021-03-26 10:13:59,441 INFO L343 CegarLoopForPetriNet]: 55 programPoint places, 4 predicate places. [2021-03-26 10:13:59,441 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:13:59,441 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 46 transitions, 309 flow [2021-03-26 10:13:59,442 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 46 transitions, 309 flow [2021-03-26 10:13:59,442 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 58 places, 46 transitions, 309 flow [2021-03-26 10:13:59,478 INFO L129 PetriNetUnfolder]: 83/211 cut-off events. [2021-03-26 10:13:59,479 INFO L130 PetriNetUnfolder]: For 525/560 co-relation queries the response was YES. [2021-03-26 10:13:59,480 INFO L84 FinitePrefix]: Finished finitePrefix Result has 697 conditions, 211 events. 83/211 cut-off events. For 525/560 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1015 event pairs, 6 based on Foata normal form. 12/207 useless extension candidates. Maximal degree in co-relation 674. Up to 66 conditions per place. [2021-03-26 10:13:59,481 INFO L142 LiptonReduction]: Number of co-enabled transitions 450 [2021-03-26 10:13:59,538 INFO L154 LiptonReduction]: Checked pairs total: 190 [2021-03-26 10:13:59,539 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 10:13:59,539 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 98 [2021-03-26 10:13:59,540 INFO L480 AbstractCegarLoop]: Abstraction has has 57 places, 45 transitions, 310 flow [2021-03-26 10:13:59,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 175.0) internal successors, (700), 4 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:59,540 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:13:59,540 INFO L263 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] [2021-03-26 10:13:59,540 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-26 10:13:59,540 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:13:59,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:13:59,541 INFO L82 PathProgramCache]: Analyzing trace with hash -447044943, now seen corresponding path program 1 times [2021-03-26 10:13:59,541 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:13:59,541 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539307535] [2021-03-26 10:13:59,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:13:59,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:13:59,618 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:13:59,619 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:13:59,620 INFO L142 QuantifierPusher]: treesize reduction 12, result has 55.6 percent of original size [2021-03-26 10:13:59,624 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 10:13:59,634 INFO L142 QuantifierPusher]: treesize reduction 12, result has 80.3 percent of original size [2021-03-26 10:13:59,637 INFO L147 QuantifierPusher]: treesize reduction 9, result has 81.6 percent of original size 40 [2021-03-26 10:13:59,655 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:13:59,655 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 10:13:59,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:13:59,660 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539307535] [2021-03-26 10:13:59,660 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:13:59,660 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:13:59,660 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815298637] [2021-03-26 10:13:59,660 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:13:59,661 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:13:59,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:13:59,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:13:59,662 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 202 [2021-03-26 10:13:59,663 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 45 transitions, 310 flow. Second operand has 5 states, 5 states have (on average 157.0) internal successors, (785), 5 states have internal predecessors, (785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:59,663 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:13:59,663 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 202 [2021-03-26 10:13:59,663 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:13:59,746 INFO L129 PetriNetUnfolder]: 185/446 cut-off events. [2021-03-26 10:13:59,747 INFO L130 PetriNetUnfolder]: For 1834/1958 co-relation queries the response was YES. [2021-03-26 10:13:59,749 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1455 conditions, 446 events. 185/446 cut-off events. For 1834/1958 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 2753 event pairs, 13 based on Foata normal form. 45/464 useless extension candidates. Maximal degree in co-relation 1430. Up to 152 conditions per place. [2021-03-26 10:13:59,750 INFO L132 encePairwiseOnDemand]: 198/202 looper letters, 3 selfloop transitions, 6 changer transitions 6/52 dead transitions. [2021-03-26 10:13:59,750 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 52 transitions, 390 flow [2021-03-26 10:13:59,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:13:59,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:13:59,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 789 transitions. [2021-03-26 10:13:59,752 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7811881188118812 [2021-03-26 10:13:59,752 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 789 transitions. [2021-03-26 10:13:59,753 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 789 transitions. [2021-03-26 10:13:59,753 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:13:59,753 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 789 transitions. [2021-03-26 10:13:59,754 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 157.8) internal successors, (789), 5 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:59,756 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:59,756 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:59,756 INFO L185 Difference]: Start difference. First operand has 57 places, 45 transitions, 310 flow. Second operand 5 states and 789 transitions. [2021-03-26 10:13:59,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 52 transitions, 390 flow [2021-03-26 10:13:59,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 52 transitions, 381 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-03-26 10:13:59,763 INFO L241 Difference]: Finished difference. Result has 60 places, 46 transitions, 325 flow [2021-03-26 10:13:59,763 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=301, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=325, PETRI_PLACES=60, PETRI_TRANSITIONS=46} [2021-03-26 10:13:59,763 INFO L343 CegarLoopForPetriNet]: 55 programPoint places, 5 predicate places. [2021-03-26 10:13:59,763 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:13:59,764 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 46 transitions, 325 flow [2021-03-26 10:13:59,764 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 46 transitions, 325 flow [2021-03-26 10:13:59,764 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 60 places, 46 transitions, 325 flow [2021-03-26 10:13:59,782 INFO L129 PetriNetUnfolder]: 102/235 cut-off events. [2021-03-26 10:13:59,783 INFO L130 PetriNetUnfolder]: For 429/462 co-relation queries the response was YES. [2021-03-26 10:13:59,784 INFO L84 FinitePrefix]: Finished finitePrefix Result has 778 conditions, 235 events. 102/235 cut-off events. For 429/462 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1177 event pairs, 4 based on Foata normal form. 9/224 useless extension candidates. Maximal degree in co-relation 753. Up to 76 conditions per place. [2021-03-26 10:13:59,785 INFO L142 LiptonReduction]: Number of co-enabled transitions 342 [2021-03-26 10:13:59,899 INFO L154 LiptonReduction]: Checked pairs total: 9 [2021-03-26 10:13:59,899 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:13:59,899 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 136 [2021-03-26 10:13:59,899 INFO L480 AbstractCegarLoop]: Abstraction has has 60 places, 46 transitions, 328 flow [2021-03-26 10:13:59,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 157.0) internal successors, (785), 5 states have internal predecessors, (785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:59,900 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:13:59,900 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:13:59,900 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-26 10:13:59,900 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:13:59,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:13:59,901 INFO L82 PathProgramCache]: Analyzing trace with hash -876230039, now seen corresponding path program 1 times [2021-03-26 10:13:59,901 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:13:59,901 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57127993] [2021-03-26 10:13:59,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:13:59,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:13:59,939 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:13:59,940 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:13:59,940 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:13:59,940 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:13:59,944 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-03-26 10:13:59,945 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 10:13:59,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:13:59,953 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57127993] [2021-03-26 10:13:59,953 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:13:59,953 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:13:59,953 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160511525] [2021-03-26 10:13:59,953 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:13:59,953 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:13:59,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:13:59,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:13:59,955 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 203 [2021-03-26 10:13:59,955 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 46 transitions, 328 flow. Second operand has 4 states, 4 states have (on average 167.0) internal successors, (668), 4 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:13:59,955 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:13:59,955 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 203 [2021-03-26 10:13:59,955 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:14:00,000 INFO L129 PetriNetUnfolder]: 137/303 cut-off events. [2021-03-26 10:14:00,000 INFO L130 PetriNetUnfolder]: For 609/661 co-relation queries the response was YES. [2021-03-26 10:14:00,002 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1018 conditions, 303 events. 137/303 cut-off events. For 609/661 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 1590 event pairs, 3 based on Foata normal form. 16/297 useless extension candidates. Maximal degree in co-relation 991. Up to 102 conditions per place. [2021-03-26 10:14:00,002 INFO L132 encePairwiseOnDemand]: 195/203 looper letters, 3 selfloop transitions, 6 changer transitions 11/46 dead transitions. [2021-03-26 10:14:00,002 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 46 transitions, 366 flow [2021-03-26 10:14:00,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:14:00,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:14:00,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 675 transitions. [2021-03-26 10:14:00,005 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8312807881773399 [2021-03-26 10:14:00,005 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 675 transitions. [2021-03-26 10:14:00,005 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 675 transitions. [2021-03-26 10:14:00,005 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:14:00,005 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 675 transitions. [2021-03-26 10:14:00,006 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 168.75) internal successors, (675), 4 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:00,008 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 203.0) internal successors, (1015), 5 states have internal predecessors, (1015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:00,008 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 203.0) internal successors, (1015), 5 states have internal predecessors, (1015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:00,008 INFO L185 Difference]: Start difference. First operand has 60 places, 46 transitions, 328 flow. Second operand 4 states and 675 transitions. [2021-03-26 10:14:00,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 46 transitions, 366 flow [2021-03-26 10:14:00,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 46 transitions, 353 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-03-26 10:14:00,012 INFO L241 Difference]: Finished difference. Result has 61 places, 35 transitions, 228 flow [2021-03-26 10:14:00,013 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=315, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=228, PETRI_PLACES=61, PETRI_TRANSITIONS=35} [2021-03-26 10:14:00,013 INFO L343 CegarLoopForPetriNet]: 55 programPoint places, 6 predicate places. [2021-03-26 10:14:00,013 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:14:00,013 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 35 transitions, 228 flow [2021-03-26 10:14:00,013 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 35 transitions, 228 flow [2021-03-26 10:14:00,014 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 60 places, 35 transitions, 228 flow [2021-03-26 10:14:00,020 INFO L129 PetriNetUnfolder]: 33/79 cut-off events. [2021-03-26 10:14:00,021 INFO L130 PetriNetUnfolder]: For 175/190 co-relation queries the response was YES. [2021-03-26 10:14:00,021 INFO L84 FinitePrefix]: Finished finitePrefix Result has 262 conditions, 79 events. 33/79 cut-off events. For 175/190 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 220 event pairs, 0 based on Foata normal form. 2/73 useless extension candidates. Maximal degree in co-relation 236. Up to 26 conditions per place. [2021-03-26 10:14:00,022 INFO L142 LiptonReduction]: Number of co-enabled transitions 146 [2021-03-26 10:14:00,698 WARN L205 SmtUtils]: Spent 675.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 178 [2021-03-26 10:14:01,008 WARN L205 SmtUtils]: Spent 308.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2021-03-26 10:14:02,262 WARN L205 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 302 DAG size of output: 258 [2021-03-26 10:14:02,807 WARN L205 SmtUtils]: Spent 544.00 ms on a formula simplification that was a NOOP. DAG size: 255 [2021-03-26 10:14:03,446 WARN L205 SmtUtils]: Spent 635.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 178 [2021-03-26 10:14:03,730 WARN L205 SmtUtils]: Spent 283.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2021-03-26 10:14:04,958 WARN L205 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 302 DAG size of output: 258 [2021-03-26 10:14:05,544 WARN L205 SmtUtils]: Spent 584.00 ms on a formula simplification that was a NOOP. DAG size: 255 [2021-03-26 10:14:05,687 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 69 [2021-03-26 10:14:05,976 WARN L205 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 88 [2021-03-26 10:14:06,053 INFO L154 LiptonReduction]: Checked pairs total: 37 [2021-03-26 10:14:06,054 INFO L156 LiptonReduction]: Total number of compositions: 4 [2021-03-26 10:14:06,054 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 6041 [2021-03-26 10:14:06,054 INFO L480 AbstractCegarLoop]: Abstraction has has 58 places, 33 transitions, 233 flow [2021-03-26 10:14:06,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 167.0) internal successors, (668), 4 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:06,055 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:14:06,055 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:14:06,055 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-26 10:14:06,055 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:14:06,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:14:06,056 INFO L82 PathProgramCache]: Analyzing trace with hash -231903240, now seen corresponding path program 1 times [2021-03-26 10:14:06,056 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:14:06,056 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285167252] [2021-03-26 10:14:06,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:14:06,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 10:14:06,104 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 10:14:06,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 10:14:06,151 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 10:14:06,187 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 10:14:06,187 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 10:14:06,187 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-26 10:14:06,287 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 10:14:06 BasicIcfg [2021-03-26 10:14:06,287 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 10:14:06,288 INFO L168 Benchmark]: Toolchain (without parser) took 19389.66 ms. Allocated memory was 255.9 MB in the beginning and 742.4 MB in the end (delta: 486.5 MB). Free memory was 237.0 MB in the beginning and 490.5 MB in the end (delta: -253.5 MB). Peak memory consumption was 231.6 MB. Max. memory is 16.0 GB. [2021-03-26 10:14:06,288 INFO L168 Benchmark]: CDTParser took 0.50 ms. Allocated memory is still 255.9 MB. Free memory is still 237.6 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 10:14:06,288 INFO L168 Benchmark]: CACSL2BoogieTranslator took 498.60 ms. Allocated memory was 255.9 MB in the beginning and 350.2 MB in the end (delta: 94.4 MB). Free memory was 236.4 MB in the beginning and 310.5 MB in the end (delta: -74.1 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. [2021-03-26 10:14:06,289 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.12 ms. Allocated memory is still 350.2 MB. Free memory was 310.5 MB in the beginning and 307.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-26 10:14:06,289 INFO L168 Benchmark]: Boogie Preprocessor took 28.52 ms. Allocated memory is still 350.2 MB. Free memory was 307.7 MB in the beginning and 305.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 10:14:06,289 INFO L168 Benchmark]: RCFGBuilder took 1463.12 ms. Allocated memory is still 350.2 MB. Free memory was 305.6 MB in the beginning and 325.1 MB in the end (delta: -19.6 MB). Peak memory consumption was 60.8 MB. Max. memory is 16.0 GB. [2021-03-26 10:14:06,289 INFO L168 Benchmark]: TraceAbstraction took 17351.34 ms. Allocated memory was 350.2 MB in the beginning and 742.4 MB in the end (delta: 392.2 MB). Free memory was 324.1 MB in the beginning and 490.5 MB in the end (delta: -166.4 MB). Peak memory consumption was 224.7 MB. Max. memory is 16.0 GB. [2021-03-26 10:14:06,291 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.50 ms. Allocated memory is still 255.9 MB. Free memory is still 237.6 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 498.60 ms. Allocated memory was 255.9 MB in the beginning and 350.2 MB in the end (delta: 94.4 MB). Free memory was 236.4 MB in the beginning and 310.5 MB in the end (delta: -74.1 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 41.12 ms. Allocated memory is still 350.2 MB. Free memory was 310.5 MB in the beginning and 307.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 28.52 ms. Allocated memory is still 350.2 MB. Free memory was 307.7 MB in the beginning and 305.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1463.12 ms. Allocated memory is still 350.2 MB. Free memory was 305.6 MB in the beginning and 325.1 MB in the end (delta: -19.6 MB). Peak memory consumption was 60.8 MB. Max. memory is 16.0 GB. * TraceAbstraction took 17351.34 ms. Allocated memory was 350.2 MB in the beginning and 742.4 MB in the end (delta: 392.2 MB). Free memory was 324.1 MB in the beginning and 490.5 MB in the end (delta: -166.4 MB). Peak memory consumption was 224.7 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3143.8ms, 119 PlacesBefore, 55 PlacesAfterwards, 108 TransitionsBefore, 43 TransitionsAfterwards, 2300 CoEnabledTransitionPairs, 6 FixpointIterations, 29 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 1 ChoiceCompositions, 72 TotalNumberOfCompositions, 3631 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1980, positive: 1901, positive conditional: 1901, positive unconditional: 0, negative: 79, negative conditional: 79, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1980, positive: 1901, positive conditional: 0, positive unconditional: 1901, negative: 79, negative conditional: 0, negative unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1980, positive: 1901, positive conditional: 0, positive unconditional: 1901, negative: 79, negative conditional: 0, negative unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1537, positive: 1497, positive conditional: 0, positive unconditional: 1497, negative: 40, negative conditional: 0, negative unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1537, positive: 1480, positive conditional: 0, positive unconditional: 1480, negative: 57, negative conditional: 0, negative unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 57, positive: 17, positive conditional: 0, positive unconditional: 17, negative: 40, negative conditional: 0, negative unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 411, positive: 50, positive conditional: 0, positive unconditional: 50, negative: 361, negative conditional: 0, negative unconditional: 361, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1980, positive: 404, positive conditional: 0, positive unconditional: 404, negative: 39, negative conditional: 0, negative unconditional: 39, unknown: 1537, unknown conditional: 0, unknown unconditional: 1537] , Statistics on independence cache: Total cache size (in pairs): 1537, Positive cache size: 1497, Positive conditional cache size: 0, Positive unconditional cache size: 1497, Negative cache size: 40, Negative conditional cache size: 0, Negative unconditional cache size: 40, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1045.9ms, 51 PlacesBefore, 40 PlacesAfterwards, 40 TransitionsBefore, 29 TransitionsAfterwards, 432 CoEnabledTransitionPairs, 4 FixpointIterations, 8 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 12 TotalNumberOfCompositions, 1559 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 591, positive: 506, positive conditional: 506, positive unconditional: 0, negative: 85, negative conditional: 85, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 591, positive: 506, positive conditional: 36, positive unconditional: 470, negative: 85, negative conditional: 8, negative unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 591, positive: 506, positive conditional: 36, positive unconditional: 470, negative: 85, negative conditional: 8, negative unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 147, positive: 129, positive conditional: 7, positive unconditional: 122, negative: 18, negative conditional: 2, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 147, positive: 121, positive conditional: 0, positive unconditional: 121, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 26, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 18, negative conditional: 2, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 310, positive: 38, positive conditional: 0, positive unconditional: 38, negative: 272, negative conditional: 82, negative unconditional: 190, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 591, positive: 377, positive conditional: 29, positive unconditional: 348, negative: 67, negative conditional: 6, negative unconditional: 61, unknown: 147, unknown conditional: 9, unknown unconditional: 138] , Statistics on independence cache: Total cache size (in pairs): 1684, Positive cache size: 1626, Positive conditional cache size: 7, Positive unconditional cache size: 1619, Negative cache size: 58, Negative conditional cache size: 2, Negative unconditional cache size: 56, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1398.9ms, 46 PlacesBefore, 40 PlacesAfterwards, 33 TransitionsBefore, 31 TransitionsAfterwards, 392 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 438 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 110, positive: 89, positive conditional: 89, positive unconditional: 0, negative: 21, negative conditional: 21, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 110, positive: 89, positive conditional: 0, positive unconditional: 89, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 110, positive: 89, positive conditional: 0, positive unconditional: 89, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 15, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 110, positive: 86, positive conditional: 0, positive unconditional: 86, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 1688, Positive cache size: 1629, Positive conditional cache size: 7, Positive unconditional cache size: 1622, Negative cache size: 59, Negative conditional cache size: 2, Negative unconditional cache size: 57, Eliminated conditions: 21 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 44.8ms, 42 PlacesBefore, 42 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 508 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 286 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 72, positive: 60, positive conditional: 60, positive unconditional: 0, negative: 12, negative conditional: 12, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 72, positive: 60, positive conditional: 0, positive unconditional: 60, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 72, positive: 60, positive conditional: 0, positive unconditional: 60, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 72, positive: 52, positive conditional: 0, positive unconditional: 52, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 1697, Positive cache size: 1637, Positive conditional cache size: 7, Positive unconditional cache size: 1630, Negative cache size: 60, Negative conditional cache size: 2, Negative unconditional cache size: 58, Eliminated conditions: 10 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 38.6ms, 45 PlacesBefore, 45 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 586 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 459 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 82, positive: 65, positive conditional: 65, positive unconditional: 0, negative: 17, negative conditional: 17, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 82, positive: 65, positive conditional: 0, positive unconditional: 65, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 82, positive: 65, positive conditional: 0, positive unconditional: 65, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 82, positive: 64, positive conditional: 0, positive unconditional: 64, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 1698, Positive cache size: 1638, Positive conditional cache size: 7, Positive unconditional cache size: 1631, Negative cache size: 60, Negative conditional cache size: 2, Negative unconditional cache size: 58, Eliminated conditions: 19 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 210.9ms, 51 PlacesBefore, 51 PlacesAfterwards, 52 TransitionsBefore, 51 TransitionsAfterwards, 874 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 573 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 49, positive: 33, positive conditional: 33, positive unconditional: 0, negative: 16, negative conditional: 16, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 49, positive: 33, positive conditional: 14, positive unconditional: 19, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 49, positive: 33, positive conditional: 14, positive unconditional: 19, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 2, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 49, positive: 29, positive conditional: 12, positive unconditional: 17, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 4, unknown conditional: 2, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 1702, Positive cache size: 1642, Positive conditional cache size: 9, Positive unconditional cache size: 1633, Negative cache size: 60, Negative conditional cache size: 2, Negative unconditional cache size: 58, Eliminated conditions: 13 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 191.2ms, 53 PlacesBefore, 53 PlacesAfterwards, 54 TransitionsBefore, 54 TransitionsAfterwards, 818 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 291 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 98, positive: 89, positive conditional: 89, positive unconditional: 0, negative: 9, negative conditional: 9, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 98, positive: 89, positive conditional: 15, positive unconditional: 74, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 98, positive: 89, positive conditional: 15, positive unconditional: 74, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 98, positive: 86, positive conditional: 15, positive unconditional: 71, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 1705, Positive cache size: 1645, Positive conditional cache size: 9, Positive unconditional cache size: 1636, Negative cache size: 60, Negative conditional cache size: 2, Negative unconditional cache size: 58, Eliminated conditions: 24 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 274.1ms, 61 PlacesBefore, 61 PlacesAfterwards, 63 TransitionsBefore, 62 TransitionsAfterwards, 1146 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 729 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 178, positive: 160, positive conditional: 160, positive unconditional: 0, negative: 18, negative conditional: 18, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 178, positive: 160, positive conditional: 40, positive unconditional: 120, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 178, positive: 160, positive conditional: 40, positive unconditional: 120, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 2, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 178, positive: 157, positive conditional: 38, positive unconditional: 119, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 3, unknown conditional: 2, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 1708, Positive cache size: 1648, Positive conditional cache size: 11, Positive unconditional cache size: 1637, Negative cache size: 60, Negative conditional cache size: 2, Negative unconditional cache size: 58, Eliminated conditions: 48 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 165.2ms, 64 PlacesBefore, 64 PlacesAfterwards, 67 TransitionsBefore, 66 TransitionsAfterwards, 1084 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 726 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 238, positive: 220, positive conditional: 220, positive unconditional: 0, negative: 18, negative conditional: 18, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 238, positive: 220, positive conditional: 83, positive unconditional: 137, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 238, positive: 220, positive conditional: 83, positive unconditional: 137, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 2, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 238, positive: 217, positive conditional: 81, positive unconditional: 136, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 3, unknown conditional: 2, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 1711, Positive cache size: 1651, Positive conditional cache size: 13, Positive unconditional cache size: 1638, Negative cache size: 60, Negative conditional cache size: 2, Negative unconditional cache size: 58, Eliminated conditions: 65 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 980.2ms, 68 PlacesBefore, 64 PlacesAfterwards, 54 TransitionsBefore, 51 TransitionsAfterwards, 620 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 839 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 210, positive: 180, positive conditional: 180, positive unconditional: 0, negative: 30, negative conditional: 30, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 210, positive: 180, positive conditional: 94, positive unconditional: 86, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 210, positive: 180, positive conditional: 94, positive unconditional: 86, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 210, positive: 178, positive conditional: 92, positive unconditional: 86, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1713, Positive cache size: 1653, Positive conditional cache size: 15, Positive unconditional cache size: 1638, Negative cache size: 60, Negative conditional cache size: 2, Negative unconditional cache size: 58, Eliminated conditions: 62 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 97.2ms, 59 PlacesBefore, 57 PlacesAfterwards, 46 TransitionsBefore, 45 TransitionsAfterwards, 450 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 190 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 64, positive: 58, positive conditional: 58, positive unconditional: 0, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 64, positive: 58, positive conditional: 24, positive unconditional: 34, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 64, positive: 58, positive conditional: 24, positive unconditional: 34, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 64, positive: 53, positive conditional: 24, positive unconditional: 29, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 1718, Positive cache size: 1658, Positive conditional cache size: 15, Positive unconditional cache size: 1643, Negative cache size: 60, Negative conditional cache size: 2, Negative unconditional cache size: 58, Eliminated conditions: 18 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 135.0ms, 60 PlacesBefore, 60 PlacesAfterwards, 46 TransitionsBefore, 46 TransitionsAfterwards, 342 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 9 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 9, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 9, positive: 9, positive conditional: 4, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 4, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 2, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 9, positive: 4, positive conditional: 2, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 5, unknown conditional: 2, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 1723, Positive cache size: 1663, Positive conditional cache size: 17, Positive unconditional cache size: 1646, Negative cache size: 60, Negative conditional cache size: 2, Negative unconditional cache size: 58, Eliminated conditions: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6040.5ms, 61 PlacesBefore, 58 PlacesAfterwards, 35 TransitionsBefore, 33 TransitionsAfterwards, 146 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 37 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 37, positive: 37, positive conditional: 37, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 37, positive: 37, positive conditional: 6, positive unconditional: 31, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 37, positive: 37, positive conditional: 6, positive unconditional: 31, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 37, positive: 33, positive conditional: 2, positive unconditional: 31, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1727, Positive cache size: 1667, Positive conditional cache size: 21, Positive unconditional cache size: 1646, Negative cache size: 60, Negative conditional cache size: 2, Negative unconditional cache size: 58, Eliminated conditions: 31 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p2_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int a = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L722] 0 int y = 0; [L724] 0 int z = 0; [L725] 0 _Bool z$flush_delayed; [L726] 0 int z$mem_tmp; [L727] 0 _Bool z$r_buff0_thd0; [L728] 0 _Bool z$r_buff0_thd1; [L729] 0 _Bool z$r_buff0_thd2; [L730] 0 _Bool z$r_buff0_thd3; [L731] 0 _Bool z$r_buff0_thd4; [L732] 0 _Bool z$r_buff1_thd0; [L733] 0 _Bool z$r_buff1_thd1; [L734] 0 _Bool z$r_buff1_thd2; [L735] 0 _Bool z$r_buff1_thd3; [L736] 0 _Bool z$r_buff1_thd4; [L737] 0 _Bool z$read_delayed; [L738] 0 int *z$read_delayed_var; [L739] 0 int z$w_buff0; [L740] 0 _Bool z$w_buff0_used; [L741] 0 int z$w_buff1; [L742] 0 _Bool z$w_buff1_used; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L844] 0 pthread_t t1429; [L845] FCALL, FORK 0 pthread_create(&t1429, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] 0 pthread_t t1430; [L847] FCALL, FORK 0 pthread_create(&t1430, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L848] 0 pthread_t t1431; [L849] FCALL, FORK 0 pthread_create(&t1431, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L850] 0 pthread_t t1432; [L851] FCALL, FORK 0 pthread_create(&t1432, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L806] 4 z$w_buff1 = z$w_buff0 [L807] 4 z$w_buff0 = 1 [L808] 4 z$w_buff1_used = z$w_buff0_used [L809] 4 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 4 !(!expression) [L811] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L812] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L813] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L814] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L815] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L816] 4 z$r_buff0_thd4 = (_Bool)1 [L819] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L748] 1 a = 1 [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L763] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L766] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 2 return 0; [L778] 3 y = 2 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L782] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L783] 3 z$flush_delayed = weak$$choice2 [L784] 3 z$mem_tmp = z [L785] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L785] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L786] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L786] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L787] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L787] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L788] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L788] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L789] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L789] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L790] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L790] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L791] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L791] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L792] 3 __unbuffered_p2_EAX = z [L793] EXPR 3 z$flush_delayed ? z$mem_tmp : z [L793] 3 z = z$flush_delayed ? z$mem_tmp : z [L794] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L799] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 3 return 0; [L822] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L822] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L823] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L823] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L824] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L824] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L825] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L825] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L826] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L826] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L829] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L831] 4 return 0; [L853] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L857] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L857] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L857] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L857] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L858] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L858] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L859] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L859] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L860] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L860] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L861] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L861] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L864] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 111 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 4.7ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 17148.4ms, OverallIterations: 13, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 1910.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 3220.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 75 SDtfs, 48 SDslu, 45 SDs, 0 SdLazy, 249 SolverSat, 64 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 262.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 188.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=578occurred in iteration=8, InterpolantAutomatonStates: 58, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 47.0ms SsaConstructionTime, 395.5ms SatisfiabilityAnalysisTime, 657.4ms InterpolantComputationTime, 234 NumberOfCodeBlocks, 234 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 202 ConstructedInterpolants, 0 QuantifiedInterpolants, 1176 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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! Received shutdown request...