/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/VMCAI2021_PN.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix028_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-11af1e5 [2020-10-11 18:16:13,663 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-11 18:16:13,666 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-11 18:16:13,695 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-11 18:16:13,695 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-11 18:16:13,703 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-11 18:16:13,705 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-11 18:16:13,710 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-11 18:16:13,713 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-11 18:16:13,716 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-11 18:16:13,717 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-11 18:16:13,718 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-11 18:16:13,718 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-11 18:16:13,721 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-11 18:16:13,723 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-11 18:16:13,725 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-11 18:16:13,726 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-11 18:16:13,728 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-11 18:16:13,730 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-11 18:16:13,738 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-11 18:16:13,740 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-11 18:16:13,741 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-11 18:16:13,742 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-11 18:16:13,742 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-11 18:16:13,755 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-11 18:16:13,757 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-11 18:16:13,757 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-11 18:16:13,758 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-11 18:16:13,759 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-11 18:16:13,759 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-11 18:16:13,760 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-11 18:16:13,764 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-11 18:16:13,765 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-11 18:16:13,766 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-11 18:16:13,769 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-11 18:16:13,769 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-11 18:16:13,770 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-11 18:16:13,770 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-11 18:16:13,771 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-11 18:16:13,774 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-11 18:16:13,775 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-11 18:16:13,777 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/VMCAI2021_PN.epf [2020-10-11 18:16:13,823 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-11 18:16:13,824 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-11 18:16:13,825 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-11 18:16:13,825 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-11 18:16:13,825 INFO L138 SettingsManager]: * Use SBE=true [2020-10-11 18:16:13,826 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-11 18:16:13,826 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-11 18:16:13,826 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-11 18:16:13,827 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-11 18:16:13,827 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-11 18:16:13,827 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-11 18:16:13,827 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-11 18:16:13,827 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-11 18:16:13,828 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-11 18:16:13,828 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-11 18:16:13,829 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-11 18:16:13,829 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-11 18:16:13,830 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-11 18:16:13,830 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-11 18:16:13,830 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-11 18:16:13,830 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-11 18:16:13,830 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-11 18:16:13,831 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-11 18:16:13,831 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-11 18:16:13,831 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-11 18:16:13,831 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-11 18:16:13,832 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-11 18:16:13,832 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2020-10-11 18:16:13,832 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-11 18:16:13,832 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-11 18:16:14,147 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-11 18:16:14,158 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-11 18:16:14,163 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-11 18:16:14,165 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-11 18:16:14,165 INFO L275 PluginConnector]: CDTParser initialized [2020-10-11 18:16:14,166 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix028_rmo.opt.i [2020-10-11 18:16:14,223 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccf267455/262491d658e0480db085786909479182/FLAGffe26114a [2020-10-11 18:16:14,804 INFO L306 CDTParser]: Found 1 translation units. [2020-10-11 18:16:14,805 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix028_rmo.opt.i [2020-10-11 18:16:14,818 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccf267455/262491d658e0480db085786909479182/FLAGffe26114a [2020-10-11 18:16:15,072 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccf267455/262491d658e0480db085786909479182 [2020-10-11 18:16:15,081 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-11 18:16:15,083 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-11 18:16:15,085 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-11 18:16:15,085 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-11 18:16:15,089 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-11 18:16:15,090 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:16:15" (1/1) ... [2020-10-11 18:16:15,093 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d3d4802 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:16:15, skipping insertion in model container [2020-10-11 18:16:15,093 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:16:15" (1/1) ... [2020-10-11 18:16:15,101 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-11 18:16:15,143 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-11 18:16:15,610 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 18:16:15,627 INFO L203 MainTranslator]: Completed pre-run [2020-10-11 18:16:15,725 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 18:16:15,806 INFO L208 MainTranslator]: Completed translation [2020-10-11 18:16:15,806 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:16:15 WrapperNode [2020-10-11 18:16:15,807 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-11 18:16:15,807 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-11 18:16:15,808 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-11 18:16:15,808 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-11 18:16:15,817 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:16:15" (1/1) ... [2020-10-11 18:16:15,837 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:16:15" (1/1) ... [2020-10-11 18:16:15,875 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-11 18:16:15,876 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-11 18:16:15,876 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-11 18:16:15,876 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-11 18:16:15,884 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:16:15" (1/1) ... [2020-10-11 18:16:15,884 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:16:15" (1/1) ... [2020-10-11 18:16:15,889 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:16:15" (1/1) ... [2020-10-11 18:16:15,890 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:16:15" (1/1) ... [2020-10-11 18:16:15,900 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:16:15" (1/1) ... [2020-10-11 18:16:15,905 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:16:15" (1/1) ... [2020-10-11 18:16:15,909 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:16:15" (1/1) ... [2020-10-11 18:16:15,914 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-11 18:16:15,915 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-11 18:16:15,915 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-11 18:16:15,915 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-11 18:16:15,916 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:16:15" (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-11 18:16:15,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-11 18:16:15,983 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-11 18:16:15,983 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-11 18:16:15,983 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-11 18:16:15,983 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-11 18:16:15,984 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-11 18:16:15,984 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-11 18:16:15,985 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-11 18:16:15,985 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-11 18:16:15,986 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-11 18:16:15,986 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-11 18:16:15,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-11 18:16:15,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-11 18:16:15,988 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-11 18:16:17,989 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-11 18:16:17,989 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-11 18:16:17,991 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:16:17 BoogieIcfgContainer [2020-10-11 18:16:17,992 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-11 18:16:17,993 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-11 18:16:17,993 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-11 18:16:17,996 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-11 18:16:17,997 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 06:16:15" (1/3) ... [2020-10-11 18:16:17,997 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@162129d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:16:17, skipping insertion in model container [2020-10-11 18:16:17,998 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:16:15" (2/3) ... [2020-10-11 18:16:17,998 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@162129d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:16:17, skipping insertion in model container [2020-10-11 18:16:17,998 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:16:17" (3/3) ... [2020-10-11 18:16:18,000 INFO L111 eAbstractionObserver]: Analyzing ICFG mix028_rmo.opt.i [2020-10-11 18:16:18,011 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-11 18:16:18,018 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-11 18:16:18,019 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-11 18:16:18,049 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:18,049 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:18,050 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:18,050 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:18,051 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:18,051 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:18,051 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:18,051 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:18,051 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:18,052 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:18,052 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:18,052 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:18,053 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:18,053 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:18,054 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:18,054 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:18,054 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:18,054 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:18,055 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:18,055 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:18,055 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:18,055 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:18,056 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:18,056 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:18,056 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:18,057 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:18,057 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:18,057 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:18,057 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:18,058 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:18,058 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:18,058 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:18,059 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:18,059 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:18,059 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:18,059 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:18,059 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:18,060 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:18,060 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:18,060 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:18,060 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:18,061 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:18,061 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:18,065 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:18,065 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:18,066 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:18,066 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:18,066 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:18,066 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:18,066 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:18,067 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:18,067 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:18,067 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:18,072 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:18,073 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:18,073 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:18,073 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:18,073 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:18,073 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:18,074 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:18,074 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:18,074 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:18,074 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:18,076 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:18,076 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:18,076 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:18,077 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:18,077 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:18,077 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:18,077 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:18,078 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:18,078 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:18,078 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:18,078 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:18,079 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:16:18,095 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-11 18:16:18,116 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-11 18:16:18,117 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-11 18:16:18,117 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-11 18:16:18,117 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-11 18:16:18,117 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-11 18:16:18,117 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-11 18:16:18,118 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-11 18:16:18,118 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-11 18:16:18,132 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 102 places, 94 transitions, 203 flow [2020-10-11 18:16:18,183 INFO L129 PetriNetUnfolder]: 2/91 cut-off events. [2020-10-11 18:16:18,183 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:16:18,189 INFO L80 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 91 events. 2/91 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/87 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2020-10-11 18:16:18,190 INFO L82 GeneralOperation]: Start removeDead. Operand has 102 places, 94 transitions, 203 flow [2020-10-11 18:16:18,197 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 99 places, 91 transitions, 191 flow [2020-10-11 18:16:18,244 INFO L129 PetriNetUnfolder]: 0/46 cut-off events. [2020-10-11 18:16:18,245 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:16:18,246 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:16:18,247 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:16:18,248 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:16:18,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:16:18,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1570082113, now seen corresponding path program 1 times [2020-10-11 18:16:18,271 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:16:18,271 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176428814] [2020-10-11 18:16:18,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:16:18,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:16:18,638 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-11 18:16:18,638 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176428814] [2020-10-11 18:16:18,639 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:16:18,640 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-11 18:16:18,641 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404917708] [2020-10-11 18:16:18,651 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-11 18:16:18,652 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:16:18,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-11 18:16:18,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 18:16:18,777 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 94 [2020-10-11 18:16:18,779 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 191 flow. Second operand 3 states. [2020-10-11 18:16:18,779 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:16:18,779 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 94 [2020-10-11 18:16:18,781 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:16:18,813 INFO L129 PetriNetUnfolder]: 0/88 cut-off events. [2020-10-11 18:16:18,813 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:16:18,814 INFO L80 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 88 events. 0/88 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 61 event pairs, 0 based on Foata normal form. 4/90 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2020-10-11 18:16:18,816 INFO L132 encePairwiseOnDemand]: 89/94 looper letters, 0 selfloop transitions, 2 changer transitions 11/88 dead transitions. [2020-10-11 18:16:18,816 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 88 transitions, 189 flow [2020-10-11 18:16:18,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-11 18:16:18,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-11 18:16:18,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 274 transitions. [2020-10-11 18:16:18,834 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9716312056737588 [2020-10-11 18:16:18,835 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 274 transitions. [2020-10-11 18:16:18,836 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 274 transitions. [2020-10-11 18:16:18,838 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:16:18,841 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 274 transitions. [2020-10-11 18:16:18,846 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-11 18:16:18,852 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-11 18:16:18,853 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-11 18:16:18,855 INFO L185 Difference]: Start difference. First operand has 99 places, 91 transitions, 191 flow. Second operand 3 states and 274 transitions. [2020-10-11 18:16:18,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 88 transitions, 189 flow [2020-10-11 18:16:18,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 88 transitions, 186 flow, removed 0 selfloop flow, removed 3 redundant places. [2020-10-11 18:16:18,865 INFO L241 Difference]: Finished difference. Result has 97 places, 77 transitions, 164 flow [2020-10-11 18:16:18,869 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=164, PETRI_PLACES=97, PETRI_TRANSITIONS=77} [2020-10-11 18:16:18,870 INFO L341 CegarLoopForPetriNet]: 99 programPoint places, -2 predicate places. [2020-10-11 18:16:18,870 INFO L481 AbstractCegarLoop]: Abstraction has has 97 places, 77 transitions, 164 flow [2020-10-11 18:16:18,870 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-11 18:16:18,870 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:16:18,870 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:16:18,871 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-11 18:16:18,871 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:16:18,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:16:18,871 INFO L82 PathProgramCache]: Analyzing trace with hash -647770408, now seen corresponding path program 1 times [2020-10-11 18:16:18,872 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:16:18,872 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846145448] [2020-10-11 18:16:18,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:16:18,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:16:19,289 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-11 18:16:19,290 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846145448] [2020-10-11 18:16:19,290 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:16:19,290 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-11 18:16:19,291 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983364721] [2020-10-11 18:16:19,293 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 18:16:19,293 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:16:19,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 18:16:19,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-10-11 18:16:19,833 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 94 [2020-10-11 18:16:19,833 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 77 transitions, 164 flow. Second operand 11 states. [2020-10-11 18:16:19,834 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:16:19,834 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 94 [2020-10-11 18:16:19,834 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:16:20,619 INFO L129 PetriNetUnfolder]: 302/665 cut-off events. [2020-10-11 18:16:20,619 INFO L130 PetriNetUnfolder]: For 57/57 co-relation queries the response was YES. [2020-10-11 18:16:20,628 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1227 conditions, 665 events. 302/665 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 3988 event pairs, 81 based on Foata normal form. 19/669 useless extension candidates. Maximal degree in co-relation 1181. Up to 281 conditions per place. [2020-10-11 18:16:20,636 INFO L132 encePairwiseOnDemand]: 81/94 looper letters, 15 selfloop transitions, 10 changer transitions 44/129 dead transitions. [2020-10-11 18:16:20,637 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 129 transitions, 420 flow [2020-10-11 18:16:20,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-11 18:16:20,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-10-11 18:16:20,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1256 transitions. [2020-10-11 18:16:20,648 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8351063829787234 [2020-10-11 18:16:20,649 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1256 transitions. [2020-10-11 18:16:20,649 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1256 transitions. [2020-10-11 18:16:20,650 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:16:20,650 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1256 transitions. [2020-10-11 18:16:20,656 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 17 states. [2020-10-11 18:16:20,664 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 17 states. [2020-10-11 18:16:20,664 INFO L81 ComplementDD]: Finished complementDD. Result 17 states. [2020-10-11 18:16:20,664 INFO L185 Difference]: Start difference. First operand has 97 places, 77 transitions, 164 flow. Second operand 16 states and 1256 transitions. [2020-10-11 18:16:20,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 129 transitions, 420 flow [2020-10-11 18:16:20,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 129 transitions, 402 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-11 18:16:20,670 INFO L241 Difference]: Finished difference. Result has 110 places, 82 transitions, 247 flow [2020-10-11 18:16:20,671 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=247, PETRI_PLACES=110, PETRI_TRANSITIONS=82} [2020-10-11 18:16:20,671 INFO L341 CegarLoopForPetriNet]: 99 programPoint places, 11 predicate places. [2020-10-11 18:16:20,672 INFO L481 AbstractCegarLoop]: Abstraction has has 110 places, 82 transitions, 247 flow [2020-10-11 18:16:20,672 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 18:16:20,672 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:16:20,672 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:16:20,672 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-11 18:16:20,673 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:16:20,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:16:20,673 INFO L82 PathProgramCache]: Analyzing trace with hash -1261608509, now seen corresponding path program 1 times [2020-10-11 18:16:20,673 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:16:20,674 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204242991] [2020-10-11 18:16:20,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:16:20,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:16:20,883 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-11 18:16:20,883 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204242991] [2020-10-11 18:16:20,884 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:16:20,884 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:16:20,884 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409804484] [2020-10-11 18:16:20,885 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:16:20,885 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:16:20,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:16:20,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:16:21,046 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 94 [2020-10-11 18:16:21,047 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 82 transitions, 247 flow. Second operand 6 states. [2020-10-11 18:16:21,047 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:16:21,047 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 94 [2020-10-11 18:16:21,048 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:16:21,222 INFO L129 PetriNetUnfolder]: 78/335 cut-off events. [2020-10-11 18:16:21,222 INFO L130 PetriNetUnfolder]: For 702/749 co-relation queries the response was YES. [2020-10-11 18:16:21,224 INFO L80 FinitePrefix]: Finished finitePrefix Result has 947 conditions, 335 events. 78/335 cut-off events. For 702/749 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1757 event pairs, 51 based on Foata normal form. 12/331 useless extension candidates. Maximal degree in co-relation 889. Up to 81 conditions per place. [2020-10-11 18:16:21,227 INFO L132 encePairwiseOnDemand]: 88/94 looper letters, 8 selfloop transitions, 10 changer transitions 0/92 dead transitions. [2020-10-11 18:16:21,227 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 92 transitions, 331 flow [2020-10-11 18:16:21,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:16:21,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:16:21,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 776 transitions. [2020-10-11 18:16:21,231 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.91725768321513 [2020-10-11 18:16:21,231 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 776 transitions. [2020-10-11 18:16:21,231 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 776 transitions. [2020-10-11 18:16:21,232 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:16:21,232 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 776 transitions. [2020-10-11 18:16:21,234 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:16:21,236 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:16:21,236 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:16:21,236 INFO L185 Difference]: Start difference. First operand has 110 places, 82 transitions, 247 flow. Second operand 9 states and 776 transitions. [2020-10-11 18:16:21,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 92 transitions, 331 flow [2020-10-11 18:16:21,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 92 transitions, 311 flow, removed 7 selfloop flow, removed 6 redundant places. [2020-10-11 18:16:21,243 INFO L241 Difference]: Finished difference. Result has 106 places, 90 transitions, 308 flow [2020-10-11 18:16:21,244 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=235, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=308, PETRI_PLACES=106, PETRI_TRANSITIONS=90} [2020-10-11 18:16:21,244 INFO L341 CegarLoopForPetriNet]: 99 programPoint places, 7 predicate places. [2020-10-11 18:16:21,244 INFO L481 AbstractCegarLoop]: Abstraction has has 106 places, 90 transitions, 308 flow [2020-10-11 18:16:21,244 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:16:21,244 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:16:21,245 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:16:21,245 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-11 18:16:21,245 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:16:21,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:16:21,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1957309865, now seen corresponding path program 1 times [2020-10-11 18:16:21,246 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:16:21,246 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943811849] [2020-10-11 18:16:21,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:16:21,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:16:21,532 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-11 18:16:21,533 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943811849] [2020-10-11 18:16:21,533 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:16:21,534 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-11 18:16:21,534 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7218360] [2020-10-11 18:16:21,534 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 18:16:21,535 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:16:21,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 18:16:21,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-10-11 18:16:22,192 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 94 [2020-10-11 18:16:22,193 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 90 transitions, 308 flow. Second operand 9 states. [2020-10-11 18:16:22,193 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:16:22,193 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 94 [2020-10-11 18:16:22,194 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:16:22,849 INFO L129 PetriNetUnfolder]: 424/987 cut-off events. [2020-10-11 18:16:22,849 INFO L130 PetriNetUnfolder]: For 3063/3449 co-relation queries the response was YES. [2020-10-11 18:16:22,854 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3481 conditions, 987 events. 424/987 cut-off events. For 3063/3449 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 6406 event pairs, 67 based on Foata normal form. 18/975 useless extension candidates. Maximal degree in co-relation 3422. Up to 322 conditions per place. [2020-10-11 18:16:22,861 INFO L132 encePairwiseOnDemand]: 84/94 looper letters, 19 selfloop transitions, 8 changer transitions 52/142 dead transitions. [2020-10-11 18:16:22,861 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 142 transitions, 867 flow [2020-10-11 18:16:22,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-11 18:16:22,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-10-11 18:16:22,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 913 transitions. [2020-10-11 18:16:22,865 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8829787234042553 [2020-10-11 18:16:22,865 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 913 transitions. [2020-10-11 18:16:22,866 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 913 transitions. [2020-10-11 18:16:22,867 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:16:22,867 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 913 transitions. [2020-10-11 18:16:22,869 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 12 states. [2020-10-11 18:16:22,872 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 12 states. [2020-10-11 18:16:22,872 INFO L81 ComplementDD]: Finished complementDD. Result 12 states. [2020-10-11 18:16:22,872 INFO L185 Difference]: Start difference. First operand has 106 places, 90 transitions, 308 flow. Second operand 11 states and 913 transitions. [2020-10-11 18:16:22,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 142 transitions, 867 flow [2020-10-11 18:16:22,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 142 transitions, 867 flow, removed 0 selfloop flow, removed 0 redundant places. [2020-10-11 18:16:22,889 INFO L241 Difference]: Finished difference. Result has 123 places, 85 transitions, 333 flow [2020-10-11 18:16:22,890 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=333, PETRI_PLACES=123, PETRI_TRANSITIONS=85} [2020-10-11 18:16:22,890 INFO L341 CegarLoopForPetriNet]: 99 programPoint places, 24 predicate places. [2020-10-11 18:16:22,890 INFO L481 AbstractCegarLoop]: Abstraction has has 123 places, 85 transitions, 333 flow [2020-10-11 18:16:22,891 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 18:16:22,891 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:16:22,891 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:16:22,891 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-11 18:16:22,893 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:16:22,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:16:22,894 INFO L82 PathProgramCache]: Analyzing trace with hash -196002962, now seen corresponding path program 1 times [2020-10-11 18:16:22,894 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:16:22,895 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391588783] [2020-10-11 18:16:22,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:16:23,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:16:23,308 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-11 18:16:23,308 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391588783] [2020-10-11 18:16:23,308 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:16:23,309 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-11 18:16:23,309 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806448093] [2020-10-11 18:16:23,309 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-11 18:16:23,310 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:16:23,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-11 18:16:23,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-10-11 18:16:24,618 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 94 [2020-10-11 18:16:24,619 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 85 transitions, 333 flow. Second operand 12 states. [2020-10-11 18:16:24,619 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:16:24,619 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 94 [2020-10-11 18:16:24,619 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:16:25,199 INFO L129 PetriNetUnfolder]: 154/440 cut-off events. [2020-10-11 18:16:25,199 INFO L130 PetriNetUnfolder]: For 3389/3797 co-relation queries the response was YES. [2020-10-11 18:16:25,203 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2087 conditions, 440 events. 154/440 cut-off events. For 3389/3797 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2190 event pairs, 43 based on Foata normal form. 13/444 useless extension candidates. Maximal degree in co-relation 2016. Up to 203 conditions per place. [2020-10-11 18:16:25,207 INFO L132 encePairwiseOnDemand]: 83/94 looper letters, 25 selfloop transitions, 10 changer transitions 25/121 dead transitions. [2020-10-11 18:16:25,208 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 121 transitions, 887 flow [2020-10-11 18:16:25,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-11 18:16:25,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-10-11 18:16:25,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1255 transitions. [2020-10-11 18:16:25,215 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8344414893617021 [2020-10-11 18:16:25,215 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1255 transitions. [2020-10-11 18:16:25,215 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1255 transitions. [2020-10-11 18:16:25,216 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:16:25,216 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1255 transitions. [2020-10-11 18:16:25,219 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 17 states. [2020-10-11 18:16:25,222 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 17 states. [2020-10-11 18:16:25,223 INFO L81 ComplementDD]: Finished complementDD. Result 17 states. [2020-10-11 18:16:25,223 INFO L185 Difference]: Start difference. First operand has 123 places, 85 transitions, 333 flow. Second operand 16 states and 1255 transitions. [2020-10-11 18:16:25,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 121 transitions, 887 flow [2020-10-11 18:16:25,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 121 transitions, 813 flow, removed 29 selfloop flow, removed 10 redundant places. [2020-10-11 18:16:25,233 INFO L241 Difference]: Finished difference. Result has 126 places, 88 transitions, 393 flow [2020-10-11 18:16:25,234 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=301, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=393, PETRI_PLACES=126, PETRI_TRANSITIONS=88} [2020-10-11 18:16:25,234 INFO L341 CegarLoopForPetriNet]: 99 programPoint places, 27 predicate places. [2020-10-11 18:16:25,234 INFO L481 AbstractCegarLoop]: Abstraction has has 126 places, 88 transitions, 393 flow [2020-10-11 18:16:25,234 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-11 18:16:25,234 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:16:25,235 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:16:25,235 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-11 18:16:25,235 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:16:25,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:16:25,235 INFO L82 PathProgramCache]: Analyzing trace with hash 323935085, now seen corresponding path program 1 times [2020-10-11 18:16:25,236 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:16:25,236 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697910698] [2020-10-11 18:16:25,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:16:25,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:16:25,426 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-11 18:16:25,426 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697910698] [2020-10-11 18:16:25,427 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:16:25,427 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:16:25,427 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358597210] [2020-10-11 18:16:25,427 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:16:25,428 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:16:25,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:16:25,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:16:25,635 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 94 [2020-10-11 18:16:25,636 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 88 transitions, 393 flow. Second operand 6 states. [2020-10-11 18:16:25,636 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:16:25,636 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 94 [2020-10-11 18:16:25,637 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:16:25,845 INFO L129 PetriNetUnfolder]: 197/634 cut-off events. [2020-10-11 18:16:25,845 INFO L130 PetriNetUnfolder]: For 5830/6009 co-relation queries the response was YES. [2020-10-11 18:16:25,850 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3004 conditions, 634 events. 197/634 cut-off events. For 5830/6009 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 3943 event pairs, 58 based on Foata normal form. 22/642 useless extension candidates. Maximal degree in co-relation 2932. Up to 221 conditions per place. [2020-10-11 18:16:25,855 INFO L132 encePairwiseOnDemand]: 88/94 looper letters, 12 selfloop transitions, 2 changer transitions 4/97 dead transitions. [2020-10-11 18:16:25,855 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 97 transitions, 517 flow [2020-10-11 18:16:25,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-11 18:16:25,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-11 18:16:25,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 517 transitions. [2020-10-11 18:16:25,858 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9166666666666666 [2020-10-11 18:16:25,858 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 517 transitions. [2020-10-11 18:16:25,858 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 517 transitions. [2020-10-11 18:16:25,859 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:16:25,859 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 517 transitions. [2020-10-11 18:16:25,860 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-11 18:16:25,862 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-11 18:16:25,862 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-11 18:16:25,862 INFO L185 Difference]: Start difference. First operand has 126 places, 88 transitions, 393 flow. Second operand 6 states and 517 transitions. [2020-10-11 18:16:25,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 97 transitions, 517 flow [2020-10-11 18:16:25,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 97 transitions, 425 flow, removed 41 selfloop flow, removed 13 redundant places. [2020-10-11 18:16:25,872 INFO L241 Difference]: Finished difference. Result has 113 places, 89 transitions, 349 flow [2020-10-11 18:16:25,872 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=331, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=349, PETRI_PLACES=113, PETRI_TRANSITIONS=89} [2020-10-11 18:16:25,872 INFO L341 CegarLoopForPetriNet]: 99 programPoint places, 14 predicate places. [2020-10-11 18:16:25,873 INFO L481 AbstractCegarLoop]: Abstraction has has 113 places, 89 transitions, 349 flow [2020-10-11 18:16:25,873 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:16:25,873 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:16:25,873 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:16:25,873 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-11 18:16:25,874 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:16:25,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:16:25,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1512270193, now seen corresponding path program 2 times [2020-10-11 18:16:25,874 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:16:25,875 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608479980] [2020-10-11 18:16:25,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:16:25,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:16:25,999 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-11 18:16:25,999 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608479980] [2020-10-11 18:16:25,999 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:16:26,000 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:16:26,000 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227887903] [2020-10-11 18:16:26,000 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:16:26,000 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:16:26,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:16:26,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:16:26,126 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 94 [2020-10-11 18:16:26,127 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 89 transitions, 349 flow. Second operand 6 states. [2020-10-11 18:16:26,127 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:16:26,127 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 94 [2020-10-11 18:16:26,128 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:16:26,584 INFO L129 PetriNetUnfolder]: 559/1647 cut-off events. [2020-10-11 18:16:26,584 INFO L130 PetriNetUnfolder]: For 4173/4307 co-relation queries the response was YES. [2020-10-11 18:16:26,599 INFO L80 FinitePrefix]: Finished finitePrefix Result has 4406 conditions, 1647 events. 559/1647 cut-off events. For 4173/4307 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 14140 event pairs, 131 based on Foata normal form. 55/1584 useless extension candidates. Maximal degree in co-relation 4342. Up to 381 conditions per place. [2020-10-11 18:16:26,615 INFO L132 encePairwiseOnDemand]: 85/94 looper letters, 19 selfloop transitions, 16 changer transitions 0/114 dead transitions. [2020-10-11 18:16:26,616 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 114 transitions, 469 flow [2020-10-11 18:16:26,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:16:26,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:16:26,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 766 transitions. [2020-10-11 18:16:26,620 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9054373522458629 [2020-10-11 18:16:26,620 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 766 transitions. [2020-10-11 18:16:26,620 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 766 transitions. [2020-10-11 18:16:26,621 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:16:26,621 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 766 transitions. [2020-10-11 18:16:26,623 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:16:26,626 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:16:26,626 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:16:26,626 INFO L185 Difference]: Start difference. First operand has 113 places, 89 transitions, 349 flow. Second operand 9 states and 766 transitions. [2020-10-11 18:16:26,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 114 transitions, 469 flow [2020-10-11 18:16:26,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 114 transitions, 461 flow, removed 3 selfloop flow, removed 4 redundant places. [2020-10-11 18:16:26,636 INFO L241 Difference]: Finished difference. Result has 119 places, 103 transitions, 452 flow [2020-10-11 18:16:26,636 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=341, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=452, PETRI_PLACES=119, PETRI_TRANSITIONS=103} [2020-10-11 18:16:26,637 INFO L341 CegarLoopForPetriNet]: 99 programPoint places, 20 predicate places. [2020-10-11 18:16:26,637 INFO L481 AbstractCegarLoop]: Abstraction has has 119 places, 103 transitions, 452 flow [2020-10-11 18:16:26,637 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:16:26,637 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:16:26,638 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:16:26,638 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-11 18:16:26,638 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:16:26,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:16:26,639 INFO L82 PathProgramCache]: Analyzing trace with hash -168334585, now seen corresponding path program 1 times [2020-10-11 18:16:26,639 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:16:26,639 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721056535] [2020-10-11 18:16:26,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:16:26,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:16:26,793 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-11 18:16:26,794 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721056535] [2020-10-11 18:16:26,794 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:16:26,794 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 18:16:26,795 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300199853] [2020-10-11 18:16:26,795 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 18:16:26,795 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:16:26,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 18:16:26,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-11 18:16:26,950 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 94 [2020-10-11 18:16:26,951 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 103 transitions, 452 flow. Second operand 7 states. [2020-10-11 18:16:26,951 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:16:26,951 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 94 [2020-10-11 18:16:26,951 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:16:27,335 INFO L129 PetriNetUnfolder]: 408/1400 cut-off events. [2020-10-11 18:16:27,336 INFO L130 PetriNetUnfolder]: For 3401/4840 co-relation queries the response was YES. [2020-10-11 18:16:27,347 INFO L80 FinitePrefix]: Finished finitePrefix Result has 4411 conditions, 1400 events. 408/1400 cut-off events. For 3401/4840 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 12545 event pairs, 17 based on Foata normal form. 305/1593 useless extension candidates. Maximal degree in co-relation 4343. Up to 386 conditions per place. [2020-10-11 18:16:27,356 INFO L132 encePairwiseOnDemand]: 85/94 looper letters, 15 selfloop transitions, 31 changer transitions 6/131 dead transitions. [2020-10-11 18:16:27,357 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 131 transitions, 737 flow [2020-10-11 18:16:27,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-11 18:16:27,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-10-11 18:16:27,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1022 transitions. [2020-10-11 18:16:27,361 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9060283687943262 [2020-10-11 18:16:27,361 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1022 transitions. [2020-10-11 18:16:27,361 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1022 transitions. [2020-10-11 18:16:27,362 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:16:27,362 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1022 transitions. [2020-10-11 18:16:27,364 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 13 states. [2020-10-11 18:16:27,367 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 13 states. [2020-10-11 18:16:27,367 INFO L81 ComplementDD]: Finished complementDD. Result 13 states. [2020-10-11 18:16:27,367 INFO L185 Difference]: Start difference. First operand has 119 places, 103 transitions, 452 flow. Second operand 12 states and 1022 transitions. [2020-10-11 18:16:27,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 131 transitions, 737 flow [2020-10-11 18:16:27,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 131 transitions, 735 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-11 18:16:27,377 INFO L241 Difference]: Finished difference. Result has 132 places, 122 transitions, 680 flow [2020-10-11 18:16:27,378 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=450, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=680, PETRI_PLACES=132, PETRI_TRANSITIONS=122} [2020-10-11 18:16:27,378 INFO L341 CegarLoopForPetriNet]: 99 programPoint places, 33 predicate places. [2020-10-11 18:16:27,378 INFO L481 AbstractCegarLoop]: Abstraction has has 132 places, 122 transitions, 680 flow [2020-10-11 18:16:27,378 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 18:16:27,378 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:16:27,379 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:16:27,379 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-11 18:16:27,379 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:16:27,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:16:27,379 INFO L82 PathProgramCache]: Analyzing trace with hash 907316801, now seen corresponding path program 1 times [2020-10-11 18:16:27,380 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:16:27,380 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284192265] [2020-10-11 18:16:27,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:16:27,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:16:27,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:16:27,750 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284192265] [2020-10-11 18:16:27,750 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:16:27,751 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-10-11 18:16:27,751 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890664312] [2020-10-11 18:16:27,752 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-10-11 18:16:27,752 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:16:27,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-11 18:16:27,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2020-10-11 18:16:30,103 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 94 [2020-10-11 18:16:30,104 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 122 transitions, 680 flow. Second operand 15 states. [2020-10-11 18:16:30,104 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:16:30,104 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 94 [2020-10-11 18:16:30,104 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:16:30,781 INFO L129 PetriNetUnfolder]: 356/1488 cut-off events. [2020-10-11 18:16:30,781 INFO L130 PetriNetUnfolder]: For 5427/6027 co-relation queries the response was YES. [2020-10-11 18:16:30,794 INFO L80 FinitePrefix]: Finished finitePrefix Result has 4891 conditions, 1488 events. 356/1488 cut-off events. For 5427/6027 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 13703 event pairs, 16 based on Foata normal form. 33/1428 useless extension candidates. Maximal degree in co-relation 4812. Up to 348 conditions per place. [2020-10-11 18:16:30,804 INFO L132 encePairwiseOnDemand]: 80/94 looper letters, 23 selfloop transitions, 16 changer transitions 20/152 dead transitions. [2020-10-11 18:16:30,804 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 152 transitions, 1105 flow [2020-10-11 18:16:30,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-10-11 18:16:30,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-10-11 18:16:30,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1440 transitions. [2020-10-11 18:16:30,809 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8062709966405375 [2020-10-11 18:16:30,809 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 1440 transitions. [2020-10-11 18:16:30,809 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 1440 transitions. [2020-10-11 18:16:30,811 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:16:30,811 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1440 transitions. [2020-10-11 18:16:30,814 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 20 states. [2020-10-11 18:16:30,818 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 20 states. [2020-10-11 18:16:30,818 INFO L81 ComplementDD]: Finished complementDD. Result 20 states. [2020-10-11 18:16:30,818 INFO L185 Difference]: Start difference. First operand has 132 places, 122 transitions, 680 flow. Second operand 19 states and 1440 transitions. [2020-10-11 18:16:30,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 152 transitions, 1105 flow [2020-10-11 18:16:30,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 152 transitions, 983 flow, removed 48 selfloop flow, removed 6 redundant places. [2020-10-11 18:16:30,859 INFO L241 Difference]: Finished difference. Result has 155 places, 125 transitions, 679 flow [2020-10-11 18:16:30,860 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=564, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=679, PETRI_PLACES=155, PETRI_TRANSITIONS=125} [2020-10-11 18:16:30,860 INFO L341 CegarLoopForPetriNet]: 99 programPoint places, 56 predicate places. [2020-10-11 18:16:30,860 INFO L481 AbstractCegarLoop]: Abstraction has has 155 places, 125 transitions, 679 flow [2020-10-11 18:16:30,861 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-10-11 18:16:30,861 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:16:30,861 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:16:30,861 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-11 18:16:30,861 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:16:30,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:16:30,862 INFO L82 PathProgramCache]: Analyzing trace with hash -628991382, now seen corresponding path program 1 times [2020-10-11 18:16:30,862 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:16:30,862 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421550374] [2020-10-11 18:16:30,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:16:30,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:16:30,990 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-11 18:16:30,990 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421550374] [2020-10-11 18:16:30,990 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:16:30,991 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-11 18:16:30,991 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111507263] [2020-10-11 18:16:30,991 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-11 18:16:30,991 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:16:30,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-11 18:16:30,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-11 18:16:31,163 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 94 [2020-10-11 18:16:31,163 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 125 transitions, 679 flow. Second operand 8 states. [2020-10-11 18:16:31,164 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:16:31,164 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 94 [2020-10-11 18:16:31,164 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:16:31,692 INFO L129 PetriNetUnfolder]: 404/1496 cut-off events. [2020-10-11 18:16:31,692 INFO L130 PetriNetUnfolder]: For 2815/4614 co-relation queries the response was YES. [2020-10-11 18:16:31,706 INFO L80 FinitePrefix]: Finished finitePrefix Result has 4313 conditions, 1496 events. 404/1496 cut-off events. For 2815/4614 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 14397 event pairs, 6 based on Foata normal form. 429/1783 useless extension candidates. Maximal degree in co-relation 4267. Up to 238 conditions per place. [2020-10-11 18:16:31,716 INFO L132 encePairwiseOnDemand]: 85/94 looper letters, 10 selfloop transitions, 36 changer transitions 16/144 dead transitions. [2020-10-11 18:16:31,716 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 144 transitions, 901 flow [2020-10-11 18:16:31,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-11 18:16:31,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-11 18:16:31,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1266 transitions. [2020-10-11 18:16:31,720 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8978723404255319 [2020-10-11 18:16:31,721 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1266 transitions. [2020-10-11 18:16:31,721 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1266 transitions. [2020-10-11 18:16:31,721 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:16:31,722 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1266 transitions. [2020-10-11 18:16:31,723 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 16 states. [2020-10-11 18:16:31,727 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 16 states. [2020-10-11 18:16:31,727 INFO L81 ComplementDD]: Finished complementDD. Result 16 states. [2020-10-11 18:16:31,727 INFO L185 Difference]: Start difference. First operand has 155 places, 125 transitions, 679 flow. Second operand 15 states and 1266 transitions. [2020-10-11 18:16:31,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 144 transitions, 901 flow [2020-10-11 18:16:31,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 144 transitions, 801 flow, removed 40 selfloop flow, removed 21 redundant places. [2020-10-11 18:16:31,748 INFO L241 Difference]: Finished difference. Result has 145 places, 125 transitions, 691 flow [2020-10-11 18:16:31,749 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=579, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=691, PETRI_PLACES=145, PETRI_TRANSITIONS=125} [2020-10-11 18:16:31,750 INFO L341 CegarLoopForPetriNet]: 99 programPoint places, 46 predicate places. [2020-10-11 18:16:31,750 INFO L481 AbstractCegarLoop]: Abstraction has has 145 places, 125 transitions, 691 flow [2020-10-11 18:16:31,750 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-11 18:16:31,750 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:16:31,750 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:16:31,751 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-11 18:16:31,751 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:16:31,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:16:31,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1130432318, now seen corresponding path program 1 times [2020-10-11 18:16:31,752 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:16:31,757 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672884405] [2020-10-11 18:16:31,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:16:31,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:16:32,040 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-11 18:16:32,041 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672884405] [2020-10-11 18:16:32,041 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:16:32,041 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-11 18:16:32,042 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854556595] [2020-10-11 18:16:32,042 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-11 18:16:32,042 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:16:32,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-11 18:16:32,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2020-10-11 18:16:33,689 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 94 [2020-10-11 18:16:33,689 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 125 transitions, 691 flow. Second operand 12 states. [2020-10-11 18:16:33,689 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:16:33,689 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 94 [2020-10-11 18:16:33,689 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:16:34,325 INFO L129 PetriNetUnfolder]: 627/2592 cut-off events. [2020-10-11 18:16:34,325 INFO L130 PetriNetUnfolder]: For 6863/7173 co-relation queries the response was YES. [2020-10-11 18:16:34,352 INFO L80 FinitePrefix]: Finished finitePrefix Result has 7778 conditions, 2592 events. 627/2592 cut-off events. For 6863/7173 co-relation queries the response was YES. Maximal size of possible extension queue 440. Compared 29307 event pairs, 2 based on Foata normal form. 10/2420 useless extension candidates. Maximal degree in co-relation 7698. Up to 347 conditions per place. [2020-10-11 18:16:34,359 INFO L132 encePairwiseOnDemand]: 82/94 looper letters, 24 selfloop transitions, 5 changer transitions 36/158 dead transitions. [2020-10-11 18:16:34,359 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 158 transitions, 1103 flow [2020-10-11 18:16:34,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-11 18:16:34,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-10-11 18:16:34,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1054 transitions. [2020-10-11 18:16:34,362 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8009118541033434 [2020-10-11 18:16:34,363 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1054 transitions. [2020-10-11 18:16:34,363 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1054 transitions. [2020-10-11 18:16:34,363 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:16:34,364 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1054 transitions. [2020-10-11 18:16:34,367 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 15 states. [2020-10-11 18:16:34,369 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 15 states. [2020-10-11 18:16:34,369 INFO L81 ComplementDD]: Finished complementDD. Result 15 states. [2020-10-11 18:16:34,369 INFO L185 Difference]: Start difference. First operand has 145 places, 125 transitions, 691 flow. Second operand 14 states and 1054 transitions. [2020-10-11 18:16:34,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 158 transitions, 1103 flow [2020-10-11 18:16:34,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 158 transitions, 902 flow, removed 76 selfloop flow, removed 17 redundant places. [2020-10-11 18:16:34,461 INFO L241 Difference]: Finished difference. Result has 146 places, 118 transitions, 564 flow [2020-10-11 18:16:34,462 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=586, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=564, PETRI_PLACES=146, PETRI_TRANSITIONS=118} [2020-10-11 18:16:34,462 INFO L341 CegarLoopForPetriNet]: 99 programPoint places, 47 predicate places. [2020-10-11 18:16:34,462 INFO L481 AbstractCegarLoop]: Abstraction has has 146 places, 118 transitions, 564 flow [2020-10-11 18:16:34,462 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-11 18:16:34,463 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:16:34,463 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:16:34,463 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-11 18:16:34,463 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:16:34,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:16:34,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1530335710, now seen corresponding path program 2 times [2020-10-11 18:16:34,464 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:16:34,464 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451683547] [2020-10-11 18:16:34,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:16:34,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:16:34,931 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-11 18:16:34,932 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451683547] [2020-10-11 18:16:34,932 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:16:34,932 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-10-11 18:16:34,933 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578348404] [2020-10-11 18:16:34,933 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-10-11 18:16:34,933 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:16:34,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-11 18:16:34,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2020-10-11 18:16:38,241 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 94 [2020-10-11 18:16:38,242 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 118 transitions, 564 flow. Second operand 15 states. [2020-10-11 18:16:38,242 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:16:38,242 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 94 [2020-10-11 18:16:38,242 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:16:38,594 INFO L129 PetriNetUnfolder]: 189/821 cut-off events. [2020-10-11 18:16:38,594 INFO L130 PetriNetUnfolder]: For 996/1022 co-relation queries the response was YES. [2020-10-11 18:16:38,599 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2218 conditions, 821 events. 189/821 cut-off events. For 996/1022 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 6778 event pairs, 0 based on Foata normal form. 4/781 useless extension candidates. Maximal degree in co-relation 2187. Up to 90 conditions per place. [2020-10-11 18:16:38,602 INFO L132 encePairwiseOnDemand]: 81/94 looper letters, 19 selfloop transitions, 8 changer transitions 11/129 dead transitions. [2020-10-11 18:16:38,602 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 129 transitions, 703 flow [2020-10-11 18:16:38,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 18:16:38,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-11 18:16:38,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 968 transitions. [2020-10-11 18:16:38,604 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.7921440261865794 [2020-10-11 18:16:38,604 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 968 transitions. [2020-10-11 18:16:38,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 968 transitions. [2020-10-11 18:16:38,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:16:38,605 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 968 transitions. [2020-10-11 18:16:38,606 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 14 states. [2020-10-11 18:16:38,608 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 14 states. [2020-10-11 18:16:38,608 INFO L81 ComplementDD]: Finished complementDD. Result 14 states. [2020-10-11 18:16:38,608 INFO L185 Difference]: Start difference. First operand has 146 places, 118 transitions, 564 flow. Second operand 13 states and 968 transitions. [2020-10-11 18:16:38,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 129 transitions, 703 flow [2020-10-11 18:16:38,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 129 transitions, 646 flow, removed 17 selfloop flow, removed 14 redundant places. [2020-10-11 18:16:38,621 INFO L241 Difference]: Finished difference. Result has 140 places, 117 transitions, 552 flow [2020-10-11 18:16:38,621 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=524, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=552, PETRI_PLACES=140, PETRI_TRANSITIONS=117} [2020-10-11 18:16:38,622 INFO L341 CegarLoopForPetriNet]: 99 programPoint places, 41 predicate places. [2020-10-11 18:16:38,622 INFO L481 AbstractCegarLoop]: Abstraction has has 140 places, 117 transitions, 552 flow [2020-10-11 18:16:38,622 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-10-11 18:16:38,622 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:16:38,622 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:16:38,622 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-11 18:16:38,623 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:16:38,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:16:38,623 INFO L82 PathProgramCache]: Analyzing trace with hash 3148916, now seen corresponding path program 3 times [2020-10-11 18:16:38,623 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:16:38,623 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169840681] [2020-10-11 18:16:38,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:16:38,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 18:16:38,667 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 18:16:38,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 18:16:38,715 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 18:16:38,758 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-11 18:16:38,758 INFO L519 BasicCegarLoop]: Counterexample might be feasible [2020-10-11 18:16:38,759 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-11 18:16:38,790 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-11 18:16:38,790 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:16:38,792 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-11 18:16:38,792 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:16:38,792 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-11 18:16:38,792 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:16:38,792 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-11 18:16:38,792 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:16:38,793 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-11 18:16:38,793 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:16:38,793 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-11 18:16:38,793 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:16:38,793 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-11 18:16:38,793 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:16:38,794 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-11 18:16:38,794 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:16:38,794 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-11 18:16:38,794 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:16:38,794 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-11 18:16:38,795 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:16:38,795 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-11 18:16:38,795 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:16:38,795 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-11 18:16:38,795 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:16:38,796 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-11 18:16:38,796 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:16:38,796 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-11 18:16:38,796 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:16:38,796 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-11 18:16:38,796 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:16:38,797 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-11 18:16:38,797 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:16:38,797 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-11 18:16:38,797 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:16:38,798 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-11 18:16:38,798 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:16:38,798 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-11 18:16:38,798 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:16:38,799 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-11 18:16:38,799 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:16:38,799 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-11 18:16:38,799 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:16:38,799 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-11 18:16:38,800 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:16:38,800 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-11 18:16:38,800 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:16:38,800 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-11 18:16:38,800 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:16:38,801 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-11 18:16:38,801 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:16:38,801 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-11 18:16:38,801 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:16:38,801 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-11 18:16:38,801 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:16:38,802 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-11 18:16:38,802 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:16:38,802 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-11 18:16:38,802 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:16:38,802 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-11 18:16:38,802 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:16:38,803 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-11 18:16:38,803 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:16:38,803 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-11 18:16:38,803 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:16:38,803 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-11 18:16:38,804 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:16:38,804 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-11 18:16:38,804 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:16:38,804 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-11 18:16:38,804 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:16:38,907 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 06:16:38 BasicIcfg [2020-10-11 18:16:38,907 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-11 18:16:38,911 INFO L168 Benchmark]: Toolchain (without parser) took 23827.61 ms. Allocated memory was 252.2 MB in the beginning and 686.3 MB in the end (delta: 434.1 MB). Free memory was 204.9 MB in the beginning and 509.9 MB in the end (delta: -305.0 MB). Peak memory consumption was 129.1 MB. Max. memory is 14.2 GB. [2020-10-11 18:16:38,911 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 252.2 MB. Free memory was 227.7 MB in the beginning and 226.9 MB in the end (delta: 839.2 kB). Peak memory consumption was 839.2 kB. Max. memory is 14.2 GB. [2020-10-11 18:16:38,912 INFO L168 Benchmark]: CACSL2BoogieTranslator took 722.57 ms. Allocated memory was 252.2 MB in the beginning and 317.7 MB in the end (delta: 65.5 MB). Free memory was 204.1 MB in the beginning and 266.6 MB in the end (delta: -62.5 MB). Peak memory consumption was 27.9 MB. Max. memory is 14.2 GB. [2020-10-11 18:16:38,913 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.89 ms. Allocated memory is still 317.7 MB. Free memory was 266.6 MB in the beginning and 263.1 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 14.2 GB. [2020-10-11 18:16:38,916 INFO L168 Benchmark]: Boogie Preprocessor took 38.66 ms. Allocated memory is still 317.7 MB. Free memory was 263.1 MB in the beginning and 260.6 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-11 18:16:38,916 INFO L168 Benchmark]: RCFGBuilder took 2077.16 ms. Allocated memory was 317.7 MB in the beginning and 359.1 MB in the end (delta: 41.4 MB). Free memory was 260.6 MB in the beginning and 184.0 MB in the end (delta: 76.6 MB). Peak memory consumption was 118.0 MB. Max. memory is 14.2 GB. [2020-10-11 18:16:38,917 INFO L168 Benchmark]: TraceAbstraction took 20914.50 ms. Allocated memory was 359.1 MB in the beginning and 686.3 MB in the end (delta: 327.2 MB). Free memory was 184.0 MB in the beginning and 509.9 MB in the end (delta: -325.9 MB). Peak memory consumption was 1.3 MB. Max. memory is 14.2 GB. [2020-10-11 18:16:38,926 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.25 ms. Allocated memory is still 252.2 MB. Free memory was 227.7 MB in the beginning and 226.9 MB in the end (delta: 839.2 kB). Peak memory consumption was 839.2 kB. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 722.57 ms. Allocated memory was 252.2 MB in the beginning and 317.7 MB in the end (delta: 65.5 MB). Free memory was 204.1 MB in the beginning and 266.6 MB in the end (delta: -62.5 MB). Peak memory consumption was 27.9 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 67.89 ms. Allocated memory is still 317.7 MB. Free memory was 266.6 MB in the beginning and 263.1 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 38.66 ms. Allocated memory is still 317.7 MB. Free memory was 263.1 MB in the beginning and 260.6 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 2077.16 ms. Allocated memory was 317.7 MB in the beginning and 359.1 MB in the end (delta: 41.4 MB). Free memory was 260.6 MB in the beginning and 184.0 MB in the end (delta: 76.6 MB). Peak memory consumption was 118.0 MB. Max. memory is 14.2 GB. * TraceAbstraction took 20914.50 ms. Allocated memory was 359.1 MB in the beginning and 686.3 MB in the end (delta: 327.2 MB). Free memory was 184.0 MB in the beginning and 509.9 MB in the end (delta: -325.9 MB). Peak memory consumption was 1.3 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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; VAL [__unbuffered_cnt=0] [L700] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L702] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L703] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0] [L704] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L706] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L707] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L708] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L709] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L710] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L711] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L712] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0] [L713] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0] [L714] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L715] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L716] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0] [L717] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0] [L718] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L719] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L720] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L721] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L722] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L724] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L726] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L727] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L728] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L812] 0 pthread_t t760; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L813] FCALL, FORK 0 pthread_create(&t760, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L814] 0 pthread_t t761; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L815] FCALL, FORK 0 pthread_create(&t761, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L816] 0 pthread_t t762; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L817] FCALL, FORK 0 pthread_create(&t762, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L752] 2 x$w_buff1 = x$w_buff0 [L753] 2 x$w_buff0 = 2 [L754] 2 x$w_buff1_used = x$w_buff0_used [L755] 2 x$w_buff0_used = (_Bool)1 [L7] COND TRUE 2 !expression [L7] 2 __VERIFIER_error() [L757] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L758] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L759] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L760] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L761] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L764] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L781] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=0] [L784] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=0] [L787] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=0] [L732] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L735] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L738] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L738] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L738] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L738] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L739] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L739] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L740] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L740] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L741] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L741] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L742] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L742] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L767] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L767] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L768] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L768] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L769] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L769] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L770] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L770] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L771] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L771] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L790] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L790] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L791] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L791] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L792] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L792] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L793] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L793] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L794] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L794] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L774] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L745] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L797] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L819] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L823] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L823] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L823] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L823] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L824] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L824] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L825] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L825] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L826] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L826] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L827] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L827] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L830] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L831] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L832] 0 x$flush_delayed = weak$$choice2 [L833] 0 x$mem_tmp = x [L834] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L834] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1 [L834] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L834] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L835] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L835] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L836] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L836] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L836] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L836] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L837] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L837] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L838] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L838] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L839] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L839] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L840] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L840] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0 [L840] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L840] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L841] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) [L842] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L842] 0 x = x$flush_delayed ? x$mem_tmp : x [L843] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, 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=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L7] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, 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=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L7] 0 __VERIFIER_error() VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, 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=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 93 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: 20.6s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 16.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 402 SDtfs, 744 SDslu, 2387 SDs, 0 SdLazy, 2173 SolverSat, 343 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 187 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=691occurred in iteration=10, 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.7s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 808 NumberOfCodeBlocks, 808 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 725 ConstructedInterpolants, 0 QuantifiedInterpolants, 291014 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...