/usr/bin/java -Xmx8000000000 -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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix034_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-c7e336b [2020-10-05 22:41:43,648 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-05 22:41:43,651 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-05 22:41:43,690 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-05 22:41:43,690 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-05 22:41:43,698 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-05 22:41:43,701 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-05 22:41:43,705 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-05 22:41:43,707 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-05 22:41:43,710 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-05 22:41:43,711 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-05 22:41:43,712 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-05 22:41:43,712 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-05 22:41:43,715 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-05 22:41:43,717 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-05 22:41:43,718 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-05 22:41:43,720 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-05 22:41:43,721 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-05 22:41:43,722 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-05 22:41:43,731 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-05 22:41:43,733 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-05 22:41:43,734 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-05 22:41:43,735 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-05 22:41:43,735 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-05 22:41:43,747 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-05 22:41:43,747 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-05 22:41:43,747 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-05 22:41:43,748 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-05 22:41:43,748 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-05 22:41:43,749 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-05 22:41:43,749 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-05 22:41:43,750 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-05 22:41:43,751 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-05 22:41:43,751 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-05 22:41:43,752 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-05 22:41:43,752 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-05 22:41:43,753 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-05 22:41:43,753 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-05 22:41:43,753 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-05 22:41:43,754 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-05 22:41:43,755 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-05 22:41:43,755 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-05 22:41:43,779 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-05 22:41:43,779 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-05 22:41:43,780 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-05 22:41:43,780 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-05 22:41:43,780 INFO L138 SettingsManager]: * Use SBE=true [2020-10-05 22:41:43,781 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-05 22:41:43,781 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-05 22:41:43,781 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-05 22:41:43,781 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-05 22:41:43,782 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-05 22:41:43,782 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-05 22:41:43,782 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-05 22:41:43,782 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-05 22:41:43,782 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-05 22:41:43,782 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-05 22:41:43,783 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-05 22:41:43,783 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-05 22:41:43,783 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-05 22:41:43,783 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-05 22:41:43,784 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-05 22:41:43,784 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-05 22:41:43,784 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-05 22:41:43,784 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-05 22:41:43,784 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-05 22:41:43,785 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-05 22:41:43,785 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-05 22:41:43,785 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-05 22:41:43,785 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-05 22:41:43,785 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-05 22:41:43,785 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-05 22:41:44,104 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-05 22:41:44,119 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-05 22:41:44,123 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-05 22:41:44,125 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-05 22:41:44,125 INFO L275 PluginConnector]: CDTParser initialized [2020-10-05 22:41:44,126 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix034_power.opt.i [2020-10-05 22:41:44,198 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2177a1829/71f016c0b0da40c29d37374c6a2896e6/FLAG5a8c54337 [2020-10-05 22:41:44,748 INFO L306 CDTParser]: Found 1 translation units. [2020-10-05 22:41:44,749 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix034_power.opt.i [2020-10-05 22:41:44,767 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2177a1829/71f016c0b0da40c29d37374c6a2896e6/FLAG5a8c54337 [2020-10-05 22:41:45,028 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2177a1829/71f016c0b0da40c29d37374c6a2896e6 [2020-10-05 22:41:45,038 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-05 22:41:45,040 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-05 22:41:45,041 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-05 22:41:45,041 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-05 22:41:45,045 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-05 22:41:45,046 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 10:41:45" (1/1) ... [2020-10-05 22:41:45,049 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b745360 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:41:45, skipping insertion in model container [2020-10-05 22:41:45,049 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 10:41:45" (1/1) ... [2020-10-05 22:41:45,057 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-05 22:41:45,119 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-05 22:41:45,694 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-05 22:41:45,712 INFO L203 MainTranslator]: Completed pre-run [2020-10-05 22:41:45,793 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-05 22:41:45,884 INFO L208 MainTranslator]: Completed translation [2020-10-05 22:41:45,885 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:41:45 WrapperNode [2020-10-05 22:41:45,885 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-05 22:41:45,886 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-05 22:41:45,886 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-05 22:41:45,886 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-05 22:41:45,895 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:41:45" (1/1) ... [2020-10-05 22:41:45,915 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:41:45" (1/1) ... [2020-10-05 22:41:45,952 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-05 22:41:45,954 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-05 22:41:45,955 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-05 22:41:45,955 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-05 22:41:45,966 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:41:45" (1/1) ... [2020-10-05 22:41:45,966 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:41:45" (1/1) ... [2020-10-05 22:41:45,972 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:41:45" (1/1) ... [2020-10-05 22:41:45,972 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:41:45" (1/1) ... [2020-10-05 22:41:45,993 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:41:45" (1/1) ... [2020-10-05 22:41:45,999 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:41:45" (1/1) ... [2020-10-05 22:41:46,003 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:41:45" (1/1) ... [2020-10-05 22:41:46,007 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-05 22:41:46,008 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-05 22:41:46,008 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-05 22:41:46,008 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-05 22:41:46,009 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:41:45" (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-05 22:41:46,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-05 22:41:46,072 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-05 22:41:46,073 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-05 22:41:46,073 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-05 22:41:46,073 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-05 22:41:46,073 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-05 22:41:46,073 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-05 22:41:46,074 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-05 22:41:46,074 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-05 22:41:46,074 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-05 22:41:46,074 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-05 22:41:46,076 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-05 22:41:47,976 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-05 22:41:47,977 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-05 22:41:47,979 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 10:41:47 BoogieIcfgContainer [2020-10-05 22:41:47,979 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-05 22:41:47,981 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-05 22:41:47,981 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-05 22:41:47,984 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-05 22:41:47,985 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.10 10:41:45" (1/3) ... [2020-10-05 22:41:47,986 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31f53880 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 10:41:47, skipping insertion in model container [2020-10-05 22:41:47,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:41:45" (2/3) ... [2020-10-05 22:41:47,987 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31f53880 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 10:41:47, skipping insertion in model container [2020-10-05 22:41:47,987 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 10:41:47" (3/3) ... [2020-10-05 22:41:47,990 INFO L109 eAbstractionObserver]: Analyzing ICFG mix034_power.opt.i [2020-10-05 22:41:48,000 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-05 22:41:48,001 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-05 22:41:48,009 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-05 22:41:48,010 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-05 22:41:48,053 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,054 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,054 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,054 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,054 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,055 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,055 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,055 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,055 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,056 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,056 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,056 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,056 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,056 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,056 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,057 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,057 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,058 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,058 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,058 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,058 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,058 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,059 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,059 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,059 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,059 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,059 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,059 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,060 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,060 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,060 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,060 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,060 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,060 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,060 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,061 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,061 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,061 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,062 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,062 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,062 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,063 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,064 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,064 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,064 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,065 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,065 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,065 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,065 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,065 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,066 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,066 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,066 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,066 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,066 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,066 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,067 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,067 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,067 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,069 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,069 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,070 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,070 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,070 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,070 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,070 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,071 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,071 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,079 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,079 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,079 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,080 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,080 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,080 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,080 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,081 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,081 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,081 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,081 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,082 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,086 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,087 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,087 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,087 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,088 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,088 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,088 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,089 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,089 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,089 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,089 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,089 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,090 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,090 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,090 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,091 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,091 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,091 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,091 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,091 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,092 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,092 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,093 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,093 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,095 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,096 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,096 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,096 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,096 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,097 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,097 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,098 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,098 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:41:48,121 INFO L251 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-10-05 22:41:48,152 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-05 22:41:48,152 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-05 22:41:48,153 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-05 22:41:48,153 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-05 22:41:48,153 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-05 22:41:48,153 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-05 22:41:48,153 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-05 22:41:48,153 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-05 22:41:48,179 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 85 places, 80 transitions, 170 flow [2020-10-05 22:41:48,182 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 85 places, 80 transitions, 170 flow [2020-10-05 22:41:48,255 INFO L129 PetriNetUnfolder]: 2/78 cut-off events. [2020-10-05 22:41:48,256 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-05 22:41:48,262 INFO L80 FinitePrefix]: Finished finitePrefix Result has 85 conditions, 78 events. 2/78 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 46 event pairs, 0 based on Foata normal form. 0/74 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2020-10-05 22:41:48,268 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 85 places, 80 transitions, 170 flow [2020-10-05 22:41:48,311 INFO L129 PetriNetUnfolder]: 2/78 cut-off events. [2020-10-05 22:41:48,311 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-05 22:41:48,312 INFO L80 FinitePrefix]: Finished finitePrefix Result has 85 conditions, 78 events. 2/78 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 46 event pairs, 0 based on Foata normal form. 0/74 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2020-10-05 22:41:48,314 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1024 [2020-10-05 22:41:48,316 INFO L170 etLargeBlockEncoding]: Semantic Check. [2020-10-05 22:41:48,529 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:48,529 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:48,544 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-05 22:41:48,545 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:41:48,550 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:41:48,550 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:41:48,554 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-05 22:41:48,554 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:41:48,560 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-05 22:41:48,561 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:41:48,566 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-05 22:41:48,567 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:41:48,578 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-05 22:41:48,579 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:41:48,686 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:41:48,687 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-05 22:41:48,695 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-05 22:41:48,695 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:41:48,738 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:48,739 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:48,743 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:48,744 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:48,747 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:48,747 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:41:48,752 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:41:48,753 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:41:48,771 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:41:48,771 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:48,772 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:48,773 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:48,775 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:48,776 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:41:48,778 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:41:48,779 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:41:49,035 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:41:49,036 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:49,037 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:49,038 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:49,040 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:49,040 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:41:49,042 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:41:49,043 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:41:49,063 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:41:49,064 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:49,065 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:49,065 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:49,067 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:49,068 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:41:49,070 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:41:49,070 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:41:49,175 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:41:49,175 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-05 22:41:49,177 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-05 22:41:49,178 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:41:49,241 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:49,241 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:49,250 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-05 22:41:49,250 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:41:49,252 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:41:49,253 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:41:49,254 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-05 22:41:49,254 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:41:49,256 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-05 22:41:49,256 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:41:49,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-05 22:41:49,258 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:41:49,259 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-05 22:41:49,259 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:41:49,296 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:41:49,296 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:49,297 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:49,297 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:49,299 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:49,300 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:41:49,302 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:41:49,302 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:41:49,318 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:41:49,318 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:49,319 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:49,319 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:49,321 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:49,322 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:41:49,323 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:41:49,324 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:41:49,479 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 38 [2020-10-05 22:41:49,575 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:41:49,575 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:49,576 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:49,577 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:49,578 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:49,579 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:41:49,581 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:41:49,582 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:41:49,602 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:49,603 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:49,603 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:49,604 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:49,606 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:49,606 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:41:49,610 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:41:49,610 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:41:49,683 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-05 22:41:49,684 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:41:49,685 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-10-05 22:41:49,685 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:41:49,686 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-10-05 22:41:49,686 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:41:49,736 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-05 22:41:49,736 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:50,152 WARN L193 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-10-05 22:41:50,397 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-05 22:41:50,398 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:41:50,399 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-10-05 22:41:50,400 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:41:50,401 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-10-05 22:41:50,401 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:41:50,498 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-05 22:41:50,498 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:50,575 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:50,576 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:50,577 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:50,577 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:50,578 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:50,579 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:41:50,581 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:41:50,581 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:41:50,592 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:41:50,593 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:50,593 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:50,594 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:50,595 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:50,595 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:41:50,597 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:41:50,597 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:41:50,670 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:41:50,671 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:50,672 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:50,673 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:50,674 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:50,675 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:41:50,676 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:41:50,677 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:41:50,694 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:50,695 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:50,696 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:50,696 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:50,698 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:50,699 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:41:50,721 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:41:50,721 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:41:50,839 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-05 22:41:50,839 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:51,167 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:41:51,167 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-05 22:41:51,169 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-05 22:41:51,170 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:41:51,203 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:41:51,204 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:51,206 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-05 22:41:51,206 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:41:51,208 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:41:51,208 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:41:51,209 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-05 22:41:51,209 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:41:51,211 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-05 22:41:51,211 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:41:51,212 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-05 22:41:51,213 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:41:51,214 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-05 22:41:51,214 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:41:51,267 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:41:51,268 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:41:51,271 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-05 22:41:51,272 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:41:51,274 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:41:51,274 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:41:51,275 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-05 22:41:51,276 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:41:51,277 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-05 22:41:51,278 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:41:51,279 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-05 22:41:51,279 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:41:51,280 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-05 22:41:51,281 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:41:51,315 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:41:51,315 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-05 22:41:51,317 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-05 22:41:51,318 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:41:51,579 WARN L193 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2020-10-05 22:41:51,676 INFO L206 etLargeBlockEncoding]: Checked pairs total: 2519 [2020-10-05 22:41:51,677 INFO L214 etLargeBlockEncoding]: Total number of compositions: 67 [2020-10-05 22:41:51,681 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 28 places, 22 transitions, 54 flow [2020-10-05 22:41:51,704 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 230 states. [2020-10-05 22:41:51,707 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states. [2020-10-05 22:41:51,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-05 22:41:51,715 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:41:51,716 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-05 22:41:51,716 INFO L427 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:41:51,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:41:51,723 INFO L82 PathProgramCache]: Analyzing trace with hash 911351, now seen corresponding path program 1 times [2020-10-05 22:41:51,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:41:51,736 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699326394] [2020-10-05 22:41:51,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:41:51,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:41:51,977 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-05 22:41:51,978 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699326394] [2020-10-05 22:41:51,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:41:51,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 22:41:51,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96763285] [2020-10-05 22:41:51,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 22:41:51,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:41:52,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 22:41:52,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 22:41:52,004 INFO L87 Difference]: Start difference. First operand 230 states. Second operand 3 states. [2020-10-05 22:41:52,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:41:52,068 INFO L93 Difference]: Finished difference Result 192 states and 464 transitions. [2020-10-05 22:41:52,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 22:41:52,070 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-05 22:41:52,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:41:52,084 INFO L225 Difference]: With dead ends: 192 [2020-10-05 22:41:52,084 INFO L226 Difference]: Without dead ends: 162 [2020-10-05 22:41:52,086 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 22:41:52,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2020-10-05 22:41:52,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2020-10-05 22:41:52,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2020-10-05 22:41:52,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 385 transitions. [2020-10-05 22:41:52,141 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 385 transitions. Word has length 3 [2020-10-05 22:41:52,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:41:52,142 INFO L479 AbstractCegarLoop]: Abstraction has 162 states and 385 transitions. [2020-10-05 22:41:52,142 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 22:41:52,142 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 385 transitions. [2020-10-05 22:41:52,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-10-05 22:41:52,143 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:41:52,144 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:41:52,144 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-05 22:41:52,144 INFO L427 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:41:52,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:41:52,145 INFO L82 PathProgramCache]: Analyzing trace with hash 694399148, now seen corresponding path program 1 times [2020-10-05 22:41:52,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:41:52,145 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77448461] [2020-10-05 22:41:52,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:41:52,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:41:52,326 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-05 22:41:52,327 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77448461] [2020-10-05 22:41:52,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:41:52,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-05 22:41:52,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235043603] [2020-10-05 22:41:52,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 22:41:52,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:41:52,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 22:41:52,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-05 22:41:52,330 INFO L87 Difference]: Start difference. First operand 162 states and 385 transitions. Second operand 4 states. [2020-10-05 22:41:52,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:41:52,394 INFO L93 Difference]: Finished difference Result 172 states and 388 transitions. [2020-10-05 22:41:52,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 22:41:52,395 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-10-05 22:41:52,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:41:52,397 INFO L225 Difference]: With dead ends: 172 [2020-10-05 22:41:52,397 INFO L226 Difference]: Without dead ends: 142 [2020-10-05 22:41:52,398 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-05 22:41:52,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2020-10-05 22:41:52,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2020-10-05 22:41:52,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-10-05 22:41:52,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 329 transitions. [2020-10-05 22:41:52,410 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 329 transitions. Word has length 8 [2020-10-05 22:41:52,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:41:52,410 INFO L479 AbstractCegarLoop]: Abstraction has 142 states and 329 transitions. [2020-10-05 22:41:52,411 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 22:41:52,411 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 329 transitions. [2020-10-05 22:41:52,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-05 22:41:52,412 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:41:52,412 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:41:52,412 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-05 22:41:52,413 INFO L427 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:41:52,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:41:52,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1966023050, now seen corresponding path program 1 times [2020-10-05 22:41:52,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:41:52,414 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448029215] [2020-10-05 22:41:52,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:41:52,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:41:52,494 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-05 22:41:52,495 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448029215] [2020-10-05 22:41:52,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:41:52,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 22:41:52,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409451936] [2020-10-05 22:41:52,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 22:41:52,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:41:52,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 22:41:52,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-05 22:41:52,497 INFO L87 Difference]: Start difference. First operand 142 states and 329 transitions. Second operand 4 states. [2020-10-05 22:41:52,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:41:52,527 INFO L93 Difference]: Finished difference Result 108 states and 206 transitions. [2020-10-05 22:41:52,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 22:41:52,529 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-10-05 22:41:52,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:41:52,531 INFO L225 Difference]: With dead ends: 108 [2020-10-05 22:41:52,531 INFO L226 Difference]: Without dead ends: 78 [2020-10-05 22:41:52,531 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-05 22:41:52,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-10-05 22:41:52,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2020-10-05 22:41:52,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-10-05 22:41:52,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 137 transitions. [2020-10-05 22:41:52,538 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 137 transitions. Word has length 10 [2020-10-05 22:41:52,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:41:52,538 INFO L479 AbstractCegarLoop]: Abstraction has 78 states and 137 transitions. [2020-10-05 22:41:52,538 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 22:41:52,539 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 137 transitions. [2020-10-05 22:41:52,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-05 22:41:52,540 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:41:52,540 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:41:52,540 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-05 22:41:52,540 INFO L427 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:41:52,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:41:52,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1336816019, now seen corresponding path program 1 times [2020-10-05 22:41:52,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:41:52,541 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959759323] [2020-10-05 22:41:52,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:41:52,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:41:52,712 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-05 22:41:52,713 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959759323] [2020-10-05 22:41:52,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:41:52,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-05 22:41:52,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861896851] [2020-10-05 22:41:52,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 22:41:52,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:41:52,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 22:41:52,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 22:41:52,715 INFO L87 Difference]: Start difference. First operand 78 states and 137 transitions. Second operand 5 states. [2020-10-05 22:41:52,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:41:52,751 INFO L93 Difference]: Finished difference Result 56 states and 91 transitions. [2020-10-05 22:41:52,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 22:41:52,751 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-05 22:41:52,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:41:52,752 INFO L225 Difference]: With dead ends: 56 [2020-10-05 22:41:52,752 INFO L226 Difference]: Without dead ends: 46 [2020-10-05 22:41:52,753 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-05 22:41:52,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-10-05 22:41:52,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2020-10-05 22:41:52,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-10-05 22:41:52,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 73 transitions. [2020-10-05 22:41:52,757 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 73 transitions. Word has length 13 [2020-10-05 22:41:52,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:41:52,757 INFO L479 AbstractCegarLoop]: Abstraction has 46 states and 73 transitions. [2020-10-05 22:41:52,757 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 22:41:52,758 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 73 transitions. [2020-10-05 22:41:52,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-05 22:41:52,758 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:41:52,759 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:41:52,759 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-05 22:41:52,759 INFO L427 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:41:52,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:41:52,759 INFO L82 PathProgramCache]: Analyzing trace with hash -902089120, now seen corresponding path program 1 times [2020-10-05 22:41:52,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:41:52,760 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616455185] [2020-10-05 22:41:52,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:41:52,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:41:52,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 22:41:52,959 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616455185] [2020-10-05 22:41:52,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:41:52,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 22:41:52,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3702696] [2020-10-05 22:41:52,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 22:41:52,961 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:41:52,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 22:41:52,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-05 22:41:52,962 INFO L87 Difference]: Start difference. First operand 46 states and 73 transitions. Second operand 7 states. [2020-10-05 22:41:53,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:41:53,113 INFO L93 Difference]: Finished difference Result 55 states and 83 transitions. [2020-10-05 22:41:53,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-05 22:41:53,113 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2020-10-05 22:41:53,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:41:53,114 INFO L225 Difference]: With dead ends: 55 [2020-10-05 22:41:53,114 INFO L226 Difference]: Without dead ends: 36 [2020-10-05 22:41:53,114 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2020-10-05 22:41:53,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-10-05 22:41:53,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2020-10-05 22:41:53,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-10-05 22:41:53,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 53 transitions. [2020-10-05 22:41:53,118 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 53 transitions. Word has length 17 [2020-10-05 22:41:53,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:41:53,118 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 53 transitions. [2020-10-05 22:41:53,118 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 22:41:53,118 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 53 transitions. [2020-10-05 22:41:53,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-05 22:41:53,119 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:41:53,119 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:41:53,119 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-05 22:41:53,120 INFO L427 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:41:53,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:41:53,120 INFO L82 PathProgramCache]: Analyzing trace with hash -614563230, now seen corresponding path program 2 times [2020-10-05 22:41:53,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:41:53,121 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087459203] [2020-10-05 22:41:53,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:41:53,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 22:41:53,260 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 22:41:53,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 22:41:53,316 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 22:41:53,363 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-05 22:41:53,363 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-10-05 22:41:53,363 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-05 22:41:53,384 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-05 22:41:53,384 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:41:53,392 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-05 22:41:53,392 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:41:53,393 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-05 22:41:53,393 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:41:53,394 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-05 22:41:53,394 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:41:53,394 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-05 22:41:53,394 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:41:53,395 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-05 22:41:53,395 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:41:53,395 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-05 22:41:53,395 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:41:53,396 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-05 22:41:53,396 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:41:53,396 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-05 22:41:53,396 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:41:53,396 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-05 22:41:53,396 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:41:53,397 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-05 22:41:53,397 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:41:53,397 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-05 22:41:53,397 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:41:53,398 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-05 22:41:53,398 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:41:53,398 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-05 22:41:53,399 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:41:53,399 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-05 22:41:53,399 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:41:53,399 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-05 22:41:53,399 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:41:53,400 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-05 22:41:53,400 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:41:53,400 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-05 22:41:53,400 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:41:53,400 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-05 22:41:53,400 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:41:53,405 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-05 22:41:53,406 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:41:53,406 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-05 22:41:53,407 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:41:53,407 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-05 22:41:53,407 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:41:53,407 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-05 22:41:53,407 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:41:53,407 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-05 22:41:53,407 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:41:53,408 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-05 22:41:53,408 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:41:53,408 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-05 22:41:53,409 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:41:53,409 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-05 22:41:53,409 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:41:53,409 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-05 22:41:53,409 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:41:53,409 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-05 22:41:53,409 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:41:53,410 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-05 22:41:53,410 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:41:53,483 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.10 10:41:53 BasicIcfg [2020-10-05 22:41:53,483 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-05 22:41:53,486 INFO L168 Benchmark]: Toolchain (without parser) took 8445.95 ms. Allocated memory was 148.4 MB in the beginning and 318.2 MB in the end (delta: 169.9 MB). Free memory was 102.9 MB in the beginning and 105.2 MB in the end (delta: -2.3 MB). Peak memory consumption was 167.6 MB. Max. memory is 7.1 GB. [2020-10-05 22:41:53,487 INFO L168 Benchmark]: CDTParser took 1.03 ms. Allocated memory is still 148.4 MB. Free memory was 123.0 MB in the beginning and 122.6 MB in the end (delta: 419.4 kB). Peak memory consumption was 419.4 kB. Max. memory is 7.1 GB. [2020-10-05 22:41:53,488 INFO L168 Benchmark]: CACSL2BoogieTranslator took 844.74 ms. Allocated memory was 148.4 MB in the beginning and 205.0 MB in the end (delta: 56.6 MB). Free memory was 102.9 MB in the beginning and 159.8 MB in the end (delta: -56.9 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. [2020-10-05 22:41:53,492 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.53 ms. Allocated memory is still 205.0 MB. Free memory was 159.8 MB in the beginning and 157.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2020-10-05 22:41:53,493 INFO L168 Benchmark]: Boogie Preprocessor took 53.20 ms. Allocated memory is still 205.0 MB. Free memory was 157.0 MB in the beginning and 155.2 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2020-10-05 22:41:53,493 INFO L168 Benchmark]: RCFGBuilder took 1971.29 ms. Allocated memory was 205.0 MB in the beginning and 245.9 MB in the end (delta: 40.9 MB). Free memory was 155.2 MB in the beginning and 193.9 MB in the end (delta: -38.8 MB). Peak memory consumption was 97.8 MB. Max. memory is 7.1 GB. [2020-10-05 22:41:53,495 INFO L168 Benchmark]: TraceAbstraction took 5502.90 ms. Allocated memory was 245.9 MB in the beginning and 318.2 MB in the end (delta: 72.4 MB). Free memory was 193.9 MB in the beginning and 105.2 MB in the end (delta: 88.8 MB). Peak memory consumption was 161.1 MB. Max. memory is 7.1 GB. [2020-10-05 22:41:53,507 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.03 ms. Allocated memory is still 148.4 MB. Free memory was 123.0 MB in the beginning and 122.6 MB in the end (delta: 419.4 kB). Peak memory consumption was 419.4 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 844.74 ms. Allocated memory was 148.4 MB in the beginning and 205.0 MB in the end (delta: 56.6 MB). Free memory was 102.9 MB in the beginning and 159.8 MB in the end (delta: -56.9 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 66.53 ms. Allocated memory is still 205.0 MB. Free memory was 159.8 MB in the beginning and 157.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 53.20 ms. Allocated memory is still 205.0 MB. Free memory was 157.0 MB in the beginning and 155.2 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1971.29 ms. Allocated memory was 205.0 MB in the beginning and 245.9 MB in the end (delta: 40.9 MB). Free memory was 155.2 MB in the beginning and 193.9 MB in the end (delta: -38.8 MB). Peak memory consumption was 97.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5502.90 ms. Allocated memory was 245.9 MB in the beginning and 318.2 MB in the end (delta: 72.4 MB). Free memory was 193.9 MB in the beginning and 105.2 MB in the end (delta: 88.8 MB). Peak memory consumption was 161.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.4s, 85 ProgramPointsBefore, 28 ProgramPointsAfterwards, 80 TransitionsBefore, 22 TransitionsAfterwards, 1024 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 31 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 549 VarBasedMoverChecksPositive, 25 VarBasedMoverChecksNegative, 7 SemBasedMoverChecksPositive, 31 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 0 MoverChecksTotal, 2519 CheckedPairsTotal, 67 TotalNumberOfCompositions - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L697] 0 int __unbuffered_cnt = 0; [L699] 0 int __unbuffered_p0_EAX = 0; [L701] 0 int __unbuffered_p1_EAX = 0; [L703] 0 int __unbuffered_p1_EBX = 0; [L704] 0 _Bool main$tmp_guard0; [L705] 0 _Bool main$tmp_guard1; [L707] 0 int x = 0; [L709] 0 int y = 0; [L711] 0 int z = 0; [L712] 0 _Bool z$flush_delayed; [L713] 0 int z$mem_tmp; [L714] 0 _Bool z$r_buff0_thd0; [L715] 0 _Bool z$r_buff0_thd1; [L716] 0 _Bool z$r_buff0_thd2; [L717] 0 _Bool z$r_buff1_thd0; [L718] 0 _Bool z$r_buff1_thd1; [L719] 0 _Bool z$r_buff1_thd2; [L720] 0 _Bool z$read_delayed; [L721] 0 int *z$read_delayed_var; [L722] 0 int z$w_buff0; [L723] 0 _Bool z$w_buff0_used; [L724] 0 int z$w_buff1; [L725] 0 _Bool z$w_buff1_used; [L726] 0 _Bool weak$$choice0; [L727] 0 _Bool weak$$choice2; [L806] 0 pthread_t t899; [L807] FCALL, FORK 0 pthread_create(&t899, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L731] 1 z$w_buff1 = z$w_buff0 [L732] 1 z$w_buff0 = 1 [L733] 1 z$w_buff1_used = z$w_buff0_used [L734] 1 z$w_buff0_used = (_Bool)1 [L7] COND TRUE 1 !expression [L7] 1 __VERIFIER_error() [L736] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L737] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L738] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L739] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L742] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L808] 0 pthread_t t900; [L809] FCALL, FORK 0 pthread_create(&t900, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L759] 2 x = 1 [L762] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L765] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_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=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L768] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L769] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L770] 2 z$flush_delayed = weak$$choice2 [L771] 2 z$mem_tmp = z [L772] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L772] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L773] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L773] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0) [L773] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0 [L773] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0) [L773] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L773] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L774] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L774] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L775] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L775] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used) [L775] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L775] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used) [L775] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L775] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L776] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L776] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L777] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L777] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L778] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L778] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L779] 2 __unbuffered_p1_EBX = z [L780] EXPR 2 z$flush_delayed ? z$mem_tmp : z [L780] 2 z = z$flush_delayed ? z$mem_tmp : z [L781] 2 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=0, x=1, 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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L745] 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) [L745] 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) [L746] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L746] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L747] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L747] 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 [L748] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L748] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L749] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L749] 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 [L752] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L754] 1 return 0; [L784] 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) [L784] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z [L784] 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) [L784] 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) [L785] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L785] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L786] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L786] 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 [L787] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L787] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L788] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L788] 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 [L791] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L793] 2 return 0; [L811] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L3] COND FALSE 0 !(!cond) [L815] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L815] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L816] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L816] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L817] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L817] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L818] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L818] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L819] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L819] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L822] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=0, x=1, 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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=0, x=1, 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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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 3 procedures, 79 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 5.2s, OverallIterations: 6, TraceHistogramMax: 1, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.5s, HoareTripleCheckerStatistics: 103 SDtfs, 100 SDslu, 177 SDs, 0 SdLazy, 97 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=230occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 68 NumberOfCodeBlocks, 68 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 46 ConstructedInterpolants, 0 QuantifiedInterpolants, 2979 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 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...