/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/mix042_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-16 01:26:19,626 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 01:26:19,628 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 01:26:19,653 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 01:26:19,653 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 01:26:19,654 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 01:26:19,656 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 01:26:19,657 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 01:26:19,659 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 01:26:19,660 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 01:26:19,661 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 01:26:19,662 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 01:26:19,662 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 01:26:19,663 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 01:26:19,664 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 01:26:19,666 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 01:26:19,666 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 01:26:19,667 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 01:26:19,669 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 01:26:19,671 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 01:26:19,672 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 01:26:19,673 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 01:26:19,674 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 01:26:19,675 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 01:26:19,678 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 01:26:19,678 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 01:26:19,678 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 01:26:19,679 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 01:26:19,679 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 01:26:19,680 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 01:26:19,680 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 01:26:19,681 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 01:26:19,682 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 01:26:19,683 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 01:26:19,684 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 01:26:19,684 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 01:26:19,685 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 01:26:19,685 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 01:26:19,685 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 01:26:19,686 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 01:26:19,687 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 01:26:19,687 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:26:19,711 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 01:26:19,711 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 01:26:19,712 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 01:26:19,713 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 01:26:19,713 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 01:26:19,713 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 01:26:19,713 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 01:26:19,713 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 01:26:19,714 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 01:26:19,714 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 01:26:19,714 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 01:26:19,714 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 01:26:19,714 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 01:26:19,714 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 01:26:19,715 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 01:26:19,715 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 01:26:19,715 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 01:26:19,715 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 01:26:19,715 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 01:26:19,716 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 01:26:19,716 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 01:26:19,716 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 01:26:19,716 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 01:26:19,717 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 01:26:19,717 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 01:26:19,717 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 01:26:19,717 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 01:26:19,717 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-16 01:26:19,717 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 01:26:20,041 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 01:26:20,053 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 01:26:20,056 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 01:26:20,057 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 01:26:20,058 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 01:26:20,058 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix042_pso.opt.i [2020-10-16 01:26:20,120 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c405e52fa/78a0f111a73d41c68e7a86120a962ea3/FLAGf86270f7e [2020-10-16 01:26:20,614 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 01:26:20,615 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix042_pso.opt.i [2020-10-16 01:26:20,645 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c405e52fa/78a0f111a73d41c68e7a86120a962ea3/FLAGf86270f7e [2020-10-16 01:26:20,916 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c405e52fa/78a0f111a73d41c68e7a86120a962ea3 [2020-10-16 01:26:20,925 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 01:26:20,927 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 01:26:20,928 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 01:26:20,928 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 01:26:20,934 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 01:26:20,935 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:26:20" (1/1) ... [2020-10-16 01:26:20,938 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4767bcde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:26:20, skipping insertion in model container [2020-10-16 01:26:20,938 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:26:20" (1/1) ... [2020-10-16 01:26:20,946 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 01:26:21,000 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 01:26:21,527 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 01:26:21,542 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 01:26:21,605 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 01:26:21,682 INFO L208 MainTranslator]: Completed translation [2020-10-16 01:26:21,683 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:26:21 WrapperNode [2020-10-16 01:26:21,683 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 01:26:21,684 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 01:26:21,684 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 01:26:21,684 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 01:26:21,693 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:26:21" (1/1) ... [2020-10-16 01:26:21,712 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:26:21" (1/1) ... [2020-10-16 01:26:21,751 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 01:26:21,751 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 01:26:21,751 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 01:26:21,752 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 01:26:21,762 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:26:21" (1/1) ... [2020-10-16 01:26:21,762 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:26:21" (1/1) ... [2020-10-16 01:26:21,770 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:26:21" (1/1) ... [2020-10-16 01:26:21,770 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:26:21" (1/1) ... [2020-10-16 01:26:21,781 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:26:21" (1/1) ... [2020-10-16 01:26:21,785 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:26:21" (1/1) ... [2020-10-16 01:26:21,789 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:26:21" (1/1) ... [2020-10-16 01:26:21,794 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 01:26:21,795 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 01:26:21,795 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 01:26:21,795 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 01:26:21,796 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:26:21" (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:26:21,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 01:26:21,857 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 01:26:21,857 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 01:26:21,857 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 01:26:21,857 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 01:26:21,858 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 01:26:21,858 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 01:26:21,858 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 01:26:21,858 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 01:26:21,858 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 01:26:21,858 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 01:26:21,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 01:26:21,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 01:26:21,861 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:26:23,810 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 01:26:23,810 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 01:26:23,813 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:26:23 BoogieIcfgContainer [2020-10-16 01:26:23,813 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 01:26:23,814 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 01:26:23,814 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 01:26:23,818 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 01:26:23,818 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 01:26:20" (1/3) ... [2020-10-16 01:26:23,819 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40477d7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:26:23, skipping insertion in model container [2020-10-16 01:26:23,819 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:26:21" (2/3) ... [2020-10-16 01:26:23,820 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40477d7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:26:23, skipping insertion in model container [2020-10-16 01:26:23,820 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:26:23" (3/3) ... [2020-10-16 01:26:23,821 INFO L111 eAbstractionObserver]: Analyzing ICFG mix042_pso.opt.i [2020-10-16 01:26:23,833 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 01:26:23,842 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 01:26:23,843 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 01:26:23,871 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:23,872 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:23,872 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:23,872 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:23,873 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:23,873 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:23,873 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:23,874 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:23,874 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:23,874 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:23,874 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:23,875 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:23,875 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:23,875 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:23,875 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:23,875 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:23,875 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:23,876 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:23,876 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:23,877 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:23,877 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:23,877 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:23,878 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:23,878 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:23,878 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:23,879 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:23,879 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:23,879 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:23,879 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:23,879 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:23,880 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:23,880 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:23,880 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:23,880 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:23,881 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:23,881 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:23,885 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:23,885 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:23,885 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:23,885 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:23,887 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:23,888 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:23,888 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:23,888 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:23,888 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:23,889 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:23,889 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:23,889 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:23,889 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:23,889 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:23,893 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:23,894 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:23,894 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:23,894 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:23,894 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:23,895 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:23,895 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:23,895 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:23,895 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:23,895 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:23,896 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:23,896 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:26:23,913 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-16 01:26:23,931 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 01:26:23,931 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-16 01:26:23,931 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 01:26:23,932 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 01:26:23,932 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 01:26:23,932 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 01:26:23,932 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 01:26:23,932 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 01:26:23,946 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 104 places, 96 transitions, 207 flow [2020-10-16 01:26:23,989 INFO L129 PetriNetUnfolder]: 2/93 cut-off events. [2020-10-16 01:26:23,990 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:26:23,994 INFO L80 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 93 events. 2/93 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 69 event pairs, 0 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2020-10-16 01:26:23,995 INFO L82 GeneralOperation]: Start removeDead. Operand has 104 places, 96 transitions, 207 flow [2020-10-16 01:26:24,001 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 101 places, 93 transitions, 195 flow [2020-10-16 01:26:24,003 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 01:26:24,006 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 93 transitions, 195 flow [2020-10-16 01:26:24,009 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 101 places, 93 transitions, 195 flow [2020-10-16 01:26:24,009 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 101 places, 93 transitions, 195 flow [2020-10-16 01:26:24,034 INFO L129 PetriNetUnfolder]: 2/93 cut-off events. [2020-10-16 01:26:24,034 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:26:24,035 INFO L80 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 93 events. 2/93 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 70 event pairs, 0 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2020-10-16 01:26:24,038 INFO L117 LiptonReduction]: Number of co-enabled transitions 1692 [2020-10-16 01:26:24,246 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 01:26:24,247 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:26:24,428 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 38 [2020-10-16 01:26:24,485 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 01:26:24,485 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:26:24,546 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 01:26:24,547 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:26:24,549 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 01:26:24,550 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:26:24,571 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 01:26:24,571 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:26:24,574 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 01:26:24,574 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:26:25,800 WARN L193 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2020-10-16 01:26:25,816 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 2, 1] term [2020-10-16 01:26:25,817 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:26:25,818 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 01:26:25,819 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:26:26,771 WARN L193 SmtUtils]: Spent 947.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 125 [2020-10-16 01:26:27,014 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 01:26:27,014 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:26:27,018 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 01:26:27,019 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:26:27,055 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 01:26:27,056 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:26:27,058 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 01:26:27,059 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:26:27,523 WARN L193 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-16 01:26:27,646 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-16 01:26:27,826 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:26:27,826 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:26:27,828 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:26:27,828 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:26:27,832 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:26:27,833 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:26:27,837 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:26:27,837 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:26:27,872 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:26:27,875 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:26:27,877 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:26:27,877 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:26:27,881 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:26:27,882 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:26:27,886 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:26:27,886 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:26:27,968 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:26:27,968 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:26:27,969 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:26:27,970 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:26:27,972 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:26:27,973 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:26:27,975 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:26:27,975 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:26:27,989 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:26:27,989 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:26:27,990 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:26:27,991 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:26:27,993 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:26:27,994 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:26:27,996 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:26:27,997 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:26:28,188 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:26:28,189 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:26:28,190 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:26:28,191 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:26:28,193 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:26:28,194 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:26:28,196 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:26:28,196 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:26:28,235 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:26:28,235 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:26:28,236 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:26:28,237 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:26:28,238 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:26:28,239 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:26:28,240 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:26:28,241 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:26:28,621 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:26:28,621 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:26:28,623 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:26:28,623 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:26:28,625 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:26:28,626 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:26:28,627 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:26:28,628 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:26:28,640 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:26:28,641 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:26:28,641 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:26:28,642 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:26:28,647 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:26:28,647 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:26:28,649 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:26:28,649 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:26:29,372 WARN L193 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2020-10-16 01:26:29,513 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-10-16 01:26:29,521 INFO L132 LiptonReduction]: Checked pairs total: 4575 [2020-10-16 01:26:29,521 INFO L134 LiptonReduction]: Total number of compositions: 79 [2020-10-16 01:26:29,524 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5523 [2020-10-16 01:26:29,532 INFO L129 PetriNetUnfolder]: 0/13 cut-off events. [2020-10-16 01:26:29,532 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:26:29,532 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:26:29,533 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:26:29,534 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:26:29,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:26:29,539 INFO L82 PathProgramCache]: Analyzing trace with hash -964678123, now seen corresponding path program 1 times [2020-10-16 01:26:29,550 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:26:29,550 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173197307] [2020-10-16 01:26:29,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:26:29,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:26:29,802 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:26:29,803 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173197307] [2020-10-16 01:26:29,804 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:26:29,804 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 01:26:29,805 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509459823] [2020-10-16 01:26:29,816 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 01:26:29,816 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:26:29,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 01:26:29,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 01:26:29,835 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 175 [2020-10-16 01:26:29,837 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 59 flow. Second operand 3 states. [2020-10-16 01:26:29,838 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:26:29,838 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 175 [2020-10-16 01:26:29,839 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:26:29,907 INFO L129 PetriNetUnfolder]: 16/69 cut-off events. [2020-10-16 01:26:29,907 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:26:29,908 INFO L80 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 69 events. 16/69 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 239 event pairs, 2 based on Foata normal form. 6/72 useless extension candidates. Maximal degree in co-relation 104. Up to 27 conditions per place. [2020-10-16 01:26:29,910 INFO L132 encePairwiseOnDemand]: 171/175 looper letters, 7 selfloop transitions, 2 changer transitions 0/26 dead transitions. [2020-10-16 01:26:29,910 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 26 transitions, 79 flow [2020-10-16 01:26:29,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 01:26:29,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 01:26:29,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 453 transitions. [2020-10-16 01:26:29,928 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8628571428571429 [2020-10-16 01:26:29,929 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 453 transitions. [2020-10-16 01:26:29,930 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 453 transitions. [2020-10-16 01:26:29,932 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:26:29,936 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 453 transitions. [2020-10-16 01:26:29,940 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 01:26:29,948 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 01:26:29,949 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 01:26:29,951 INFO L185 Difference]: Start difference. First operand has 34 places, 25 transitions, 59 flow. Second operand 3 states and 453 transitions. [2020-10-16 01:26:29,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 26 transitions, 79 flow [2020-10-16 01:26:29,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 26 transitions, 76 flow, removed 0 selfloop flow, removed 3 redundant places. [2020-10-16 01:26:29,958 INFO L241 Difference]: Finished difference. Result has 32 places, 23 transitions, 56 flow [2020-10-16 01:26:29,961 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=32, PETRI_TRANSITIONS=23} [2020-10-16 01:26:29,962 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2020-10-16 01:26:29,962 INFO L481 AbstractCegarLoop]: Abstraction has has 32 places, 23 transitions, 56 flow [2020-10-16 01:26:29,962 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 01:26:29,962 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:26:29,962 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:26:29,963 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 01:26:29,963 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:26:29,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:26:29,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1097435749, now seen corresponding path program 1 times [2020-10-16 01:26:29,963 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:26:29,964 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239628459] [2020-10-16 01:26:29,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:26:30,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:26:30,153 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:26:30,154 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239628459] [2020-10-16 01:26:30,154 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:26:30,154 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 01:26:30,154 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944964928] [2020-10-16 01:26:30,156 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:26:30,156 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:26:30,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:26:30,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:26:30,159 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 175 [2020-10-16 01:26:30,159 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 23 transitions, 56 flow. Second operand 4 states. [2020-10-16 01:26:30,159 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:26:30,159 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 175 [2020-10-16 01:26:30,160 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:26:30,325 INFO L129 PetriNetUnfolder]: 47/116 cut-off events. [2020-10-16 01:26:30,325 INFO L130 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2020-10-16 01:26:30,327 INFO L80 FinitePrefix]: Finished finitePrefix Result has 225 conditions, 116 events. 47/116 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 472 event pairs, 9 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 216. Up to 51 conditions per place. [2020-10-16 01:26:30,328 INFO L132 encePairwiseOnDemand]: 170/175 looper letters, 8 selfloop transitions, 2 changer transitions 9/33 dead transitions. [2020-10-16 01:26:30,328 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 33 transitions, 116 flow [2020-10-16 01:26:30,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:26:30,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:26:30,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 676 transitions. [2020-10-16 01:26:30,336 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7725714285714286 [2020-10-16 01:26:30,336 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 676 transitions. [2020-10-16 01:26:30,336 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 676 transitions. [2020-10-16 01:26:30,337 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:26:30,337 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 676 transitions. [2020-10-16 01:26:30,340 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:26:30,344 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:26:30,347 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:26:30,347 INFO L185 Difference]: Start difference. First operand has 32 places, 23 transitions, 56 flow. Second operand 5 states and 676 transitions. [2020-10-16 01:26:30,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 33 transitions, 116 flow [2020-10-16 01:26:30,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 33 transitions, 110 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 01:26:30,349 INFO L241 Difference]: Finished difference. Result has 37 places, 22 transitions, 62 flow [2020-10-16 01:26:30,349 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=62, PETRI_PLACES=37, PETRI_TRANSITIONS=22} [2020-10-16 01:26:30,350 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 3 predicate places. [2020-10-16 01:26:30,350 INFO L481 AbstractCegarLoop]: Abstraction has has 37 places, 22 transitions, 62 flow [2020-10-16 01:26:30,350 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:26:30,350 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:26:30,350 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:26:30,351 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 01:26:30,351 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:26:30,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:26:30,352 INFO L82 PathProgramCache]: Analyzing trace with hash 339258869, now seen corresponding path program 1 times [2020-10-16 01:26:30,352 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:26:30,352 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372838224] [2020-10-16 01:26:30,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:26:30,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:26:30,516 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:26:30,517 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372838224] [2020-10-16 01:26:30,518 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:26:30,518 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:26:30,518 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124344929] [2020-10-16 01:26:30,519 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:26:30,519 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:26:30,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:26:30,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:26:30,523 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 175 [2020-10-16 01:26:30,523 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 22 transitions, 62 flow. Second operand 5 states. [2020-10-16 01:26:30,523 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:26:30,524 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 175 [2020-10-16 01:26:30,524 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:26:30,607 INFO L129 PetriNetUnfolder]: 24/79 cut-off events. [2020-10-16 01:26:30,607 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2020-10-16 01:26:30,608 INFO L80 FinitePrefix]: Finished finitePrefix Result has 168 conditions, 79 events. 24/79 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 299 event pairs, 9 based on Foata normal form. 6/83 useless extension candidates. Maximal degree in co-relation 156. Up to 33 conditions per place. [2020-10-16 01:26:30,609 INFO L132 encePairwiseOnDemand]: 171/175 looper letters, 8 selfloop transitions, 2 changer transitions 5/29 dead transitions. [2020-10-16 01:26:30,609 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 29 transitions, 108 flow [2020-10-16 01:26:30,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:26:30,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:26:30,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 662 transitions. [2020-10-16 01:26:30,612 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7565714285714286 [2020-10-16 01:26:30,612 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 662 transitions. [2020-10-16 01:26:30,612 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 662 transitions. [2020-10-16 01:26:30,613 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:26:30,613 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 662 transitions. [2020-10-16 01:26:30,614 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:26:30,616 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:26:30,616 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:26:30,616 INFO L185 Difference]: Start difference. First operand has 37 places, 22 transitions, 62 flow. Second operand 5 states and 662 transitions. [2020-10-16 01:26:30,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 29 transitions, 108 flow [2020-10-16 01:26:30,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 29 transitions, 100 flow, removed 2 selfloop flow, removed 4 redundant places. [2020-10-16 01:26:30,619 INFO L241 Difference]: Finished difference. Result has 37 places, 22 transitions, 66 flow [2020-10-16 01:26:30,619 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=66, PETRI_PLACES=37, PETRI_TRANSITIONS=22} [2020-10-16 01:26:30,619 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 3 predicate places. [2020-10-16 01:26:30,619 INFO L481 AbstractCegarLoop]: Abstraction has has 37 places, 22 transitions, 66 flow [2020-10-16 01:26:30,619 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:26:30,620 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:26:30,620 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:26:30,620 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 01:26:30,620 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:26:30,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:26:30,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1927062368, now seen corresponding path program 1 times [2020-10-16 01:26:30,621 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:26:30,621 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328483671] [2020-10-16 01:26:30,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:26:30,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:26:30,799 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:26:30,800 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328483671] [2020-10-16 01:26:30,801 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:26:30,801 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:26:30,801 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123513428] [2020-10-16 01:26:30,802 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 01:26:30,802 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:26:30,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 01:26:30,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-16 01:26:30,804 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 175 [2020-10-16 01:26:30,804 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 22 transitions, 66 flow. Second operand 6 states. [2020-10-16 01:26:30,804 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:26:30,804 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 175 [2020-10-16 01:26:30,805 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:26:30,977 INFO L129 PetriNetUnfolder]: 28/95 cut-off events. [2020-10-16 01:26:30,978 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2020-10-16 01:26:30,979 INFO L80 FinitePrefix]: Finished finitePrefix Result has 211 conditions, 95 events. 28/95 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 339 event pairs, 18 based on Foata normal form. 6/100 useless extension candidates. Maximal degree in co-relation 198. Up to 50 conditions per place. [2020-10-16 01:26:30,979 INFO L132 encePairwiseOnDemand]: 169/175 looper letters, 9 selfloop transitions, 5 changer transitions 6/34 dead transitions. [2020-10-16 01:26:30,980 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 34 transitions, 135 flow [2020-10-16 01:26:30,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 01:26:30,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 01:26:30,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 772 transitions. [2020-10-16 01:26:30,984 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7352380952380952 [2020-10-16 01:26:30,984 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 772 transitions. [2020-10-16 01:26:30,984 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 772 transitions. [2020-10-16 01:26:30,985 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:26:30,985 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 772 transitions. [2020-10-16 01:26:30,987 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 01:26:30,989 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 01:26:30,989 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 01:26:30,989 INFO L185 Difference]: Start difference. First operand has 37 places, 22 transitions, 66 flow. Second operand 6 states and 772 transitions. [2020-10-16 01:26:30,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 34 transitions, 135 flow [2020-10-16 01:26:30,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 34 transitions, 120 flow, removed 4 selfloop flow, removed 5 redundant places. [2020-10-16 01:26:30,992 INFO L241 Difference]: Finished difference. Result has 39 places, 26 transitions, 92 flow [2020-10-16 01:26:30,992 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=92, PETRI_PLACES=39, PETRI_TRANSITIONS=26} [2020-10-16 01:26:30,992 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 5 predicate places. [2020-10-16 01:26:30,992 INFO L481 AbstractCegarLoop]: Abstraction has has 39 places, 26 transitions, 92 flow [2020-10-16 01:26:30,993 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 01:26:30,993 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:26:30,993 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:26:30,993 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 01:26:30,993 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:26:30,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:26:30,994 INFO L82 PathProgramCache]: Analyzing trace with hash -1896370169, now seen corresponding path program 1 times [2020-10-16 01:26:30,994 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:26:30,994 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872517835] [2020-10-16 01:26:30,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:26:31,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:26:31,154 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:26:31,158 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872517835] [2020-10-16 01:26:31,158 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:26:31,158 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 01:26:31,158 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53489164] [2020-10-16 01:26:31,159 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 01:26:31,159 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:26:31,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 01:26:31,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-16 01:26:31,161 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 175 [2020-10-16 01:26:31,162 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 26 transitions, 92 flow. Second operand 7 states. [2020-10-16 01:26:31,162 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:26:31,162 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 175 [2020-10-16 01:26:31,162 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:26:31,352 INFO L129 PetriNetUnfolder]: 25/87 cut-off events. [2020-10-16 01:26:31,352 INFO L130 PetriNetUnfolder]: For 61/63 co-relation queries the response was YES. [2020-10-16 01:26:31,354 INFO L80 FinitePrefix]: Finished finitePrefix Result has 229 conditions, 87 events. 25/87 cut-off events. For 61/63 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 315 event pairs, 1 based on Foata normal form. 7/90 useless extension candidates. Maximal degree in co-relation 215. Up to 33 conditions per place. [2020-10-16 01:26:31,355 INFO L132 encePairwiseOnDemand]: 168/175 looper letters, 10 selfloop transitions, 9 changer transitions 5/38 dead transitions. [2020-10-16 01:26:31,355 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 38 transitions, 182 flow [2020-10-16 01:26:31,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 01:26:31,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 01:26:31,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 899 transitions. [2020-10-16 01:26:31,359 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7338775510204082 [2020-10-16 01:26:31,359 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 899 transitions. [2020-10-16 01:26:31,359 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 899 transitions. [2020-10-16 01:26:31,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:26:31,360 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 899 transitions. [2020-10-16 01:26:31,362 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 01:26:31,365 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 01:26:31,365 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 01:26:31,365 INFO L185 Difference]: Start difference. First operand has 39 places, 26 transitions, 92 flow. Second operand 7 states and 899 transitions. [2020-10-16 01:26:31,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 38 transitions, 182 flow [2020-10-16 01:26:31,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 38 transitions, 180 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-16 01:26:31,371 INFO L241 Difference]: Finished difference. Result has 45 places, 30 transitions, 140 flow [2020-10-16 01:26:31,371 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=140, PETRI_PLACES=45, PETRI_TRANSITIONS=30} [2020-10-16 01:26:31,371 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 11 predicate places. [2020-10-16 01:26:31,372 INFO L481 AbstractCegarLoop]: Abstraction has has 45 places, 30 transitions, 140 flow [2020-10-16 01:26:31,372 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 01:26:31,372 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:26:31,372 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:26:31,372 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 01:26:31,372 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:26:31,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:26:31,373 INFO L82 PathProgramCache]: Analyzing trace with hash 6679119, now seen corresponding path program 1 times [2020-10-16 01:26:31,373 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:26:31,373 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895660983] [2020-10-16 01:26:31,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:26:31,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:26:31,499 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:26:31,500 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895660983] [2020-10-16 01:26:31,500 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:26:31,500 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:26:31,501 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755153373] [2020-10-16 01:26:31,501 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:26:31,501 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:26:31,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:26:31,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:26:31,503 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 175 [2020-10-16 01:26:31,504 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 30 transitions, 140 flow. Second operand 4 states. [2020-10-16 01:26:31,504 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:26:31,504 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 175 [2020-10-16 01:26:31,504 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:26:31,608 INFO L129 PetriNetUnfolder]: 56/165 cut-off events. [2020-10-16 01:26:31,608 INFO L130 PetriNetUnfolder]: For 140/152 co-relation queries the response was YES. [2020-10-16 01:26:31,610 INFO L80 FinitePrefix]: Finished finitePrefix Result has 440 conditions, 165 events. 56/165 cut-off events. For 140/152 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 844 event pairs, 18 based on Foata normal form. 16/167 useless extension candidates. Maximal degree in co-relation 422. Up to 78 conditions per place. [2020-10-16 01:26:31,614 INFO L132 encePairwiseOnDemand]: 169/175 looper letters, 8 selfloop transitions, 8 changer transitions 0/40 dead transitions. [2020-10-16 01:26:31,614 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 40 transitions, 192 flow [2020-10-16 01:26:31,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:26:31,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:26:31,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 723 transitions. [2020-10-16 01:26:31,618 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8262857142857143 [2020-10-16 01:26:31,618 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 723 transitions. [2020-10-16 01:26:31,618 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 723 transitions. [2020-10-16 01:26:31,619 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:26:31,619 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 723 transitions. [2020-10-16 01:26:31,621 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:26:31,623 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:26:31,623 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:26:31,623 INFO L185 Difference]: Start difference. First operand has 45 places, 30 transitions, 140 flow. Second operand 5 states and 723 transitions. [2020-10-16 01:26:31,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 40 transitions, 192 flow [2020-10-16 01:26:31,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 40 transitions, 178 flow, removed 7 selfloop flow, removed 2 redundant places. [2020-10-16 01:26:31,632 INFO L241 Difference]: Finished difference. Result has 48 places, 37 transitions, 186 flow [2020-10-16 01:26:31,633 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=186, PETRI_PLACES=48, PETRI_TRANSITIONS=37} [2020-10-16 01:26:31,633 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 14 predicate places. [2020-10-16 01:26:31,633 INFO L481 AbstractCegarLoop]: Abstraction has has 48 places, 37 transitions, 186 flow [2020-10-16 01:26:31,633 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:26:31,633 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:26:31,634 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:26:31,634 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 01:26:31,634 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:26:31,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:26:31,635 INFO L82 PathProgramCache]: Analyzing trace with hash -451538249, now seen corresponding path program 1 times [2020-10-16 01:26:31,635 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:26:31,635 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572477861] [2020-10-16 01:26:31,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:26:31,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:26:31,724 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:26:31,725 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572477861] [2020-10-16 01:26:31,725 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:26:31,725 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:26:31,726 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991219804] [2020-10-16 01:26:31,726 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:26:31,726 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:26:31,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:26:31,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:26:31,729 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 175 [2020-10-16 01:26:31,733 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 37 transitions, 186 flow. Second operand 5 states. [2020-10-16 01:26:31,733 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:26:31,733 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 175 [2020-10-16 01:26:31,733 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:26:31,819 INFO L129 PetriNetUnfolder]: 36/128 cut-off events. [2020-10-16 01:26:31,819 INFO L130 PetriNetUnfolder]: For 166/326 co-relation queries the response was YES. [2020-10-16 01:26:31,820 INFO L80 FinitePrefix]: Finished finitePrefix Result has 446 conditions, 128 events. 36/128 cut-off events. For 166/326 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 589 event pairs, 2 based on Foata normal form. 52/173 useless extension candidates. Maximal degree in co-relation 425. Up to 72 conditions per place. [2020-10-16 01:26:31,822 INFO L132 encePairwiseOnDemand]: 169/175 looper letters, 5 selfloop transitions, 15 changer transitions 3/47 dead transitions. [2020-10-16 01:26:31,822 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 47 transitions, 290 flow [2020-10-16 01:26:31,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 01:26:31,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 01:26:31,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1012 transitions. [2020-10-16 01:26:31,827 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8261224489795919 [2020-10-16 01:26:31,827 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1012 transitions. [2020-10-16 01:26:31,827 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1012 transitions. [2020-10-16 01:26:31,828 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:26:31,828 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1012 transitions. [2020-10-16 01:26:31,831 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 01:26:31,834 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 01:26:31,834 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 01:26:31,834 INFO L185 Difference]: Start difference. First operand has 48 places, 37 transitions, 186 flow. Second operand 7 states and 1012 transitions. [2020-10-16 01:26:31,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 47 transitions, 290 flow [2020-10-16 01:26:31,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 47 transitions, 286 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 01:26:31,839 INFO L241 Difference]: Finished difference. Result has 56 places, 44 transitions, 281 flow [2020-10-16 01:26:31,840 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=281, PETRI_PLACES=56, PETRI_TRANSITIONS=44} [2020-10-16 01:26:31,840 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 22 predicate places. [2020-10-16 01:26:31,840 INFO L481 AbstractCegarLoop]: Abstraction has has 56 places, 44 transitions, 281 flow [2020-10-16 01:26:31,840 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:26:31,840 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:26:31,841 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:26:31,841 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 01:26:31,841 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:26:31,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:26:31,841 INFO L82 PathProgramCache]: Analyzing trace with hash -996447001, now seen corresponding path program 1 times [2020-10-16 01:26:31,842 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:26:31,842 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590358667] [2020-10-16 01:26:31,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:26:31,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:26:31,959 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:26:31,959 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590358667] [2020-10-16 01:26:31,959 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:26:31,960 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 01:26:31,960 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657618638] [2020-10-16 01:26:31,960 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 01:26:31,961 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:26:31,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 01:26:31,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 01:26:31,963 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 175 [2020-10-16 01:26:31,964 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 281 flow. Second operand 6 states. [2020-10-16 01:26:31,964 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:26:31,965 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 175 [2020-10-16 01:26:31,965 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:26:32,098 INFO L129 PetriNetUnfolder]: 26/99 cut-off events. [2020-10-16 01:26:32,098 INFO L130 PetriNetUnfolder]: For 493/880 co-relation queries the response was YES. [2020-10-16 01:26:32,099 INFO L80 FinitePrefix]: Finished finitePrefix Result has 460 conditions, 99 events. 26/99 cut-off events. For 493/880 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 415 event pairs, 0 based on Foata normal form. 70/162 useless extension candidates. Maximal degree in co-relation 439. Up to 63 conditions per place. [2020-10-16 01:26:32,100 INFO L132 encePairwiseOnDemand]: 169/175 looper letters, 2 selfloop transitions, 19 changer transitions 3/48 dead transitions. [2020-10-16 01:26:32,100 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 48 transitions, 359 flow [2020-10-16 01:26:32,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 01:26:32,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-16 01:26:32,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1295 transitions. [2020-10-16 01:26:32,105 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8222222222222222 [2020-10-16 01:26:32,105 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1295 transitions. [2020-10-16 01:26:32,105 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1295 transitions. [2020-10-16 01:26:32,106 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:26:32,106 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1295 transitions. [2020-10-16 01:26:32,109 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-16 01:26:32,112 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-16 01:26:32,112 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-16 01:26:32,112 INFO L185 Difference]: Start difference. First operand has 56 places, 44 transitions, 281 flow. Second operand 9 states and 1295 transitions. [2020-10-16 01:26:32,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 48 transitions, 359 flow [2020-10-16 01:26:32,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 48 transitions, 314 flow, removed 17 selfloop flow, removed 4 redundant places. [2020-10-16 01:26:32,116 INFO L241 Difference]: Finished difference. Result has 63 places, 45 transitions, 297 flow [2020-10-16 01:26:32,116 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=297, PETRI_PLACES=63, PETRI_TRANSITIONS=45} [2020-10-16 01:26:32,117 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 29 predicate places. [2020-10-16 01:26:32,117 INFO L481 AbstractCegarLoop]: Abstraction has has 63 places, 45 transitions, 297 flow [2020-10-16 01:26:32,117 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 01:26:32,117 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:26:32,117 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] [2020-10-16 01:26:32,117 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 01:26:32,118 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:26:32,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:26:32,118 INFO L82 PathProgramCache]: Analyzing trace with hash 757147492, now seen corresponding path program 1 times [2020-10-16 01:26:32,118 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:26:32,118 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884178433] [2020-10-16 01:26:32,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:26:32,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:26:32,279 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:26:32,280 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884178433] [2020-10-16 01:26:32,280 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:26:32,280 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-16 01:26:32,280 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033212162] [2020-10-16 01:26:32,281 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-16 01:26:32,281 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:26:32,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-16 01:26:32,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-10-16 01:26:32,283 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 175 [2020-10-16 01:26:32,284 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 45 transitions, 297 flow. Second operand 10 states. [2020-10-16 01:26:32,284 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:26:32,285 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 175 [2020-10-16 01:26:32,285 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:26:32,653 INFO L129 PetriNetUnfolder]: 136/429 cut-off events. [2020-10-16 01:26:32,653 INFO L130 PetriNetUnfolder]: For 1343/1399 co-relation queries the response was YES. [2020-10-16 01:26:32,657 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1750 conditions, 429 events. 136/429 cut-off events. For 1343/1399 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 3175 event pairs, 14 based on Foata normal form. 25/439 useless extension candidates. Maximal degree in co-relation 1723. Up to 125 conditions per place. [2020-10-16 01:26:32,659 INFO L132 encePairwiseOnDemand]: 167/175 looper letters, 21 selfloop transitions, 25 changer transitions 23/90 dead transitions. [2020-10-16 01:26:32,659 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 90 transitions, 796 flow [2020-10-16 01:26:32,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-16 01:26:32,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-10-16 01:26:32,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1869 transitions. [2020-10-16 01:26:32,666 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7628571428571429 [2020-10-16 01:26:32,666 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1869 transitions. [2020-10-16 01:26:32,666 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1869 transitions. [2020-10-16 01:26:32,668 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:26:32,668 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1869 transitions. [2020-10-16 01:26:32,672 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 15 states. [2020-10-16 01:26:32,676 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 15 states. [2020-10-16 01:26:32,677 INFO L81 ComplementDD]: Finished complementDD. Result 15 states. [2020-10-16 01:26:32,677 INFO L185 Difference]: Start difference. First operand has 63 places, 45 transitions, 297 flow. Second operand 14 states and 1869 transitions. [2020-10-16 01:26:32,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 90 transitions, 796 flow [2020-10-16 01:26:32,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 90 transitions, 623 flow, removed 40 selfloop flow, removed 8 redundant places. [2020-10-16 01:26:32,694 INFO L241 Difference]: Finished difference. Result has 78 places, 61 transitions, 457 flow [2020-10-16 01:26:32,694 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=457, PETRI_PLACES=78, PETRI_TRANSITIONS=61} [2020-10-16 01:26:32,695 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 44 predicate places. [2020-10-16 01:26:32,695 INFO L481 AbstractCegarLoop]: Abstraction has has 78 places, 61 transitions, 457 flow [2020-10-16 01:26:32,695 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-16 01:26:32,695 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:26:32,695 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] [2020-10-16 01:26:32,695 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 01:26:32,697 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:26:32,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:26:32,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1073968750, now seen corresponding path program 2 times [2020-10-16 01:26:32,697 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:26:32,698 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239463542] [2020-10-16 01:26:32,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:26:32,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:26:32,833 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:26:32,834 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239463542] [2020-10-16 01:26:32,834 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:26:32,834 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 01:26:32,834 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10366096] [2020-10-16 01:26:32,835 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 01:26:32,836 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:26:32,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 01:26:32,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-16 01:26:32,838 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 175 [2020-10-16 01:26:32,840 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 61 transitions, 457 flow. Second operand 7 states. [2020-10-16 01:26:32,840 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:26:32,840 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 175 [2020-10-16 01:26:32,840 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:26:33,021 INFO L129 PetriNetUnfolder]: 143/574 cut-off events. [2020-10-16 01:26:33,021 INFO L130 PetriNetUnfolder]: For 1871/1977 co-relation queries the response was YES. [2020-10-16 01:26:33,029 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2310 conditions, 574 events. 143/574 cut-off events. For 1871/1977 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 4896 event pairs, 13 based on Foata normal form. 45/589 useless extension candidates. Maximal degree in co-relation 2276. Up to 189 conditions per place. [2020-10-16 01:26:33,031 INFO L132 encePairwiseOnDemand]: 169/175 looper letters, 9 selfloop transitions, 3 changer transitions 11/69 dead transitions. [2020-10-16 01:26:33,031 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 69 transitions, 542 flow [2020-10-16 01:26:33,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 01:26:33,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 01:26:33,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 919 transitions. [2020-10-16 01:26:33,035 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7502040816326531 [2020-10-16 01:26:33,035 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 919 transitions. [2020-10-16 01:26:33,035 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 919 transitions. [2020-10-16 01:26:33,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:26:33,036 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 919 transitions. [2020-10-16 01:26:33,038 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 01:26:33,040 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 01:26:33,041 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 01:26:33,041 INFO L185 Difference]: Start difference. First operand has 78 places, 61 transitions, 457 flow. Second operand 7 states and 919 transitions. [2020-10-16 01:26:33,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 69 transitions, 542 flow [2020-10-16 01:26:33,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 69 transitions, 506 flow, removed 14 selfloop flow, removed 7 redundant places. [2020-10-16 01:26:33,055 INFO L241 Difference]: Finished difference. Result has 75 places, 54 transitions, 393 flow [2020-10-16 01:26:33,056 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=433, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=393, PETRI_PLACES=75, PETRI_TRANSITIONS=54} [2020-10-16 01:26:33,056 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 41 predicate places. [2020-10-16 01:26:33,056 INFO L481 AbstractCegarLoop]: Abstraction has has 75 places, 54 transitions, 393 flow [2020-10-16 01:26:33,056 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 01:26:33,056 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:26:33,057 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] [2020-10-16 01:26:33,057 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 01:26:33,057 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:26:33,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:26:33,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1856200726, now seen corresponding path program 3 times [2020-10-16 01:26:33,058 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:26:33,058 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576684913] [2020-10-16 01:26:33,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:26:33,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 01:26:33,089 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 01:26:33,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 01:26:33,118 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 01:26:33,153 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 01:26:33,153 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 01:26:33,153 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 01:26:33,171 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:26:33,172 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:26:33,173 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:26:33,174 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:26:33,174 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:26:33,174 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:26:33,174 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:26:33,174 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:26:33,175 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:26:33,175 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:26:33,175 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:26:33,175 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:26:33,176 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:26:33,176 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:26:33,176 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:26:33,176 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:26:33,176 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:26:33,177 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:26:33,177 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:26:33,177 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:26:33,177 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:26:33,177 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:26:33,177 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:26:33,178 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:26:33,178 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:26:33,179 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:26:33,179 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:26:33,179 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:26:33,179 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:26:33,179 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:26:33,179 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:26:33,179 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:26:33,180 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:26:33,180 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:26:33,180 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:26:33,180 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:26:33,180 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:26:33,181 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:26:33,181 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:26:33,181 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:26:33,181 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:26:33,181 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:26:33,182 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:26:33,182 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:26:33,182 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:26:33,182 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:26:33,182 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:26:33,182 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:26:33,183 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:26:33,183 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:26:33,183 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:26:33,183 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:26:33,183 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:26:33,183 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:26:33,184 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:26:33,184 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:26:33,184 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:26:33,184 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:26:33,255 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 01:26:33 BasicIcfg [2020-10-16 01:26:33,255 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 01:26:33,260 INFO L168 Benchmark]: Toolchain (without parser) took 12334.01 ms. Allocated memory was 249.6 MB in the beginning and 499.6 MB in the end (delta: 250.1 MB). Free memory was 204.3 MB in the beginning and 238.6 MB in the end (delta: -34.3 MB). Peak memory consumption was 215.8 MB. Max. memory is 14.2 GB. [2020-10-16 01:26:33,261 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 249.6 MB. Free memory is still 225.9 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-16 01:26:33,264 INFO L168 Benchmark]: CACSL2BoogieTranslator took 755.45 ms. Allocated memory was 249.6 MB in the beginning and 309.9 MB in the end (delta: 60.3 MB). Free memory was 204.3 MB in the beginning and 260.1 MB in the end (delta: -55.8 MB). Peak memory consumption was 30.6 MB. Max. memory is 14.2 GB. [2020-10-16 01:26:33,265 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.41 ms. Allocated memory is still 309.9 MB. Free memory was 260.1 MB in the beginning and 257.6 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:26:33,266 INFO L168 Benchmark]: Boogie Preprocessor took 43.15 ms. Allocated memory is still 309.9 MB. Free memory was 257.6 MB in the beginning and 255.1 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:26:33,267 INFO L168 Benchmark]: RCFGBuilder took 2018.30 ms. Allocated memory was 309.9 MB in the beginning and 356.0 MB in the end (delta: 46.1 MB). Free memory was 255.1 MB in the beginning and 206.6 MB in the end (delta: 48.5 MB). Peak memory consumption was 99.5 MB. Max. memory is 14.2 GB. [2020-10-16 01:26:33,269 INFO L168 Benchmark]: TraceAbstraction took 9441.24 ms. Allocated memory was 356.0 MB in the beginning and 499.6 MB in the end (delta: 143.7 MB). Free memory was 206.6 MB in the beginning and 238.6 MB in the end (delta: -32.0 MB). Peak memory consumption was 111.7 MB. Max. memory is 14.2 GB. [2020-10-16 01:26:33,274 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.22 ms. Allocated memory is still 249.6 MB. Free memory is still 225.9 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 755.45 ms. Allocated memory was 249.6 MB in the beginning and 309.9 MB in the end (delta: 60.3 MB). Free memory was 204.3 MB in the beginning and 260.1 MB in the end (delta: -55.8 MB). Peak memory consumption was 30.6 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 67.41 ms. Allocated memory is still 309.9 MB. Free memory was 260.1 MB in the beginning and 257.6 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 43.15 ms. Allocated memory is still 309.9 MB. Free memory was 257.6 MB in the beginning and 255.1 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 2018.30 ms. Allocated memory was 309.9 MB in the beginning and 356.0 MB in the end (delta: 46.1 MB). Free memory was 255.1 MB in the beginning and 206.6 MB in the end (delta: 48.5 MB). Peak memory consumption was 99.5 MB. Max. memory is 14.2 GB. * TraceAbstraction took 9441.24 ms. Allocated memory was 356.0 MB in the beginning and 499.6 MB in the end (delta: 143.7 MB). Free memory was 206.6 MB in the beginning and 238.6 MB in the end (delta: -32.0 MB). Peak memory consumption was 111.7 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1107 VarBasedMoverChecksPositive, 62 VarBasedMoverChecksNegative, 22 SemBasedMoverChecksPositive, 40 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.8s, 147 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 5.5s, 101 PlacesBefore, 34 PlacesAfterwards, 93 TransitionsBefore, 25 TransitionsAfterwards, 1692 CoEnabledTransitionPairs, 7 FixpointIterations, 34 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 79 TotalNumberOfCompositions, 4575 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L698] 0 int __unbuffered_cnt = 0; [L700] 0 int __unbuffered_p0_EAX = 0; [L702] 0 int __unbuffered_p2_EAX = 0; [L704] 0 int __unbuffered_p2_EBX = 0; [L706] 0 int a = 0; [L707] 0 _Bool main$tmp_guard0; [L708] 0 _Bool main$tmp_guard1; [L710] 0 int x = 0; [L712] 0 int y = 0; [L713] 0 _Bool y$flush_delayed; [L714] 0 int y$mem_tmp; [L715] 0 _Bool y$r_buff0_thd0; [L716] 0 _Bool y$r_buff0_thd1; [L717] 0 _Bool y$r_buff0_thd2; [L718] 0 _Bool y$r_buff0_thd3; [L719] 0 _Bool y$r_buff1_thd0; [L720] 0 _Bool y$r_buff1_thd1; [L721] 0 _Bool y$r_buff1_thd2; [L722] 0 _Bool y$r_buff1_thd3; [L723] 0 _Bool y$read_delayed; [L724] 0 int *y$read_delayed_var; [L725] 0 int y$w_buff0; [L726] 0 _Bool y$w_buff0_used; [L727] 0 int y$w_buff1; [L728] 0 _Bool y$w_buff1_used; [L730] 0 int z = 0; [L731] 0 _Bool weak$$choice0; [L732] 0 _Bool weak$$choice2; [L814] 0 pthread_t t1114; [L815] FCALL, FORK 0 pthread_create(&t1114, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L816] 0 pthread_t t1115; [L817] FCALL, FORK 0 pthread_create(&t1115, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L818] 0 pthread_t t1116; [L819] FCALL, FORK 0 pthread_create(&t1116, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L771] 3 y$w_buff1 = y$w_buff0 [L772] 3 y$w_buff0 = 2 [L773] 3 y$w_buff1_used = y$w_buff0_used [L774] 3 y$w_buff0_used = (_Bool)1 [L7] COND TRUE 3 !expression [L7] 3 __VERIFIER_error() [L776] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L777] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L778] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L779] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L780] 3 y$r_buff0_thd3 = (_Bool)1 [L783] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L786] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L789] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L736] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L739] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L744] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L746] 1 return 0; [L751] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L754] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L757] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L757] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L758] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L758] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L759] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L759] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L760] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L760] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L761] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L761] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L764] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L766] 2 return 0; [L792] 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) [L792] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L792] 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) [L792] 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) [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L794] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L794] 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 [L795] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L795] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L796] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L796] 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 [L799] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 3 return 0; [L821] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L825] 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) [L825] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L825] 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) [L825] 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) [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L827] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L827] 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 [L828] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L828] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L829] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L829] 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 [L832] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L833] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L834] 0 y$flush_delayed = weak$$choice2 [L835] 0 y$mem_tmp = y [L836] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L836] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L837] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L837] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L838] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L838] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L839] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L839] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L839] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L839] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L840] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L841] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L841] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L841] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L841] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L842] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L842] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L843] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L844] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L844] 0 y = y$flush_delayed ? y$mem_tmp : y [L845] 0 y$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 95 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 9.2s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.5s, HoareTripleCheckerStatistics: 45 SDtfs, 54 SDslu, 60 SDs, 0 SdLazy, 480 SolverSat, 89 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=457occurred 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.9s InterpolantComputationTime, 167 NumberOfCodeBlocks, 167 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 135 ConstructedInterpolants, 0 QuantifiedInterpolants, 13845 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...