/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe-SemanticLooper.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix019_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-16 04:43:11,716 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 04:43:11,719 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 04:43:11,745 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 04:43:11,746 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 04:43:11,754 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 04:43:11,757 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 04:43:11,761 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 04:43:11,763 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 04:43:11,766 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 04:43:11,767 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 04:43:11,769 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 04:43:11,769 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 04:43:11,772 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 04:43:11,774 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 04:43:11,776 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 04:43:11,777 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 04:43:11,778 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 04:43:11,780 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 04:43:11,788 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 04:43:11,790 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 04:43:11,791 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 04:43:11,792 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 04:43:11,793 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 04:43:11,809 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 04:43:11,810 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 04:43:11,810 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 04:43:11,811 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 04:43:11,811 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 04:43:11,815 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 04:43:11,815 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 04:43:11,816 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 04:43:11,817 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 04:43:11,821 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 04:43:11,822 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 04:43:11,822 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 04:43:11,823 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 04:43:11,823 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 04:43:11,823 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 04:43:11,825 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 04:43:11,827 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 04:43:11,827 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe-SemanticLooper.epf [2020-10-16 04:43:11,874 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 04:43:11,879 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 04:43:11,880 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 04:43:11,881 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 04:43:11,881 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 04:43:11,881 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 04:43:11,881 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 04:43:11,881 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 04:43:11,882 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 04:43:11,882 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 04:43:11,882 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 04:43:11,882 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 04:43:11,882 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 04:43:11,883 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 04:43:11,883 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 04:43:11,883 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 04:43:11,883 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 04:43:11,883 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 04:43:11,884 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 04:43:11,884 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 04:43:11,884 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 04:43:11,885 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 04:43:11,885 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 04:43:11,885 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 04:43:11,885 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 04:43:11,886 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 04:43:11,886 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 04:43:11,886 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-16 04:43:11,886 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 04:43:12,164 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 04:43:12,181 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 04:43:12,185 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 04:43:12,186 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 04:43:12,187 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 04:43:12,187 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix019_power.oepc.i [2020-10-16 04:43:12,248 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/445cd4aef/78d5d5b148074535b590572975a3e8d1/FLAG1fa6b1c26 [2020-10-16 04:43:12,783 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 04:43:12,784 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix019_power.oepc.i [2020-10-16 04:43:12,819 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/445cd4aef/78d5d5b148074535b590572975a3e8d1/FLAG1fa6b1c26 [2020-10-16 04:43:13,041 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/445cd4aef/78d5d5b148074535b590572975a3e8d1 [2020-10-16 04:43:13,052 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 04:43:13,054 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 04:43:13,058 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 04:43:13,059 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 04:43:13,063 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 04:43:13,064 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 04:43:13" (1/1) ... [2020-10-16 04:43:13,068 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ec83fbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:43:13, skipping insertion in model container [2020-10-16 04:43:13,068 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 04:43:13" (1/1) ... [2020-10-16 04:43:13,076 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 04:43:13,144 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 04:43:13,641 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 04:43:13,654 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 04:43:13,747 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 04:43:13,821 INFO L208 MainTranslator]: Completed translation [2020-10-16 04:43:13,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:43:13 WrapperNode [2020-10-16 04:43:13,822 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 04:43:13,823 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 04:43:13,823 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 04:43:13,823 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 04:43:13,832 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:43:13" (1/1) ... [2020-10-16 04:43:13,855 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:43:13" (1/1) ... [2020-10-16 04:43:13,890 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 04:43:13,890 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 04:43:13,891 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 04:43:13,891 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 04:43:13,901 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:43:13" (1/1) ... [2020-10-16 04:43:13,902 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:43:13" (1/1) ... [2020-10-16 04:43:13,906 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:43:13" (1/1) ... [2020-10-16 04:43:13,907 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:43:13" (1/1) ... [2020-10-16 04:43:13,919 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:43:13" (1/1) ... [2020-10-16 04:43:13,927 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:43:13" (1/1) ... [2020-10-16 04:43:13,935 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:43:13" (1/1) ... [2020-10-16 04:43:13,944 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 04:43:13,945 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 04:43:13,945 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 04:43:13,945 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 04:43:13,948 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:43:13" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 04:43:14,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 04:43:14,022 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 04:43:14,022 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 04:43:14,022 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 04:43:14,022 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 04:43:14,023 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 04:43:14,023 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 04:43:14,023 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 04:43:14,023 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 04:43:14,023 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 04:43:14,023 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 04:43:14,024 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 04:43:14,024 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 04:43:14,026 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-16 04:43:15,986 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 04:43:15,986 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 04:43:15,988 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 04:43:15 BoogieIcfgContainer [2020-10-16 04:43:15,988 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 04:43:15,990 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 04:43:15,990 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 04:43:15,993 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 04:43:15,994 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 04:43:13" (1/3) ... [2020-10-16 04:43:15,995 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a804fff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 04:43:15, skipping insertion in model container [2020-10-16 04:43:15,995 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:43:13" (2/3) ... [2020-10-16 04:43:15,995 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a804fff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 04:43:15, skipping insertion in model container [2020-10-16 04:43:15,995 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 04:43:15" (3/3) ... [2020-10-16 04:43:15,997 INFO L111 eAbstractionObserver]: Analyzing ICFG mix019_power.oepc.i [2020-10-16 04:43:16,009 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 04:43:16,017 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 04:43:16,018 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 04:43:16,050 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,050 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,051 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,051 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,051 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,052 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,052 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,052 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,053 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,053 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,053 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,053 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,054 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,054 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,054 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,055 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,055 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,056 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,056 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,056 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,056 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,057 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,057 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,057 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,057 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,058 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,058 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,058 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,058 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,059 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,059 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,059 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,060 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,060 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,060 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,060 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,060 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,061 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,061 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,061 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,061 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,061 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,062 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,062 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,062 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,062 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,062 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,063 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,063 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,063 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,063 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,063 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,064 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,064 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,064 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,064 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,064 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,065 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,065 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,065 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,065 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,065 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,065 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,066 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,066 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,066 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,066 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,066 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,067 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,067 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,067 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,067 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,069 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,069 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,070 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,070 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,070 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,070 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,070 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,071 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,071 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,075 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,076 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,076 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,076 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,076 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,077 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,077 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,077 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,077 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,078 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,078 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,078 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,078 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,078 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,079 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,079 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,079 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,079 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,080 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,080 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,080 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,080 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,081 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,081 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,081 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,081 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,082 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,082 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,082 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,082 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,083 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,083 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,083 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,085 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,086 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,086 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,086 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,086 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,086 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,087 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,087 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,087 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,087 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,088 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,088 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,089 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,090 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,090 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,090 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,090 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,090 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,090 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,091 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,091 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,091 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:43:16,108 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-16 04:43:16,131 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 04:43:16,131 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-16 04:43:16,131 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 04:43:16,131 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 04:43:16,131 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 04:43:16,132 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 04:43:16,132 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 04:43:16,132 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 04:43:16,147 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 103 places, 95 transitions, 205 flow [2020-10-16 04:43:16,196 INFO L129 PetriNetUnfolder]: 2/92 cut-off events. [2020-10-16 04:43:16,196 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:43:16,202 INFO L80 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 92 events. 2/92 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 69 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2020-10-16 04:43:16,202 INFO L82 GeneralOperation]: Start removeDead. Operand has 103 places, 95 transitions, 205 flow [2020-10-16 04:43:16,234 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 100 places, 92 transitions, 193 flow [2020-10-16 04:43:16,237 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 04:43:16,244 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 193 flow [2020-10-16 04:43:16,247 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 193 flow [2020-10-16 04:43:16,248 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 193 flow [2020-10-16 04:43:16,297 INFO L129 PetriNetUnfolder]: 2/92 cut-off events. [2020-10-16 04:43:16,297 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:43:16,299 INFO L80 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 92 events. 2/92 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2020-10-16 04:43:16,304 INFO L117 LiptonReduction]: Number of co-enabled transitions 1732 [2020-10-16 04:43:16,776 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:43:16,778 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:43:16,780 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:43:16,780 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:43:16,788 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:43:16,788 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:43:16,796 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:43:16,797 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:43:16,819 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:43:16,819 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:43:16,821 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:43:16,821 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:43:16,824 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:43:16,825 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:43:16,827 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:43:16,828 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:43:16,906 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:43:16,906 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:43:16,907 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:43:16,908 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:43:16,910 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:43:16,911 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:43:16,913 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:43:16,913 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:43:16,930 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:43:16,931 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:43:16,932 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:43:16,932 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:43:16,935 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:43:16,935 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:43:16,938 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:43:16,938 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:43:16,985 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:43:16,985 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:43:16,986 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:43:16,986 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:43:16,989 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:43:16,990 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:43:16,992 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:43:16,993 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:43:17,010 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:43:17,011 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:43:17,012 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:43:17,012 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:43:17,014 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:43:17,015 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:43:17,017 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:43:17,018 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:43:17,375 WARN L193 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-16 04:43:17,488 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 04:43:17,489 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:43:17,641 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2020-10-16 04:43:17,805 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:43:17,805 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:43:17,806 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:43:17,807 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:43:17,812 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:43:17,813 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:43:17,815 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:43:17,816 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:43:17,840 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:43:17,841 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:43:17,842 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:43:17,842 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:43:17,846 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:43:17,847 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:43:17,849 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:43:17,850 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:43:18,067 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:43:18,067 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:43:18,093 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:43:18,094 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:43:18,096 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:43:18,096 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:43:18,097 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:43:18,098 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:43:18,099 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:43:18,100 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:43:18,102 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:43:18,102 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:43:18,103 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:43:18,104 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:43:18,147 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:43:18,148 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 04:43:18,150 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:43:18,151 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:43:18,210 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:43:18,211 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 04:43:18,213 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:43:18,214 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:43:18,249 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:43:18,249 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:43:18,251 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:43:18,251 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:43:18,253 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:43:18,253 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:43:18,254 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:43:18,255 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:43:18,256 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:43:18,257 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:43:18,258 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:43:18,258 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:43:18,259 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:43:18,260 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:43:18,305 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 04:43:18,305 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:43:18,482 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:43:18,483 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:43:18,483 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:43:18,484 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:43:18,487 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:43:18,487 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:43:18,489 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:43:18,489 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:43:18,503 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:43:18,504 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:43:18,504 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:43:18,505 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:43:18,506 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:43:18,507 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:43:18,511 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:43:18,511 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:43:18,544 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 04:43:18,545 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:43:18,606 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:43:18,606 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:43:18,607 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:43:18,607 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:43:18,608 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:43:18,609 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:43:18,612 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:43:18,613 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:43:18,626 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:43:18,627 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:43:18,628 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:43:18,628 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:43:18,630 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:43:18,630 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:43:18,631 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:43:18,632 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:43:18,685 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:43:18,685 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:43:18,688 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:43:18,689 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:43:18,691 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:43:18,693 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:43:18,696 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:43:18,696 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:43:18,710 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:43:18,710 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:43:18,711 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:43:18,711 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:43:18,713 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:43:18,714 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:43:18,718 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:43:18,719 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:43:18,827 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:43:18,828 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:43:18,828 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:43:18,829 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:43:18,830 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:43:18,831 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:43:18,832 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:43:18,833 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:43:18,847 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:43:18,847 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:43:18,848 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:43:18,848 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:43:18,850 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:43:18,850 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:43:18,852 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:43:18,852 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:43:18,899 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:43:18,900 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:43:18,900 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:43:18,901 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:43:18,902 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:43:18,903 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:43:18,904 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:43:18,904 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:43:18,915 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:43:18,916 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:43:18,916 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:43:18,917 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:43:18,918 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:43:18,918 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:43:18,920 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:43:18,920 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:43:18,981 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:43:18,982 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:43:18,983 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:43:18,984 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:43:18,985 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:43:18,990 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:43:18,992 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:43:18,992 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:43:18,994 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:43:18,994 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:43:18,995 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:43:18,996 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:43:18,997 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:43:18,999 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:43:19,040 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:43:19,041 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 04:43:19,043 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:43:19,046 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:43:19,083 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:43:19,083 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:43:19,084 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:43:19,084 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:43:19,085 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:43:19,086 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:43:19,087 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:43:19,088 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:43:19,101 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:43:19,102 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:43:19,103 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:43:19,103 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:43:19,104 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:43:19,105 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:43:19,106 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:43:19,107 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:43:19,141 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:43:19,142 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 04:43:19,144 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:43:19,144 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:43:19,181 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:43:19,182 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:43:19,191 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:43:19,192 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:43:19,194 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:43:19,194 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:43:19,195 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:43:19,195 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:43:19,197 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:43:19,197 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:43:19,199 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:43:19,199 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:43:19,201 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:43:19,201 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:43:19,313 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:43:19,314 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:43:19,314 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:43:19,314 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:43:19,316 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:43:19,316 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:43:19,318 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:43:19,318 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:43:19,332 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:43:19,333 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:43:19,333 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:43:19,334 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:43:19,335 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:43:19,335 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:43:19,337 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:43:19,337 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:43:19,398 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 04:43:19,398 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:43:20,208 WARN L193 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2020-10-16 04:43:20,317 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2020-10-16 04:43:20,519 INFO L132 LiptonReduction]: Checked pairs total: 5456 [2020-10-16 04:43:20,519 INFO L134 LiptonReduction]: Total number of compositions: 80 [2020-10-16 04:43:20,522 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4288 [2020-10-16 04:43:20,527 INFO L129 PetriNetUnfolder]: 0/2 cut-off events. [2020-10-16 04:43:20,527 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:43:20,527 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:43:20,528 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2020-10-16 04:43:20,529 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:43:20,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:43:20,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1051011, now seen corresponding path program 1 times [2020-10-16 04:43:20,545 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:43:20,545 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160091830] [2020-10-16 04:43:20,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:43:20,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:43:20,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:43:20,764 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160091830] [2020-10-16 04:43:20,765 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:43:20,765 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 04:43:20,765 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161139012] [2020-10-16 04:43:20,776 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 04:43:20,776 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:43:20,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 04:43:20,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 04:43:20,795 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 175 [2020-10-16 04:43:20,798 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 59 flow. Second operand 3 states. [2020-10-16 04:43:20,798 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:43:20,798 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 175 [2020-10-16 04:43:20,799 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:43:20,889 INFO L129 PetriNetUnfolder]: 49/136 cut-off events. [2020-10-16 04:43:20,889 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:43:20,890 INFO L80 FinitePrefix]: Finished finitePrefix Result has 232 conditions, 136 events. 49/136 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 596 event pairs, 38 based on Foata normal form. 17/140 useless extension candidates. Maximal degree in co-relation 222. Up to 65 conditions per place. [2020-10-16 04:43:20,892 INFO L132 encePairwiseOnDemand]: 171/175 looper letters, 9 selfloop transitions, 2 changer transitions 0/27 dead transitions. [2020-10-16 04:43:20,892 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 27 transitions, 85 flow [2020-10-16 04:43:20,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 04:43:20,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 04:43:20,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 452 transitions. [2020-10-16 04:43:20,911 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8609523809523809 [2020-10-16 04:43:20,912 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 452 transitions. [2020-10-16 04:43:20,913 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 452 transitions. [2020-10-16 04:43:20,915 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:43:20,919 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 452 transitions. [2020-10-16 04:43:20,923 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 04:43:20,932 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 04:43:20,932 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 04:43:20,934 INFO L185 Difference]: Start difference. First operand has 34 places, 25 transitions, 59 flow. Second operand 3 states and 452 transitions. [2020-10-16 04:43:20,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 27 transitions, 85 flow [2020-10-16 04:43:20,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 27 transitions, 82 flow, removed 0 selfloop flow, removed 3 redundant places. [2020-10-16 04:43:20,941 INFO L241 Difference]: Finished difference. Result has 32 places, 23 transitions, 56 flow [2020-10-16 04:43:20,944 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=32, PETRI_TRANSITIONS=23} [2020-10-16 04:43:20,945 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2020-10-16 04:43:20,946 INFO L481 AbstractCegarLoop]: Abstraction has has 32 places, 23 transitions, 56 flow [2020-10-16 04:43:20,946 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 04:43:20,946 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:43:20,946 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:43:20,946 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 04:43:20,947 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:43:20,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:43:20,947 INFO L82 PathProgramCache]: Analyzing trace with hash 51299796, now seen corresponding path program 1 times [2020-10-16 04:43:20,947 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:43:20,948 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010277121] [2020-10-16 04:43:20,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:43:20,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:43:21,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:43:21,061 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010277121] [2020-10-16 04:43:21,062 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:43:21,062 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 04:43:21,062 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954083561] [2020-10-16 04:43:21,064 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 04:43:21,064 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:43:21,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 04:43:21,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 04:43:21,066 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 175 [2020-10-16 04:43:21,067 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 23 transitions, 56 flow. Second operand 3 states. [2020-10-16 04:43:21,067 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:43:21,067 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 175 [2020-10-16 04:43:21,067 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:43:21,081 INFO L129 PetriNetUnfolder]: 1/28 cut-off events. [2020-10-16 04:43:21,081 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:43:21,081 INFO L80 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 28 events. 1/28 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 50 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 36. Up to 5 conditions per place. [2020-10-16 04:43:21,082 INFO L132 encePairwiseOnDemand]: 172/175 looper letters, 1 selfloop transitions, 2 changer transitions 2/24 dead transitions. [2020-10-16 04:43:21,082 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 24 transitions, 68 flow [2020-10-16 04:43:21,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 04:43:21,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 04:43:21,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 471 transitions. [2020-10-16 04:43:21,085 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8971428571428571 [2020-10-16 04:43:21,085 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 471 transitions. [2020-10-16 04:43:21,085 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 471 transitions. [2020-10-16 04:43:21,086 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:43:21,086 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 471 transitions. [2020-10-16 04:43:21,087 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 04:43:21,088 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 04:43:21,088 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 04:43:21,089 INFO L185 Difference]: Start difference. First operand has 32 places, 23 transitions, 56 flow. Second operand 3 states and 471 transitions. [2020-10-16 04:43:21,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 24 transitions, 68 flow [2020-10-16 04:43:21,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 24 transitions, 64 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 04:43:21,090 INFO L241 Difference]: Finished difference. Result has 33 places, 22 transitions, 58 flow [2020-10-16 04:43:21,090 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=33, PETRI_TRANSITIONS=22} [2020-10-16 04:43:21,091 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, -1 predicate places. [2020-10-16 04:43:21,091 INFO L481 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 58 flow [2020-10-16 04:43:21,091 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 04:43:21,091 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:43:21,092 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:43:21,092 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 04:43:21,092 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:43:21,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:43:21,092 INFO L82 PathProgramCache]: Analyzing trace with hash 2022950178, now seen corresponding path program 1 times [2020-10-16 04:43:21,093 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:43:21,093 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686047784] [2020-10-16 04:43:21,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:43:21,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:43:21,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:43:21,142 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686047784] [2020-10-16 04:43:21,142 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:43:21,142 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 04:43:21,143 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502340068] [2020-10-16 04:43:21,143 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 04:43:21,143 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:43:21,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 04:43:21,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 04:43:21,145 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 175 [2020-10-16 04:43:21,145 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 22 transitions, 58 flow. Second operand 3 states. [2020-10-16 04:43:21,145 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:43:21,146 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 175 [2020-10-16 04:43:21,146 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:43:21,158 INFO L129 PetriNetUnfolder]: 3/34 cut-off events. [2020-10-16 04:43:21,158 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-10-16 04:43:21,159 INFO L80 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 34 events. 3/34 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 77 event pairs, 1 based on Foata normal form. 1/33 useless extension candidates. Maximal degree in co-relation 50. Up to 10 conditions per place. [2020-10-16 04:43:21,159 INFO L132 encePairwiseOnDemand]: 171/175 looper letters, 3 selfloop transitions, 3 changer transitions 0/24 dead transitions. [2020-10-16 04:43:21,159 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 24 transitions, 74 flow [2020-10-16 04:43:21,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 04:43:21,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 04:43:21,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 457 transitions. [2020-10-16 04:43:21,161 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8704761904761905 [2020-10-16 04:43:21,162 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 457 transitions. [2020-10-16 04:43:21,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 457 transitions. [2020-10-16 04:43:21,162 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:43:21,162 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 457 transitions. [2020-10-16 04:43:21,163 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 04:43:21,164 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 04:43:21,164 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 04:43:21,165 INFO L185 Difference]: Start difference. First operand has 33 places, 22 transitions, 58 flow. Second operand 3 states and 457 transitions. [2020-10-16 04:43:21,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 24 transitions, 74 flow [2020-10-16 04:43:21,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 24 transitions, 70 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 04:43:21,166 INFO L241 Difference]: Finished difference. Result has 33 places, 24 transitions, 73 flow [2020-10-16 04:43:21,166 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=73, PETRI_PLACES=33, PETRI_TRANSITIONS=24} [2020-10-16 04:43:21,167 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, -1 predicate places. [2020-10-16 04:43:21,167 INFO L481 AbstractCegarLoop]: Abstraction has has 33 places, 24 transitions, 73 flow [2020-10-16 04:43:21,167 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 04:43:21,167 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:43:21,167 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:43:21,167 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 04:43:21,167 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:43:21,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:43:21,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1714115059, now seen corresponding path program 1 times [2020-10-16 04:43:21,168 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:43:21,168 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455140563] [2020-10-16 04:43:21,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:43:21,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:43:21,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:43:21,246 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455140563] [2020-10-16 04:43:21,247 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:43:21,247 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 04:43:21,247 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842609993] [2020-10-16 04:43:21,247 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 04:43:21,247 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:43:21,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 04:43:21,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 04:43:21,249 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 175 [2020-10-16 04:43:21,250 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 73 flow. Second operand 4 states. [2020-10-16 04:43:21,250 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:43:21,250 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 175 [2020-10-16 04:43:21,250 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:43:21,308 INFO L129 PetriNetUnfolder]: 45/120 cut-off events. [2020-10-16 04:43:21,309 INFO L130 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2020-10-16 04:43:21,310 INFO L80 FinitePrefix]: Finished finitePrefix Result has 247 conditions, 120 events. 45/120 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 519 event pairs, 20 based on Foata normal form. 10/120 useless extension candidates. Maximal degree in co-relation 236. Up to 60 conditions per place. [2020-10-16 04:43:21,311 INFO L132 encePairwiseOnDemand]: 169/175 looper letters, 7 selfloop transitions, 7 changer transitions 2/34 dead transitions. [2020-10-16 04:43:21,311 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 34 transitions, 125 flow [2020-10-16 04:43:21,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 04:43:21,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 04:43:21,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 713 transitions. [2020-10-16 04:43:21,314 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8148571428571428 [2020-10-16 04:43:21,314 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 713 transitions. [2020-10-16 04:43:21,315 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 713 transitions. [2020-10-16 04:43:21,315 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:43:21,315 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 713 transitions. [2020-10-16 04:43:21,317 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 04:43:21,318 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 04:43:21,318 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 04:43:21,319 INFO L185 Difference]: Start difference. First operand has 33 places, 24 transitions, 73 flow. Second operand 5 states and 713 transitions. [2020-10-16 04:43:21,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 34 transitions, 125 flow [2020-10-16 04:43:21,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 34 transitions, 122 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 04:43:21,321 INFO L241 Difference]: Finished difference. Result has 39 places, 30 transitions, 124 flow [2020-10-16 04:43:21,321 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=124, PETRI_PLACES=39, PETRI_TRANSITIONS=30} [2020-10-16 04:43:21,321 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 5 predicate places. [2020-10-16 04:43:21,321 INFO L481 AbstractCegarLoop]: Abstraction has has 39 places, 30 transitions, 124 flow [2020-10-16 04:43:21,322 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 04:43:21,322 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:43:21,322 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:43:21,322 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 04:43:21,322 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:43:21,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:43:21,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1453193263, now seen corresponding path program 1 times [2020-10-16 04:43:21,323 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:43:21,323 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965846787] [2020-10-16 04:43:21,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:43:21,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:43:21,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:43:21,368 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965846787] [2020-10-16 04:43:21,368 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:43:21,368 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 04:43:21,369 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150911184] [2020-10-16 04:43:21,369 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 04:43:21,369 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:43:21,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 04:43:21,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 04:43:21,371 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 175 [2020-10-16 04:43:21,371 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 124 flow. Second operand 3 states. [2020-10-16 04:43:21,371 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:43:21,372 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 175 [2020-10-16 04:43:21,372 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:43:21,401 INFO L129 PetriNetUnfolder]: 54/145 cut-off events. [2020-10-16 04:43:21,402 INFO L130 PetriNetUnfolder]: For 137/164 co-relation queries the response was YES. [2020-10-16 04:43:21,403 INFO L80 FinitePrefix]: Finished finitePrefix Result has 410 conditions, 145 events. 54/145 cut-off events. For 137/164 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 700 event pairs, 25 based on Foata normal form. 10/143 useless extension candidates. Maximal degree in co-relation 395. Up to 93 conditions per place. [2020-10-16 04:43:21,404 INFO L132 encePairwiseOnDemand]: 172/175 looper letters, 3 selfloop transitions, 3 changer transitions 3/30 dead transitions. [2020-10-16 04:43:21,404 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 30 transitions, 136 flow [2020-10-16 04:43:21,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 04:43:21,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 04:43:21,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 456 transitions. [2020-10-16 04:43:21,406 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8685714285714285 [2020-10-16 04:43:21,407 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 456 transitions. [2020-10-16 04:43:21,407 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 456 transitions. [2020-10-16 04:43:21,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:43:21,407 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 456 transitions. [2020-10-16 04:43:21,408 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 04:43:21,409 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 04:43:21,410 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 04:43:21,410 INFO L185 Difference]: Start difference. First operand has 39 places, 30 transitions, 124 flow. Second operand 3 states and 456 transitions. [2020-10-16 04:43:21,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 30 transitions, 136 flow [2020-10-16 04:43:21,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 30 transitions, 132 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 04:43:21,413 INFO L241 Difference]: Finished difference. Result has 41 places, 27 transitions, 113 flow [2020-10-16 04:43:21,413 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=113, PETRI_PLACES=41, PETRI_TRANSITIONS=27} [2020-10-16 04:43:21,414 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 7 predicate places. [2020-10-16 04:43:21,414 INFO L481 AbstractCegarLoop]: Abstraction has has 41 places, 27 transitions, 113 flow [2020-10-16 04:43:21,414 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 04:43:21,414 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:43:21,414 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:43:21,415 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 04:43:21,415 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:43:21,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:43:21,415 INFO L82 PathProgramCache]: Analyzing trace with hash -541231140, now seen corresponding path program 1 times [2020-10-16 04:43:21,415 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:43:21,416 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776329605] [2020-10-16 04:43:21,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:43:21,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:43:21,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:43:21,465 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776329605] [2020-10-16 04:43:21,465 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:43:21,465 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 04:43:21,465 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802489563] [2020-10-16 04:43:21,466 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 04:43:21,466 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:43:21,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 04:43:21,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 04:43:21,469 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 175 [2020-10-16 04:43:21,469 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 27 transitions, 113 flow. Second operand 4 states. [2020-10-16 04:43:21,469 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:43:21,469 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 175 [2020-10-16 04:43:21,469 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:43:21,530 INFO L129 PetriNetUnfolder]: 109/272 cut-off events. [2020-10-16 04:43:21,530 INFO L130 PetriNetUnfolder]: For 363/439 co-relation queries the response was YES. [2020-10-16 04:43:21,532 INFO L80 FinitePrefix]: Finished finitePrefix Result has 751 conditions, 272 events. 109/272 cut-off events. For 363/439 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 1562 event pairs, 51 based on Foata normal form. 13/253 useless extension candidates. Maximal degree in co-relation 735. Up to 175 conditions per place. [2020-10-16 04:43:21,534 INFO L132 encePairwiseOnDemand]: 172/175 looper letters, 5 selfloop transitions, 2 changer transitions 0/29 dead transitions. [2020-10-16 04:43:21,534 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 29 transitions, 132 flow [2020-10-16 04:43:21,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 04:43:21,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 04:43:21,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 584 transitions. [2020-10-16 04:43:21,537 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8342857142857143 [2020-10-16 04:43:21,537 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 584 transitions. [2020-10-16 04:43:21,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 584 transitions. [2020-10-16 04:43:21,538 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:43:21,538 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 584 transitions. [2020-10-16 04:43:21,539 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 04:43:21,541 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 04:43:21,541 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 04:43:21,541 INFO L185 Difference]: Start difference. First operand has 41 places, 27 transitions, 113 flow. Second operand 4 states and 584 transitions. [2020-10-16 04:43:21,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 29 transitions, 132 flow [2020-10-16 04:43:21,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 29 transitions, 125 flow, removed 2 selfloop flow, removed 2 redundant places. [2020-10-16 04:43:21,545 INFO L241 Difference]: Finished difference. Result has 42 places, 28 transitions, 119 flow [2020-10-16 04:43:21,545 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=119, PETRI_PLACES=42, PETRI_TRANSITIONS=28} [2020-10-16 04:43:21,546 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 8 predicate places. [2020-10-16 04:43:21,546 INFO L481 AbstractCegarLoop]: Abstraction has has 42 places, 28 transitions, 119 flow [2020-10-16 04:43:21,546 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 04:43:21,546 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:43:21,546 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:43:21,546 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 04:43:21,547 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:43:21,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:43:21,547 INFO L82 PathProgramCache]: Analyzing trace with hash -463961700, now seen corresponding path program 2 times [2020-10-16 04:43:21,547 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:43:21,548 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731001812] [2020-10-16 04:43:21,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:43:21,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:43:21,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:43:21,628 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731001812] [2020-10-16 04:43:21,629 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:43:21,629 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 04:43:21,629 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020209510] [2020-10-16 04:43:21,629 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 04:43:21,630 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:43:21,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 04:43:21,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 04:43:21,632 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 175 [2020-10-16 04:43:21,633 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 28 transitions, 119 flow. Second operand 5 states. [2020-10-16 04:43:21,633 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:43:21,633 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 175 [2020-10-16 04:43:21,633 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:43:21,744 INFO L129 PetriNetUnfolder]: 64/191 cut-off events. [2020-10-16 04:43:21,745 INFO L130 PetriNetUnfolder]: For 169/262 co-relation queries the response was YES. [2020-10-16 04:43:21,746 INFO L80 FinitePrefix]: Finished finitePrefix Result has 650 conditions, 191 events. 64/191 cut-off events. For 169/262 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 978 event pairs, 8 based on Foata normal form. 42/221 useless extension candidates. Maximal degree in co-relation 633. Up to 133 conditions per place. [2020-10-16 04:43:21,747 INFO L132 encePairwiseOnDemand]: 169/175 looper letters, 5 selfloop transitions, 7 changer transitions 7/38 dead transitions. [2020-10-16 04:43:21,747 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 38 transitions, 215 flow [2020-10-16 04:43:21,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 04:43:21,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 04:43:21,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 855 transitions. [2020-10-16 04:43:21,753 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8142857142857143 [2020-10-16 04:43:21,753 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 855 transitions. [2020-10-16 04:43:21,753 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 855 transitions. [2020-10-16 04:43:21,754 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:43:21,755 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 855 transitions. [2020-10-16 04:43:21,757 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 04:43:21,760 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 04:43:21,760 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 04:43:21,760 INFO L185 Difference]: Start difference. First operand has 42 places, 28 transitions, 119 flow. Second operand 6 states and 855 transitions. [2020-10-16 04:43:21,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 38 transitions, 215 flow [2020-10-16 04:43:21,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 38 transitions, 214 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 04:43:21,762 INFO L241 Difference]: Finished difference. Result has 49 places, 31 transitions, 174 flow [2020-10-16 04:43:21,763 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=174, PETRI_PLACES=49, PETRI_TRANSITIONS=31} [2020-10-16 04:43:21,763 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 15 predicate places. [2020-10-16 04:43:21,763 INFO L481 AbstractCegarLoop]: Abstraction has has 49 places, 31 transitions, 174 flow [2020-10-16 04:43:21,763 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 04:43:21,763 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:43:21,763 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:43:21,763 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 04:43:21,763 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:43:21,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:43:21,764 INFO L82 PathProgramCache]: Analyzing trace with hash -402736260, now seen corresponding path program 1 times [2020-10-16 04:43:21,764 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:43:21,764 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752119233] [2020-10-16 04:43:21,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:43:21,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:43:21,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:43:21,920 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752119233] [2020-10-16 04:43:21,920 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:43:21,920 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 04:43:21,920 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2222767] [2020-10-16 04:43:21,921 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 04:43:21,922 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:43:21,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 04:43:21,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 04:43:21,924 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 175 [2020-10-16 04:43:21,924 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 31 transitions, 174 flow. Second operand 6 states. [2020-10-16 04:43:21,924 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:43:21,925 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 175 [2020-10-16 04:43:21,925 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:43:21,994 INFO L129 PetriNetUnfolder]: 28/111 cut-off events. [2020-10-16 04:43:21,994 INFO L130 PetriNetUnfolder]: For 288/392 co-relation queries the response was YES. [2020-10-16 04:43:21,995 INFO L80 FinitePrefix]: Finished finitePrefix Result has 487 conditions, 111 events. 28/111 cut-off events. For 288/392 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 451 event pairs, 0 based on Foata normal form. 44/148 useless extension candidates. Maximal degree in co-relation 466. Up to 74 conditions per place. [2020-10-16 04:43:21,996 INFO L132 encePairwiseOnDemand]: 169/175 looper letters, 2 selfloop transitions, 10 changer transitions 7/35 dead transitions. [2020-10-16 04:43:21,996 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 35 transitions, 242 flow [2020-10-16 04:43:21,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 04:43:21,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 04:43:21,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 991 transitions. [2020-10-16 04:43:22,000 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8089795918367347 [2020-10-16 04:43:22,000 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 991 transitions. [2020-10-16 04:43:22,000 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 991 transitions. [2020-10-16 04:43:22,001 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:43:22,001 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 991 transitions. [2020-10-16 04:43:22,003 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 04:43:22,006 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 04:43:22,006 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 04:43:22,006 INFO L185 Difference]: Start difference. First operand has 49 places, 31 transitions, 174 flow. Second operand 7 states and 991 transitions. [2020-10-16 04:43:22,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 35 transitions, 242 flow [2020-10-16 04:43:22,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 35 transitions, 200 flow, removed 16 selfloop flow, removed 5 redundant places. [2020-10-16 04:43:22,010 INFO L241 Difference]: Finished difference. Result has 51 places, 28 transitions, 154 flow [2020-10-16 04:43:22,010 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=154, PETRI_PLACES=51, PETRI_TRANSITIONS=28} [2020-10-16 04:43:22,010 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 17 predicate places. [2020-10-16 04:43:22,011 INFO L481 AbstractCegarLoop]: Abstraction has has 51 places, 28 transitions, 154 flow [2020-10-16 04:43:22,011 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 04:43:22,011 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:43:22,011 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:43:22,011 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 04:43:22,011 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:43:22,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:43:22,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1700534403, now seen corresponding path program 1 times [2020-10-16 04:43:22,012 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:43:22,012 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789485909] [2020-10-16 04:43:22,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:43:22,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:43:22,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:43:22,187 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789485909] [2020-10-16 04:43:22,187 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:43:22,188 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 04:43:22,188 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946378088] [2020-10-16 04:43:22,188 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 04:43:22,189 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:43:22,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 04:43:22,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-16 04:43:22,190 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 175 [2020-10-16 04:43:22,191 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 28 transitions, 154 flow. Second operand 7 states. [2020-10-16 04:43:22,191 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:43:22,191 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 175 [2020-10-16 04:43:22,191 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:43:22,387 INFO L129 PetriNetUnfolder]: 29/115 cut-off events. [2020-10-16 04:43:22,387 INFO L130 PetriNetUnfolder]: For 146/156 co-relation queries the response was YES. [2020-10-16 04:43:22,388 INFO L80 FinitePrefix]: Finished finitePrefix Result has 348 conditions, 115 events. 29/115 cut-off events. For 146/156 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 454 event pairs, 1 based on Foata normal form. 1/112 useless extension candidates. Maximal degree in co-relation 331. Up to 35 conditions per place. [2020-10-16 04:43:22,389 INFO L132 encePairwiseOnDemand]: 168/175 looper letters, 7 selfloop transitions, 5 changer transitions 8/40 dead transitions. [2020-10-16 04:43:22,389 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 40 transitions, 224 flow [2020-10-16 04:43:22,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 04:43:22,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 04:43:22,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 910 transitions. [2020-10-16 04:43:22,393 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7428571428571429 [2020-10-16 04:43:22,393 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 910 transitions. [2020-10-16 04:43:22,393 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 910 transitions. [2020-10-16 04:43:22,394 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:43:22,394 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 910 transitions. [2020-10-16 04:43:22,396 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 04:43:22,398 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 04:43:22,398 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 04:43:22,398 INFO L185 Difference]: Start difference. First operand has 51 places, 28 transitions, 154 flow. Second operand 7 states and 910 transitions. [2020-10-16 04:43:22,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 40 transitions, 224 flow [2020-10-16 04:43:22,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 40 transitions, 170 flow, removed 17 selfloop flow, removed 10 redundant places. [2020-10-16 04:43:22,402 INFO L241 Difference]: Finished difference. Result has 48 places, 31 transitions, 145 flow [2020-10-16 04:43:22,402 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=145, PETRI_PLACES=48, PETRI_TRANSITIONS=31} [2020-10-16 04:43:22,402 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 14 predicate places. [2020-10-16 04:43:22,403 INFO L481 AbstractCegarLoop]: Abstraction has has 48 places, 31 transitions, 145 flow [2020-10-16 04:43:22,403 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 04:43:22,403 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:43:22,403 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:43:22,403 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 04:43:22,403 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:43:22,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:43:22,404 INFO L82 PathProgramCache]: Analyzing trace with hash 569048305, now seen corresponding path program 2 times [2020-10-16 04:43:22,404 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:43:22,404 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431554028] [2020-10-16 04:43:22,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:43:22,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:43:22,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:43:22,698 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431554028] [2020-10-16 04:43:22,698 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:43:22,699 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 04:43:22,699 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219951860] [2020-10-16 04:43:22,699 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 04:43:22,699 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:43:22,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 04:43:22,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-16 04:43:22,701 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 175 [2020-10-16 04:43:22,702 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 31 transitions, 145 flow. Second operand 7 states. [2020-10-16 04:43:22,702 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:43:22,702 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 175 [2020-10-16 04:43:22,702 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:43:22,878 INFO L129 PetriNetUnfolder]: 22/99 cut-off events. [2020-10-16 04:43:22,878 INFO L130 PetriNetUnfolder]: For 97/126 co-relation queries the response was YES. [2020-10-16 04:43:22,879 INFO L80 FinitePrefix]: Finished finitePrefix Result has 314 conditions, 99 events. 22/99 cut-off events. For 97/126 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 354 event pairs, 3 based on Foata normal form. 9/106 useless extension candidates. Maximal degree in co-relation 300. Up to 28 conditions per place. [2020-10-16 04:43:22,880 INFO L132 encePairwiseOnDemand]: 169/175 looper letters, 6 selfloop transitions, 3 changer transitions 8/37 dead transitions. [2020-10-16 04:43:22,880 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 37 transitions, 212 flow [2020-10-16 04:43:22,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 04:43:22,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 04:43:22,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 864 transitions. [2020-10-16 04:43:22,883 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7053061224489796 [2020-10-16 04:43:22,884 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 864 transitions. [2020-10-16 04:43:22,884 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 864 transitions. [2020-10-16 04:43:22,885 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:43:22,885 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 864 transitions. [2020-10-16 04:43:22,887 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 04:43:22,889 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 04:43:22,889 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 04:43:22,890 INFO L185 Difference]: Start difference. First operand has 48 places, 31 transitions, 145 flow. Second operand 7 states and 864 transitions. [2020-10-16 04:43:22,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 37 transitions, 212 flow [2020-10-16 04:43:22,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 37 transitions, 196 flow, removed 5 selfloop flow, removed 4 redundant places. [2020-10-16 04:43:22,893 INFO L241 Difference]: Finished difference. Result has 50 places, 28 transitions, 128 flow [2020-10-16 04:43:22,893 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=128, PETRI_PLACES=50, PETRI_TRANSITIONS=28} [2020-10-16 04:43:22,893 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 16 predicate places. [2020-10-16 04:43:22,893 INFO L481 AbstractCegarLoop]: Abstraction has has 50 places, 28 transitions, 128 flow [2020-10-16 04:43:22,893 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 04:43:22,894 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:43:22,894 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:43:22,894 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 04:43:22,894 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:43:22,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:43:22,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1671681411, now seen corresponding path program 3 times [2020-10-16 04:43:22,895 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:43:22,895 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422451951] [2020-10-16 04:43:22,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:43:22,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 04:43:22,976 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 04:43:23,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 04:43:23,086 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 04:43:23,142 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 04:43:23,143 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 04:43:23,143 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 04:43:23,144 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-16 04:43:23,161 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1008] [1008] L3-->L843: Formula: (let ((.cse7 (= (mod ~z$r_buff1_thd0~0_In159240294 256) 0)) (.cse6 (= (mod ~z$w_buff1_used~0_In159240294 256) 0)) (.cse8 (= (mod ~z$r_buff0_thd0~0_In159240294 256) 0)) (.cse9 (= (mod ~z$w_buff0_used~0_In159240294 256) 0))) (let ((.cse0 (or .cse8 .cse9)) (.cse4 (not .cse9)) (.cse5 (not .cse8)) (.cse3 (or .cse7 .cse6)) (.cse1 (not .cse7)) (.cse2 (not .cse6))) (and (= ~z$r_buff1_thd0~0_In159240294 ~z$r_buff1_thd0~0_Out159240294) (or (and .cse0 (or (and (= ~z$w_buff1~0_In159240294 ~z~0_Out159240294) .cse1 .cse2) (and (= ~z~0_In159240294 ~z~0_Out159240294) .cse3))) (and .cse4 (= ~z$w_buff0~0_In159240294 ~z~0_Out159240294) .cse5)) (or (and (= ~z$w_buff0_used~0_Out159240294 ~z$w_buff0_used~0_In159240294) .cse0) (and (= ~z$w_buff0_used~0_Out159240294 0) .cse4 .cse5)) (or (and .cse3 (= ~z$w_buff1_used~0_Out159240294 ~z$w_buff1_used~0_In159240294)) (and (= ~z$w_buff1_used~0_Out159240294 0) .cse1 .cse2)) (not (= ULTIMATE.start_assume_abort_if_not_~cond_In159240294 0)) (= ~z$r_buff0_thd0~0_In159240294 ~z$r_buff0_thd0~0_Out159240294)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In159240294, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In159240294, ~z$w_buff0_used~0=~z$w_buff0_used~0_In159240294, ~z$w_buff0~0=~z$w_buff0~0_In159240294, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In159240294, ~z$w_buff1_used~0=~z$w_buff1_used~0_In159240294, ~z$w_buff1~0=~z$w_buff1~0_In159240294, ~z~0=~z~0_In159240294} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_Out159240294, ~z$w_buff0~0=~z$w_buff0~0_In159240294, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out159240294, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out159240294|, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out159240294|, ~z$w_buff1~0=~z$w_buff1~0_In159240294, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out159240294|, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out159240294|, ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out159240294|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_Out159240294, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out159240294|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In159240294, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out159240294, ~z~0=~z~0_Out159240294} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite51, ~z$w_buff0_used~0, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite48, ~z~0] because there is no mapped edge [2020-10-16 04:43:23,167 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:43:23,167 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:43:23,178 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:43:23,179 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:43:23,179 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:43:23,179 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:43:23,179 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:43:23,179 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:43:23,179 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:43:23,179 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:43:23,180 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:43:23,180 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:43:23,180 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:43:23,180 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:43:23,180 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:43:23,181 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:43:23,181 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:43:23,181 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:43:23,181 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:43:23,181 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:43:23,181 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:43:23,181 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:43:23,181 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:43:23,182 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:43:23,182 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:43:23,182 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:43:23,182 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:43:23,182 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:43:23,182 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:43:23,182 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:43:23,182 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:43:23,183 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:43:23,188 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:43:23,189 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:43:23,189 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:43:23,189 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:43:23,189 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:43:23,189 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:43:23,189 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:43:23,190 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:43:23,190 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:43:23,190 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:43:23,190 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:43:23,190 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:43:23,191 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:43:23,191 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:43:23,191 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:43:23,191 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:43:23,192 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:43:23,192 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:43:23,192 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:43:23,192 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:43:23,192 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:43:23,192 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:43:23,192 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:43:23,192 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:43:23,303 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 04:43:23 BasicIcfg [2020-10-16 04:43:23,303 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 04:43:23,306 INFO L168 Benchmark]: Toolchain (without parser) took 10252.32 ms. Allocated memory was 253.2 MB in the beginning and 495.5 MB in the end (delta: 242.2 MB). Free memory was 206.1 MB in the beginning and 225.9 MB in the end (delta: -19.8 MB). Peak memory consumption was 222.4 MB. Max. memory is 14.2 GB. [2020-10-16 04:43:23,306 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 253.2 MB. Free memory is still 227.1 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-16 04:43:23,308 INFO L168 Benchmark]: CACSL2BoogieTranslator took 764.17 ms. Allocated memory was 253.2 MB in the beginning and 319.8 MB in the end (delta: 66.6 MB). Free memory was 206.1 MB in the beginning and 270.6 MB in the end (delta: -64.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 14.2 GB. [2020-10-16 04:43:23,308 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.24 ms. Allocated memory is still 319.8 MB. Free memory was 270.6 MB in the beginning and 265.5 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 14.2 GB. [2020-10-16 04:43:23,309 INFO L168 Benchmark]: Boogie Preprocessor took 53.73 ms. Allocated memory is still 319.8 MB. Free memory is still 265.5 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-16 04:43:23,311 INFO L168 Benchmark]: RCFGBuilder took 2044.03 ms. Allocated memory was 319.8 MB in the beginning and 360.2 MB in the end (delta: 40.4 MB). Free memory was 265.5 MB in the beginning and 190.4 MB in the end (delta: 75.1 MB). Peak memory consumption was 115.5 MB. Max. memory is 14.2 GB. [2020-10-16 04:43:23,314 INFO L168 Benchmark]: TraceAbstraction took 7313.83 ms. Allocated memory was 360.2 MB in the beginning and 495.5 MB in the end (delta: 135.3 MB). Free memory was 190.4 MB in the beginning and 225.9 MB in the end (delta: -35.4 MB). Peak memory consumption was 99.8 MB. Max. memory is 14.2 GB. [2020-10-16 04:43:23,321 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.23 ms. Allocated memory is still 253.2 MB. Free memory is still 227.1 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 764.17 ms. Allocated memory was 253.2 MB in the beginning and 319.8 MB in the end (delta: 66.6 MB). Free memory was 206.1 MB in the beginning and 270.6 MB in the end (delta: -64.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 67.24 ms. Allocated memory is still 319.8 MB. Free memory was 270.6 MB in the beginning and 265.5 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 53.73 ms. Allocated memory is still 319.8 MB. Free memory is still 265.5 MB. There was no memory consumed. Max. memory is 14.2 GB. * RCFGBuilder took 2044.03 ms. Allocated memory was 319.8 MB in the beginning and 360.2 MB in the end (delta: 40.4 MB). Free memory was 265.5 MB in the beginning and 190.4 MB in the end (delta: 75.1 MB). Peak memory consumption was 115.5 MB. Max. memory is 14.2 GB. * TraceAbstraction took 7313.83 ms. Allocated memory was 360.2 MB in the beginning and 495.5 MB in the end (delta: 135.3 MB). Free memory was 190.4 MB in the beginning and 225.9 MB in the end (delta: -35.4 MB). Peak memory consumption was 99.8 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1129 VarBasedMoverChecksPositive, 100 VarBasedMoverChecksNegative, 38 SemBasedMoverChecksPositive, 62 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.7s, 149 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 4.2s, 100 PlacesBefore, 34 PlacesAfterwards, 92 TransitionsBefore, 25 TransitionsAfterwards, 1732 CoEnabledTransitionPairs, 7 FixpointIterations, 33 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 80 TotalNumberOfCompositions, 5456 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L698] 0 int __unbuffered_cnt = 0; [L700] 0 int __unbuffered_p1_EAX = 0; [L702] 0 int __unbuffered_p2_EAX = 0; [L704] 0 int __unbuffered_p2_EBX = 0; [L705] 0 _Bool main$tmp_guard0; [L706] 0 _Bool main$tmp_guard1; [L708] 0 int x = 0; [L710] 0 int y = 0; [L712] 0 int z = 0; [L713] 0 _Bool z$flush_delayed; [L714] 0 int z$mem_tmp; [L715] 0 _Bool z$r_buff0_thd0; [L716] 0 _Bool z$r_buff0_thd1; [L717] 0 _Bool z$r_buff0_thd2; [L718] 0 _Bool z$r_buff0_thd3; [L719] 0 _Bool z$r_buff1_thd0; [L720] 0 _Bool z$r_buff1_thd1; [L721] 0 _Bool z$r_buff1_thd2; [L722] 0 _Bool z$r_buff1_thd3; [L723] 0 _Bool z$read_delayed; [L724] 0 int *z$read_delayed_var; [L725] 0 int z$w_buff0; [L726] 0 _Bool z$w_buff0_used; [L727] 0 int z$w_buff1; [L728] 0 _Bool z$w_buff1_used; [L729] 0 _Bool weak$$choice0; [L730] 0 _Bool weak$$choice2; [L827] 0 pthread_t t497; [L828] FCALL, FORK 0 pthread_create(&t497, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L734] 1 z$w_buff1 = z$w_buff0 [L735] 1 z$w_buff0 = 1 [L736] 1 z$w_buff1_used = z$w_buff0_used [L737] 1 z$w_buff0_used = (_Bool)1 [L7] COND TRUE 1 !expression [L7] 1 __VERIFIER_error() [L739] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L740] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L741] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L742] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L743] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L829] 0 pthread_t t498; [L830] FCALL, FORK 0 pthread_create(&t498, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L831] 0 pthread_t t499; [L832] FCALL, FORK 0 pthread_create(&t499, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L746] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L763] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L783] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __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, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L786] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __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, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L769] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L770] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L770] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L771] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L771] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L772] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L772] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L773] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L773] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L789] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L790] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L791] 3 z$flush_delayed = weak$$choice2 [L792] 3 z$mem_tmp = z [L793] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L793] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L794] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L794] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0) [L794] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0 [L794] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0) [L794] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L794] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L795] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L795] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L796] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L796] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L797] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L797] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L798] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L798] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L799] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L799] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L800] 3 __unbuffered_p2_EBX = z [L801] EXPR 3 z$flush_delayed ? z$mem_tmp : z [L801] 3 z = z$flush_delayed ? z$mem_tmp : z [L802] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __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=7, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L805] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L805] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L805] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L805] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L806] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L806] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L807] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L807] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L808] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L808] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L809] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L809] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L749] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L749] EXPR 1 z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z [L749] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L749] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L750] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L750] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L751] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L751] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L752] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L752] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L753] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L753] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L776] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L778] 2 return 0; [L812] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L814] 3 return 0; [L834] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L845] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __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=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 94 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 7.0s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.3s, HoareTripleCheckerStatistics: 37 SDtfs, 20 SDslu, 22 SDs, 0 SdLazy, 224 SolverSat, 35 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=174occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 164 NumberOfCodeBlocks, 164 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 132 ConstructedInterpolants, 0 QuantifiedInterpolants, 14523 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...