/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe029_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-11af1e5 [2020-10-11 15:09:44,720 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-11 15:09:44,723 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-11 15:09:44,762 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-11 15:09:44,763 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-11 15:09:44,771 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-11 15:09:44,773 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-11 15:09:44,777 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-11 15:09:44,780 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-11 15:09:44,782 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-11 15:09:44,783 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-11 15:09:44,784 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-11 15:09:44,785 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-11 15:09:44,787 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-11 15:09:44,789 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-11 15:09:44,791 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-11 15:09:44,792 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-11 15:09:44,793 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-11 15:09:44,794 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-11 15:09:44,802 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-11 15:09:44,804 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-11 15:09:44,805 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-11 15:09:44,806 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-11 15:09:44,807 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-11 15:09:44,818 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-11 15:09:44,819 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-11 15:09:44,820 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-11 15:09:44,821 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-11 15:09:44,826 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-11 15:09:44,827 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-11 15:09:44,828 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-11 15:09:44,828 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-11 15:09:44,829 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-11 15:09:44,834 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-11 15:09:44,835 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-11 15:09:44,835 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-11 15:09:44,836 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-11 15:09:44,836 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-11 15:09:44,838 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-11 15:09:44,839 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-11 15:09:44,839 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-11 15:09:44,840 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-11 15:09:44,879 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-11 15:09:44,879 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-11 15:09:44,881 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-11 15:09:44,881 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-11 15:09:44,881 INFO L138 SettingsManager]: * Use SBE=true [2020-10-11 15:09:44,882 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-11 15:09:44,882 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-11 15:09:44,882 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-11 15:09:44,882 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-11 15:09:44,882 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-11 15:09:44,884 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-11 15:09:44,884 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-11 15:09:44,884 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-11 15:09:44,884 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-11 15:09:44,885 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-11 15:09:44,885 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-11 15:09:44,885 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-11 15:09:44,885 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-11 15:09:44,885 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-11 15:09:44,886 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-11 15:09:44,886 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-11 15:09:44,886 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-11 15:09:44,887 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-11 15:09:44,887 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-11 15:09:44,887 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-11 15:09:44,887 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-11 15:09:44,887 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-11 15:09:44,888 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-11 15:09:44,888 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-11 15:09:44,888 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-11 15:09:45,175 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-11 15:09:45,187 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-11 15:09:45,191 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-11 15:09:45,192 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-11 15:09:45,192 INFO L275 PluginConnector]: CDTParser initialized [2020-10-11 15:09:45,193 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_power.opt.i [2020-10-11 15:09:45,255 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d139fd5d/4ca5dd0003294882b18468da8c90affe/FLAG980bc4d18 [2020-10-11 15:09:45,819 INFO L306 CDTParser]: Found 1 translation units. [2020-10-11 15:09:45,820 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_power.opt.i [2020-10-11 15:09:45,845 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d139fd5d/4ca5dd0003294882b18468da8c90affe/FLAG980bc4d18 [2020-10-11 15:09:46,084 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d139fd5d/4ca5dd0003294882b18468da8c90affe [2020-10-11 15:09:46,092 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-11 15:09:46,093 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-11 15:09:46,094 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-11 15:09:46,094 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-11 15:09:46,098 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-11 15:09:46,099 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:09:46" (1/1) ... [2020-10-11 15:09:46,102 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e25dab0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:09:46, skipping insertion in model container [2020-10-11 15:09:46,102 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:09:46" (1/1) ... [2020-10-11 15:09:46,110 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-11 15:09:46,177 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-11 15:09:46,623 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 15:09:46,645 INFO L203 MainTranslator]: Completed pre-run [2020-10-11 15:09:46,771 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 15:09:46,857 INFO L208 MainTranslator]: Completed translation [2020-10-11 15:09:46,858 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:09:46 WrapperNode [2020-10-11 15:09:46,858 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-11 15:09:46,859 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-11 15:09:46,859 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-11 15:09:46,859 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-11 15:09:46,868 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:09:46" (1/1) ... [2020-10-11 15:09:46,887 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:09:46" (1/1) ... [2020-10-11 15:09:46,921 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-11 15:09:46,922 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-11 15:09:46,922 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-11 15:09:46,922 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-11 15:09:46,932 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:09:46" (1/1) ... [2020-10-11 15:09:46,932 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:09:46" (1/1) ... [2020-10-11 15:09:46,937 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:09:46" (1/1) ... [2020-10-11 15:09:46,937 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:09:46" (1/1) ... [2020-10-11 15:09:46,946 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:09:46" (1/1) ... [2020-10-11 15:09:46,950 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:09:46" (1/1) ... [2020-10-11 15:09:46,954 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:09:46" (1/1) ... [2020-10-11 15:09:46,959 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-11 15:09:46,959 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-11 15:09:46,960 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-11 15:09:46,960 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-11 15:09:46,961 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:09:46" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-11 15:09:47,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-11 15:09:47,044 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-11 15:09:47,045 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-11 15:09:47,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-11 15:09:47,045 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-11 15:09:47,046 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-11 15:09:47,046 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-11 15:09:47,047 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-11 15:09:47,047 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-11 15:09:47,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-11 15:09:47,048 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-11 15:09:47,055 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-11 15:09:49,082 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-11 15:09:49,083 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-11 15:09:49,086 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:09:49 BoogieIcfgContainer [2020-10-11 15:09:49,086 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-11 15:09:49,088 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-11 15:09:49,088 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-11 15:09:49,093 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-11 15:09:49,094 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 03:09:46" (1/3) ... [2020-10-11 15:09:49,095 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f1cb8ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:09:49, skipping insertion in model container [2020-10-11 15:09:49,096 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:09:46" (2/3) ... [2020-10-11 15:09:49,098 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f1cb8ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:09:49, skipping insertion in model container [2020-10-11 15:09:49,099 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:09:49" (3/3) ... [2020-10-11 15:09:49,102 INFO L111 eAbstractionObserver]: Analyzing ICFG safe029_power.opt.i [2020-10-11 15:09:49,113 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-11 15:09:49,113 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-11 15:09:49,120 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-11 15:09:49,121 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-11 15:09:49,147 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:09:49,147 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:09:49,147 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:09:49,148 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:09:49,148 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:09:49,148 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:09:49,149 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:09:49,149 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:09:49,149 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:09:49,149 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:09:49,149 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:09:49,150 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:09:49,150 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:09:49,151 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:09:49,151 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:09:49,151 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:09:49,152 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:09:49,152 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:09:49,152 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:09:49,152 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:09:49,153 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:09:49,153 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:09:49,153 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:09:49,153 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:09:49,154 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:09:49,154 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:09:49,154 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:09:49,154 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:09:49,155 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:09:49,155 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:09:49,159 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:09:49,159 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:09:49,160 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:09:49,160 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:09:49,160 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:09:49,160 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:09:49,160 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:09:49,160 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:09:49,161 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:09:49,161 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:09:49,166 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:09:49,166 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:09:49,166 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:09:49,167 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:09:49,167 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:09:49,167 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:09:49,167 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:09:49,167 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:09:49,168 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:09:49,168 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:09:49,168 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:09:49,168 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:09:49,184 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-10-11 15:09:49,205 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-11 15:09:49,205 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-11 15:09:49,205 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-11 15:09:49,206 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-11 15:09:49,206 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-11 15:09:49,206 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-11 15:09:49,206 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-11 15:09:49,206 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-11 15:09:49,219 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-11 15:09:49,222 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 74 transitions, 158 flow [2020-10-11 15:09:49,225 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 74 transitions, 158 flow [2020-10-11 15:09:49,227 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 79 places, 74 transitions, 158 flow [2020-10-11 15:09:49,268 INFO L129 PetriNetUnfolder]: 2/72 cut-off events. [2020-10-11 15:09:49,268 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 15:09:49,273 INFO L80 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 72 events. 2/72 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 47 event pairs, 0 based on Foata normal form. 0/68 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2020-10-11 15:09:49,276 INFO L117 LiptonReduction]: Number of co-enabled transitions 888 [2020-10-11 15:09:49,521 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-11 15:09:49,522 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:09:49,524 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-11 15:09:49,525 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:09:49,531 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 15:09:49,531 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-11 15:09:49,537 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-11 15:09:49,538 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:09:49,656 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:09:49,657 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:09:49,668 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-11 15:09:49,668 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:09:49,669 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:09:49,670 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:09:49,675 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:09:49,675 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 15:09:49,677 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:09:49,678 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 15:09:49,680 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:09:49,680 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 15:09:49,685 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-11 15:09:49,685 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:09:49,689 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-11 15:09:49,689 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:09:49,691 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-11 15:09:49,691 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:09:49,761 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-11 15:09:49,762 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:09:49,763 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-11 15:09:49,764 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:09:49,795 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-11 15:09:49,795 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:09:49,796 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-11 15:09:49,797 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:09:49,851 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:09:49,851 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:09:49,857 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-11 15:09:49,858 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:09:49,859 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:09:49,859 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:09:49,863 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:09:49,864 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 15:09:49,867 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:09:49,867 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 15:09:49,869 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:09:49,869 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 15:09:49,873 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-11 15:09:49,873 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:09:49,876 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-11 15:09:49,877 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:09:49,878 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-11 15:09:49,879 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:09:49,926 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-11 15:09:49,927 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:09:49,928 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-11 15:09:49,929 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:09:49,931 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 15:09:49,932 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-11 15:09:49,935 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-11 15:09:49,935 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:09:50,012 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-11 15:09:50,012 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:09:50,013 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-11 15:09:50,014 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:09:50,036 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 3, 2, 1] term [2020-10-11 15:09:50,037 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:09:50,038 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-11 15:09:50,038 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:09:50,091 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:09:50,091 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:09:50,094 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-11 15:09:50,094 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:09:50,095 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:09:50,096 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:09:50,099 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:09:50,099 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 15:09:50,100 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:09:50,101 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 15:09:50,103 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:09:50,104 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 15:09:50,106 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-11 15:09:50,106 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:09:50,108 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-11 15:09:50,108 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:09:50,111 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-11 15:09:50,111 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:09:50,156 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-11 15:09:50,157 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:09:50,158 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-11 15:09:50,158 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:09:50,161 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 15:09:50,161 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-11 15:09:50,164 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-11 15:09:50,164 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:09:50,235 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 2, 1] term [2020-10-11 15:09:50,236 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:09:50,236 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-11 15:09:50,237 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:09:50,265 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-11 15:09:50,266 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:09:50,267 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-10-11 15:09:50,267 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:09:50,268 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-10-11 15:09:50,268 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:09:50,272 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-11 15:09:50,273 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:09:50,274 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-11 15:09:50,274 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:09:50,298 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-11 15:09:50,298 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:09:50,299 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-11 15:09:50,300 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:09:50,319 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-11 15:09:50,319 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:09:50,320 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-11 15:09:50,320 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:09:50,680 WARN L193 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-11 15:09:50,791 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-11 15:09:51,054 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-11 15:09:51,055 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:09:51,056 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-11 15:09:51,056 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:09:51,058 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 15:09:51,059 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-11 15:09:51,061 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-11 15:09:51,061 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:09:51,104 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 15:09:51,105 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:09:51,109 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-11 15:09:51,110 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:09:51,111 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:09:51,111 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:09:51,113 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:09:51,114 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 15:09:51,116 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:09:51,116 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 15:09:51,117 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:09:51,118 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 15:09:51,120 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-11 15:09:51,120 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:09:51,122 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-11 15:09:51,122 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:09:51,124 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-11 15:09:51,124 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:09:52,627 WARN L193 SmtUtils]: Spent 1.47 s on a formula simplification. DAG size of input: 224 DAG size of output: 184 [2020-10-11 15:09:52,640 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-10-11 15:09:52,641 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:09:52,642 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-11 15:09:52,642 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:09:53,780 WARN L193 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 139 DAG size of output: 119 [2020-10-11 15:09:53,823 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 15:09:53,824 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:09:53,825 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:09:53,825 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:09:53,827 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:09:53,828 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:09:53,829 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-11 15:09:53,829 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:09:53,844 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:09:53,844 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:09:53,845 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:09:53,845 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:09:53,847 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:09:53,848 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 15:09:53,852 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 15:09:53,853 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 15:09:53,893 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 15:09:53,897 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:09:53,898 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:09:53,898 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:09:53,900 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:09:53,900 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 15:09:53,905 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 15:09:53,906 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 15:09:53,921 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 15:09:53,921 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:09:53,922 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:09:53,922 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:09:53,924 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:09:53,925 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 15:09:53,927 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 15:09:53,927 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 15:09:53,975 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 15:09:53,976 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:09:53,976 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:09:53,977 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:09:53,978 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:09:53,979 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 15:09:53,980 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 15:09:53,981 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 15:09:53,997 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 15:09:53,997 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:09:53,998 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:09:53,998 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:09:54,000 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:09:54,000 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 15:09:54,001 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 15:09:54,002 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 15:09:54,320 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 15:09:54,320 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:09:54,321 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:09:54,321 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:09:54,323 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:09:54,323 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:09:54,324 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-11 15:09:54,325 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:09:54,336 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 15:09:54,336 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:09:54,337 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:09:54,338 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:09:54,339 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:09:54,339 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 15:09:54,341 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 15:09:54,342 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 15:09:54,361 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-11 15:09:54,362 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:09:54,363 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:09:54,363 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:09:54,364 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:09:54,364 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:09:54,365 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:09:54,365 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:09:54,367 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:09:54,367 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:09:54,369 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:09:54,369 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:09:54,371 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 15:09:54,371 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:09:54,372 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:09:54,373 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:09:54,374 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 4, 3, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:09:54,374 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:09:54,389 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 15:09:54,390 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 15:09:54,391 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 15:09:54,392 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:09:55,332 WARN L193 SmtUtils]: Spent 919.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 116 [2020-10-11 15:09:55,614 WARN L193 SmtUtils]: Spent 279.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2020-10-11 15:09:56,183 WARN L193 SmtUtils]: Spent 567.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 104 [2020-10-11 15:09:56,439 WARN L193 SmtUtils]: Spent 254.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2020-10-11 15:09:56,474 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 15:09:56,474 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:09:56,475 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:09:56,475 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:09:56,477 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:09:56,478 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 15:09:56,480 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 15:09:56,480 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 15:09:56,500 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:09:56,501 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:09:56,501 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:09:56,502 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:09:56,503 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:09:56,504 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 15:09:56,506 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 15:09:56,506 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 15:09:56,686 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 15:09:56,686 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 15:09:56,688 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 15:09:56,688 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:09:56,703 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-11 15:09:56,703 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:09:56,704 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:09:56,705 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:09:56,705 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:09:56,705 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:09:56,706 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:09:56,707 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:09:56,708 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:09:56,709 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:09:56,710 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:09:56,710 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:09:56,711 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 15:09:56,712 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:09:56,721 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:09:56,722 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:09:56,725 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:09:56,725 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:09:56,764 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 15:09:56,764 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:09:56,765 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:09:56,765 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:09:56,767 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:09:56,767 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 15:09:56,769 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 15:09:56,769 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 15:09:56,786 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:09:56,786 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:09:56,787 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:09:56,787 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:09:56,791 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:09:56,792 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:09:56,795 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-11 15:09:56,796 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:09:56,853 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:09:56,854 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:09:56,855 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:09:56,858 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:09:56,863 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:09:56,864 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 15:09:56,867 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 15:09:56,868 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 15:09:56,885 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:09:56,886 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:09:56,886 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:09:56,887 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:09:56,888 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:09:56,889 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 15:09:56,890 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 15:09:56,891 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 15:09:56,976 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 5, 3, 5, 3, 2, 1] term [2020-10-11 15:09:56,977 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 15:09:56,979 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 2, 1] term [2020-10-11 15:09:56,979 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:09:56,993 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 3, 5, 2, 2, 1] term [2020-10-11 15:09:56,993 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:09:56,994 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 3, 2, 1] term [2020-10-11 15:09:56,994 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:09:56,995 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:09:56,995 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:09:56,996 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:09:56,997 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:09:56,999 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:09:56,999 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:09:57,001 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:09:57,001 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:09:57,003 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 5, 3, 5, 3, 2, 1] term [2020-10-11 15:09:57,003 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:09:57,005 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 3, 5, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:09:57,005 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:09:57,006 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 5, 3, 5, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:09:57,006 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:09:57,131 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 4, 2, 2, 1] term [2020-10-11 15:09:57,132 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:09:57,132 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 15:09:57,133 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:09:57,133 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:09:57,133 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:09:57,134 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:09:57,134 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:09:57,137 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:09:57,138 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:09:57,139 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:09:57,139 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:09:57,140 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 2, 2, 1] term [2020-10-11 15:09:57,141 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:09:57,142 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 4, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:09:57,142 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:09:57,143 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 4, 3, 4, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:09:57,143 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:09:57,166 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 2, 2, 1] term [2020-10-11 15:09:57,166 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 15:09:57,168 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 2, 1] term [2020-10-11 15:09:57,171 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:09:57,499 WARN L193 SmtUtils]: Spent 307.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2020-10-11 15:09:57,826 WARN L193 SmtUtils]: Spent 325.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2020-10-11 15:09:58,294 WARN L193 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2020-10-11 15:09:58,390 INFO L132 LiptonReduction]: Checked pairs total: 2314 [2020-10-11 15:09:58,390 INFO L134 LiptonReduction]: Total number of compositions: 66 [2020-10-11 15:09:58,397 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 26 places, 20 transitions, 50 flow [2020-10-11 15:09:58,415 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 162 states. [2020-10-11 15:09:58,417 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states. [2020-10-11 15:09:58,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-11 15:09:58,423 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:09:58,424 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-11 15:09:58,425 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:09:58,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:09:58,431 INFO L82 PathProgramCache]: Analyzing trace with hash 860640783, now seen corresponding path program 1 times [2020-10-11 15:09:58,441 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:09:58,441 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866353590] [2020-10-11 15:09:58,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:09:58,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:09:58,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:09:58,667 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866353590] [2020-10-11 15:09:58,668 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:09:58,668 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-11 15:09:58,669 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227518152] [2020-10-11 15:09:58,674 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-11 15:09:58,674 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:09:58,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-11 15:09:58,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 15:09:58,693 INFO L87 Difference]: Start difference. First operand 162 states. Second operand 3 states. [2020-10-11 15:09:58,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:09:58,767 INFO L93 Difference]: Finished difference Result 137 states and 320 transitions. [2020-10-11 15:09:58,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-11 15:09:58,769 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-10-11 15:09:58,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:09:58,782 INFO L225 Difference]: With dead ends: 137 [2020-10-11 15:09:58,782 INFO L226 Difference]: Without dead ends: 112 [2020-10-11 15:09:58,783 INFO L673 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-11 15:09:58,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-10-11 15:09:58,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2020-10-11 15:09:58,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-10-11 15:09:58,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 255 transitions. [2020-10-11 15:09:58,834 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 255 transitions. Word has length 5 [2020-10-11 15:09:58,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:09:58,834 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 255 transitions. [2020-10-11 15:09:58,835 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-11 15:09:58,835 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 255 transitions. [2020-10-11 15:09:58,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-11 15:09:58,835 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:09:58,835 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:09:58,836 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-11 15:09:58,836 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:09:58,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:09:58,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1852838512, now seen corresponding path program 1 times [2020-10-11 15:09:58,837 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:09:58,837 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5256266] [2020-10-11 15:09:58,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:09:58,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:09:58,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-11 15:09:58,972 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5256266] [2020-10-11 15:09:58,972 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:09:58,973 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-11 15:09:58,973 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636270823] [2020-10-11 15:09:58,974 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-11 15:09:58,975 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:09:58,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-11 15:09:58,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 15:09:58,976 INFO L87 Difference]: Start difference. First operand 112 states and 255 transitions. Second operand 3 states. [2020-10-11 15:09:58,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:09:58,987 INFO L93 Difference]: Finished difference Result 110 states and 249 transitions. [2020-10-11 15:09:58,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-11 15:09:58,988 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-10-11 15:09:58,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:09:58,990 INFO L225 Difference]: With dead ends: 110 [2020-10-11 15:09:58,990 INFO L226 Difference]: Without dead ends: 110 [2020-10-11 15:09:58,991 INFO L673 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-11 15:09:58,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2020-10-11 15:09:59,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2020-10-11 15:09:59,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-10-11 15:09:59,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 249 transitions. [2020-10-11 15:09:59,003 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 249 transitions. Word has length 7 [2020-10-11 15:09:59,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:09:59,003 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 249 transitions. [2020-10-11 15:09:59,003 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-11 15:09:59,003 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 249 transitions. [2020-10-11 15:09:59,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-10-11 15:09:59,004 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:09:59,004 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:09:59,004 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-11 15:09:59,005 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:09:59,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:09:59,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1603419562, now seen corresponding path program 1 times [2020-10-11 15:09:59,005 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:09:59,005 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230054434] [2020-10-11 15:09:59,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:09:59,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:09:59,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:09:59,120 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230054434] [2020-10-11 15:09:59,120 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:09:59,120 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-11 15:09:59,120 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949271768] [2020-10-11 15:09:59,121 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-11 15:09:59,122 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:09:59,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-11 15:09:59,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-11 15:09:59,122 INFO L87 Difference]: Start difference. First operand 110 states and 249 transitions. Second operand 4 states. [2020-10-11 15:09:59,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:09:59,176 INFO L93 Difference]: Finished difference Result 109 states and 246 transitions. [2020-10-11 15:09:59,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-11 15:09:59,183 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-10-11 15:09:59,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:09:59,185 INFO L225 Difference]: With dead ends: 109 [2020-10-11 15:09:59,185 INFO L226 Difference]: Without dead ends: 109 [2020-10-11 15:09:59,185 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-11 15:09:59,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2020-10-11 15:09:59,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2020-10-11 15:09:59,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2020-10-11 15:09:59,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 246 transitions. [2020-10-11 15:09:59,205 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 246 transitions. Word has length 8 [2020-10-11 15:09:59,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:09:59,205 INFO L481 AbstractCegarLoop]: Abstraction has 109 states and 246 transitions. [2020-10-11 15:09:59,205 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-11 15:09:59,205 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 246 transitions. [2020-10-11 15:09:59,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-11 15:09:59,206 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:09:59,206 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:09:59,207 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-11 15:09:59,207 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:09:59,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:09:59,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1832994573, now seen corresponding path program 1 times [2020-10-11 15:09:59,209 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:09:59,209 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428789414] [2020-10-11 15:09:59,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:09:59,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:09:59,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:09:59,294 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428789414] [2020-10-11 15:09:59,295 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:09:59,295 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-11 15:09:59,295 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866735551] [2020-10-11 15:09:59,295 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-11 15:09:59,296 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:09:59,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-11 15:09:59,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-11 15:09:59,296 INFO L87 Difference]: Start difference. First operand 109 states and 246 transitions. Second operand 5 states. [2020-10-11 15:09:59,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:09:59,364 INFO L93 Difference]: Finished difference Result 154 states and 330 transitions. [2020-10-11 15:09:59,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-11 15:09:59,365 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-10-11 15:09:59,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:09:59,366 INFO L225 Difference]: With dead ends: 154 [2020-10-11 15:09:59,366 INFO L226 Difference]: Without dead ends: 118 [2020-10-11 15:09:59,367 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-11 15:09:59,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2020-10-11 15:09:59,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 106. [2020-10-11 15:09:59,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-10-11 15:09:59,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 226 transitions. [2020-10-11 15:09:59,376 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 226 transitions. Word has length 9 [2020-10-11 15:09:59,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:09:59,376 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 226 transitions. [2020-10-11 15:09:59,377 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-11 15:09:59,377 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 226 transitions. [2020-10-11 15:09:59,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-11 15:09:59,378 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:09:59,378 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:09:59,378 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-11 15:09:59,378 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:09:59,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:09:59,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1833046095, now seen corresponding path program 1 times [2020-10-11 15:09:59,379 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:09:59,379 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118491829] [2020-10-11 15:09:59,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:09:59,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:09:59,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:09:59,509 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118491829] [2020-10-11 15:09:59,509 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:09:59,509 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-11 15:09:59,510 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805641758] [2020-10-11 15:09:59,510 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-11 15:09:59,511 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:09:59,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-11 15:09:59,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-11 15:09:59,512 INFO L87 Difference]: Start difference. First operand 106 states and 226 transitions. Second operand 5 states. [2020-10-11 15:09:59,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:09:59,595 INFO L93 Difference]: Finished difference Result 105 states and 213 transitions. [2020-10-11 15:09:59,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-11 15:09:59,596 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-10-11 15:09:59,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:09:59,597 INFO L225 Difference]: With dead ends: 105 [2020-10-11 15:09:59,597 INFO L226 Difference]: Without dead ends: 89 [2020-10-11 15:09:59,597 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-11 15:09:59,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2020-10-11 15:09:59,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2020-10-11 15:09:59,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-10-11 15:09:59,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 182 transitions. [2020-10-11 15:09:59,615 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 182 transitions. Word has length 9 [2020-10-11 15:09:59,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:09:59,615 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 182 transitions. [2020-10-11 15:09:59,615 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-11 15:09:59,615 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 182 transitions. [2020-10-11 15:09:59,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-11 15:09:59,616 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:09:59,616 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:09:59,617 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-11 15:09:59,617 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:09:59,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:09:59,617 INFO L82 PathProgramCache]: Analyzing trace with hash 569608686, now seen corresponding path program 1 times [2020-10-11 15:09:59,617 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:09:59,618 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685316265] [2020-10-11 15:09:59,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:09:59,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:09:59,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:09:59,712 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685316265] [2020-10-11 15:09:59,712 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:09:59,712 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-11 15:09:59,713 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064479739] [2020-10-11 15:09:59,713 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-11 15:09:59,713 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:09:59,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-11 15:09:59,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-11 15:09:59,714 INFO L87 Difference]: Start difference. First operand 89 states and 182 transitions. Second operand 4 states. [2020-10-11 15:09:59,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:09:59,737 INFO L93 Difference]: Finished difference Result 77 states and 132 transitions. [2020-10-11 15:09:59,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-11 15:09:59,738 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-10-11 15:09:59,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:09:59,739 INFO L225 Difference]: With dead ends: 77 [2020-10-11 15:09:59,739 INFO L226 Difference]: Without dead ends: 54 [2020-10-11 15:09:59,739 INFO L673 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-11 15:09:59,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-10-11 15:09:59,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2020-10-11 15:09:59,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-10-11 15:09:59,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 85 transitions. [2020-10-11 15:09:59,774 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 85 transitions. Word has length 11 [2020-10-11 15:09:59,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:09:59,776 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 85 transitions. [2020-10-11 15:09:59,776 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-11 15:09:59,776 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 85 transitions. [2020-10-11 15:09:59,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-11 15:09:59,777 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:09:59,777 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:09:59,777 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-11 15:09:59,777 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:09:59,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:09:59,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1195880930, now seen corresponding path program 1 times [2020-10-11 15:09:59,778 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:09:59,778 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27765844] [2020-10-11 15:09:59,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:09:59,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:09:59,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:09:59,845 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27765844] [2020-10-11 15:09:59,845 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:09:59,845 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-11 15:09:59,845 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458627123] [2020-10-11 15:09:59,846 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-11 15:09:59,846 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:09:59,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-11 15:09:59,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-11 15:09:59,846 INFO L87 Difference]: Start difference. First operand 54 states and 85 transitions. Second operand 5 states. [2020-10-11 15:09:59,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:09:59,878 INFO L93 Difference]: Finished difference Result 42 states and 60 transitions. [2020-10-11 15:09:59,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-11 15:09:59,879 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-11 15:09:59,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:09:59,879 INFO L225 Difference]: With dead ends: 42 [2020-10-11 15:09:59,879 INFO L226 Difference]: Without dead ends: 24 [2020-10-11 15:09:59,880 INFO L673 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-11 15:09:59,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-10-11 15:09:59,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-10-11 15:09:59,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-10-11 15:09:59,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2020-10-11 15:09:59,882 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 12 [2020-10-11 15:09:59,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:09:59,882 INFO L481 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2020-10-11 15:09:59,882 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-11 15:09:59,883 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2020-10-11 15:09:59,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-11 15:09:59,883 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:09:59,883 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:09:59,883 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-11 15:09:59,884 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:09:59,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:09:59,884 INFO L82 PathProgramCache]: Analyzing trace with hash -1348623678, now seen corresponding path program 1 times [2020-10-11 15:09:59,884 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:09:59,885 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607690110] [2020-10-11 15:09:59,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:09:59,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:10:00,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:10:00,085 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607690110] [2020-10-11 15:10:00,085 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:10:00,085 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-11 15:10:00,085 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4491076] [2020-10-11 15:10:00,086 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 15:10:00,086 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:10:00,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 15:10:00,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-11 15:10:00,087 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand 6 states. [2020-10-11 15:10:00,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:10:00,184 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2020-10-11 15:10:00,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-11 15:10:00,185 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-10-11 15:10:00,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:10:00,186 INFO L225 Difference]: With dead ends: 32 [2020-10-11 15:10:00,186 INFO L226 Difference]: Without dead ends: 20 [2020-10-11 15:10:00,186 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-11 15:10:00,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-10-11 15:10:00,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-10-11 15:10:00,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-10-11 15:10:00,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2020-10-11 15:10:00,189 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 15 [2020-10-11 15:10:00,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:10:00,189 INFO L481 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2020-10-11 15:10:00,190 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 15:10:00,190 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2020-10-11 15:10:00,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-11 15:10:00,190 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:10:00,190 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:10:00,190 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-11 15:10:00,191 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:10:00,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:10:00,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1278231562, now seen corresponding path program 2 times [2020-10-11 15:10:00,191 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:10:00,192 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655736224] [2020-10-11 15:10:00,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:10:00,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 15:10:00,231 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 15:10:00,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 15:10:00,263 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 15:10:00,296 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-11 15:10:00,297 INFO L519 BasicCegarLoop]: Counterexample might be feasible [2020-10-11 15:10:00,297 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-11 15:10:00,298 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-11 15:10:00,306 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [855] [855] L3-->L793: Formula: (let ((.cse7 (= (mod ~x$r_buff1_thd0~0_In-1601759625 256) 0)) (.cse6 (= (mod ~x$w_buff1_used~0_In-1601759625 256) 0)) (.cse9 (= (mod ~x$r_buff0_thd0~0_In-1601759625 256) 0)) (.cse8 (= (mod ~x$w_buff0_used~0_In-1601759625 256) 0))) (let ((.cse0 (or .cse9 .cse8)) (.cse4 (not .cse9)) (.cse5 (not .cse8)) (.cse3 (or .cse7 .cse6)) (.cse1 (not .cse7)) (.cse2 (not .cse6))) (and (= ~x$r_buff1_thd0~0_In-1601759625 ~x$r_buff1_thd0~0_Out-1601759625) (not (= ULTIMATE.start_assume_abort_if_not_~cond_In-1601759625 0)) (= ~x$r_buff0_thd0~0_In-1601759625 ~x$r_buff0_thd0~0_Out-1601759625) (or (and .cse0 (or (and .cse1 (= ~x~0_Out-1601759625 ~x$w_buff1~0_In-1601759625) .cse2) (and .cse3 (= ~x~0_In-1601759625 ~x~0_Out-1601759625)))) (and (= ~x$w_buff0~0_In-1601759625 ~x~0_Out-1601759625) .cse4 .cse5)) (or (and .cse0 (= ~x$w_buff0_used~0_Out-1601759625 ~x$w_buff0_used~0_In-1601759625)) (and (= ~x$w_buff0_used~0_Out-1601759625 0) .cse4 .cse5)) (or (and (= ~x$w_buff1_used~0_In-1601759625 ~x$w_buff1_used~0_Out-1601759625) .cse3) (and .cse1 (= ~x$w_buff1_used~0_Out-1601759625 0) .cse2))))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-1601759625, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1601759625, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In-1601759625, ~x$w_buff1~0=~x$w_buff1~0_In-1601759625, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1601759625, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1601759625, ~x~0=~x~0_In-1601759625, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1601759625} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-1601759625, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out-1601759625, ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out-1601759625|, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out-1601759625|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-1601759625|, ~x$w_buff1~0=~x$w_buff1~0_In-1601759625, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out-1601759625, ULTIMATE.start_main_#t~ite16=|ULTIMATE.start_main_#t~ite16_Out-1601759625|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out-1601759625, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-1601759625|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1601759625|, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out-1601759625, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In-1601759625, ~x~0=~x~0_Out-1601759625} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19, ~x$w_buff1_used~0, ULTIMATE.start_main_#t~ite16, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite21, ~x~0, ~x$w_buff0_used~0] because there is no mapped edge [2020-10-11 15:10:00,311 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 15:10:00,311 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:10:00,313 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 15:10:00,313 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:10:00,313 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 15:10:00,313 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:10:00,314 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 15:10:00,314 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:10:00,314 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 15:10:00,314 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:10:00,314 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 15:10:00,315 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:10:00,315 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 15:10:00,318 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:10:00,319 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 15:10:00,319 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:10:00,319 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 15:10:00,319 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:10:00,319 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 15:10:00,319 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:10:00,320 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 15:10:00,320 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:10:00,320 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 15:10:00,320 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:10:00,320 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 15:10:00,320 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:10:00,323 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 15:10:00,324 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:10:00,324 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 15:10:00,324 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:10:00,325 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 15:10:00,325 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:10:00,325 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 15:10:00,325 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:10:00,325 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 15:10:00,326 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:10:00,326 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 15:10:00,326 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:10:00,326 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 15:10:00,327 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:10:00,331 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 15:10:00,331 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:10:00,331 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 15:10:00,331 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:10:00,332 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 15:10:00,332 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:10:00,426 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 03:10:00 BasicIcfg [2020-10-11 15:10:00,426 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-11 15:10:00,431 INFO L168 Benchmark]: Toolchain (without parser) took 14335.45 ms. Allocated memory was 251.7 MB in the beginning and 537.4 MB in the end (delta: 285.7 MB). Free memory was 204.5 MB in the beginning and 413.0 MB in the end (delta: -208.5 MB). Peak memory consumption was 77.2 MB. Max. memory is 14.2 GB. [2020-10-11 15:10:00,432 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 251.7 MB. Free memory is still 225.5 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-11 15:10:00,433 INFO L168 Benchmark]: CACSL2BoogieTranslator took 764.24 ms. Allocated memory was 251.7 MB in the beginning and 316.7 MB in the end (delta: 65.0 MB). Free memory was 204.5 MB in the beginning and 267.3 MB in the end (delta: -62.8 MB). Peak memory consumption was 26.9 MB. Max. memory is 14.2 GB. [2020-10-11 15:10:00,434 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.93 ms. Allocated memory is still 316.7 MB. Free memory was 267.3 MB in the beginning and 264.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-11 15:10:00,437 INFO L168 Benchmark]: Boogie Preprocessor took 37.13 ms. Allocated memory is still 316.7 MB. Free memory was 264.8 MB in the beginning and 262.3 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-11 15:10:00,439 INFO L168 Benchmark]: RCFGBuilder took 2127.05 ms. Allocated memory was 316.7 MB in the beginning and 358.1 MB in the end (delta: 41.4 MB). Free memory was 262.3 MB in the beginning and 212.6 MB in the end (delta: 49.6 MB). Peak memory consumption was 99.7 MB. Max. memory is 14.2 GB. [2020-10-11 15:10:00,440 INFO L168 Benchmark]: TraceAbstraction took 11339.08 ms. Allocated memory was 358.1 MB in the beginning and 537.4 MB in the end (delta: 179.3 MB). Free memory was 212.6 MB in the beginning and 413.0 MB in the end (delta: -200.4 MB). There was no memory consumed. Max. memory is 14.2 GB. [2020-10-11 15:10:00,452 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.20 ms. Allocated memory is still 251.7 MB. Free memory is still 225.5 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 764.24 ms. Allocated memory was 251.7 MB in the beginning and 316.7 MB in the end (delta: 65.0 MB). Free memory was 204.5 MB in the beginning and 267.3 MB in the end (delta: -62.8 MB). Peak memory consumption was 26.9 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 62.93 ms. Allocated memory is still 316.7 MB. Free memory was 267.3 MB in the beginning and 264.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 37.13 ms. Allocated memory is still 316.7 MB. Free memory was 264.8 MB in the beginning and 262.3 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 2127.05 ms. Allocated memory was 316.7 MB in the beginning and 358.1 MB in the end (delta: 41.4 MB). Free memory was 262.3 MB in the beginning and 212.6 MB in the end (delta: 49.6 MB). Peak memory consumption was 99.7 MB. Max. memory is 14.2 GB. * TraceAbstraction took 11339.08 ms. Allocated memory was 358.1 MB in the beginning and 537.4 MB in the end (delta: 179.3 MB). Free memory was 212.6 MB in the beginning and 413.0 MB in the end (delta: -200.4 MB). There was no memory consumed. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 581 VarBasedMoverChecksPositive, 61 VarBasedMoverChecksNegative, 19 SemBasedMoverChecksPositive, 42 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 51 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 9.1s, 79 PlacesBefore, 26 PlacesAfterwards, 74 TransitionsBefore, 20 TransitionsAfterwards, 888 CoEnabledTransitionPairs, 6 FixpointIterations, 27 TrivialSequentialCompositions, 33 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 66 TotalNumberOfCompositions, 2314 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L697] 0 int __unbuffered_cnt = 0; [L698] 0 _Bool main$tmp_guard0; [L699] 0 _Bool main$tmp_guard1; [L701] 0 int x = 0; [L702] 0 _Bool x$flush_delayed; [L703] 0 int x$mem_tmp; [L704] 0 _Bool x$r_buff0_thd0; [L705] 0 _Bool x$r_buff0_thd1; [L706] 0 _Bool x$r_buff0_thd2; [L707] 0 _Bool x$r_buff1_thd0; [L708] 0 _Bool x$r_buff1_thd1; [L709] 0 _Bool x$r_buff1_thd2; [L710] 0 _Bool x$read_delayed; [L711] 0 int *x$read_delayed_var; [L712] 0 int x$w_buff0; [L713] 0 _Bool x$w_buff0_used; [L714] 0 int x$w_buff1; [L715] 0 _Bool x$w_buff1_used; [L717] 0 int y = 0; [L718] 0 _Bool weak$$choice0; [L719] 0 _Bool weak$$choice2; [L779] 0 pthread_t t2475; [L780] FCALL, FORK 0 pthread_create(&t2475, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L781] 0 pthread_t t2476; [L782] FCALL, FORK 0 pthread_create(&t2476, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L743] 2 x$w_buff1 = x$w_buff0 [L744] 2 x$w_buff0 = 2 [L745] 2 x$w_buff1_used = x$w_buff0_used [L746] 2 x$w_buff0_used = (_Bool)1 [L7] COND TRUE 2 !expression [L7] 2 __VERIFIER_error() [L748] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L749] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L750] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L751] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L754] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L723] 1 y = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L726] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L757] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L757] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L757] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L757] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L758] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L758] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L759] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L759] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L760] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L760] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L761] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L761] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L729] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L729] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L729] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L729] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L730] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L730] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L731] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L731] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L732] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L732] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L733] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L733] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L736] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L738] 1 return 0; [L764] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L766] 2 return 0; [L784] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L795] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L796] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L797] 0 x$flush_delayed = weak$$choice2 [L798] 0 x$mem_tmp = x [L799] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L799] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L800] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L800] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L801] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L801] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L801] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1 [L801] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L801] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L801] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L802] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L802] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L803] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L803] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L804] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L804] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L805] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L805] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L806] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L807] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L807] 0 x = x$flush_delayed ? x$mem_tmp : x [L808] 0 x$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 73 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 11.0s, OverallIterations: 9, TraceHistogramMax: 1, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.2s, HoareTripleCheckerStatistics: 109 SDtfs, 102 SDslu, 129 SDs, 0 SdLazy, 129 SolverSat, 34 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=162occurred 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.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 12 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 91 NumberOfCodeBlocks, 91 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 68 ConstructedInterpolants, 0 QuantifiedInterpolants, 6198 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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...