/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/mix045_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-b09bf87 [2020-10-16 11:12:56,699 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 11:12:56,702 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 11:12:56,732 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 11:12:56,733 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 11:12:56,740 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 11:12:56,744 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 11:12:56,748 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 11:12:56,750 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 11:12:56,754 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 11:12:56,755 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 11:12:56,756 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 11:12:56,756 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 11:12:56,759 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 11:12:56,762 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 11:12:56,763 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 11:12:56,765 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 11:12:56,767 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 11:12:56,768 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 11:12:56,775 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 11:12:56,776 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 11:12:56,778 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 11:12:56,779 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 11:12:56,780 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 11:12:56,791 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 11:12:56,792 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 11:12:56,792 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 11:12:56,796 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 11:12:56,796 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 11:12:56,797 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 11:12:56,797 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 11:12:56,799 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 11:12:56,800 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 11:12:56,801 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 11:12:56,802 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 11:12:56,802 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 11:12:56,802 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 11:12:56,803 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 11:12:56,803 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 11:12:56,804 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 11:12:56,807 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 11:12:56,809 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-16 11:12:56,831 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 11:12:56,831 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 11:12:56,832 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 11:12:56,833 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 11:12:56,833 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 11:12:56,833 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 11:12:56,833 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 11:12:56,834 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 11:12:56,834 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 11:12:56,834 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 11:12:56,834 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 11:12:56,834 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 11:12:56,835 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 11:12:56,835 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 11:12:56,835 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 11:12:56,835 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 11:12:56,835 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 11:12:56,836 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 11:12:56,836 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 11:12:56,836 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 11:12:56,836 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 11:12:56,836 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 11:12:56,837 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 11:12:56,837 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 11:12:56,837 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 11:12:56,837 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 11:12:56,837 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 11:12:56,838 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-16 11:12:56,838 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-16 11:12:56,838 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 11:12:57,163 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 11:12:57,179 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 11:12:57,183 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 11:12:57,184 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 11:12:57,186 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 11:12:57,187 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix045_tso.opt.i [2020-10-16 11:12:57,246 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/8ac865aec/db98db2a491c4b0b863e47ab411290c1/FLAGca0f2bc48 [2020-10-16 11:12:57,767 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 11:12:57,769 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/pthread-wmm/mix045_tso.opt.i [2020-10-16 11:12:57,795 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/8ac865aec/db98db2a491c4b0b863e47ab411290c1/FLAGca0f2bc48 [2020-10-16 11:12:58,039 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/8ac865aec/db98db2a491c4b0b863e47ab411290c1 [2020-10-16 11:12:58,047 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 11:12:58,049 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 11:12:58,051 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 11:12:58,051 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 11:12:58,056 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 11:12:58,057 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 11:12:58" (1/1) ... [2020-10-16 11:12:58,061 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56167900 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:12:58, skipping insertion in model container [2020-10-16 11:12:58,061 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 11:12:58" (1/1) ... [2020-10-16 11:12:58,069 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 11:12:58,112 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 11:12:58,605 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 11:12:58,723 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 11:12:58,789 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 11:12:58,867 INFO L208 MainTranslator]: Completed translation [2020-10-16 11:12:58,867 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:12:58 WrapperNode [2020-10-16 11:12:58,868 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 11:12:58,869 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 11:12:58,869 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 11:12:58,869 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 11:12:58,878 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:12:58" (1/1) ... [2020-10-16 11:12:58,898 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:12:58" (1/1) ... [2020-10-16 11:12:58,943 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 11:12:58,944 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 11:12:58,944 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 11:12:58,947 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 11:12:58,956 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:12:58" (1/1) ... [2020-10-16 11:12:58,956 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:12:58" (1/1) ... [2020-10-16 11:12:58,962 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:12:58" (1/1) ... [2020-10-16 11:12:58,962 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:12:58" (1/1) ... [2020-10-16 11:12:58,974 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:12:58" (1/1) ... [2020-10-16 11:12:58,979 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:12:58" (1/1) ... [2020-10-16 11:12:58,983 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:12:58" (1/1) ... [2020-10-16 11:12:58,989 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 11:12:58,990 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 11:12:58,990 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 11:12:58,990 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 11:12:58,992 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:12:58" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 11:12:59,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 11:12:59,062 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 11:12:59,063 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 11:12:59,063 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 11:12:59,063 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 11:12:59,064 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 11:12:59,064 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 11:12:59,065 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 11:12:59,065 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 11:12:59,066 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 11:12:59,066 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 11:12:59,066 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 11:12:59,066 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 11:12:59,069 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-16 11:13:00,988 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 11:13:00,988 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 11:13:00,991 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 11:13:00 BoogieIcfgContainer [2020-10-16 11:13:00,991 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 11:13:00,992 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 11:13:00,993 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 11:13:00,996 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 11:13:00,997 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 11:12:58" (1/3) ... [2020-10-16 11:13:00,999 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ef9cb26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 11:13:00, skipping insertion in model container [2020-10-16 11:13:00,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:12:58" (2/3) ... [2020-10-16 11:13:01,000 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ef9cb26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 11:13:00, skipping insertion in model container [2020-10-16 11:13:01,000 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 11:13:00" (3/3) ... [2020-10-16 11:13:01,002 INFO L111 eAbstractionObserver]: Analyzing ICFG mix045_tso.opt.i [2020-10-16 11:13:01,015 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-16 11:13:01,016 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 11:13:01,026 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 11:13:01,027 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 11:13:01,080 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:01,080 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:01,080 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:01,081 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:01,081 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:01,081 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:01,082 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:01,082 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:01,082 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:01,083 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:01,083 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:01,083 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:01,083 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:01,083 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:01,083 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:01,084 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:01,084 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:01,084 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:01,085 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:01,085 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:01,085 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:01,086 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:01,086 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:01,086 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:01,086 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:01,086 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:01,087 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:01,087 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:01,087 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:01,087 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:01,088 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:01,088 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:01,088 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:01,088 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:01,089 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:01,089 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:01,096 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:01,097 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:01,097 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:01,098 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:01,101 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:01,102 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:01,102 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:01,102 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:01,102 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:01,103 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:01,103 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:01,103 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:01,103 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:01,103 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:01,106 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:01,107 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:01,107 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:01,107 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:01,107 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:01,108 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:01,108 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:01,108 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:01,108 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:01,108 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:01,108 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:01,109 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:13:01,111 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-16 11:13:01,126 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-16 11:13:01,151 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 11:13:01,151 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-16 11:13:01,151 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 11:13:01,151 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 11:13:01,152 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 11:13:01,152 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 11:13:01,152 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 11:13:01,152 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 11:13:01,169 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 11:13:01,172 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 95 transitions, 205 flow [2020-10-16 11:13:01,176 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 95 transitions, 205 flow [2020-10-16 11:13:01,178 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 103 places, 95 transitions, 205 flow [2020-10-16 11:13:01,233 INFO L129 PetriNetUnfolder]: 2/92 cut-off events. [2020-10-16 11:13:01,233 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 11:13:01,238 INFO L80 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 92 events. 2/92 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 63 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2020-10-16 11:13:01,241 INFO L117 LiptonReduction]: Number of co-enabled transitions 1692 [2020-10-16 11:13:01,359 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 11:13:01,360 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:13:01,362 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 11:13:01,363 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:13:01,401 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 11:13:01,402 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:13:01,404 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 11:13:01,404 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:13:01,768 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 11:13:01,768 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:13:01,770 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 11:13:01,770 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:13:01,801 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 11:13:01,801 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:13:01,803 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 11:13:01,804 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:13:03,148 WARN L193 SmtUtils]: Spent 1.32 s on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2020-10-16 11:13:03,173 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 2, 1] term [2020-10-16 11:13:03,173 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:13:03,177 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 11:13:03,178 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:13:04,044 WARN L193 SmtUtils]: Spent 847.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 125 [2020-10-16 11:13:04,120 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 11:13:04,121 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:13:04,843 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:13:04,843 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:13:04,845 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:13:04,845 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:13:04,851 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:13:04,852 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:13:04,855 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:13:04,855 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:13:04,874 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:13:04,875 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:13:04,876 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:13:04,877 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:13:04,880 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:13:04,880 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:13:04,883 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:13:04,884 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:13:04,995 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 11:13:04,996 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:13:05,088 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:13:05,088 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:13:05,089 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:13:05,090 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:13:05,092 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:13:05,093 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:13:05,095 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:13:05,096 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:13:05,114 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:13:05,115 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:13:05,116 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:13:05,117 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:13:05,119 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:13:05,120 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:13:05,122 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:13:05,122 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:13:05,266 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:13:05,267 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:13:05,268 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:13:05,268 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:13:05,271 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:13:05,271 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:13:05,274 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:13:05,274 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:13:05,294 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:13:05,294 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:13:05,295 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:13:05,295 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:13:05,298 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:13:05,298 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:13:05,301 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:13:05,301 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:13:05,611 WARN L193 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-10-16 11:13:05,735 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-16 11:13:06,427 WARN L193 SmtUtils]: Spent 690.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 110 [2020-10-16 11:13:06,746 WARN L193 SmtUtils]: Spent 315.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2020-10-16 11:13:06,785 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:13:06,785 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:13:06,786 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:13:06,786 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:13:06,789 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:13:06,790 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:13:06,793 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:13:06,793 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:13:06,818 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:13:06,819 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:13:06,819 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:13:06,820 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:13:06,823 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:13:06,823 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:13:06,828 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:13:06,829 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:13:06,897 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:13:06,898 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:13:06,899 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:13:06,899 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:13:06,901 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:13:06,902 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:13:06,903 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:13:06,904 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:13:06,917 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:13:06,918 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:13:06,919 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:13:06,919 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:13:06,922 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:13:06,923 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:13:06,926 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:13:06,926 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:13:07,125 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:13:07,125 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:13:07,128 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:13:07,129 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:13:07,131 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:13:07,131 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:13:07,134 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:13:07,134 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:13:07,148 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:13:07,148 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:13:07,149 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:13:07,149 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:13:07,151 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:13:07,152 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:13:07,154 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:13:07,156 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:13:07,902 WARN L193 SmtUtils]: Spent 724.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 126 [2020-10-16 11:13:08,285 WARN L193 SmtUtils]: Spent 379.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2020-10-16 11:13:08,341 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:13:08,341 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:13:08,342 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:13:08,342 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:13:08,344 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:13:08,344 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:13:08,346 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:13:08,347 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:13:08,358 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:13:08,359 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:13:08,360 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:13:08,360 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:13:08,363 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:13:08,363 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:13:08,365 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:13:08,366 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:13:08,412 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:13:08,413 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:13:08,414 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:13:08,414 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:13:08,416 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:13:08,422 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:13:08,423 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:13:08,424 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:13:08,440 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:13:08,440 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:13:08,444 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:13:08,445 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:13:08,450 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:13:08,450 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:13:08,452 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:13:08,452 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:13:08,577 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 3, 7, 2, 2, 1] term [2020-10-16 11:13:08,577 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:13:08,578 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 2, 3, 2, 1] term [2020-10-16 11:13:08,578 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:13:08,579 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:13:08,579 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:13:08,582 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:13:08,582 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:13:08,590 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 7, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:13:08,590 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:13:08,592 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 7, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:13:08,593 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:13:08,594 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 7, 3, 7, 3, 2, 1] term [2020-10-16 11:13:08,594 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:13:08,596 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 7, 3, 7, 3, 7, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:13:08,596 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:13:08,597 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 7, 3, 7, 3, 7, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:13:08,598 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:13:08,618 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 7, 3, 7, 3, 2, 1] term [2020-10-16 11:13:08,619 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:13:08,620 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 7, 3, 7, 3, 2, 1] term [2020-10-16 11:13:08,621 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:13:08,798 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 7, 3, 7, 3, 2, 1] term [2020-10-16 11:13:08,798 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:13:08,801 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 7, 3, 7, 3, 2, 1] term [2020-10-16 11:13:08,802 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:13:08,819 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 3, 7, 2, 2, 1] term [2020-10-16 11:13:08,819 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:13:08,820 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 2, 3, 2, 1] term [2020-10-16 11:13:08,821 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:13:08,821 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:13:08,822 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:13:08,823 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:13:08,823 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:13:08,824 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 7, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:13:08,825 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:13:08,826 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 7, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:13:08,827 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:13:08,828 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 7, 3, 7, 3, 2, 1] term [2020-10-16 11:13:08,828 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:13:08,830 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 7, 3, 7, 3, 7, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:13:08,831 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:13:08,832 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 7, 3, 7, 3, 7, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:13:08,832 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:13:08,923 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 7, 3, 7, 3, 2, 1] term [2020-10-16 11:13:08,923 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:13:08,925 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 7, 3, 7, 3, 2, 1] term [2020-10-16 11:13:08,926 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:13:08,946 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 3, 7, 2, 2, 1] term [2020-10-16 11:13:08,947 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:13:08,948 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 2, 3, 2, 1] term [2020-10-16 11:13:08,948 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:13:08,949 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:13:08,949 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:13:08,950 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:13:08,951 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:13:08,955 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 7, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:13:08,955 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:13:08,957 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 7, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:13:08,958 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:13:08,960 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 7, 3, 7, 3, 2, 1] term [2020-10-16 11:13:08,961 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:13:08,962 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 7, 3, 7, 3, 7, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:13:08,963 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:13:08,965 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 7, 3, 7, 3, 7, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:13:08,965 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:13:09,022 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 3, 7, 2, 2, 1] term [2020-10-16 11:13:09,023 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:13:09,023 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 2, 3, 2, 1] term [2020-10-16 11:13:09,024 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:13:09,024 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:13:09,025 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:13:09,026 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:13:09,026 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:13:09,027 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 7, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:13:09,028 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:13:09,029 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 7, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:13:09,029 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:13:09,031 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 7, 3, 7, 3, 2, 1] term [2020-10-16 11:13:09,032 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:13:09,032 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 7, 3, 7, 3, 7, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:13:09,033 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:13:09,034 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 7, 3, 7, 3, 7, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:13:09,034 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:13:09,052 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 7, 3, 7, 3, 2, 1] term [2020-10-16 11:13:09,052 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:13:09,054 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 7, 3, 7, 3, 2, 1] term [2020-10-16 11:13:09,054 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:13:09,607 WARN L193 SmtUtils]: Spent 485.00 ms on a formula simplification that was a NOOP. DAG size: 131 [2020-10-16 11:13:09,946 WARN L193 SmtUtils]: Spent 336.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2020-10-16 11:13:10,111 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-10-16 11:13:10,213 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-10-16 11:13:10,503 WARN L193 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2020-10-16 11:13:10,622 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2020-10-16 11:13:10,630 INFO L132 LiptonReduction]: Checked pairs total: 4495 [2020-10-16 11:13:10,630 INFO L134 LiptonReduction]: Total number of compositions: 82 [2020-10-16 11:13:10,638 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 26 transitions, 67 flow [2020-10-16 11:13:10,687 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 750 states. [2020-10-16 11:13:10,689 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states. [2020-10-16 11:13:10,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-16 11:13:10,696 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:13:10,697 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:13:10,698 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:13:10,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:13:10,703 INFO L82 PathProgramCache]: Analyzing trace with hash -139107104, now seen corresponding path program 1 times [2020-10-16 11:13:10,714 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:13:10,714 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912337763] [2020-10-16 11:13:10,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:13:10,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:13:10,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:13:10,972 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912337763] [2020-10-16 11:13:10,973 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:13:10,974 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 11:13:10,974 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100985249] [2020-10-16 11:13:10,980 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 11:13:10,980 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:13:10,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 11:13:10,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 11:13:10,998 INFO L87 Difference]: Start difference. First operand 750 states. Second operand 3 states. [2020-10-16 11:13:11,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:13:11,101 INFO L93 Difference]: Finished difference Result 650 states and 2028 transitions. [2020-10-16 11:13:11,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 11:13:11,105 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-10-16 11:13:11,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:13:11,150 INFO L225 Difference]: With dead ends: 650 [2020-10-16 11:13:11,150 INFO L226 Difference]: Without dead ends: 530 [2020-10-16 11:13:11,152 INFO L677 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-16 11:13:11,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2020-10-16 11:13:11,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 530. [2020-10-16 11:13:11,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2020-10-16 11:13:11,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 1622 transitions. [2020-10-16 11:13:11,250 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 1622 transitions. Word has length 7 [2020-10-16 11:13:11,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:13:11,252 INFO L481 AbstractCegarLoop]: Abstraction has 530 states and 1622 transitions. [2020-10-16 11:13:11,252 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 11:13:11,252 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 1622 transitions. [2020-10-16 11:13:11,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-16 11:13:11,253 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:13:11,253 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:13:11,254 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 11:13:11,254 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:13:11,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:13:11,254 INFO L82 PathProgramCache]: Analyzing trace with hash -537885840, now seen corresponding path program 1 times [2020-10-16 11:13:11,254 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:13:11,255 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895685033] [2020-10-16 11:13:11,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:13:11,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:13:11,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:13:11,377 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895685033] [2020-10-16 11:13:11,377 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:13:11,377 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 11:13:11,377 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393017214] [2020-10-16 11:13:11,379 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 11:13:11,379 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:13:11,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 11:13:11,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 11:13:11,380 INFO L87 Difference]: Start difference. First operand 530 states and 1622 transitions. Second operand 3 states. [2020-10-16 11:13:11,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:13:11,415 INFO L93 Difference]: Finished difference Result 528 states and 1614 transitions. [2020-10-16 11:13:11,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 11:13:11,416 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-16 11:13:11,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:13:11,422 INFO L225 Difference]: With dead ends: 528 [2020-10-16 11:13:11,422 INFO L226 Difference]: Without dead ends: 528 [2020-10-16 11:13:11,423 INFO L677 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-16 11:13:11,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2020-10-16 11:13:11,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528. [2020-10-16 11:13:11,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2020-10-16 11:13:11,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 1614 transitions. [2020-10-16 11:13:11,458 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 1614 transitions. Word has length 9 [2020-10-16 11:13:11,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:13:11,459 INFO L481 AbstractCegarLoop]: Abstraction has 528 states and 1614 transitions. [2020-10-16 11:13:11,459 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 11:13:11,459 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 1614 transitions. [2020-10-16 11:13:11,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-16 11:13:11,462 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:13:11,462 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:13:11,463 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 11:13:11,463 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:13:11,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:13:11,463 INFO L82 PathProgramCache]: Analyzing trace with hash 505407985, now seen corresponding path program 1 times [2020-10-16 11:13:11,464 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:13:11,464 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351832578] [2020-10-16 11:13:11,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:13:11,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:13:11,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:13:11,556 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351832578] [2020-10-16 11:13:11,556 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:13:11,556 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 11:13:11,556 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729348685] [2020-10-16 11:13:11,557 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 11:13:11,557 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:13:11,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 11:13:11,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 11:13:11,558 INFO L87 Difference]: Start difference. First operand 528 states and 1614 transitions. Second operand 3 states. [2020-10-16 11:13:11,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:13:11,572 INFO L93 Difference]: Finished difference Result 518 states and 1576 transitions. [2020-10-16 11:13:11,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 11:13:11,573 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-10-16 11:13:11,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:13:11,578 INFO L225 Difference]: With dead ends: 518 [2020-10-16 11:13:11,578 INFO L226 Difference]: Without dead ends: 518 [2020-10-16 11:13:11,579 INFO L677 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-16 11:13:11,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2020-10-16 11:13:11,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 518. [2020-10-16 11:13:11,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2020-10-16 11:13:11,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 1576 transitions. [2020-10-16 11:13:11,601 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 1576 transitions. Word has length 10 [2020-10-16 11:13:11,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:13:11,602 INFO L481 AbstractCegarLoop]: Abstraction has 518 states and 1576 transitions. [2020-10-16 11:13:11,602 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 11:13:11,602 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 1576 transitions. [2020-10-16 11:13:11,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-16 11:13:11,603 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:13:11,604 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:13:11,604 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 11:13:11,604 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:13:11,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:13:11,605 INFO L82 PathProgramCache]: Analyzing trace with hash 505408109, now seen corresponding path program 1 times [2020-10-16 11:13:11,605 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:13:11,605 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099705374] [2020-10-16 11:13:11,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:13:11,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:13:11,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:13:11,682 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099705374] [2020-10-16 11:13:11,682 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:13:11,683 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 11:13:11,683 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073718137] [2020-10-16 11:13:11,683 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 11:13:11,684 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:13:11,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 11:13:11,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 11:13:11,684 INFO L87 Difference]: Start difference. First operand 518 states and 1576 transitions. Second operand 3 states. [2020-10-16 11:13:11,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:13:11,763 INFO L93 Difference]: Finished difference Result 500 states and 1513 transitions. [2020-10-16 11:13:11,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 11:13:11,764 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-10-16 11:13:11,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:13:11,768 INFO L225 Difference]: With dead ends: 500 [2020-10-16 11:13:11,768 INFO L226 Difference]: Without dead ends: 500 [2020-10-16 11:13:11,769 INFO L677 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-16 11:13:11,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2020-10-16 11:13:11,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 500. [2020-10-16 11:13:11,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2020-10-16 11:13:11,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 1513 transitions. [2020-10-16 11:13:11,787 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 1513 transitions. Word has length 10 [2020-10-16 11:13:11,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:13:11,788 INFO L481 AbstractCegarLoop]: Abstraction has 500 states and 1513 transitions. [2020-10-16 11:13:11,790 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 11:13:11,790 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 1513 transitions. [2020-10-16 11:13:11,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-16 11:13:11,800 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:13:11,800 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:13:11,800 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 11:13:11,800 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:13:11,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:13:11,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1512221684, now seen corresponding path program 1 times [2020-10-16 11:13:11,801 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:13:11,801 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812532340] [2020-10-16 11:13:11,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:13:11,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:13:11,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:13:11,859 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812532340] [2020-10-16 11:13:11,859 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:13:11,860 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 11:13:11,860 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164107438] [2020-10-16 11:13:11,860 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 11:13:11,860 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:13:11,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 11:13:11,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 11:13:11,861 INFO L87 Difference]: Start difference. First operand 500 states and 1513 transitions. Second operand 3 states. [2020-10-16 11:13:11,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:13:11,873 INFO L93 Difference]: Finished difference Result 482 states and 1450 transitions. [2020-10-16 11:13:11,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 11:13:11,874 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-16 11:13:11,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:13:11,878 INFO L225 Difference]: With dead ends: 482 [2020-10-16 11:13:11,878 INFO L226 Difference]: Without dead ends: 482 [2020-10-16 11:13:11,879 INFO L677 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-16 11:13:11,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2020-10-16 11:13:11,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 482. [2020-10-16 11:13:11,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2020-10-16 11:13:11,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 1450 transitions. [2020-10-16 11:13:11,896 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 1450 transitions. Word has length 11 [2020-10-16 11:13:11,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:13:11,896 INFO L481 AbstractCegarLoop]: Abstraction has 482 states and 1450 transitions. [2020-10-16 11:13:11,896 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 11:13:11,896 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 1450 transitions. [2020-10-16 11:13:11,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-16 11:13:11,898 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:13:11,898 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:13:11,899 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 11:13:11,899 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:13:11,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:13:11,899 INFO L82 PathProgramCache]: Analyzing trace with hash 365755524, now seen corresponding path program 1 times [2020-10-16 11:13:11,899 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:13:11,900 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548646290] [2020-10-16 11:13:11,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:13:11,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:13:12,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:13:12,035 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548646290] [2020-10-16 11:13:12,035 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:13:12,035 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 11:13:12,035 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902537663] [2020-10-16 11:13:12,036 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 11:13:12,036 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:13:12,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 11:13:12,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 11:13:12,037 INFO L87 Difference]: Start difference. First operand 482 states and 1450 transitions. Second operand 5 states. [2020-10-16 11:13:12,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:13:12,122 INFO L93 Difference]: Finished difference Result 470 states and 1406 transitions. [2020-10-16 11:13:12,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 11:13:12,123 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-16 11:13:12,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:13:12,127 INFO L225 Difference]: With dead ends: 470 [2020-10-16 11:13:12,127 INFO L226 Difference]: Without dead ends: 470 [2020-10-16 11:13:12,128 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-10-16 11:13:12,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2020-10-16 11:13:12,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 470. [2020-10-16 11:13:12,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2020-10-16 11:13:12,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 1406 transitions. [2020-10-16 11:13:12,143 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 1406 transitions. Word has length 12 [2020-10-16 11:13:12,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:13:12,144 INFO L481 AbstractCegarLoop]: Abstraction has 470 states and 1406 transitions. [2020-10-16 11:13:12,144 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 11:13:12,144 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 1406 transitions. [2020-10-16 11:13:12,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-16 11:13:12,145 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:13:12,145 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:13:12,145 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 11:13:12,146 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:13:12,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:13:12,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1546482384, now seen corresponding path program 1 times [2020-10-16 11:13:12,146 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:13:12,146 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583409948] [2020-10-16 11:13:12,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:13:12,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:13:12,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:13:12,218 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583409948] [2020-10-16 11:13:12,218 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:13:12,218 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 11:13:12,219 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455669513] [2020-10-16 11:13:12,219 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 11:13:12,219 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:13:12,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 11:13:12,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-16 11:13:12,220 INFO L87 Difference]: Start difference. First operand 470 states and 1406 transitions. Second operand 5 states. [2020-10-16 11:13:12,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:13:12,287 INFO L93 Difference]: Finished difference Result 494 states and 1464 transitions. [2020-10-16 11:13:12,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 11:13:12,288 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-16 11:13:12,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:13:12,292 INFO L225 Difference]: With dead ends: 494 [2020-10-16 11:13:12,292 INFO L226 Difference]: Without dead ends: 494 [2020-10-16 11:13:12,293 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-16 11:13:12,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2020-10-16 11:13:12,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 486. [2020-10-16 11:13:12,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 486 states. [2020-10-16 11:13:12,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 1446 transitions. [2020-10-16 11:13:12,310 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 1446 transitions. Word has length 13 [2020-10-16 11:13:12,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:13:12,310 INFO L481 AbstractCegarLoop]: Abstraction has 486 states and 1446 transitions. [2020-10-16 11:13:12,310 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 11:13:12,310 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 1446 transitions. [2020-10-16 11:13:12,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-16 11:13:12,312 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:13:12,312 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:13:12,312 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 11:13:12,312 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:13:12,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:13:12,313 INFO L82 PathProgramCache]: Analyzing trace with hash -697643707, now seen corresponding path program 1 times [2020-10-16 11:13:12,313 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:13:12,313 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484842674] [2020-10-16 11:13:12,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:13:12,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:13:12,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:13:12,419 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484842674] [2020-10-16 11:13:12,419 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:13:12,419 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 11:13:12,420 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381425834] [2020-10-16 11:13:12,420 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 11:13:12,420 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:13:12,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 11:13:12,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 11:13:12,421 INFO L87 Difference]: Start difference. First operand 486 states and 1446 transitions. Second operand 4 states. [2020-10-16 11:13:12,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:13:12,465 INFO L93 Difference]: Finished difference Result 472 states and 1245 transitions. [2020-10-16 11:13:12,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 11:13:12,466 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-10-16 11:13:12,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:13:12,469 INFO L225 Difference]: With dead ends: 472 [2020-10-16 11:13:12,469 INFO L226 Difference]: Without dead ends: 344 [2020-10-16 11:13:12,469 INFO L677 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-16 11:13:12,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2020-10-16 11:13:12,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 344. [2020-10-16 11:13:12,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2020-10-16 11:13:12,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 878 transitions. [2020-10-16 11:13:12,481 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 878 transitions. Word has length 14 [2020-10-16 11:13:12,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:13:12,481 INFO L481 AbstractCegarLoop]: Abstraction has 344 states and 878 transitions. [2020-10-16 11:13:12,481 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 11:13:12,482 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 878 transitions. [2020-10-16 11:13:12,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-16 11:13:12,483 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:13:12,483 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:13:12,483 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 11:13:12,483 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:13:12,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:13:12,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1081476507, now seen corresponding path program 1 times [2020-10-16 11:13:12,484 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:13:12,484 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815228532] [2020-10-16 11:13:12,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:13:12,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:13:12,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:13:12,588 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815228532] [2020-10-16 11:13:12,588 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:13:12,588 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 11:13:12,589 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213734979] [2020-10-16 11:13:12,589 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 11:13:12,589 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:13:12,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 11:13:12,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 11:13:12,590 INFO L87 Difference]: Start difference. First operand 344 states and 878 transitions. Second operand 5 states. [2020-10-16 11:13:12,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:13:12,655 INFO L93 Difference]: Finished difference Result 282 states and 663 transitions. [2020-10-16 11:13:12,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 11:13:12,656 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-10-16 11:13:12,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:13:12,658 INFO L225 Difference]: With dead ends: 282 [2020-10-16 11:13:12,658 INFO L226 Difference]: Without dead ends: 217 [2020-10-16 11:13:12,659 INFO L677 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-16 11:13:12,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2020-10-16 11:13:12,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2020-10-16 11:13:12,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2020-10-16 11:13:12,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 497 transitions. [2020-10-16 11:13:12,666 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 497 transitions. Word has length 15 [2020-10-16 11:13:12,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:13:12,667 INFO L481 AbstractCegarLoop]: Abstraction has 217 states and 497 transitions. [2020-10-16 11:13:12,667 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 11:13:12,667 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 497 transitions. [2020-10-16 11:13:12,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-16 11:13:12,669 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:13:12,669 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:13:12,669 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 11:13:12,669 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:13:12,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:13:12,670 INFO L82 PathProgramCache]: Analyzing trace with hash -726028274, now seen corresponding path program 1 times [2020-10-16 11:13:12,670 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:13:12,671 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960440894] [2020-10-16 11:13:12,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:13:12,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:13:12,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:13:12,888 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960440894] [2020-10-16 11:13:12,888 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:13:12,888 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 11:13:12,889 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571349063] [2020-10-16 11:13:12,889 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 11:13:12,889 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:13:12,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 11:13:12,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-16 11:13:12,891 INFO L87 Difference]: Start difference. First operand 217 states and 497 transitions. Second operand 6 states. [2020-10-16 11:13:13,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:13:13,013 INFO L93 Difference]: Finished difference Result 349 states and 759 transitions. [2020-10-16 11:13:13,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 11:13:13,014 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-10-16 11:13:13,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:13:13,017 INFO L225 Difference]: With dead ends: 349 [2020-10-16 11:13:13,017 INFO L226 Difference]: Without dead ends: 315 [2020-10-16 11:13:13,017 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-16 11:13:13,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2020-10-16 11:13:13,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 243. [2020-10-16 11:13:13,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2020-10-16 11:13:13,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 545 transitions. [2020-10-16 11:13:13,025 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 545 transitions. Word has length 17 [2020-10-16 11:13:13,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:13:13,026 INFO L481 AbstractCegarLoop]: Abstraction has 243 states and 545 transitions. [2020-10-16 11:13:13,026 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 11:13:13,026 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 545 transitions. [2020-10-16 11:13:13,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-16 11:13:13,027 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:13:13,027 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:13:13,027 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 11:13:13,028 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:13:13,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:13:13,028 INFO L82 PathProgramCache]: Analyzing trace with hash 632441612, now seen corresponding path program 2 times [2020-10-16 11:13:13,028 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:13:13,028 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563774067] [2020-10-16 11:13:13,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:13:13,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:13:13,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:13:13,068 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563774067] [2020-10-16 11:13:13,068 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:13:13,068 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 11:13:13,068 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214810998] [2020-10-16 11:13:13,069 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 11:13:13,069 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:13:13,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 11:13:13,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 11:13:13,069 INFO L87 Difference]: Start difference. First operand 243 states and 545 transitions. Second operand 3 states. [2020-10-16 11:13:13,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:13:13,083 INFO L93 Difference]: Finished difference Result 334 states and 730 transitions. [2020-10-16 11:13:13,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 11:13:13,084 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2020-10-16 11:13:13,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:13:13,086 INFO L225 Difference]: With dead ends: 334 [2020-10-16 11:13:13,087 INFO L226 Difference]: Without dead ends: 244 [2020-10-16 11:13:13,087 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-16 11:13:13,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2020-10-16 11:13:13,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 212. [2020-10-16 11:13:13,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2020-10-16 11:13:13,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 451 transitions. [2020-10-16 11:13:13,094 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 451 transitions. Word has length 17 [2020-10-16 11:13:13,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:13:13,095 INFO L481 AbstractCegarLoop]: Abstraction has 212 states and 451 transitions. [2020-10-16 11:13:13,095 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 11:13:13,095 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 451 transitions. [2020-10-16 11:13:13,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-16 11:13:13,096 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:13:13,096 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:13:13,096 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 11:13:13,097 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:13:13,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:13:13,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1032040049, now seen corresponding path program 1 times [2020-10-16 11:13:13,097 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:13:13,098 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459593421] [2020-10-16 11:13:13,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:13:13,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:13:13,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:13:13,207 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459593421] [2020-10-16 11:13:13,207 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:13:13,207 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 11:13:13,207 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843367037] [2020-10-16 11:13:13,208 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 11:13:13,208 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:13:13,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 11:13:13,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 11:13:13,209 INFO L87 Difference]: Start difference. First operand 212 states and 451 transitions. Second operand 6 states. [2020-10-16 11:13:13,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:13:13,269 INFO L93 Difference]: Finished difference Result 191 states and 408 transitions. [2020-10-16 11:13:13,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 11:13:13,270 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-10-16 11:13:13,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:13:13,271 INFO L225 Difference]: With dead ends: 191 [2020-10-16 11:13:13,271 INFO L226 Difference]: Without dead ends: 113 [2020-10-16 11:13:13,272 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-16 11:13:13,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2020-10-16 11:13:13,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 109. [2020-10-16 11:13:13,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2020-10-16 11:13:13,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 223 transitions. [2020-10-16 11:13:13,275 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 223 transitions. Word has length 18 [2020-10-16 11:13:13,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:13:13,276 INFO L481 AbstractCegarLoop]: Abstraction has 109 states and 223 transitions. [2020-10-16 11:13:13,276 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 11:13:13,276 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 223 transitions. [2020-10-16 11:13:13,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-16 11:13:13,277 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:13:13,277 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:13:13,277 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 11:13:13,277 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:13:13,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:13:13,278 INFO L82 PathProgramCache]: Analyzing trace with hash 430399513, now seen corresponding path program 1 times [2020-10-16 11:13:13,278 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:13:13,278 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365208597] [2020-10-16 11:13:13,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:13:13,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:13:13,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:13:13,512 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365208597] [2020-10-16 11:13:13,514 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:13:13,514 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 11:13:13,514 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329270682] [2020-10-16 11:13:13,515 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 11:13:13,515 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:13:13,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 11:13:13,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-16 11:13:13,516 INFO L87 Difference]: Start difference. First operand 109 states and 223 transitions. Second operand 8 states. [2020-10-16 11:13:13,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:13:13,745 INFO L93 Difference]: Finished difference Result 146 states and 284 transitions. [2020-10-16 11:13:13,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 11:13:13,746 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2020-10-16 11:13:13,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:13:13,747 INFO L225 Difference]: With dead ends: 146 [2020-10-16 11:13:13,747 INFO L226 Difference]: Without dead ends: 120 [2020-10-16 11:13:13,747 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2020-10-16 11:13:13,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2020-10-16 11:13:13,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 97. [2020-10-16 11:13:13,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-10-16 11:13:13,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 195 transitions. [2020-10-16 11:13:13,751 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 195 transitions. Word has length 21 [2020-10-16 11:13:13,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:13:13,751 INFO L481 AbstractCegarLoop]: Abstraction has 97 states and 195 transitions. [2020-10-16 11:13:13,752 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 11:13:13,752 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 195 transitions. [2020-10-16 11:13:13,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-16 11:13:13,752 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:13:13,752 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:13:13,753 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 11:13:13,753 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:13:13,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:13:13,753 INFO L82 PathProgramCache]: Analyzing trace with hash 288272655, now seen corresponding path program 2 times [2020-10-16 11:13:13,753 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:13:13,754 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658913211] [2020-10-16 11:13:13,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:13:13,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 11:13:13,800 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 11:13:13,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 11:13:13,834 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 11:13:13,872 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 11:13:13,872 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 11:13:13,872 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-16 11:13:13,873 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-16 11:13:13,885 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [936] [936] L821-->L828: Formula: (let ((.cse9 (= (mod ~y$r_buff1_thd0~0_In-1241657011 256) 0)) (.cse8 (= (mod ~y$w_buff1_used~0_In-1241657011 256) 0)) (.cse7 (= (mod ~y$r_buff0_thd0~0_In-1241657011 256) 0)) (.cse6 (= (mod ~y$w_buff0_used~0_In-1241657011 256) 0))) (let ((.cse3 (or .cse7 .cse6)) (.cse0 (not .cse8)) (.cse1 (not .cse9)) (.cse2 (or .cse8 .cse9)) (.cse4 (not .cse7)) (.cse5 (not .cse6))) (and (or (and (= ~y$w_buff1_used~0_Out-1241657011 0) .cse0 .cse1) (and (= ~y$w_buff1_used~0_In-1241657011 ~y$w_buff1_used~0_Out-1241657011) .cse2)) (= ~y$r_buff0_thd0~0_In-1241657011 ~y$r_buff0_thd0~0_Out-1241657011) (= ~y$r_buff1_thd0~0_Out-1241657011 ~y$r_buff1_thd0~0_In-1241657011) (or (and .cse3 (= ~y$w_buff0_used~0_Out-1241657011 ~y$w_buff0_used~0_In-1241657011)) (and (= ~y$w_buff0_used~0_Out-1241657011 0) .cse4 .cse5)) (or (and .cse3 (or (and (= ~y$w_buff1~0_In-1241657011 ~y~0_Out-1241657011) .cse0 .cse1) (and (= ~y~0_Out-1241657011 ~y~0_In-1241657011) .cse2))) (and .cse4 .cse5 (= ~y$w_buff0~0_In-1241657011 ~y~0_Out-1241657011))) (= ULTIMATE.start_assume_abort_if_not_~cond_Out-1241657011 |ULTIMATE.start_assume_abort_if_not_#in~cond_In-1241657011|) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-1241657011 0))))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-1241657011|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1241657011, ~y$w_buff1~0=~y$w_buff1~0_In-1241657011, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1241657011, ~y$w_buff0~0=~y$w_buff0~0_In-1241657011, ~y~0=~y~0_In-1241657011, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1241657011, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1241657011} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out-1241657011, ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out-1241657011|, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out-1241657011|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-1241657011|, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-1241657011|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1241657011|, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-1241657011|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-1241657011|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-1241657011, ~y$w_buff1~0=~y$w_buff1~0_In-1241657011, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out-1241657011, ~y$w_buff0~0=~y$w_buff0~0_In-1241657011, ~y~0=~y~0_Out-1241657011, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-1241657011, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out-1241657011} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite20, ~y~0, ULTIMATE.start_main_#t~ite21, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite22, ~y$w_buff1_used~0] because there is no mapped edge [2020-10-16 11:13:13,892 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:13:13,892 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:13:13,894 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:13:13,894 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:13:13,894 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:13:13,895 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:13:13,895 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:13:13,895 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:13:13,895 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:13:13,895 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:13:13,896 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:13:13,896 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:13:13,896 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:13:13,896 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:13:13,897 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:13:13,897 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:13:13,897 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:13:13,897 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:13:13,897 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:13:13,897 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:13:13,897 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:13:13,898 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:13:13,898 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:13:13,898 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:13:13,899 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:13:13,899 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:13:13,899 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:13:13,899 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:13:13,899 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:13:13,900 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:13:13,900 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:13:13,900 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:13:13,900 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:13:13,900 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:13:13,900 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:13:13,900 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:13:13,901 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:13:13,901 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:13:13,901 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:13:13,901 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:13:13,901 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:13:13,902 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:13:13,902 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:13:13,902 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:13:13,902 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:13:13,902 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:13:13,984 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 11:13:13 BasicIcfg [2020-10-16 11:13:13,984 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 11:13:13,987 INFO L168 Benchmark]: Toolchain (without parser) took 15937.20 ms. Allocated memory was 139.5 MB in the beginning and 416.3 MB in the end (delta: 276.8 MB). Free memory was 101.6 MB in the beginning and 337.0 MB in the end (delta: -235.4 MB). Peak memory consumption was 41.5 MB. Max. memory is 7.1 GB. [2020-10-16 11:13:13,987 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 139.5 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-10-16 11:13:13,988 INFO L168 Benchmark]: CACSL2BoogieTranslator took 817.37 ms. Allocated memory was 139.5 MB in the beginning and 203.9 MB in the end (delta: 64.5 MB). Free memory was 101.2 MB in the beginning and 161.1 MB in the end (delta: -59.9 MB). Peak memory consumption was 29.4 MB. Max. memory is 7.1 GB. [2020-10-16 11:13:13,988 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.82 ms. Allocated memory is still 203.9 MB. Free memory was 161.1 MB in the beginning and 157.6 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. [2020-10-16 11:13:13,989 INFO L168 Benchmark]: Boogie Preprocessor took 45.40 ms. Allocated memory is still 203.9 MB. Free memory was 157.6 MB in the beginning and 155.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2020-10-16 11:13:13,990 INFO L168 Benchmark]: RCFGBuilder took 2001.47 ms. Allocated memory was 203.9 MB in the beginning and 250.6 MB in the end (delta: 46.7 MB). Free memory was 155.5 MB in the beginning and 205.5 MB in the end (delta: -49.9 MB). Peak memory consumption was 107.3 MB. Max. memory is 7.1 GB. [2020-10-16 11:13:13,993 INFO L168 Benchmark]: TraceAbstraction took 12991.95 ms. Allocated memory was 250.6 MB in the beginning and 416.3 MB in the end (delta: 165.7 MB). Free memory was 205.5 MB in the beginning and 337.0 MB in the end (delta: -131.5 MB). Peak memory consumption was 34.2 MB. Max. memory is 7.1 GB. [2020-10-16 11:13:13,998 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 139.5 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 817.37 ms. Allocated memory was 139.5 MB in the beginning and 203.9 MB in the end (delta: 64.5 MB). Free memory was 101.2 MB in the beginning and 161.1 MB in the end (delta: -59.9 MB). Peak memory consumption was 29.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 74.82 ms. Allocated memory is still 203.9 MB. Free memory was 161.1 MB in the beginning and 157.6 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 45.40 ms. Allocated memory is still 203.9 MB. Free memory was 157.6 MB in the beginning and 155.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2001.47 ms. Allocated memory was 203.9 MB in the beginning and 250.6 MB in the end (delta: 46.7 MB). Free memory was 155.5 MB in the beginning and 205.5 MB in the end (delta: -49.9 MB). Peak memory consumption was 107.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12991.95 ms. Allocated memory was 250.6 MB in the beginning and 416.3 MB in the end (delta: 165.7 MB). Free memory was 205.5 MB in the beginning and 337.0 MB in the end (delta: -131.5 MB). Peak memory consumption was 34.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1223 VarBasedMoverChecksPositive, 82 VarBasedMoverChecksNegative, 23 SemBasedMoverChecksPositive, 59 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.7s, 141 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 9.4s, 103 PlacesBefore, 36 PlacesAfterwards, 95 TransitionsBefore, 26 TransitionsAfterwards, 1692 CoEnabledTransitionPairs, 7 FixpointIterations, 33 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 2 ChoiceCompositions, 82 TotalNumberOfCompositions, 4495 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L698] 0 int __unbuffered_cnt = 0; [L700] 0 int __unbuffered_p2_EAX = 0; [L702] 0 int __unbuffered_p2_EBX = 0; [L704] 0 int a = 0; [L705] 0 _Bool main$tmp_guard0; [L706] 0 _Bool main$tmp_guard1; [L708] 0 int x = 0; [L710] 0 int y = 0; [L711] 0 _Bool y$flush_delayed; [L712] 0 int y$mem_tmp; [L713] 0 _Bool y$r_buff0_thd0; [L714] 0 _Bool y$r_buff0_thd1; [L715] 0 _Bool y$r_buff0_thd2; [L716] 0 _Bool y$r_buff0_thd3; [L717] 0 _Bool y$r_buff1_thd0; [L718] 0 _Bool y$r_buff1_thd1; [L719] 0 _Bool y$r_buff1_thd2; [L720] 0 _Bool y$r_buff1_thd3; [L721] 0 _Bool y$read_delayed; [L722] 0 int *y$read_delayed_var; [L723] 0 int y$w_buff0; [L724] 0 _Bool y$w_buff0_used; [L725] 0 int y$w_buff1; [L726] 0 _Bool y$w_buff1_used; [L728] 0 int z = 0; [L729] 0 _Bool weak$$choice0; [L730] 0 _Bool weak$$choice2; [L812] 0 pthread_t t1214; [L813] FCALL, FORK 0 pthread_create(&t1214, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L814] 0 pthread_t t1215; [L815] FCALL, FORK 0 pthread_create(&t1215, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L816] 0 pthread_t t1216; [L817] FCALL, FORK 0 pthread_create(&t1216, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L769] 3 y$w_buff1 = y$w_buff0 [L770] 3 y$w_buff0 = 2 [L771] 3 y$w_buff1_used = y$w_buff0_used [L772] 3 y$w_buff0_used = (_Bool)1 [L7] COND TRUE 3 !expression [L7] 3 __VERIFIER_error() [L774] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L775] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L776] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L777] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L778] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L781] 3 z = 1 [L784] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L734] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L737] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L742] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L744] 1 return 0; [L749] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L752] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L790] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L790] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L791] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L792] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L792] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L793] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L794] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L794] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L797] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 3 return 0; [L755] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L755] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L755] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L755] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L756] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L756] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L757] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L757] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L758] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L758] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L759] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L759] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L762] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L764] 2 return 0; [L819] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L830] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L831] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L832] 0 y$flush_delayed = weak$$choice2 [L833] 0 y$mem_tmp = y [L834] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L834] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L835] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L835] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L835] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L835] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L836] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L836] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L836] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1 [L836] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L836] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L836] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L837] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L837] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L838] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L838] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L839] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L839] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L840] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L841] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L842] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L842] 0 y = y$flush_delayed ? y$mem_tmp : y [L843] 0 y$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 94 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 12.7s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.5s, HoareTripleCheckerStatistics: 310 SDtfs, 299 SDslu, 433 SDs, 0 SdLazy, 240 SolverSat, 63 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=750occurred 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.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 139 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 195 NumberOfCodeBlocks, 195 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 161 ConstructedInterpolants, 0 QuantifiedInterpolants, 14075 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...