/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe-SemanticLooper.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe010_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-16 05:03:16,540 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 05:03:16,542 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 05:03:16,580 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 05:03:16,580 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 05:03:16,584 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 05:03:16,588 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 05:03:16,590 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 05:03:16,595 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 05:03:16,596 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 05:03:16,597 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 05:03:16,598 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 05:03:16,598 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 05:03:16,599 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 05:03:16,601 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 05:03:16,602 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 05:03:16,603 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 05:03:16,605 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 05:03:16,607 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 05:03:16,609 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 05:03:16,611 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 05:03:16,611 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 05:03:16,614 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 05:03:16,617 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 05:03:16,622 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 05:03:16,622 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 05:03:16,622 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 05:03:16,623 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 05:03:16,623 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 05:03:16,627 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 05:03:16,627 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 05:03:16,628 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 05:03:16,628 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 05:03:16,629 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 05:03:16,630 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 05:03:16,630 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 05:03:16,631 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 05:03:16,631 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 05:03:16,631 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 05:03:16,632 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 05:03:16,632 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 05:03:16,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-SemanticLbe-SemanticLooper.epf [2020-10-16 05:03:16,654 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 05:03:16,654 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 05:03:16,655 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 05:03:16,655 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 05:03:16,656 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 05:03:16,656 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 05:03:16,656 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 05:03:16,656 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 05:03:16,656 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 05:03:16,656 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 05:03:16,657 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 05:03:16,657 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 05:03:16,657 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 05:03:16,657 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 05:03:16,657 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 05:03:16,658 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 05:03:16,658 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 05:03:16,658 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 05:03:16,658 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 05:03:16,658 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 05:03:16,658 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 05:03:16,659 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 05:03:16,659 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 05:03:16,659 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 05:03:16,659 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 05:03:16,659 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 05:03:16,659 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 05:03:16,660 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-16 05:03:16,660 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 05:03:16,942 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 05:03:16,958 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 05:03:16,962 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 05:03:16,963 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 05:03:16,965 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 05:03:16,966 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe010_power.oepc.i [2020-10-16 05:03:17,024 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06437d9e7/6113a61491e746e49cc8146430b09db3/FLAG14af5a04f [2020-10-16 05:03:17,543 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 05:03:17,543 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe010_power.oepc.i [2020-10-16 05:03:17,557 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06437d9e7/6113a61491e746e49cc8146430b09db3/FLAG14af5a04f [2020-10-16 05:03:17,822 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06437d9e7/6113a61491e746e49cc8146430b09db3 [2020-10-16 05:03:17,831 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 05:03:17,833 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 05:03:17,833 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 05:03:17,834 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 05:03:17,837 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 05:03:17,838 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 05:03:17" (1/1) ... [2020-10-16 05:03:17,840 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c8afd3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:03:17, skipping insertion in model container [2020-10-16 05:03:17,840 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 05:03:17" (1/1) ... [2020-10-16 05:03:17,848 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 05:03:17,907 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 05:03:18,347 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 05:03:18,359 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 05:03:18,426 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 05:03:18,501 INFO L208 MainTranslator]: Completed translation [2020-10-16 05:03:18,501 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:03:18 WrapperNode [2020-10-16 05:03:18,502 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 05:03:18,502 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 05:03:18,503 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 05:03:18,503 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 05:03:18,511 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:03:18" (1/1) ... [2020-10-16 05:03:18,529 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:03:18" (1/1) ... [2020-10-16 05:03:18,566 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 05:03:18,567 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 05:03:18,567 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 05:03:18,567 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 05:03:18,582 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:03:18" (1/1) ... [2020-10-16 05:03:18,582 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:03:18" (1/1) ... [2020-10-16 05:03:18,587 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:03:18" (1/1) ... [2020-10-16 05:03:18,588 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:03:18" (1/1) ... [2020-10-16 05:03:18,606 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:03:18" (1/1) ... [2020-10-16 05:03:18,611 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:03:18" (1/1) ... [2020-10-16 05:03:18,617 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:03:18" (1/1) ... [2020-10-16 05:03:18,622 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 05:03:18,629 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 05:03:18,629 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 05:03:18,629 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 05:03:18,630 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:03:18" (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 [2020-10-16 05:03:18,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 05:03:18,697 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 05:03:18,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 05:03:18,698 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 05:03:18,698 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 05:03:18,698 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 05:03:18,698 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 05:03:18,698 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 05:03:18,699 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 05:03:18,699 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 05:03:18,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 05:03:18,701 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-16 05:03:20,485 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 05:03:20,485 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 05:03:20,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 05:03:20 BoogieIcfgContainer [2020-10-16 05:03:20,487 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 05:03:20,489 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 05:03:20,489 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 05:03:20,492 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 05:03:20,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 05:03:17" (1/3) ... [2020-10-16 05:03:20,493 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@305f608c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 05:03:20, skipping insertion in model container [2020-10-16 05:03:20,493 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:03:18" (2/3) ... [2020-10-16 05:03:20,494 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@305f608c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 05:03:20, skipping insertion in model container [2020-10-16 05:03:20,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 05:03:20" (3/3) ... [2020-10-16 05:03:20,495 INFO L111 eAbstractionObserver]: Analyzing ICFG safe010_power.oepc.i [2020-10-16 05:03:20,507 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 05:03:20,514 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 05:03:20,515 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 05:03:20,540 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:20,540 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:20,540 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:20,540 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:20,541 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:20,541 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:20,542 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:20,542 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:20,542 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:20,542 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:20,542 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:20,543 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:20,543 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:20,543 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:20,543 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:20,544 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:20,544 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:20,544 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:20,545 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:20,545 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:20,545 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:20,545 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:20,546 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:20,546 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:20,546 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:20,546 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:20,546 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:20,546 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:20,547 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:20,547 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:20,551 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:20,551 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:20,551 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:20,552 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:20,552 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:20,552 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:20,552 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:20,552 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:20,553 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:20,553 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:20,553 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:20,553 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:20,559 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:20,559 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:20,559 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:20,559 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:20,560 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:20,560 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:20,560 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:20,560 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:20,560 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:20,561 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:03:20,577 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-10-16 05:03:20,598 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 05:03:20,598 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-16 05:03:20,598 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 05:03:20,598 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 05:03:20,599 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 05:03:20,599 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 05:03:20,599 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 05:03:20,599 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 05:03:20,611 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 80 places, 75 transitions, 160 flow [2020-10-16 05:03:20,648 INFO L129 PetriNetUnfolder]: 2/73 cut-off events. [2020-10-16 05:03:20,648 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 05:03:20,653 INFO L80 FinitePrefix]: Finished finitePrefix Result has 80 conditions, 73 events. 2/73 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 42 event pairs, 0 based on Foata normal form. 0/69 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2020-10-16 05:03:20,653 INFO L82 GeneralOperation]: Start removeDead. Operand has 80 places, 75 transitions, 160 flow [2020-10-16 05:03:20,659 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 78 places, 73 transitions, 152 flow [2020-10-16 05:03:20,662 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 05:03:20,664 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 73 transitions, 152 flow [2020-10-16 05:03:20,667 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 73 transitions, 152 flow [2020-10-16 05:03:20,667 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 78 places, 73 transitions, 152 flow [2020-10-16 05:03:20,684 INFO L129 PetriNetUnfolder]: 2/73 cut-off events. [2020-10-16 05:03:20,685 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 05:03:20,685 INFO L80 FinitePrefix]: Finished finitePrefix Result has 80 conditions, 73 events. 2/73 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 45 event pairs, 0 based on Foata normal form. 0/69 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2020-10-16 05:03:20,687 INFO L117 LiptonReduction]: Number of co-enabled transitions 896 [2020-10-16 05:03:20,785 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:03:20,786 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:03:20,787 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-16 05:03:20,788 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:03:20,793 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:03:20,794 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 05:03:20,799 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 05:03:20,800 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:03:20,882 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:03:20,883 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:03:20,886 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 05:03:20,886 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:03:20,888 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:03:20,888 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:03:20,893 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:03:20,894 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:03:20,896 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:03:20,896 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:03:20,899 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:03:20,900 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:03:20,904 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 05:03:20,905 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:03:20,907 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 05:03:20,907 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:03:20,945 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 05:03:20,946 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:03:20,991 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 05:03:20,992 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:03:20,993 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-16 05:03:20,993 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:03:21,018 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 05:03:21,019 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:03:21,020 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-16 05:03:21,020 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:03:22,137 WARN L193 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 224 DAG size of output: 184 [2020-10-16 05:03:22,171 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-10-16 05:03:22,172 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:03:22,173 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-16 05:03:22,173 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:03:22,904 WARN L193 SmtUtils]: Spent 727.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 119 [2020-10-16 05:03:22,946 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:03:22,946 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:03:22,949 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-16 05:03:22,949 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:03:22,953 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:03:22,954 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 05:03:22,957 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 05:03:22,957 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:03:23,015 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:03:23,016 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:03:23,026 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 05:03:23,027 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:03:23,029 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:03:23,031 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:03:23,036 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:03:23,037 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:03:23,039 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:03:23,040 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:03:23,049 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:03:23,050 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:03:23,059 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 05:03:23,060 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:03:23,064 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 05:03:23,065 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:03:23,068 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 05:03:23,068 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:03:23,135 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 05:03:23,136 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:03:23,137 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-16 05:03:23,137 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:03:23,158 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 05:03:23,159 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:03:23,160 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-16 05:03:23,160 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:03:23,225 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:03:23,226 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:03:23,227 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 05:03:23,230 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:03:23,261 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 05:03:23,262 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:03:23,264 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-16 05:03:23,264 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:03:23,342 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:03:23,343 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:03:23,346 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 05:03:23,346 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:03:23,348 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:03:23,348 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:03:23,354 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:03:23,354 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:03:23,356 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:03:23,357 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:03:23,359 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:03:23,359 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:03:23,365 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 05:03:23,366 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:03:23,367 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 05:03:23,368 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:03:23,371 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 05:03:23,372 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:03:23,435 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:03:23,436 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:03:23,439 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-16 05:03:23,440 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:03:23,448 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:03:23,449 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 05:03:23,453 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 05:03:23,453 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:03:23,597 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 2, 1] term [2020-10-16 05:03:23,598 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:03:23,599 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-16 05:03:23,599 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:03:23,630 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 05:03:23,631 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:03:23,632 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-16 05:03:23,633 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:03:23,657 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 05:03:23,657 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:03:23,659 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-10-16 05:03:23,660 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:03:23,661 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-10-16 05:03:23,661 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:03:23,892 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 05:03:23,893 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:03:23,893 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-16 05:03:23,894 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:03:23,919 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:03:23,919 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:03:23,920 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 05:03:23,920 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:03:23,974 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:03:23,974 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:03:23,988 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 05:03:23,989 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:03:23,990 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:03:23,990 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:03:23,993 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:03:23,994 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:03:23,997 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:03:23,998 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:03:23,999 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:03:23,999 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:03:24,003 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 05:03:24,004 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:03:24,005 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 05:03:24,006 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:03:24,009 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 05:03:24,010 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:03:24,056 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:03:24,056 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:03:24,057 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-16 05:03:24,058 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:03:24,061 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:03:24,062 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 05:03:24,064 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 05:03:24,065 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:03:24,312 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:03:24,313 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:03:24,313 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:03:24,314 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:03:24,315 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:03:24,316 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:03:24,317 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:03:24,318 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:03:24,330 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:03:24,330 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:03:24,331 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:03:24,331 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:03:24,333 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:03:24,333 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:03:24,335 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:03:24,335 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:03:24,378 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 05:03:24,379 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:03:24,419 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:03:24,419 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:03:24,420 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:03:24,420 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:03:24,422 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:03:24,422 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:03:24,424 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:03:24,424 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:03:24,447 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:03:24,447 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:03:24,448 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:03:24,448 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:03:24,450 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:03:24,450 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:03:24,451 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:03:24,452 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:03:24,721 WARN L193 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-10-16 05:03:24,868 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 05:03:24,868 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:03:24,955 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 05:03:24,955 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:03:25,892 WARN L193 SmtUtils]: Spent 586.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 106 [2020-10-16 05:03:26,138 WARN L193 SmtUtils]: Spent 244.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2020-10-16 05:03:27,322 WARN L193 SmtUtils]: Spent 947.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 125 [2020-10-16 05:03:27,655 WARN L193 SmtUtils]: Spent 330.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2020-10-16 05:03:27,873 WARN L193 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2020-10-16 05:03:27,988 INFO L132 LiptonReduction]: Checked pairs total: 2364 [2020-10-16 05:03:27,989 INFO L134 LiptonReduction]: Total number of compositions: 66 [2020-10-16 05:03:27,993 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 7333 [2020-10-16 05:03:28,003 INFO L129 PetriNetUnfolder]: 0/3 cut-off events. [2020-10-16 05:03:28,003 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 05:03:28,004 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:03:28,005 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2020-10-16 05:03:28,005 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:03:28,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:03:28,010 INFO L82 PathProgramCache]: Analyzing trace with hash 897514, now seen corresponding path program 1 times [2020-10-16 05:03:28,019 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:03:28,019 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685896617] [2020-10-16 05:03:28,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:03:28,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:03:28,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 05:03:28,291 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685896617] [2020-10-16 05:03:28,291 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:03:28,292 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 05:03:28,292 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888605723] [2020-10-16 05:03:28,302 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 05:03:28,302 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:03:28,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 05:03:28,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 05:03:28,320 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 141 [2020-10-16 05:03:28,322 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 17 transitions, 40 flow. Second operand 3 states. [2020-10-16 05:03:28,322 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:03:28,322 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 141 [2020-10-16 05:03:28,323 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:03:28,392 INFO L129 PetriNetUnfolder]: 23/59 cut-off events. [2020-10-16 05:03:28,392 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 05:03:28,393 INFO L80 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 59 events. 23/59 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 205 event pairs, 16 based on Foata normal form. 0/51 useless extension candidates. Maximal degree in co-relation 105. Up to 37 conditions per place. [2020-10-16 05:03:28,395 INFO L132 encePairwiseOnDemand]: 138/141 looper letters, 7 selfloop transitions, 2 changer transitions 2/20 dead transitions. [2020-10-16 05:03:28,395 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 20 transitions, 68 flow [2020-10-16 05:03:28,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 05:03:28,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 05:03:28,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 351 transitions. [2020-10-16 05:03:28,412 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8297872340425532 [2020-10-16 05:03:28,413 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 351 transitions. [2020-10-16 05:03:28,413 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 351 transitions. [2020-10-16 05:03:28,415 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:03:28,418 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 351 transitions. [2020-10-16 05:03:28,422 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 05:03:28,428 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 05:03:28,428 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 05:03:28,431 INFO L185 Difference]: Start difference. First operand has 24 places, 17 transitions, 40 flow. Second operand 3 states and 351 transitions. [2020-10-16 05:03:28,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 20 transitions, 68 flow [2020-10-16 05:03:28,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 20 transitions, 66 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 05:03:28,436 INFO L241 Difference]: Finished difference. Result has 23 places, 15 transitions, 38 flow [2020-10-16 05:03:28,439 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=38, PETRI_PLACES=23, PETRI_TRANSITIONS=15} [2020-10-16 05:03:28,440 INFO L342 CegarLoopForPetriNet]: 24 programPoint places, -1 predicate places. [2020-10-16 05:03:28,440 INFO L481 AbstractCegarLoop]: Abstraction has has 23 places, 15 transitions, 38 flow [2020-10-16 05:03:28,440 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 05:03:28,440 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:03:28,440 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:03:28,441 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 05:03:28,441 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:03:28,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:03:28,441 INFO L82 PathProgramCache]: Analyzing trace with hash -13139347, now seen corresponding path program 1 times [2020-10-16 05:03:28,442 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:03:28,442 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636320010] [2020-10-16 05:03:28,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:03:28,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:03:28,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 05:03:28,557 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636320010] [2020-10-16 05:03:28,557 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:03:28,557 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 05:03:28,557 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239108935] [2020-10-16 05:03:28,559 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 05:03:28,559 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:03:28,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 05:03:28,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 05:03:28,561 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 141 [2020-10-16 05:03:28,561 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 15 transitions, 38 flow. Second operand 3 states. [2020-10-16 05:03:28,561 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:03:28,562 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 141 [2020-10-16 05:03:28,562 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:03:28,574 INFO L129 PetriNetUnfolder]: 0/15 cut-off events. [2020-10-16 05:03:28,575 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 05:03:28,575 INFO L80 FinitePrefix]: Finished finitePrefix Result has 27 conditions, 15 events. 0/15 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 16 event pairs, 0 based on Foata normal form. 1/16 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2020-10-16 05:03:28,575 INFO L132 encePairwiseOnDemand]: 138/141 looper letters, 1 selfloop transitions, 2 changer transitions 0/15 dead transitions. [2020-10-16 05:03:28,575 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 15 transitions, 44 flow [2020-10-16 05:03:28,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 05:03:28,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 05:03:28,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 364 transitions. [2020-10-16 05:03:28,579 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8605200945626478 [2020-10-16 05:03:28,579 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 364 transitions. [2020-10-16 05:03:28,579 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 364 transitions. [2020-10-16 05:03:28,580 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:03:28,580 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 364 transitions. [2020-10-16 05:03:28,581 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 05:03:28,582 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 05:03:28,583 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 05:03:28,583 INFO L185 Difference]: Start difference. First operand has 23 places, 15 transitions, 38 flow. Second operand 3 states and 364 transitions. [2020-10-16 05:03:28,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 15 transitions, 44 flow [2020-10-16 05:03:28,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 15 transitions, 40 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 05:03:28,584 INFO L241 Difference]: Finished difference. Result has 23 places, 15 transitions, 42 flow [2020-10-16 05:03:28,584 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=34, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=42, PETRI_PLACES=23, PETRI_TRANSITIONS=15} [2020-10-16 05:03:28,585 INFO L342 CegarLoopForPetriNet]: 24 programPoint places, -1 predicate places. [2020-10-16 05:03:28,585 INFO L481 AbstractCegarLoop]: Abstraction has has 23 places, 15 transitions, 42 flow [2020-10-16 05:03:28,585 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 05:03:28,585 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:03:28,585 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:03:28,586 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 05:03:28,586 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:03:28,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:03:28,586 INFO L82 PathProgramCache]: Analyzing trace with hash -408043731, now seen corresponding path program 1 times [2020-10-16 05:03:28,586 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:03:28,587 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883498657] [2020-10-16 05:03:28,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:03:28,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:03:28,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 05:03:28,657 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883498657] [2020-10-16 05:03:28,657 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:03:28,657 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 05:03:28,657 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467139094] [2020-10-16 05:03:28,658 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 05:03:28,658 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:03:28,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 05:03:28,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 05:03:28,660 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 141 [2020-10-16 05:03:28,660 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 15 transitions, 42 flow. Second operand 4 states. [2020-10-16 05:03:28,661 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:03:28,661 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 141 [2020-10-16 05:03:28,661 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:03:28,688 INFO L129 PetriNetUnfolder]: 0/22 cut-off events. [2020-10-16 05:03:28,688 INFO L130 PetriNetUnfolder]: For 4/6 co-relation queries the response was YES. [2020-10-16 05:03:28,689 INFO L80 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 22 events. 0/22 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 48 event pairs, 0 based on Foata normal form. 3/25 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2020-10-16 05:03:28,689 INFO L132 encePairwiseOnDemand]: 137/141 looper letters, 1 selfloop transitions, 3 changer transitions 1/16 dead transitions. [2020-10-16 05:03:28,689 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 16 transitions, 57 flow [2020-10-16 05:03:28,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 05:03:28,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 05:03:28,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 467 transitions. [2020-10-16 05:03:28,692 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8280141843971631 [2020-10-16 05:03:28,692 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 467 transitions. [2020-10-16 05:03:28,693 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 467 transitions. [2020-10-16 05:03:28,693 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:03:28,693 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 467 transitions. [2020-10-16 05:03:28,694 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 05:03:28,697 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 05:03:28,697 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 05:03:28,697 INFO L185 Difference]: Start difference. First operand has 23 places, 15 transitions, 42 flow. Second operand 4 states and 467 transitions. [2020-10-16 05:03:28,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 16 transitions, 57 flow [2020-10-16 05:03:28,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 16 transitions, 51 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 05:03:28,698 INFO L241 Difference]: Finished difference. Result has 26 places, 15 transitions, 52 flow [2020-10-16 05:03:28,698 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=52, PETRI_PLACES=26, PETRI_TRANSITIONS=15} [2020-10-16 05:03:28,699 INFO L342 CegarLoopForPetriNet]: 24 programPoint places, 2 predicate places. [2020-10-16 05:03:28,699 INFO L481 AbstractCegarLoop]: Abstraction has has 26 places, 15 transitions, 52 flow [2020-10-16 05:03:28,699 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 05:03:28,699 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:03:28,699 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:03:28,699 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 05:03:28,700 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:03:28,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:03:28,700 INFO L82 PathProgramCache]: Analyzing trace with hash -996248062, now seen corresponding path program 1 times [2020-10-16 05:03:28,700 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:03:28,700 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611613148] [2020-10-16 05:03:28,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:03:28,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:03:28,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 05:03:28,810 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611613148] [2020-10-16 05:03:28,811 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:03:28,811 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 05:03:28,811 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457714530] [2020-10-16 05:03:28,811 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 05:03:28,812 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:03:28,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 05:03:28,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 05:03:28,814 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 141 [2020-10-16 05:03:28,814 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 15 transitions, 52 flow. Second operand 5 states. [2020-10-16 05:03:28,814 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:03:28,814 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 141 [2020-10-16 05:03:28,814 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:03:28,916 INFO L129 PetriNetUnfolder]: 15/46 cut-off events. [2020-10-16 05:03:28,919 INFO L130 PetriNetUnfolder]: For 34/35 co-relation queries the response was YES. [2020-10-16 05:03:28,920 INFO L80 FinitePrefix]: Finished finitePrefix Result has 111 conditions, 46 events. 15/46 cut-off events. For 34/35 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 111 event pairs, 3 based on Foata normal form. 1/47 useless extension candidates. Maximal degree in co-relation 99. Up to 30 conditions per place. [2020-10-16 05:03:28,920 INFO L132 encePairwiseOnDemand]: 136/141 looper letters, 7 selfloop transitions, 4 changer transitions 0/19 dead transitions. [2020-10-16 05:03:28,921 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 19 transitions, 82 flow [2020-10-16 05:03:28,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 05:03:28,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 05:03:28,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 416 transitions. [2020-10-16 05:03:28,925 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7375886524822695 [2020-10-16 05:03:28,925 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 416 transitions. [2020-10-16 05:03:28,925 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 416 transitions. [2020-10-16 05:03:28,926 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:03:28,926 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 416 transitions. [2020-10-16 05:03:28,931 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 05:03:28,932 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 05:03:28,932 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 05:03:28,932 INFO L185 Difference]: Start difference. First operand has 26 places, 15 transitions, 52 flow. Second operand 4 states and 416 transitions. [2020-10-16 05:03:28,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 19 transitions, 82 flow [2020-10-16 05:03:28,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 19 transitions, 70 flow, removed 2 selfloop flow, removed 4 redundant places. [2020-10-16 05:03:28,934 INFO L241 Difference]: Finished difference. Result has 26 places, 17 transitions, 61 flow [2020-10-16 05:03:28,934 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=61, PETRI_PLACES=26, PETRI_TRANSITIONS=17} [2020-10-16 05:03:28,934 INFO L342 CegarLoopForPetriNet]: 24 programPoint places, 2 predicate places. [2020-10-16 05:03:28,934 INFO L481 AbstractCegarLoop]: Abstraction has has 26 places, 17 transitions, 61 flow [2020-10-16 05:03:28,935 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 05:03:28,935 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:03:28,935 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:03:28,935 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 05:03:28,935 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:03:28,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:03:28,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1597721130, now seen corresponding path program 1 times [2020-10-16 05:03:28,937 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:03:28,937 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268955384] [2020-10-16 05:03:28,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:03:29,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:03:29,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 05:03:29,135 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268955384] [2020-10-16 05:03:29,135 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:03:29,136 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 05:03:29,136 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566590363] [2020-10-16 05:03:29,137 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 05:03:29,137 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:03:29,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 05:03:29,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 05:03:29,140 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 141 [2020-10-16 05:03:29,140 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 17 transitions, 61 flow. Second operand 5 states. [2020-10-16 05:03:29,140 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:03:29,140 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 141 [2020-10-16 05:03:29,140 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:03:29,272 INFO L129 PetriNetUnfolder]: 58/122 cut-off events. [2020-10-16 05:03:29,273 INFO L130 PetriNetUnfolder]: For 51/55 co-relation queries the response was YES. [2020-10-16 05:03:29,273 INFO L80 FinitePrefix]: Finished finitePrefix Result has 308 conditions, 122 events. 58/122 cut-off events. For 51/55 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 383 event pairs, 42 based on Foata normal form. 16/136 useless extension candidates. Maximal degree in co-relation 297. Up to 96 conditions per place. [2020-10-16 05:03:29,274 INFO L132 encePairwiseOnDemand]: 136/141 looper letters, 9 selfloop transitions, 3 changer transitions 9/26 dead transitions. [2020-10-16 05:03:29,274 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 26 transitions, 134 flow [2020-10-16 05:03:29,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 05:03:29,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 05:03:29,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 463 transitions. [2020-10-16 05:03:29,283 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6567375886524822 [2020-10-16 05:03:29,283 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 463 transitions. [2020-10-16 05:03:29,283 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 463 transitions. [2020-10-16 05:03:29,284 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:03:29,284 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 463 transitions. [2020-10-16 05:03:29,285 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 05:03:29,286 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 05:03:29,286 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 05:03:29,286 INFO L185 Difference]: Start difference. First operand has 26 places, 17 transitions, 61 flow. Second operand 5 states and 463 transitions. [2020-10-16 05:03:29,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 26 transitions, 134 flow [2020-10-16 05:03:29,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 26 transitions, 126 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 05:03:29,288 INFO L241 Difference]: Finished difference. Result has 31 places, 17 transitions, 71 flow [2020-10-16 05:03:29,288 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=71, PETRI_PLACES=31, PETRI_TRANSITIONS=17} [2020-10-16 05:03:29,289 INFO L342 CegarLoopForPetriNet]: 24 programPoint places, 7 predicate places. [2020-10-16 05:03:29,289 INFO L481 AbstractCegarLoop]: Abstraction has has 31 places, 17 transitions, 71 flow [2020-10-16 05:03:29,289 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 05:03:29,289 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:03:29,289 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:03:29,289 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 05:03:29,290 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:03:29,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:03:29,290 INFO L82 PathProgramCache]: Analyzing trace with hash -529199238, now seen corresponding path program 2 times [2020-10-16 05:03:29,290 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:03:29,290 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977794946] [2020-10-16 05:03:29,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:03:29,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:03:29,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 05:03:29,378 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977794946] [2020-10-16 05:03:29,378 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:03:29,379 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 05:03:29,379 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151258001] [2020-10-16 05:03:29,382 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 05:03:29,382 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:03:29,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 05:03:29,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 05:03:29,384 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 141 [2020-10-16 05:03:29,384 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 17 transitions, 71 flow. Second operand 4 states. [2020-10-16 05:03:29,384 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:03:29,385 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 141 [2020-10-16 05:03:29,385 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:03:29,418 INFO L129 PetriNetUnfolder]: 10/46 cut-off events. [2020-10-16 05:03:29,419 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2020-10-16 05:03:29,419 INFO L80 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 46 events. 10/46 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 132 event pairs, 4 based on Foata normal form. 6/50 useless extension candidates. Maximal degree in co-relation 108. Up to 19 conditions per place. [2020-10-16 05:03:29,420 INFO L132 encePairwiseOnDemand]: 136/141 looper letters, 4 selfloop transitions, 5 changer transitions 3/24 dead transitions. [2020-10-16 05:03:29,420 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 24 transitions, 111 flow [2020-10-16 05:03:29,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 05:03:29,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 05:03:29,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 564 transitions. [2020-10-16 05:03:29,423 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8 [2020-10-16 05:03:29,423 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 564 transitions. [2020-10-16 05:03:29,423 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 564 transitions. [2020-10-16 05:03:29,424 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:03:29,424 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 564 transitions. [2020-10-16 05:03:29,425 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 05:03:29,427 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 05:03:29,427 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 05:03:29,427 INFO L185 Difference]: Start difference. First operand has 31 places, 17 transitions, 71 flow. Second operand 5 states and 564 transitions. [2020-10-16 05:03:29,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 24 transitions, 111 flow [2020-10-16 05:03:29,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 24 transitions, 101 flow, removed 2 selfloop flow, removed 4 redundant places. [2020-10-16 05:03:29,429 INFO L241 Difference]: Finished difference. Result has 32 places, 21 transitions, 100 flow [2020-10-16 05:03:29,429 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=61, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=100, PETRI_PLACES=32, PETRI_TRANSITIONS=21} [2020-10-16 05:03:29,429 INFO L342 CegarLoopForPetriNet]: 24 programPoint places, 8 predicate places. [2020-10-16 05:03:29,429 INFO L481 AbstractCegarLoop]: Abstraction has has 32 places, 21 transitions, 100 flow [2020-10-16 05:03:29,430 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 05:03:29,430 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:03:29,430 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:03:29,430 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 05:03:29,430 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:03:29,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:03:29,430 INFO L82 PathProgramCache]: Analyzing trace with hash -471216623, now seen corresponding path program 1 times [2020-10-16 05:03:29,431 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:03:29,431 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210318747] [2020-10-16 05:03:29,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:03:29,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:03:29,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 05:03:29,510 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210318747] [2020-10-16 05:03:29,510 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:03:29,510 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 05:03:29,511 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919779174] [2020-10-16 05:03:29,511 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 05:03:29,511 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:03:29,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 05:03:29,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 05:03:29,513 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 141 [2020-10-16 05:03:29,513 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 21 transitions, 100 flow. Second operand 5 states. [2020-10-16 05:03:29,513 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:03:29,513 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 141 [2020-10-16 05:03:29,514 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:03:29,569 INFO L129 PetriNetUnfolder]: 3/31 cut-off events. [2020-10-16 05:03:29,569 INFO L130 PetriNetUnfolder]: For 40/50 co-relation queries the response was YES. [2020-10-16 05:03:29,569 INFO L80 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 31 events. 3/31 cut-off events. For 40/50 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 65 event pairs, 0 based on Foata normal form. 14/45 useless extension candidates. Maximal degree in co-relation 93. Up to 13 conditions per place. [2020-10-16 05:03:29,570 INFO L132 encePairwiseOnDemand]: 136/141 looper letters, 2 selfloop transitions, 8 changer transitions 2/24 dead transitions. [2020-10-16 05:03:29,570 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 24 transitions, 140 flow [2020-10-16 05:03:29,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 05:03:29,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 05:03:29,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 784 transitions. [2020-10-16 05:03:29,573 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7943262411347518 [2020-10-16 05:03:29,574 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 784 transitions. [2020-10-16 05:03:29,574 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 784 transitions. [2020-10-16 05:03:29,574 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:03:29,575 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 784 transitions. [2020-10-16 05:03:29,576 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 05:03:29,578 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 05:03:29,578 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 05:03:29,578 INFO L185 Difference]: Start difference. First operand has 32 places, 21 transitions, 100 flow. Second operand 7 states and 784 transitions. [2020-10-16 05:03:29,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 24 transitions, 140 flow [2020-10-16 05:03:29,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 24 transitions, 130 flow, removed 4 selfloop flow, removed 1 redundant places. [2020-10-16 05:03:29,581 INFO L241 Difference]: Finished difference. Result has 40 places, 22 transitions, 125 flow [2020-10-16 05:03:29,581 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=125, PETRI_PLACES=40, PETRI_TRANSITIONS=22} [2020-10-16 05:03:29,581 INFO L342 CegarLoopForPetriNet]: 24 programPoint places, 16 predicate places. [2020-10-16 05:03:29,581 INFO L481 AbstractCegarLoop]: Abstraction has has 40 places, 22 transitions, 125 flow [2020-10-16 05:03:29,581 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 05:03:29,581 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:03:29,582 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:03:29,582 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 05:03:29,582 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:03:29,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:03:29,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1452280836, now seen corresponding path program 1 times [2020-10-16 05:03:29,583 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:03:29,583 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376983417] [2020-10-16 05:03:29,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:03:29,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:03:29,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 05:03:29,771 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376983417] [2020-10-16 05:03:29,771 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:03:29,771 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 05:03:29,771 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535439805] [2020-10-16 05:03:29,771 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 05:03:29,772 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:03:29,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 05:03:29,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-16 05:03:29,773 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 141 [2020-10-16 05:03:29,774 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 22 transitions, 125 flow. Second operand 8 states. [2020-10-16 05:03:29,774 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:03:29,774 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 141 [2020-10-16 05:03:29,774 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:03:29,954 INFO L129 PetriNetUnfolder]: 3/38 cut-off events. [2020-10-16 05:03:29,954 INFO L130 PetriNetUnfolder]: For 99/108 co-relation queries the response was YES. [2020-10-16 05:03:29,955 INFO L80 FinitePrefix]: Finished finitePrefix Result has 148 conditions, 38 events. 3/38 cut-off events. For 99/108 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 97 event pairs, 0 based on Foata normal form. 8/46 useless extension candidates. Maximal degree in co-relation 129. Up to 17 conditions per place. [2020-10-16 05:03:29,955 INFO L132 encePairwiseOnDemand]: 135/141 looper letters, 5 selfloop transitions, 3 changer transitions 5/25 dead transitions. [2020-10-16 05:03:29,955 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 25 transitions, 163 flow [2020-10-16 05:03:29,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 05:03:29,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 05:03:29,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 684 transitions. [2020-10-16 05:03:29,959 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6930091185410334 [2020-10-16 05:03:29,960 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 684 transitions. [2020-10-16 05:03:29,960 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 684 transitions. [2020-10-16 05:03:29,961 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:03:29,961 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 684 transitions. [2020-10-16 05:03:29,962 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 05:03:29,964 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 05:03:29,964 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 05:03:29,964 INFO L185 Difference]: Start difference. First operand has 40 places, 22 transitions, 125 flow. Second operand 7 states and 684 transitions. [2020-10-16 05:03:29,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 25 transitions, 163 flow [2020-10-16 05:03:29,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 25 transitions, 134 flow, removed 8 selfloop flow, removed 6 redundant places. [2020-10-16 05:03:29,967 INFO L241 Difference]: Finished difference. Result has 41 places, 19 transitions, 94 flow [2020-10-16 05:03:29,967 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=94, PETRI_PLACES=41, PETRI_TRANSITIONS=19} [2020-10-16 05:03:29,967 INFO L342 CegarLoopForPetriNet]: 24 programPoint places, 17 predicate places. [2020-10-16 05:03:29,967 INFO L481 AbstractCegarLoop]: Abstraction has has 41 places, 19 transitions, 94 flow [2020-10-16 05:03:29,968 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 05:03:29,968 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:03:29,968 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:03:29,968 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 05:03:29,968 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:03:29,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:03:29,969 INFO L82 PathProgramCache]: Analyzing trace with hash -944094530, now seen corresponding path program 2 times [2020-10-16 05:03:29,969 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:03:29,969 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527592133] [2020-10-16 05:03:29,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:03:30,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 05:03:30,005 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 05:03:30,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 05:03:30,036 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 05:03:30,066 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 05:03:30,066 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 05:03:30,067 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 05:03:30,068 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-16 05:03:30,075 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [860] [860] L2-->L795: Formula: (let ((.cse7 (= (mod ~y$w_buff0_used~0_In1739537621 256) 0)) (.cse6 (= (mod ~y$r_buff0_thd0~0_In1739537621 256) 0)) (.cse8 (= (mod ~y$r_buff1_thd0~0_In1739537621 256) 0)) (.cse9 (= (mod ~y$w_buff1_used~0_In1739537621 256) 0))) (let ((.cse3 (not .cse9)) (.cse4 (not .cse8)) (.cse5 (or .cse8 .cse9)) (.cse2 (or .cse7 .cse6)) (.cse0 (not .cse7)) (.cse1 (not .cse6))) (and (or (and .cse0 (= ~y~0_Out1739537621 ~y$w_buff0~0_In1739537621) .cse1) (and .cse2 (or (and .cse3 .cse4 (= ~y~0_Out1739537621 ~y$w_buff1~0_In1739537621)) (and .cse5 (= ~y~0_Out1739537621 ~y~0_In1739537621))))) (not (= 0 ULTIMATE.start_assume_abort_if_not_~cond_Out1739537621)) (or (and (= ~y$w_buff1_used~0_Out1739537621 0) .cse3 .cse4) (and (= ~y$w_buff1_used~0_Out1739537621 ~y$w_buff1_used~0_In1739537621) .cse5)) (= ~y$r_buff1_thd0~0_Out1739537621 ~y$r_buff1_thd0~0_In1739537621) (= ~y$r_buff0_thd0~0_In1739537621 ~y$r_buff0_thd0~0_Out1739537621) (= ULTIMATE.start_assume_abort_if_not_~cond_Out1739537621 |ULTIMATE.start_assume_abort_if_not_#in~cond_In1739537621|) (or (and (= ~y$w_buff0_used~0_Out1739537621 ~y$w_buff0_used~0_In1739537621) .cse2) (and .cse0 .cse1 (= ~y$w_buff0_used~0_Out1739537621 0)))))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In1739537621|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1739537621, ~y$w_buff1~0=~y$w_buff1~0_In1739537621, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1739537621, ~y$w_buff0~0=~y$w_buff0~0_In1739537621, ~y~0=~y~0_In1739537621, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1739537621, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1739537621} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out1739537621, ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out1739537621|, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out1739537621|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out1739537621|, ULTIMATE.start_main_#t~ite16=|ULTIMATE.start_main_#t~ite16_Out1739537621|, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out1739537621|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out1739537621|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In1739537621|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out1739537621, ~y$w_buff1~0=~y$w_buff1~0_In1739537621, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out1739537621, ~y$w_buff0~0=~y$w_buff0~0_In1739537621, ~y~0=~y~0_Out1739537621, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out1739537621, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out1739537621} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite16, ULTIMATE.start_main_#t~ite20, ~y~0, ULTIMATE.start_main_#t~ite21, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] because there is no mapped edge [2020-10-16 05:03:30,079 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:03:30,079 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:03:30,081 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:03:30,081 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:03:30,082 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:03:30,082 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:03:30,082 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:03:30,082 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:03:30,082 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:03:30,082 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:03:30,083 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:03:30,083 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:03:30,083 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:03:30,083 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:03:30,083 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:03:30,083 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:03:30,084 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:03:30,084 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:03:30,084 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:03:30,084 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:03:30,084 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:03:30,085 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:03:30,085 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:03:30,085 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:03:30,086 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:03:30,086 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:03:30,086 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:03:30,086 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:03:30,086 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:03:30,086 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:03:30,087 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:03:30,087 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:03:30,087 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:03:30,087 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:03:30,087 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:03:30,088 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:03:30,088 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:03:30,088 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:03:30,088 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:03:30,088 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:03:30,088 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:03:30,088 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:03:30,089 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:03:30,089 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:03:30,089 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:03:30,089 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:03:30,089 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:03:30,089 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:03:30,090 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:03:30,090 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:03:30,090 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:03:30,090 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:03:30,090 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:03:30,090 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:03:30,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 05:03:30 BasicIcfg [2020-10-16 05:03:30,144 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 05:03:30,147 INFO L168 Benchmark]: Toolchain (without parser) took 12314.55 ms. Allocated memory was 253.2 MB in the beginning and 493.9 MB in the end (delta: 240.6 MB). Free memory was 207.1 MB in the beginning and 176.8 MB in the end (delta: 30.2 MB). Peak memory consumption was 270.9 MB. Max. memory is 14.2 GB. [2020-10-16 05:03:30,148 INFO L168 Benchmark]: CDTParser took 0.38 ms. Allocated memory is still 253.2 MB. Free memory was 231.3 MB in the beginning and 230.4 MB in the end (delta: 839.0 kB). Peak memory consumption was 839.0 kB. Max. memory is 14.2 GB. [2020-10-16 05:03:30,149 INFO L168 Benchmark]: CACSL2BoogieTranslator took 668.59 ms. Allocated memory was 253.2 MB in the beginning and 319.8 MB in the end (delta: 66.6 MB). Free memory was 207.1 MB in the beginning and 269.5 MB in the end (delta: -62.4 MB). Peak memory consumption was 30.4 MB. Max. memory is 14.2 GB. [2020-10-16 05:03:30,150 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.25 ms. Allocated memory is still 319.8 MB. Free memory was 269.5 MB in the beginning and 266.2 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 14.2 GB. [2020-10-16 05:03:30,151 INFO L168 Benchmark]: Boogie Preprocessor took 55.47 ms. Allocated memory is still 319.8 MB. Free memory was 266.2 MB in the beginning and 264.5 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 14.2 GB. [2020-10-16 05:03:30,156 INFO L168 Benchmark]: RCFGBuilder took 1858.96 ms. Allocated memory was 319.8 MB in the beginning and 360.7 MB in the end (delta: 40.9 MB). Free memory was 264.5 MB in the beginning and 219.1 MB in the end (delta: 45.4 MB). Peak memory consumption was 98.7 MB. Max. memory is 14.2 GB. [2020-10-16 05:03:30,157 INFO L168 Benchmark]: TraceAbstraction took 9654.99 ms. Allocated memory was 360.7 MB in the beginning and 493.9 MB in the end (delta: 133.2 MB). Free memory was 219.1 MB in the beginning and 176.8 MB in the end (delta: 42.3 MB). Peak memory consumption was 175.5 MB. Max. memory is 14.2 GB. [2020-10-16 05:03:30,163 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.38 ms. Allocated memory is still 253.2 MB. Free memory was 231.3 MB in the beginning and 230.4 MB in the end (delta: 839.0 kB). Peak memory consumption was 839.0 kB. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 668.59 ms. Allocated memory was 253.2 MB in the beginning and 319.8 MB in the end (delta: 66.6 MB). Free memory was 207.1 MB in the beginning and 269.5 MB in the end (delta: -62.4 MB). Peak memory consumption was 30.4 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 64.25 ms. Allocated memory is still 319.8 MB. Free memory was 269.5 MB in the beginning and 266.2 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 55.47 ms. Allocated memory is still 319.8 MB. Free memory was 266.2 MB in the beginning and 264.5 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 14.2 GB. * RCFGBuilder took 1858.96 ms. Allocated memory was 319.8 MB in the beginning and 360.7 MB in the end (delta: 40.9 MB). Free memory was 264.5 MB in the beginning and 219.1 MB in the end (delta: 45.4 MB). Peak memory consumption was 98.7 MB. Max. memory is 14.2 GB. * TraceAbstraction took 9654.99 ms. Allocated memory was 360.7 MB in the beginning and 493.9 MB in the end (delta: 133.2 MB). Free memory was 219.1 MB in the beginning and 176.8 MB in the end (delta: 42.3 MB). Peak memory consumption was 175.5 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 573 VarBasedMoverChecksPositive, 44 VarBasedMoverChecksNegative, 6 SemBasedMoverChecksPositive, 38 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 57 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 7.3s, 78 PlacesBefore, 24 PlacesAfterwards, 73 TransitionsBefore, 17 TransitionsAfterwards, 896 CoEnabledTransitionPairs, 6 FixpointIterations, 28 TrivialSequentialCompositions, 30 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 2 ChoiceCompositions, 66 TotalNumberOfCompositions, 2364 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L697] 0 int __unbuffered_cnt = 0; [L699] 0 int __unbuffered_p1_EAX = 0; [L700] 0 _Bool main$tmp_guard0; [L701] 0 _Bool main$tmp_guard1; [L703] 0 int x = 0; [L705] 0 int y = 0; [L706] 0 _Bool y$flush_delayed; [L707] 0 int y$mem_tmp; [L708] 0 _Bool y$r_buff0_thd0; [L709] 0 _Bool y$r_buff0_thd1; [L710] 0 _Bool y$r_buff0_thd2; [L711] 0 _Bool y$r_buff1_thd0; [L712] 0 _Bool y$r_buff1_thd1; [L713] 0 _Bool y$r_buff1_thd2; [L714] 0 _Bool y$read_delayed; [L715] 0 int *y$read_delayed_var; [L716] 0 int y$w_buff0; [L717] 0 _Bool y$w_buff0_used; [L718] 0 int y$w_buff1; [L719] 0 _Bool y$w_buff1_used; [L720] 0 _Bool weak$$choice0; [L721] 0 _Bool weak$$choice2; [L781] 0 pthread_t t2009; [L782] FCALL, FORK 0 pthread_create(&t2009, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L725] 1 y$w_buff1 = y$w_buff0 [L726] 1 y$w_buff0 = 2 [L727] 1 y$w_buff1_used = y$w_buff0_used [L728] 1 y$w_buff0_used = (_Bool)1 [L7] COND TRUE 1 !expression [L7] 1 __VERIFIER_error() [L730] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L731] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L732] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L733] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L783] 0 pthread_t t2010; [L784] FCALL, FORK 0 pthread_create(&t2010, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L753] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L756] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L759] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L759] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L759] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L759] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L760] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L760] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L761] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L761] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L762] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L762] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L763] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L763] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L739] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L739] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L740] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L740] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L741] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L741] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L742] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L742] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L743] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L743] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L746] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L748] 1 return 0; [L766] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L768] 2 return 0; [L786] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L797] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L798] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L799] 0 y$flush_delayed = weak$$choice2 [L800] 0 y$mem_tmp = y [L801] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L801] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1 [L801] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L801] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L802] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L802] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L802] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0 [L802] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L802] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L802] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L803] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L803] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L803] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L803] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L804] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L804] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L804] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L804] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L805] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L805] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L805] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0 [L805] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L805] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L805] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L806] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L806] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L807] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L807] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L808] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1) [L809] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L809] 0 y = y$flush_delayed ? y$mem_tmp : y [L810] 0 y$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 74 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 9.4s, OverallIterations: 9, TraceHistogramMax: 1, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.3s, HoareTripleCheckerStatistics: 33 SDtfs, 14 SDslu, 14 SDs, 0 SdLazy, 140 SolverSat, 33 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=125occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 92 NumberOfCodeBlocks, 92 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 69 ConstructedInterpolants, 0 QuantifiedInterpolants, 5858 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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...