/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.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix027_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-16 01:21:54,477 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 01:21:54,480 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 01:21:54,524 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 01:21:54,524 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 01:21:54,535 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 01:21:54,537 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 01:21:54,540 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 01:21:54,543 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 01:21:54,544 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 01:21:54,545 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 01:21:54,547 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 01:21:54,548 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 01:21:54,552 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 01:21:54,555 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 01:21:54,556 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 01:21:54,557 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 01:21:54,559 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 01:21:54,561 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 01:21:54,567 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 01:21:54,570 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 01:21:54,571 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 01:21:54,572 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 01:21:54,574 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 01:21:54,579 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 01:21:54,579 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 01:21:54,580 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 01:21:54,583 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 01:21:54,583 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 01:21:54,584 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 01:21:54,584 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 01:21:54,585 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 01:21:54,585 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 01:21:54,587 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 01:21:54,588 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 01:21:54,589 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 01:21:54,589 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 01:21:54,589 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 01:21:54,590 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 01:21:54,591 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 01:21:54,592 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 01:21:54,593 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.epf [2020-10-16 01:21:54,628 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 01:21:54,629 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 01:21:54,630 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 01:21:54,630 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 01:21:54,630 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 01:21:54,631 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 01:21:54,631 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 01:21:54,631 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 01:21:54,631 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 01:21:54,631 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 01:21:54,632 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 01:21:54,632 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 01:21:54,632 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 01:21:54,632 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 01:21:54,633 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 01:21:54,633 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 01:21:54,633 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 01:21:54,633 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 01:21:54,633 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 01:21:54,634 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 01:21:54,634 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 01:21:54,634 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 01:21:54,634 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 01:21:54,634 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 01:21:54,635 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 01:21:54,635 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 01:21:54,635 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 01:21:54,635 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-16 01:21:54,635 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 01:21:54,917 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 01:21:54,929 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 01:21:54,933 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 01:21:54,934 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 01:21:54,935 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 01:21:54,935 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix027_rmo.opt.i [2020-10-16 01:21:55,007 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/327255f89/80df52537f9d4fb0abe36b94dd40cf5b/FLAG48a9e408e [2020-10-16 01:21:55,551 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 01:21:55,552 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix027_rmo.opt.i [2020-10-16 01:21:55,567 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/327255f89/80df52537f9d4fb0abe36b94dd40cf5b/FLAG48a9e408e [2020-10-16 01:21:55,824 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/327255f89/80df52537f9d4fb0abe36b94dd40cf5b [2020-10-16 01:21:55,832 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 01:21:55,833 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 01:21:55,834 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 01:21:55,834 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 01:21:55,837 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 01:21:55,837 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:21:55" (1/1) ... [2020-10-16 01:21:55,840 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cc77a0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:21:55, skipping insertion in model container [2020-10-16 01:21:55,840 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:21:55" (1/1) ... [2020-10-16 01:21:55,846 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 01:21:55,912 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 01:21:56,448 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 01:21:56,461 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 01:21:56,526 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 01:21:56,600 INFO L208 MainTranslator]: Completed translation [2020-10-16 01:21:56,601 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:21:56 WrapperNode [2020-10-16 01:21:56,601 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 01:21:56,602 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 01:21:56,602 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 01:21:56,602 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 01:21:56,611 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:21:56" (1/1) ... [2020-10-16 01:21:56,631 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:21:56" (1/1) ... [2020-10-16 01:21:56,664 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 01:21:56,665 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 01:21:56,665 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 01:21:56,665 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 01:21:56,674 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:21:56" (1/1) ... [2020-10-16 01:21:56,674 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:21:56" (1/1) ... [2020-10-16 01:21:56,680 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:21:56" (1/1) ... [2020-10-16 01:21:56,680 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:21:56" (1/1) ... [2020-10-16 01:21:56,695 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:21:56" (1/1) ... [2020-10-16 01:21:56,701 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:21:56" (1/1) ... [2020-10-16 01:21:56,705 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:21:56" (1/1) ... [2020-10-16 01:21:56,711 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 01:21:56,712 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 01:21:56,712 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 01:21:56,712 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 01:21:56,713 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:21:56" (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 01:21:56,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 01:21:56,787 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 01:21:56,787 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 01:21:56,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 01:21:56,788 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 01:21:56,788 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 01:21:56,788 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 01:21:56,788 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 01:21:56,788 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 01:21:56,789 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 01:21:56,789 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-16 01:21:56,790 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-16 01:21:56,790 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 01:21:56,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 01:21:56,791 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 01:21:56,793 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 01:21:58,652 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 01:21:58,652 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 01:21:58,655 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:21:58 BoogieIcfgContainer [2020-10-16 01:21:58,655 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 01:21:58,656 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 01:21:58,656 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 01:21:58,660 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 01:21:58,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 01:21:55" (1/3) ... [2020-10-16 01:21:58,661 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b193554 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:21:58, skipping insertion in model container [2020-10-16 01:21:58,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:21:56" (2/3) ... [2020-10-16 01:21:58,662 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b193554 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:21:58, skipping insertion in model container [2020-10-16 01:21:58,662 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:21:58" (3/3) ... [2020-10-16 01:21:58,664 INFO L111 eAbstractionObserver]: Analyzing ICFG mix027_rmo.opt.i [2020-10-16 01:21:58,675 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 01:21:58,683 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 01:21:58,684 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 01:21:58,717 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,717 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,717 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,718 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,718 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,718 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,719 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,719 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,719 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,719 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,720 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,720 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,720 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,720 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,720 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,720 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,721 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,721 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,721 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,721 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,721 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,721 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,722 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,722 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,722 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,722 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,723 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,723 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,723 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,723 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,723 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,723 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,724 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,724 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,724 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,724 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,724 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,724 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,725 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,725 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,725 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,725 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,725 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,725 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,726 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,726 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,726 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,726 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,728 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,728 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,729 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,729 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,729 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,729 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,730 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,730 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,730 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,730 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,730 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,731 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,731 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,731 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,731 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,731 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,731 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,732 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,732 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,733 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,733 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,733 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,733 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,733 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,734 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,734 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,734 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,734 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,734 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,734 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,735 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,735 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,739 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,740 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,740 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,740 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,740 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,740 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,741 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,741 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,741 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,741 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,744 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,744 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,744 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,744 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,748 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,748 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,748 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,748 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,749 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,749 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,749 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,749 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,749 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,750 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,750 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,750 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,750 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,750 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,751 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,751 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,751 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,751 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,751 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,752 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,752 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,752 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,752 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,752 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,753 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,753 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,753 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,757 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,758 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,758 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,758 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,758 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,758 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,759 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,759 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,759 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,759 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,759 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,760 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:21:58,778 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-16 01:21:58,802 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 01:21:58,803 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-16 01:21:58,803 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 01:21:58,803 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 01:21:58,803 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 01:21:58,803 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 01:21:58,803 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 01:21:58,803 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 01:21:58,820 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 121 places, 110 transitions, 240 flow [2020-10-16 01:21:58,878 INFO L129 PetriNetUnfolder]: 2/106 cut-off events. [2020-10-16 01:21:58,878 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:21:58,884 INFO L80 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 106 events. 2/106 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 80 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2020-10-16 01:21:58,884 INFO L82 GeneralOperation]: Start removeDead. Operand has 121 places, 110 transitions, 240 flow [2020-10-16 01:21:58,893 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 106 transitions, 224 flow [2020-10-16 01:21:58,895 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 01:21:58,898 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 117 places, 106 transitions, 224 flow [2020-10-16 01:21:58,903 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 106 transitions, 224 flow [2020-10-16 01:21:58,904 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 117 places, 106 transitions, 224 flow [2020-10-16 01:21:58,936 INFO L129 PetriNetUnfolder]: 2/106 cut-off events. [2020-10-16 01:21:58,936 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:21:58,938 INFO L80 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 106 events. 2/106 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 79 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2020-10-16 01:21:58,942 INFO L117 LiptonReduction]: Number of co-enabled transitions 2456 [2020-10-16 01:21:59,546 WARN L193 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-16 01:21:59,650 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-16 01:21:59,741 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:21:59,742 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:21:59,743 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:21:59,744 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:21:59,748 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:21:59,748 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:21:59,752 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:21:59,752 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:21:59,773 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:21:59,773 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:21:59,774 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:21:59,775 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:21:59,778 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:21:59,778 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:21:59,781 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:21:59,782 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:21:59,835 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:21:59,836 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:21:59,837 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:21:59,838 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:21:59,840 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:21:59,841 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:21:59,844 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:21:59,844 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:21:59,864 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:21:59,864 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:21:59,865 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:21:59,866 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:21:59,868 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:21:59,868 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:21:59,870 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:21:59,871 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:21:59,955 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 01:21:59,955 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:00,034 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:22:00,034 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:00,035 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:00,036 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:00,038 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:00,039 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:22:00,041 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:22:00,042 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:22:00,057 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:22:00,058 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:00,059 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:00,059 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:00,062 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:00,062 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:22:00,064 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:22:00,065 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:22:00,161 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:00,161 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:00,162 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:00,162 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:00,164 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:00,165 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:22:00,167 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:22:00,167 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:22:00,182 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:00,183 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:00,184 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:00,184 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:00,186 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:00,186 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:22:00,188 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:22:00,189 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:22:00,910 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:22:00,910 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:00,911 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:00,911 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:00,913 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:00,913 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:22:00,915 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:22:00,915 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:22:00,930 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:00,931 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:00,932 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:00,932 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:00,934 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:00,934 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:00,935 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:22:00,936 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:00,998 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:22:00,998 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:00,999 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:00,999 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:01,001 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:01,002 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:01,003 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:22:01,003 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:01,015 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:22:01,016 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:01,016 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:01,017 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:01,018 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:01,019 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:22:01,020 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:22:01,020 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:22:01,081 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:01,081 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:01,082 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:01,082 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:01,084 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:01,084 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:01,085 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:22:01,086 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:01,098 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:01,099 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:01,099 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:01,099 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:01,101 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:01,102 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:22:01,103 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:22:01,104 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:22:01,179 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:22:01,180 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 01:22:01,182 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:22:01,182 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:01,216 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:01,217 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:01,219 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:22:01,219 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:22:01,221 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:22:01,221 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:22:01,222 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:22:01,222 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:22:01,224 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:22:01,224 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:01,226 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:22:01,226 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:01,227 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:22:01,228 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:01,618 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-10-16 01:22:01,690 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:01,691 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:01,692 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:01,692 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:01,694 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:01,695 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:22:01,697 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:22:01,698 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:22:01,713 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:01,713 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:01,714 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:01,715 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:01,716 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:01,717 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:01,718 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:22:01,718 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:01,995 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:22:01,995 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 01:22:01,997 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:22:01,998 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:02,027 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:02,028 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:02,030 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:22:02,030 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:22:02,031 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:22:02,031 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:22:02,033 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:22:02,033 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:22:02,034 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:22:02,035 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:02,036 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:22:02,036 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:02,037 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:22:02,038 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:02,140 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 01:22:02,140 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:02,194 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:22:02,195 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:02,196 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-10-16 01:22:02,196 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:02,197 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-10-16 01:22:02,197 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:02,240 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:02,241 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:02,241 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:02,242 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:02,243 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:02,244 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:22:02,245 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:22:02,245 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:22:02,257 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:22:02,257 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:02,258 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:02,259 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:02,260 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:02,260 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:02,262 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:22:02,262 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:02,318 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:22:02,318 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:02,319 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-10-16 01:22:02,319 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:02,320 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-10-16 01:22:02,320 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:02,362 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:02,363 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:02,364 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:22:02,364 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:22:02,366 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:22:02,366 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:22:02,367 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:22:02,368 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:22:02,370 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:22:02,370 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:02,371 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:22:02,371 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:02,373 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:22:02,373 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:02,406 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:22:02,406 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 01:22:02,408 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:22:02,408 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:02,463 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 01:22:02,464 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:02,491 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:22:02,491 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:02,492 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:02,493 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:02,494 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:02,494 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:02,496 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:22:02,496 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:22:02,508 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:02,509 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:02,509 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:02,510 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:22:02,511 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:22:02,511 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:22:02,513 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:22:02,513 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:22:02,986 WARN L193 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2020-10-16 01:22:03,149 WARN L193 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2020-10-16 01:22:03,167 INFO L132 LiptonReduction]: Checked pairs total: 6496 [2020-10-16 01:22:03,167 INFO L134 LiptonReduction]: Total number of compositions: 90 [2020-10-16 01:22:03,183 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4290 [2020-10-16 01:22:03,194 INFO L129 PetriNetUnfolder]: 0/11 cut-off events. [2020-10-16 01:22:03,195 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:22:03,195 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:22:03,196 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:22:03,196 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:22:03,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:22:03,202 INFO L82 PathProgramCache]: Analyzing trace with hash 471750852, now seen corresponding path program 1 times [2020-10-16 01:22:03,212 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:22:03,214 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601821787] [2020-10-16 01:22:03,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:22:03,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:22:03,468 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 01:22:03,469 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601821787] [2020-10-16 01:22:03,470 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:22:03,470 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 01:22:03,471 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740867164] [2020-10-16 01:22:03,481 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 01:22:03,482 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:22:03,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 01:22:03,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 01:22:03,501 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 200 [2020-10-16 01:22:03,503 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 72 flow. Second operand 3 states. [2020-10-16 01:22:03,504 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:22:03,504 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 200 [2020-10-16 01:22:03,505 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:22:03,588 INFO L129 PetriNetUnfolder]: 29/109 cut-off events. [2020-10-16 01:22:03,588 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:22:03,589 INFO L80 FinitePrefix]: Finished finitePrefix Result has 176 conditions, 109 events. 29/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 424 event pairs, 15 based on Foata normal form. 11/101 useless extension candidates. Maximal degree in co-relation 165. Up to 41 conditions per place. [2020-10-16 01:22:03,592 INFO L132 encePairwiseOnDemand]: 196/200 looper letters, 7 selfloop transitions, 2 changer transitions 0/31 dead transitions. [2020-10-16 01:22:03,592 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 31 transitions, 92 flow [2020-10-16 01:22:03,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 01:22:03,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 01:22:03,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 528 transitions. [2020-10-16 01:22:03,612 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.88 [2020-10-16 01:22:03,612 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 528 transitions. [2020-10-16 01:22:03,613 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 528 transitions. [2020-10-16 01:22:03,616 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:22:03,619 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 528 transitions. [2020-10-16 01:22:03,623 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 01:22:03,631 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 01:22:03,631 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 01:22:03,634 INFO L185 Difference]: Start difference. First operand has 42 places, 30 transitions, 72 flow. Second operand 3 states and 528 transitions. [2020-10-16 01:22:03,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 31 transitions, 92 flow [2020-10-16 01:22:03,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 31 transitions, 88 flow, removed 0 selfloop flow, removed 4 redundant places. [2020-10-16 01:22:03,640 INFO L241 Difference]: Finished difference. Result has 39 places, 28 transitions, 68 flow [2020-10-16 01:22:03,643 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=39, PETRI_TRANSITIONS=28} [2020-10-16 01:22:03,644 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, -3 predicate places. [2020-10-16 01:22:03,644 INFO L481 AbstractCegarLoop]: Abstraction has has 39 places, 28 transitions, 68 flow [2020-10-16 01:22:03,644 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 01:22:03,644 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:22:03,644 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:22:03,645 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 01:22:03,645 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:22:03,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:22:03,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1977104878, now seen corresponding path program 1 times [2020-10-16 01:22:03,646 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:22:03,646 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925384418] [2020-10-16 01:22:03,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:22:03,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:22:03,749 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 01:22:03,750 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925384418] [2020-10-16 01:22:03,750 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:22:03,750 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 01:22:03,750 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045950081] [2020-10-16 01:22:03,752 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:22:03,752 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:22:03,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:22:03,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:22:03,755 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 200 [2020-10-16 01:22:03,755 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 28 transitions, 68 flow. Second operand 4 states. [2020-10-16 01:22:03,755 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:22:03,756 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 200 [2020-10-16 01:22:03,756 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:22:03,790 INFO L129 PetriNetUnfolder]: 1/39 cut-off events. [2020-10-16 01:22:03,790 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:22:03,791 INFO L80 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 39 events. 1/39 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 59 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 53. Up to 5 conditions per place. [2020-10-16 01:22:03,791 INFO L132 encePairwiseOnDemand]: 196/200 looper letters, 2 selfloop transitions, 2 changer transitions 5/32 dead transitions. [2020-10-16 01:22:03,791 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 32 transitions, 94 flow [2020-10-16 01:22:03,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:22:03,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:22:03,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 861 transitions. [2020-10-16 01:22:03,795 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.861 [2020-10-16 01:22:03,795 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 861 transitions. [2020-10-16 01:22:03,795 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 861 transitions. [2020-10-16 01:22:03,796 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:22:03,796 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 861 transitions. [2020-10-16 01:22:03,797 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:22:03,800 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:22:03,800 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:22:03,800 INFO L185 Difference]: Start difference. First operand has 39 places, 28 transitions, 68 flow. Second operand 5 states and 861 transitions. [2020-10-16 01:22:03,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 32 transitions, 94 flow [2020-10-16 01:22:03,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 32 transitions, 90 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 01:22:03,802 INFO L241 Difference]: Finished difference. Result has 44 places, 27 transitions, 74 flow [2020-10-16 01:22:03,802 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=74, PETRI_PLACES=44, PETRI_TRANSITIONS=27} [2020-10-16 01:22:03,803 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places. [2020-10-16 01:22:03,803 INFO L481 AbstractCegarLoop]: Abstraction has has 44 places, 27 transitions, 74 flow [2020-10-16 01:22:03,803 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:22:03,803 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:22:03,803 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:22:03,803 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 01:22:03,804 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:22:03,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:22:03,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1244466002, now seen corresponding path program 1 times [2020-10-16 01:22:03,804 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:22:03,804 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880271151] [2020-10-16 01:22:03,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:22:03,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:22:03,879 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 01:22:03,880 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880271151] [2020-10-16 01:22:03,880 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:22:03,880 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 01:22:03,880 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483028375] [2020-10-16 01:22:03,881 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:22:03,881 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:22:03,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:22:03,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:22:03,883 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 200 [2020-10-16 01:22:03,883 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 27 transitions, 74 flow. Second operand 4 states. [2020-10-16 01:22:03,884 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:22:03,884 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 200 [2020-10-16 01:22:03,884 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:22:03,920 INFO L129 PetriNetUnfolder]: 6/51 cut-off events. [2020-10-16 01:22:03,920 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2020-10-16 01:22:03,920 INFO L80 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 51 events. 6/51 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 122 event pairs, 2 based on Foata normal form. 4/53 useless extension candidates. Maximal degree in co-relation 86. Up to 15 conditions per place. [2020-10-16 01:22:03,921 INFO L132 encePairwiseOnDemand]: 195/200 looper letters, 4 selfloop transitions, 3 changer transitions 5/34 dead transitions. [2020-10-16 01:22:03,921 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 34 transitions, 114 flow [2020-10-16 01:22:03,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:22:03,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:22:03,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 854 transitions. [2020-10-16 01:22:03,927 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.854 [2020-10-16 01:22:03,927 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 854 transitions. [2020-10-16 01:22:03,927 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 854 transitions. [2020-10-16 01:22:03,928 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:22:03,928 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 854 transitions. [2020-10-16 01:22:03,930 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:22:03,932 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:22:03,932 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:22:03,932 INFO L185 Difference]: Start difference. First operand has 44 places, 27 transitions, 74 flow. Second operand 5 states and 854 transitions. [2020-10-16 01:22:03,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 34 transitions, 114 flow [2020-10-16 01:22:03,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 34 transitions, 106 flow, removed 2 selfloop flow, removed 4 redundant places. [2020-10-16 01:22:03,934 INFO L241 Difference]: Finished difference. Result has 44 places, 29 transitions, 93 flow [2020-10-16 01:22:03,934 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=93, PETRI_PLACES=44, PETRI_TRANSITIONS=29} [2020-10-16 01:22:03,935 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places. [2020-10-16 01:22:03,935 INFO L481 AbstractCegarLoop]: Abstraction has has 44 places, 29 transitions, 93 flow [2020-10-16 01:22:03,935 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:22:03,935 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:22:03,935 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:22:03,935 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 01:22:03,936 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:22:03,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:22:03,936 INFO L82 PathProgramCache]: Analyzing trace with hash 2086472471, now seen corresponding path program 1 times [2020-10-16 01:22:03,936 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:22:03,937 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084449840] [2020-10-16 01:22:03,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:22:03,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:22:04,000 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 01:22:04,000 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084449840] [2020-10-16 01:22:04,001 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:22:04,001 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:22:04,001 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684852270] [2020-10-16 01:22:04,001 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:22:04,002 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:22:04,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:22:04,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:22:04,004 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 200 [2020-10-16 01:22:04,004 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 29 transitions, 93 flow. Second operand 4 states. [2020-10-16 01:22:04,004 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:22:04,004 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 200 [2020-10-16 01:22:04,005 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:22:04,084 INFO L129 PetriNetUnfolder]: 147/309 cut-off events. [2020-10-16 01:22:04,084 INFO L130 PetriNetUnfolder]: For 86/86 co-relation queries the response was YES. [2020-10-16 01:22:04,087 INFO L80 FinitePrefix]: Finished finitePrefix Result has 699 conditions, 309 events. 147/309 cut-off events. For 86/86 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 1530 event pairs, 36 based on Foata normal form. 20/295 useless extension candidates. Maximal degree in co-relation 686. Up to 116 conditions per place. [2020-10-16 01:22:04,090 INFO L132 encePairwiseOnDemand]: 193/200 looper letters, 10 selfloop transitions, 6 changer transitions 0/38 dead transitions. [2020-10-16 01:22:04,090 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 38 transitions, 143 flow [2020-10-16 01:22:04,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 01:22:04,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 01:22:04,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 666 transitions. [2020-10-16 01:22:04,093 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8325 [2020-10-16 01:22:04,093 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 666 transitions. [2020-10-16 01:22:04,093 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 666 transitions. [2020-10-16 01:22:04,094 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:22:04,094 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 666 transitions. [2020-10-16 01:22:04,095 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 01:22:04,097 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 01:22:04,097 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 01:22:04,097 INFO L185 Difference]: Start difference. First operand has 44 places, 29 transitions, 93 flow. Second operand 4 states and 666 transitions. [2020-10-16 01:22:04,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 38 transitions, 143 flow [2020-10-16 01:22:04,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 38 transitions, 138 flow, removed 1 selfloop flow, removed 2 redundant places. [2020-10-16 01:22:04,100 INFO L241 Difference]: Finished difference. Result has 45 places, 34 transitions, 134 flow [2020-10-16 01:22:04,100 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=134, PETRI_PLACES=45, PETRI_TRANSITIONS=34} [2020-10-16 01:22:04,101 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 3 predicate places. [2020-10-16 01:22:04,101 INFO L481 AbstractCegarLoop]: Abstraction has has 45 places, 34 transitions, 134 flow [2020-10-16 01:22:04,101 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:22:04,101 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:22:04,101 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:22:04,101 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 01:22:04,102 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:22:04,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:22:04,102 INFO L82 PathProgramCache]: Analyzing trace with hash 766920514, now seen corresponding path program 1 times [2020-10-16 01:22:04,102 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:22:04,103 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187492773] [2020-10-16 01:22:04,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:22:04,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:22:04,173 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 01:22:04,174 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187492773] [2020-10-16 01:22:04,174 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:22:04,174 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:22:04,175 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955973639] [2020-10-16 01:22:04,175 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:22:04,175 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:22:04,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:22:04,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:22:04,178 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 200 [2020-10-16 01:22:04,178 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 34 transitions, 134 flow. Second operand 4 states. [2020-10-16 01:22:04,178 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:22:04,178 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 200 [2020-10-16 01:22:04,179 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:22:04,287 INFO L129 PetriNetUnfolder]: 153/365 cut-off events. [2020-10-16 01:22:04,287 INFO L130 PetriNetUnfolder]: For 172/224 co-relation queries the response was YES. [2020-10-16 01:22:04,289 INFO L80 FinitePrefix]: Finished finitePrefix Result has 914 conditions, 365 events. 153/365 cut-off events. For 172/224 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2130 event pairs, 72 based on Foata normal form. 27/349 useless extension candidates. Maximal degree in co-relation 899. Up to 250 conditions per place. [2020-10-16 01:22:04,294 INFO L132 encePairwiseOnDemand]: 196/200 looper letters, 5 selfloop transitions, 5 changer transitions 1/37 dead transitions. [2020-10-16 01:22:04,294 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 37 transitions, 170 flow [2020-10-16 01:22:04,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:22:04,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:22:04,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 851 transitions. [2020-10-16 01:22:04,299 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.851 [2020-10-16 01:22:04,299 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 851 transitions. [2020-10-16 01:22:04,299 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 851 transitions. [2020-10-16 01:22:04,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:22:04,301 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 851 transitions. [2020-10-16 01:22:04,303 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:22:04,306 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:22:04,306 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:22:04,306 INFO L185 Difference]: Start difference. First operand has 45 places, 34 transitions, 134 flow. Second operand 5 states and 851 transitions. [2020-10-16 01:22:04,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 37 transitions, 170 flow [2020-10-16 01:22:04,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 37 transitions, 164 flow, removed 2 selfloop flow, removed 1 redundant places. [2020-10-16 01:22:04,314 INFO L241 Difference]: Finished difference. Result has 51 places, 35 transitions, 159 flow [2020-10-16 01:22:04,314 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=159, PETRI_PLACES=51, PETRI_TRANSITIONS=35} [2020-10-16 01:22:04,315 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 9 predicate places. [2020-10-16 01:22:04,315 INFO L481 AbstractCegarLoop]: Abstraction has has 51 places, 35 transitions, 159 flow [2020-10-16 01:22:04,315 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:22:04,315 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:22:04,315 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:22:04,315 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 01:22:04,317 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:22:04,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:22:04,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1386438285, now seen corresponding path program 1 times [2020-10-16 01:22:04,318 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:22:04,318 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766579009] [2020-10-16 01:22:04,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:22:04,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:22:04,470 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 01:22:04,471 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766579009] [2020-10-16 01:22:04,471 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:22:04,471 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:22:04,472 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391468011] [2020-10-16 01:22:04,472 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:22:04,472 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:22:04,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:22:04,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:22:04,475 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 200 [2020-10-16 01:22:04,476 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 35 transitions, 159 flow. Second operand 5 states. [2020-10-16 01:22:04,476 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:22:04,476 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 200 [2020-10-16 01:22:04,476 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:22:04,571 INFO L129 PetriNetUnfolder]: 140/327 cut-off events. [2020-10-16 01:22:04,572 INFO L130 PetriNetUnfolder]: For 393/538 co-relation queries the response was YES. [2020-10-16 01:22:04,573 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1064 conditions, 327 events. 140/327 cut-off events. For 393/538 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 1730 event pairs, 8 based on Foata normal form. 35/332 useless extension candidates. Maximal degree in co-relation 1046. Up to 214 conditions per place. [2020-10-16 01:22:04,575 INFO L132 encePairwiseOnDemand]: 193/200 looper letters, 9 selfloop transitions, 10 changer transitions 1/44 dead transitions. [2020-10-16 01:22:04,575 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 44 transitions, 235 flow [2020-10-16 01:22:04,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:22:04,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:22:04,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 832 transitions. [2020-10-16 01:22:04,579 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.832 [2020-10-16 01:22:04,579 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 832 transitions. [2020-10-16 01:22:04,579 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 832 transitions. [2020-10-16 01:22:04,580 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:22:04,580 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 832 transitions. [2020-10-16 01:22:04,582 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:22:04,584 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:22:04,584 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:22:04,584 INFO L185 Difference]: Start difference. First operand has 51 places, 35 transitions, 159 flow. Second operand 5 states and 832 transitions. [2020-10-16 01:22:04,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 44 transitions, 235 flow [2020-10-16 01:22:04,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 44 transitions, 218 flow, removed 4 selfloop flow, removed 2 redundant places. [2020-10-16 01:22:04,588 INFO L241 Difference]: Finished difference. Result has 55 places, 39 transitions, 204 flow [2020-10-16 01:22:04,588 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=204, PETRI_PLACES=55, PETRI_TRANSITIONS=39} [2020-10-16 01:22:04,588 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 13 predicate places. [2020-10-16 01:22:04,589 INFO L481 AbstractCegarLoop]: Abstraction has has 55 places, 39 transitions, 204 flow [2020-10-16 01:22:04,589 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:22:04,589 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:22:04,589 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:22:04,589 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 01:22:04,589 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:22:04,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:22:04,590 INFO L82 PathProgramCache]: Analyzing trace with hash -2137978583, now seen corresponding path program 1 times [2020-10-16 01:22:04,590 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:22:04,590 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266725127] [2020-10-16 01:22:04,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:22:04,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:22:04,667 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 01:22:04,668 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266725127] [2020-10-16 01:22:04,668 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:22:04,668 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 01:22:04,669 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335188197] [2020-10-16 01:22:04,669 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 01:22:04,669 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:22:04,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 01:22:04,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 01:22:04,671 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 200 [2020-10-16 01:22:04,672 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 39 transitions, 204 flow. Second operand 6 states. [2020-10-16 01:22:04,672 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:22:04,673 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 200 [2020-10-16 01:22:04,673 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:22:04,770 INFO L129 PetriNetUnfolder]: 72/186 cut-off events. [2020-10-16 01:22:04,771 INFO L130 PetriNetUnfolder]: For 365/564 co-relation queries the response was YES. [2020-10-16 01:22:04,772 INFO L80 FinitePrefix]: Finished finitePrefix Result has 744 conditions, 186 events. 72/186 cut-off events. For 365/564 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 785 event pairs, 1 based on Foata normal form. 35/205 useless extension candidates. Maximal degree in co-relation 724. Up to 121 conditions per place. [2020-10-16 01:22:04,774 INFO L132 encePairwiseOnDemand]: 193/200 looper letters, 9 selfloop transitions, 14 changer transitions 3/48 dead transitions. [2020-10-16 01:22:04,774 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 48 transitions, 306 flow [2020-10-16 01:22:04,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 01:22:04,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 01:22:04,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 998 transitions. [2020-10-16 01:22:04,780 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8316666666666667 [2020-10-16 01:22:04,780 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 998 transitions. [2020-10-16 01:22:04,780 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 998 transitions. [2020-10-16 01:22:04,782 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:22:04,782 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 998 transitions. [2020-10-16 01:22:04,785 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 01:22:04,787 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 01:22:04,787 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 01:22:04,788 INFO L185 Difference]: Start difference. First operand has 55 places, 39 transitions, 204 flow. Second operand 6 states and 998 transitions. [2020-10-16 01:22:04,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 48 transitions, 306 flow [2020-10-16 01:22:04,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 48 transitions, 276 flow, removed 5 selfloop flow, removed 4 redundant places. [2020-10-16 01:22:04,792 INFO L241 Difference]: Finished difference. Result has 58 places, 41 transitions, 240 flow [2020-10-16 01:22:04,792 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=240, PETRI_PLACES=58, PETRI_TRANSITIONS=41} [2020-10-16 01:22:04,792 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 16 predicate places. [2020-10-16 01:22:04,793 INFO L481 AbstractCegarLoop]: Abstraction has has 58 places, 41 transitions, 240 flow [2020-10-16 01:22:04,793 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 01:22:04,793 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:22:04,793 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:22:04,793 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 01:22:04,793 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:22:04,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:22:04,794 INFO L82 PathProgramCache]: Analyzing trace with hash -316069524, now seen corresponding path program 1 times [2020-10-16 01:22:04,794 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:22:04,795 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223570419] [2020-10-16 01:22:04,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:22:04,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:22:04,947 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 01:22:04,947 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223570419] [2020-10-16 01:22:04,947 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:22:04,948 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-16 01:22:04,948 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414572860] [2020-10-16 01:22:04,948 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-16 01:22:04,949 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:22:04,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-16 01:22:04,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-10-16 01:22:04,953 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 200 [2020-10-16 01:22:04,955 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 41 transitions, 240 flow. Second operand 10 states. [2020-10-16 01:22:04,955 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:22:04,955 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 200 [2020-10-16 01:22:04,955 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:22:05,296 INFO L129 PetriNetUnfolder]: 194/425 cut-off events. [2020-10-16 01:22:05,296 INFO L130 PetriNetUnfolder]: For 1386/1518 co-relation queries the response was YES. [2020-10-16 01:22:05,298 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1890 conditions, 425 events. 194/425 cut-off events. For 1386/1518 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2220 event pairs, 26 based on Foata normal form. 26/419 useless extension candidates. Maximal degree in co-relation 1869. Up to 254 conditions per place. [2020-10-16 01:22:05,300 INFO L132 encePairwiseOnDemand]: 191/200 looper letters, 18 selfloop transitions, 17 changer transitions 27/81 dead transitions. [2020-10-16 01:22:05,301 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 81 transitions, 666 flow [2020-10-16 01:22:05,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-16 01:22:05,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-16 01:22:05,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1993 transitions. [2020-10-16 01:22:05,308 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7665384615384615 [2020-10-16 01:22:05,308 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1993 transitions. [2020-10-16 01:22:05,308 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1993 transitions. [2020-10-16 01:22:05,310 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:22:05,310 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1993 transitions. [2020-10-16 01:22:05,314 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 14 states. [2020-10-16 01:22:05,319 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 14 states. [2020-10-16 01:22:05,319 INFO L81 ComplementDD]: Finished complementDD. Result 14 states. [2020-10-16 01:22:05,319 INFO L185 Difference]: Start difference. First operand has 58 places, 41 transitions, 240 flow. Second operand 13 states and 1993 transitions. [2020-10-16 01:22:05,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 81 transitions, 666 flow [2020-10-16 01:22:05,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 81 transitions, 543 flow, removed 27 selfloop flow, removed 7 redundant places. [2020-10-16 01:22:05,330 INFO L241 Difference]: Finished difference. Result has 71 places, 53 transitions, 381 flow [2020-10-16 01:22:05,330 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=381, PETRI_PLACES=71, PETRI_TRANSITIONS=53} [2020-10-16 01:22:05,331 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 29 predicate places. [2020-10-16 01:22:05,331 INFO L481 AbstractCegarLoop]: Abstraction has has 71 places, 53 transitions, 381 flow [2020-10-16 01:22:05,331 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-16 01:22:05,331 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:22:05,331 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:22:05,331 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 01:22:05,332 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:22:05,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:22:05,332 INFO L82 PathProgramCache]: Analyzing trace with hash 202838526, now seen corresponding path program 2 times [2020-10-16 01:22:05,333 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:22:05,333 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823259246] [2020-10-16 01:22:05,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:22:05,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:22:05,434 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 01:22:05,434 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823259246] [2020-10-16 01:22:05,434 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:22:05,435 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 01:22:05,435 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991523279] [2020-10-16 01:22:05,435 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 01:22:05,436 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:22:05,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 01:22:05,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-16 01:22:05,440 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 200 [2020-10-16 01:22:05,441 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 53 transitions, 381 flow. Second operand 7 states. [2020-10-16 01:22:05,441 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:22:05,442 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 200 [2020-10-16 01:22:05,442 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:22:05,572 INFO L129 PetriNetUnfolder]: 88/208 cut-off events. [2020-10-16 01:22:05,572 INFO L130 PetriNetUnfolder]: For 999/1186 co-relation queries the response was YES. [2020-10-16 01:22:05,573 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1057 conditions, 208 events. 88/208 cut-off events. For 999/1186 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 890 event pairs, 7 based on Foata normal form. 47/237 useless extension candidates. Maximal degree in co-relation 1033. Up to 78 conditions per place. [2020-10-16 01:22:05,575 INFO L132 encePairwiseOnDemand]: 193/200 looper letters, 2 selfloop transitions, 28 changer transitions 1/54 dead transitions. [2020-10-16 01:22:05,575 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 54 transitions, 446 flow [2020-10-16 01:22:05,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 01:22:05,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 01:22:05,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1156 transitions. [2020-10-16 01:22:05,580 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8257142857142857 [2020-10-16 01:22:05,580 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1156 transitions. [2020-10-16 01:22:05,580 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1156 transitions. [2020-10-16 01:22:05,582 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:22:05,582 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1156 transitions. [2020-10-16 01:22:05,584 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 01:22:05,587 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 01:22:05,587 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 01:22:05,587 INFO L185 Difference]: Start difference. First operand has 71 places, 53 transitions, 381 flow. Second operand 7 states and 1156 transitions. [2020-10-16 01:22:05,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 54 transitions, 446 flow [2020-10-16 01:22:05,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 54 transitions, 380 flow, removed 24 selfloop flow, removed 10 redundant places. [2020-10-16 01:22:05,594 INFO L241 Difference]: Finished difference. Result has 62 places, 53 transitions, 390 flow [2020-10-16 01:22:05,594 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=315, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=390, PETRI_PLACES=62, PETRI_TRANSITIONS=53} [2020-10-16 01:22:05,595 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 20 predicate places. [2020-10-16 01:22:05,595 INFO L481 AbstractCegarLoop]: Abstraction has has 62 places, 53 transitions, 390 flow [2020-10-16 01:22:05,595 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 01:22:05,595 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:22:05,595 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:22:05,595 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 01:22:05,595 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:22:05,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:22:05,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1148541234, now seen corresponding path program 1 times [2020-10-16 01:22:05,596 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:22:05,596 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701088411] [2020-10-16 01:22:05,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:22:05,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:22:05,703 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 01:22:05,703 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701088411] [2020-10-16 01:22:05,704 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:22:05,704 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:22:05,704 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908885569] [2020-10-16 01:22:05,704 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:22:05,705 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:22:05,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:22:05,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:22:05,707 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 200 [2020-10-16 01:22:05,707 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 53 transitions, 390 flow. Second operand 4 states. [2020-10-16 01:22:05,707 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:22:05,708 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 200 [2020-10-16 01:22:05,708 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:22:05,801 INFO L129 PetriNetUnfolder]: 173/403 cut-off events. [2020-10-16 01:22:05,802 INFO L130 PetriNetUnfolder]: For 1357/1543 co-relation queries the response was YES. [2020-10-16 01:22:05,804 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1843 conditions, 403 events. 173/403 cut-off events. For 1357/1543 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 2225 event pairs, 12 based on Foata normal form. 10/373 useless extension candidates. Maximal degree in co-relation 1821. Up to 159 conditions per place. [2020-10-16 01:22:05,806 INFO L132 encePairwiseOnDemand]: 196/200 looper letters, 6 selfloop transitions, 2 changer transitions 1/56 dead transitions. [2020-10-16 01:22:05,806 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 56 transitions, 416 flow [2020-10-16 01:22:05,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 01:22:05,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 01:22:05,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 678 transitions. [2020-10-16 01:22:05,808 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8475 [2020-10-16 01:22:05,809 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 678 transitions. [2020-10-16 01:22:05,809 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 678 transitions. [2020-10-16 01:22:05,809 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:22:05,810 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 678 transitions. [2020-10-16 01:22:05,811 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 01:22:05,813 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 01:22:05,813 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 01:22:05,813 INFO L185 Difference]: Start difference. First operand has 62 places, 53 transitions, 390 flow. Second operand 4 states and 678 transitions. [2020-10-16 01:22:05,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 56 transitions, 416 flow [2020-10-16 01:22:05,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 56 transitions, 353 flow, removed 12 selfloop flow, removed 4 redundant places. [2020-10-16 01:22:05,824 INFO L241 Difference]: Finished difference. Result has 63 places, 54 transitions, 341 flow [2020-10-16 01:22:05,825 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=327, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=341, PETRI_PLACES=63, PETRI_TRANSITIONS=54} [2020-10-16 01:22:05,825 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 21 predicate places. [2020-10-16 01:22:05,825 INFO L481 AbstractCegarLoop]: Abstraction has has 63 places, 54 transitions, 341 flow [2020-10-16 01:22:05,825 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:22:05,825 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:22:05,826 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:22:05,826 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 01:22:05,826 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:22:05,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:22:05,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1309937748, now seen corresponding path program 2 times [2020-10-16 01:22:05,826 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:22:05,829 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007056294] [2020-10-16 01:22:05,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:22:05,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 01:22:05,899 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 01:22:05,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 01:22:05,952 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 01:22:06,011 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 01:22:06,011 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 01:22:06,011 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 01:22:06,047 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 01:22:06,047 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:22:06,051 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 01:22:06,051 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:22:06,051 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 01:22:06,052 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:22:06,052 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 01:22:06,052 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:22:06,052 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 01:22:06,052 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:22:06,052 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 01:22:06,053 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:22:06,053 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 01:22:06,053 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:22:06,053 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 01:22:06,054 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:22:06,054 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 01:22:06,054 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:22:06,054 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 01:22:06,054 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:22:06,054 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 01:22:06,055 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:22:06,055 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 01:22:06,055 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:22:06,055 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 01:22:06,055 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:22:06,055 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 01:22:06,055 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:22:06,056 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 01:22:06,056 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:22:06,056 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 01:22:06,056 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:22:06,058 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 01:22:06,062 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:22:06,062 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 01:22:06,062 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:22:06,062 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 01:22:06,063 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:22:06,064 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 01:22:06,064 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:22:06,064 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 01:22:06,065 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:22:06,065 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 01:22:06,065 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:22:06,065 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 01:22:06,065 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:22:06,065 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 01:22:06,065 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:22:06,066 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 01:22:06,066 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:22:06,066 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 01:22:06,066 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:22:06,066 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 01:22:06,066 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:22:06,067 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 01:22:06,067 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:22:06,067 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 01:22:06,067 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:22:06,144 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 01:22:06 BasicIcfg [2020-10-16 01:22:06,144 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 01:22:06,146 INFO L168 Benchmark]: Toolchain (without parser) took 10313.25 ms. Allocated memory was 248.0 MB in the beginning and 534.2 MB in the end (delta: 286.3 MB). Free memory was 203.7 MB in the beginning and 323.7 MB in the end (delta: -120.0 MB). Peak memory consumption was 166.2 MB. Max. memory is 14.2 GB. [2020-10-16 01:22:06,147 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 248.0 MB. Free memory is still 224.4 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-16 01:22:06,148 INFO L168 Benchmark]: CACSL2BoogieTranslator took 767.30 ms. Allocated memory was 248.0 MB in the beginning and 305.7 MB in the end (delta: 57.7 MB). Free memory was 203.7 MB in the beginning and 257.9 MB in the end (delta: -54.2 MB). Peak memory consumption was 36.0 MB. Max. memory is 14.2 GB. [2020-10-16 01:22:06,148 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.83 ms. Allocated memory is still 305.7 MB. Free memory was 257.9 MB in the beginning and 255.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 01:22:06,149 INFO L168 Benchmark]: Boogie Preprocessor took 46.46 ms. Allocated memory is still 305.7 MB. Free memory was 255.4 MB in the beginning and 252.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 01:22:06,150 INFO L168 Benchmark]: RCFGBuilder took 1943.42 ms. Allocated memory was 305.7 MB in the beginning and 355.5 MB in the end (delta: 49.8 MB). Free memory was 252.9 MB in the beginning and 205.7 MB in the end (delta: 47.2 MB). Peak memory consumption was 101.3 MB. Max. memory is 14.2 GB. [2020-10-16 01:22:06,151 INFO L168 Benchmark]: TraceAbstraction took 7488.26 ms. Allocated memory was 355.5 MB in the beginning and 534.2 MB in the end (delta: 178.8 MB). Free memory was 205.7 MB in the beginning and 323.7 MB in the end (delta: -118.0 MB). Peak memory consumption was 60.7 MB. Max. memory is 14.2 GB. [2020-10-16 01:22:06,155 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.20 ms. Allocated memory is still 248.0 MB. Free memory is still 224.4 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 767.30 ms. Allocated memory was 248.0 MB in the beginning and 305.7 MB in the end (delta: 57.7 MB). Free memory was 203.7 MB in the beginning and 257.9 MB in the end (delta: -54.2 MB). Peak memory consumption was 36.0 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 62.83 ms. Allocated memory is still 305.7 MB. Free memory was 257.9 MB in the beginning and 255.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 46.46 ms. Allocated memory is still 305.7 MB. Free memory was 255.4 MB in the beginning and 252.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 1943.42 ms. Allocated memory was 305.7 MB in the beginning and 355.5 MB in the end (delta: 49.8 MB). Free memory was 252.9 MB in the beginning and 205.7 MB in the end (delta: 47.2 MB). Peak memory consumption was 101.3 MB. Max. memory is 14.2 GB. * TraceAbstraction took 7488.26 ms. Allocated memory was 355.5 MB in the beginning and 534.2 MB in the end (delta: 178.8 MB). Free memory was 205.7 MB in the beginning and 323.7 MB in the end (delta: -118.0 MB). Peak memory consumption was 60.7 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1557 VarBasedMoverChecksPositive, 87 VarBasedMoverChecksNegative, 17 SemBasedMoverChecksPositive, 70 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.4s, 194 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 4.2s, 117 PlacesBefore, 42 PlacesAfterwards, 106 TransitionsBefore, 30 TransitionsAfterwards, 2456 CoEnabledTransitionPairs, 6 FixpointIterations, 36 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 90 TotalNumberOfCompositions, 6496 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L699] 0 int __unbuffered_cnt = 0; [L701] 0 int __unbuffered_p1_EAX = 0; [L703] 0 int __unbuffered_p3_EAX = 0; [L705] 0 int __unbuffered_p3_EBX = 0; [L707] 0 int a = 0; [L708] 0 _Bool main$tmp_guard0; [L709] 0 _Bool main$tmp_guard1; [L711] 0 int x = 0; [L713] 0 int y = 0; [L714] 0 _Bool y$flush_delayed; [L715] 0 int y$mem_tmp; [L716] 0 _Bool y$r_buff0_thd0; [L717] 0 _Bool y$r_buff0_thd1; [L718] 0 _Bool y$r_buff0_thd2; [L719] 0 _Bool y$r_buff0_thd3; [L720] 0 _Bool y$r_buff0_thd4; [L721] 0 _Bool y$r_buff1_thd0; [L722] 0 _Bool y$r_buff1_thd1; [L723] 0 _Bool y$r_buff1_thd2; [L724] 0 _Bool y$r_buff1_thd3; [L725] 0 _Bool y$r_buff1_thd4; [L726] 0 _Bool y$read_delayed; [L727] 0 int *y$read_delayed_var; [L728] 0 int y$w_buff0; [L729] 0 _Bool y$w_buff0_used; [L730] 0 int y$w_buff1; [L731] 0 _Bool y$w_buff1_used; [L733] 0 int z = 0; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L843] 0 pthread_t t733; [L844] FCALL, FORK 0 pthread_create(&t733, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=0] [L845] 0 pthread_t t734; [L846] FCALL, FORK 0 pthread_create(&t734, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=0] [L847] 0 pthread_t t735; [L848] FCALL, FORK 0 pthread_create(&t735, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=0] [L782] 3 y$w_buff1 = y$w_buff0 [L783] 3 y$w_buff0 = 1 [L784] 3 y$w_buff1_used = y$w_buff0_used [L785] 3 y$w_buff0_used = (_Bool)1 [L7] COND TRUE 3 !expression [L7] 3 __VERIFIER_error() [L787] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L788] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L789] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L790] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L791] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L792] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L795] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L849] 0 pthread_t t736; [L850] FCALL, FORK 0 pthread_create(&t736, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L812] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L815] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L818] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L739] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L742] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L754] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L749] 1 return 0; [L757] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L758] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L759] 2 y$flush_delayed = weak$$choice2 [L760] 2 y$mem_tmp = y [L761] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L761] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L762] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L762] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0) [L762] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L762] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L763] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L763] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1) [L763] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L763] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L764] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L764] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used) [L764] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L764] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L765] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L765] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L766] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L766] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2) [L766] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L766] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L767] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L767] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L767] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L767] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L768] 2 __unbuffered_p1_EAX = y [L769] EXPR 2 y$flush_delayed ? y$mem_tmp : y [L769] 2 y = y$flush_delayed ? y$mem_tmp : y [L770] 2 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L821] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L821] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L822] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L822] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L823] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L823] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L824] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L824] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L825] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L825] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L798] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L798] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L799] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L799] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L800] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L800] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L801] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L801] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L802] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L802] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L805] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L807] 3 return 0; [L828] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L830] 4 return 0; [L852] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L3] COND FALSE 0 !(!cond) [L856] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L856] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L857] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L857] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L858] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L858] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L859] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L859] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L860] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L860] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L863] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 109 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: 7.2s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.3s, HoareTripleCheckerStatistics: 50 SDtfs, 36 SDslu, 62 SDs, 0 SdLazy, 291 SolverSat, 99 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=390occurred in iteration=9, 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.4s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 202 NumberOfCodeBlocks, 202 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 165 ConstructedInterpolants, 0 QuantifiedInterpolants, 9473 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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...