/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix021_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-b09bf87 [2020-10-16 12:58:04,771 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 12:58:04,774 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 12:58:04,811 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 12:58:04,811 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 12:58:04,822 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 12:58:04,824 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 12:58:04,827 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 12:58:04,830 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 12:58:04,834 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 12:58:04,835 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 12:58:04,836 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 12:58:04,837 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 12:58:04,840 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 12:58:04,841 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 12:58:04,842 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 12:58:04,844 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 12:58:04,845 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 12:58:04,847 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 12:58:04,853 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 12:58:04,855 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 12:58:04,856 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 12:58:04,858 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 12:58:04,859 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 12:58:04,863 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 12:58:04,863 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 12:58:04,864 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 12:58:04,866 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 12:58:04,867 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 12:58:04,869 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 12:58:04,869 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 12:58:04,870 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 12:58:04,871 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 12:58:04,871 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 12:58:04,873 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 12:58:04,873 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 12:58:04,874 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 12:58:04,874 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 12:58:04,874 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 12:58:04,875 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 12:58:04,877 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 12:58:04,878 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2020-10-16 12:58:04,919 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 12:58:04,919 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 12:58:04,921 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 12:58:04,921 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 12:58:04,921 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 12:58:04,922 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 12:58:04,922 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 12:58:04,922 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 12:58:04,922 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 12:58:04,922 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 12:58:04,923 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 12:58:04,924 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 12:58:04,924 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 12:58:04,924 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 12:58:04,924 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 12:58:04,925 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 12:58:04,925 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 12:58:04,925 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 12:58:04,925 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 12:58:04,925 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 12:58:04,926 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 12:58:04,926 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 12:58:04,926 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 12:58:04,926 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-16 12:58:04,926 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 12:58:04,926 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 12:58:04,927 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 12:58:04,927 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-10-16 12:58:04,927 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-16 12:58:04,927 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-16 12:58:04,927 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2020-10-16 12:58:05,208 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 12:58:05,217 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 12:58:05,220 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 12:58:05,221 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 12:58:05,222 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 12:58:05,222 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix021_tso.oepc.i [2020-10-16 12:58:05,286 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/cbf1a0e2d/8e3866b93e404a5f842d01fca4aa40be/FLAGbdb489383 [2020-10-16 12:58:05,905 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 12:58:05,906 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/pthread-wmm/mix021_tso.oepc.i [2020-10-16 12:58:05,921 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/cbf1a0e2d/8e3866b93e404a5f842d01fca4aa40be/FLAGbdb489383 [2020-10-16 12:58:06,133 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/cbf1a0e2d/8e3866b93e404a5f842d01fca4aa40be [2020-10-16 12:58:06,142 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 12:58:06,144 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 12:58:06,145 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 12:58:06,145 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 12:58:06,149 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 12:58:06,150 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:58:06" (1/1) ... [2020-10-16 12:58:06,153 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f834480 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:58:06, skipping insertion in model container [2020-10-16 12:58:06,153 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:58:06" (1/1) ... [2020-10-16 12:58:06,160 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 12:58:06,204 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 12:58:06,705 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 12:58:06,719 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 12:58:06,810 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 12:58:06,893 INFO L208 MainTranslator]: Completed translation [2020-10-16 12:58:06,893 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:58:06 WrapperNode [2020-10-16 12:58:06,893 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 12:58:06,894 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 12:58:06,894 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 12:58:06,895 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 12:58:06,903 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:58:06" (1/1) ... [2020-10-16 12:58:06,924 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:58:06" (1/1) ... [2020-10-16 12:58:06,962 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 12:58:06,962 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 12:58:06,962 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 12:58:06,962 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 12:58:06,971 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:58:06" (1/1) ... [2020-10-16 12:58:06,971 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:58:06" (1/1) ... [2020-10-16 12:58:06,976 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:58:06" (1/1) ... [2020-10-16 12:58:06,977 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:58:06" (1/1) ... [2020-10-16 12:58:06,991 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:58:06" (1/1) ... [2020-10-16 12:58:06,995 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:58:06" (1/1) ... [2020-10-16 12:58:06,999 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:58:06" (1/1) ... [2020-10-16 12:58:07,005 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 12:58:07,005 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 12:58:07,005 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 12:58:07,005 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 12:58:07,006 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:58:06" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 12:58:07,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 12:58:07,080 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 12:58:07,080 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 12:58:07,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 12:58:07,081 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 12:58:07,081 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 12:58:07,082 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 12:58:07,082 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 12:58:07,083 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 12:58:07,083 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 12:58:07,083 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-16 12:58:07,084 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-16 12:58:07,084 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 12:58:07,084 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 12:58:07,084 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 12:58:07,086 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-16 12:58:09,147 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 12:58:09,147 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 12:58:09,150 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:58:09 BoogieIcfgContainer [2020-10-16 12:58:09,150 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 12:58:09,151 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 12:58:09,151 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 12:58:09,155 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 12:58:09,155 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 12:58:06" (1/3) ... [2020-10-16 12:58:09,156 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@adf5259 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:58:09, skipping insertion in model container [2020-10-16 12:58:09,156 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:58:06" (2/3) ... [2020-10-16 12:58:09,156 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@adf5259 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:58:09, skipping insertion in model container [2020-10-16 12:58:09,157 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:58:09" (3/3) ... [2020-10-16 12:58:09,158 INFO L111 eAbstractionObserver]: Analyzing ICFG mix021_tso.oepc.i [2020-10-16 12:58:09,170 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-16 12:58:09,170 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-16 12:58:09,178 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 12:58:09,179 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 12:58:09,210 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:58:09,211 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:58:09,211 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:58:09,211 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:58:09,212 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:58:09,212 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:58:09,212 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:58:09,213 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:58:09,213 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:58:09,213 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:58:09,213 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:58:09,214 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:58:09,214 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:58:09,214 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:58:09,214 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:58:09,214 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:58:09,214 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:58:09,215 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:58:09,215 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:58:09,216 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:58:09,216 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:58:09,216 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:58:09,217 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:58:09,217 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:58:09,218 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:58:09,218 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:58:09,218 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:58:09,218 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:58:09,218 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:58:09,219 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:58:09,219 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:58:09,219 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:58:09,219 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:58:09,219 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:58:09,220 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:58:09,220 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:58:09,221 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:58:09,221 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:58:09,221 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:58:09,221 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:58:09,221 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:58:09,222 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:58:09,222 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:58:09,222 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:58:09,222 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:58:09,222 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:58:09,222 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:58:09,223 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:58:09,223 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:58:09,227 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:58:09,228 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:58:09,228 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:58:09,228 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:58:09,228 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:58:09,229 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:58:09,229 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:58:09,229 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:58:09,229 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:58:09,229 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:58:09,233 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:58:09,233 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:58:09,233 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:58:09,233 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:58:09,238 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:58:09,239 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:58:09,239 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:58:09,239 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:58:09,239 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:58:09,239 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:58:09,240 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:58:09,240 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:58:09,240 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:58:09,240 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:58:09,242 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:58:09,242 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:58:09,242 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:58:09,243 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:58:09,243 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:58:09,243 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:58:09,243 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:58:09,243 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:58:09,244 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:58:09,244 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:58:09,244 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:58:09,244 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:58:09,246 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-16 12:58:09,259 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-16 12:58:09,280 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 12:58:09,280 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-16 12:58:09,280 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-16 12:58:09,281 INFO L380 AbstractCegarLoop]: Backedges is MCR [2020-10-16 12:58:09,281 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 12:58:09,281 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 12:58:09,281 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 12:58:09,281 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 12:58:09,295 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-16 12:58:09,296 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 111 transitions, 242 flow [2020-10-16 12:58:09,299 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 111 transitions, 242 flow [2020-10-16 12:58:09,301 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 122 places, 111 transitions, 242 flow [2020-10-16 12:58:09,353 INFO L129 PetriNetUnfolder]: 2/107 cut-off events. [2020-10-16 12:58:09,353 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 12:58:09,359 INFO L80 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 107 events. 2/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 84 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2020-10-16 12:58:09,363 INFO L117 LiptonReduction]: Number of co-enabled transitions 2572 [2020-10-16 12:58:09,982 WARN L193 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-16 12:58:11,260 WARN L193 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 230 DAG size of output: 190 [2020-10-16 12:58:11,295 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 2, 1] term [2020-10-16 12:58:11,296 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:58:11,300 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 12:58:11,300 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:58:12,493 WARN L193 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 148 DAG size of output: 127 [2020-10-16 12:58:12,731 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2020-10-16 12:58:13,284 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-16 12:58:14,578 WARN L193 SmtUtils]: Spent 873.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 112 [2020-10-16 12:58:14,872 WARN L193 SmtUtils]: Spent 291.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-10-16 12:58:15,188 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2020-10-16 12:58:15,298 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2020-10-16 12:58:16,827 WARN L193 SmtUtils]: Spent 1.53 s on a formula simplification. DAG size of input: 146 DAG size of output: 137 [2020-10-16 12:58:17,305 WARN L193 SmtUtils]: Spent 475.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-10-16 12:58:17,601 WARN L193 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2020-10-16 12:58:17,735 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2020-10-16 12:58:17,744 INFO L132 LiptonReduction]: Checked pairs total: 7917 [2020-10-16 12:58:17,744 INFO L134 LiptonReduction]: Total number of compositions: 90 [2020-10-16 12:58:17,750 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 46 places, 33 transitions, 86 flow [2020-10-16 12:58:18,054 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3890 states. [2020-10-16 12:58:18,056 INFO L276 IsEmpty]: Start isEmpty. Operand 3890 states. [2020-10-16 12:58:18,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-16 12:58:18,066 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:58:18,067 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:58:18,067 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:58:18,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:58:18,107 INFO L82 PathProgramCache]: Analyzing trace with hash -836286608, now seen corresponding path program 1 times [2020-10-16 12:58:18,132 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:58:18,133 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629817418] [2020-10-16 12:58:18,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:58:18,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:58:18,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:58:18,409 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629817418] [2020-10-16 12:58:18,410 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:58:18,411 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:58:18,411 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1587528828] [2020-10-16 12:58:18,412 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 12:58:18,415 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 12:58:18,430 INFO L258 McrAutomatonBuilder]: Finished intersection with 8 states and 7 transitions. [2020-10-16 12:58:18,431 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 12:58:18,435 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 12:58:18,435 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:58:18,436 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:58:18,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:58:18,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:58:18,454 INFO L87 Difference]: Start difference. First operand 3890 states. Second operand 3 states. [2020-10-16 12:58:18,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:58:18,588 INFO L93 Difference]: Finished difference Result 3250 states and 12738 transitions. [2020-10-16 12:58:18,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:58:18,591 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-10-16 12:58:18,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:58:18,639 INFO L225 Difference]: With dead ends: 3250 [2020-10-16 12:58:18,639 INFO L226 Difference]: Without dead ends: 2650 [2020-10-16 12:58:18,641 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:58:18,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2650 states. [2020-10-16 12:58:18,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2650 to 2650. [2020-10-16 12:58:18,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2650 states. [2020-10-16 12:58:18,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2650 states to 2650 states and 10228 transitions. [2020-10-16 12:58:18,876 INFO L78 Accepts]: Start accepts. Automaton has 2650 states and 10228 transitions. Word has length 7 [2020-10-16 12:58:18,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:58:18,878 INFO L481 AbstractCegarLoop]: Abstraction has 2650 states and 10228 transitions. [2020-10-16 12:58:18,878 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:58:18,878 INFO L276 IsEmpty]: Start isEmpty. Operand 2650 states and 10228 transitions. [2020-10-16 12:58:18,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-16 12:58:18,883 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:58:18,883 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:58:18,883 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 12:58:18,884 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:58:18,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:58:18,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1410706723, now seen corresponding path program 1 times [2020-10-16 12:58:18,889 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:58:18,889 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160268952] [2020-10-16 12:58:18,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:58:18,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:58:18,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:58:18,991 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160268952] [2020-10-16 12:58:18,991 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:58:18,991 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:58:18,992 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [98884723] [2020-10-16 12:58:18,992 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 12:58:18,994 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 12:58:18,997 INFO L258 McrAutomatonBuilder]: Finished intersection with 12 states and 11 transitions. [2020-10-16 12:58:18,997 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 12:58:18,999 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 12:58:19,001 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:58:19,002 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:58:19,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:58:19,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:58:19,008 INFO L87 Difference]: Start difference. First operand 2650 states and 10228 transitions. Second operand 3 states. [2020-10-16 12:58:19,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:58:19,053 INFO L93 Difference]: Finished difference Result 2450 states and 9358 transitions. [2020-10-16 12:58:19,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:58:19,055 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-16 12:58:19,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:58:19,077 INFO L225 Difference]: With dead ends: 2450 [2020-10-16 12:58:19,077 INFO L226 Difference]: Without dead ends: 2450 [2020-10-16 12:58:19,079 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:58:19,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2450 states. [2020-10-16 12:58:19,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2450 to 2450. [2020-10-16 12:58:19,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2450 states. [2020-10-16 12:58:19,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2450 states to 2450 states and 9358 transitions. [2020-10-16 12:58:19,192 INFO L78 Accepts]: Start accepts. Automaton has 2450 states and 9358 transitions. Word has length 11 [2020-10-16 12:58:19,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:58:19,192 INFO L481 AbstractCegarLoop]: Abstraction has 2450 states and 9358 transitions. [2020-10-16 12:58:19,192 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:58:19,193 INFO L276 IsEmpty]: Start isEmpty. Operand 2450 states and 9358 transitions. [2020-10-16 12:58:19,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-16 12:58:19,200 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:58:19,200 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:58:19,200 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 12:58:19,201 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:58:19,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:58:19,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1541590479, now seen corresponding path program 1 times [2020-10-16 12:58:19,202 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:58:19,203 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423115473] [2020-10-16 12:58:19,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:58:19,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:58:19,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:58:19,342 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423115473] [2020-10-16 12:58:19,343 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:58:19,343 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:58:19,343 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1890875329] [2020-10-16 12:58:19,343 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 12:58:19,348 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 12:58:19,353 INFO L258 McrAutomatonBuilder]: Finished intersection with 18 states and 21 transitions. [2020-10-16 12:58:19,353 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 12:58:19,387 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:19,448 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 12:58:19,479 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:19,485 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:19,499 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:19,527 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 12:58:19,528 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:58:19,528 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:58:19,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:58:19,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:58:19,529 INFO L87 Difference]: Start difference. First operand 2450 states and 9358 transitions. Second operand 3 states. [2020-10-16 12:58:19,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:58:19,607 INFO L93 Difference]: Finished difference Result 2442 states and 9320 transitions. [2020-10-16 12:58:19,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:58:19,608 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-10-16 12:58:19,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:58:19,631 INFO L225 Difference]: With dead ends: 2442 [2020-10-16 12:58:19,631 INFO L226 Difference]: Without dead ends: 2442 [2020-10-16 12:58:19,632 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:58:19,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2442 states. [2020-10-16 12:58:19,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2442 to 2442. [2020-10-16 12:58:19,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2442 states. [2020-10-16 12:58:19,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2442 states to 2442 states and 9320 transitions. [2020-10-16 12:58:19,721 INFO L78 Accepts]: Start accepts. Automaton has 2442 states and 9320 transitions. Word has length 13 [2020-10-16 12:58:19,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:58:19,722 INFO L481 AbstractCegarLoop]: Abstraction has 2442 states and 9320 transitions. [2020-10-16 12:58:19,722 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:58:19,722 INFO L276 IsEmpty]: Start isEmpty. Operand 2442 states and 9320 transitions. [2020-10-16 12:58:19,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-16 12:58:19,725 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:58:19,725 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:58:19,725 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 12:58:19,725 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:58:19,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:58:19,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1895245069, now seen corresponding path program 1 times [2020-10-16 12:58:19,727 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:58:19,727 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970356964] [2020-10-16 12:58:19,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:58:19,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:58:19,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:58:19,803 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970356964] [2020-10-16 12:58:19,804 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:58:19,804 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:58:19,804 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1882843966] [2020-10-16 12:58:19,804 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 12:58:19,807 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 12:58:19,812 INFO L258 McrAutomatonBuilder]: Finished intersection with 31 states and 50 transitions. [2020-10-16 12:58:19,812 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 12:58:19,834 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-10-16 12:58:19,834 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:19,835 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-16 12:58:19,835 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:19,837 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 12:58:19,846 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:19,850 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:19,854 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:19,859 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:19,863 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:19,872 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 12:58:19,881 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 12:58:19,882 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:19,889 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 12:58:19,905 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-10-16 12:58:19,905 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:19,906 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-16 12:58:19,907 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:19,908 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:19,909 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:19,921 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 12:58:19,929 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:19,933 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:19,937 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:19,955 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-10-16 12:58:19,956 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:19,956 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-16 12:58:19,957 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:20,013 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:20,015 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:20,032 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 12:58:20,037 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:20,038 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:20,048 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:20,085 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-10-16 12:58:20,086 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:20,087 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-16 12:58:20,087 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:20,090 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:20,103 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 12:58:20,107 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:20,108 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:20,113 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:20,123 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:20,138 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-10-16 12:58:20,139 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:20,140 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-16 12:58:20,140 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:20,141 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 12:58:20,145 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:20,149 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:20,152 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:20,158 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 12:58:20,163 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 4 conjuncts [2020-10-16 12:58:20,167 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:20,170 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 4 conjuncts [2020-10-16 12:58:20,207 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 12:58:20,208 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:58:20,208 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:58:20,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:58:20,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:58:20,209 INFO L87 Difference]: Start difference. First operand 2442 states and 9320 transitions. Second operand 3 states. [2020-10-16 12:58:20,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:58:20,262 INFO L93 Difference]: Finished difference Result 2418 states and 9214 transitions. [2020-10-16 12:58:20,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:58:20,263 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2020-10-16 12:58:20,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:58:20,284 INFO L225 Difference]: With dead ends: 2418 [2020-10-16 12:58:20,284 INFO L226 Difference]: Without dead ends: 2418 [2020-10-16 12:58:20,285 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 6 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:58:20,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2418 states. [2020-10-16 12:58:20,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2418 to 2418. [2020-10-16 12:58:20,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2418 states. [2020-10-16 12:58:20,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2418 states to 2418 states and 9214 transitions. [2020-10-16 12:58:20,369 INFO L78 Accepts]: Start accepts. Automaton has 2418 states and 9214 transitions. Word has length 14 [2020-10-16 12:58:20,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:58:20,369 INFO L481 AbstractCegarLoop]: Abstraction has 2418 states and 9214 transitions. [2020-10-16 12:58:20,369 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:58:20,369 INFO L276 IsEmpty]: Start isEmpty. Operand 2418 states and 9214 transitions. [2020-10-16 12:58:20,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-16 12:58:20,372 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:58:20,372 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:58:20,373 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 12:58:20,373 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:58:20,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:58:20,373 INFO L82 PathProgramCache]: Analyzing trace with hash -337746026, now seen corresponding path program 1 times [2020-10-16 12:58:20,375 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:58:20,376 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469186130] [2020-10-16 12:58:20,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:58:20,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:58:20,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-16 12:58:20,509 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469186130] [2020-10-16 12:58:20,509 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:58:20,509 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:58:20,510 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [616858045] [2020-10-16 12:58:20,510 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 12:58:20,512 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 12:58:20,516 INFO L258 McrAutomatonBuilder]: Finished intersection with 26 states and 38 transitions. [2020-10-16 12:58:20,516 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 12:58:20,531 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:20,533 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:20,534 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:20,540 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 12:58:20,542 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 12:58:20,555 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:20,557 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 12:58:20,563 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:20,569 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:20,577 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 12:58:20,582 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-16 12:58:20,585 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:20,589 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-16 12:58:20,639 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:20,640 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:20,642 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:20,644 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 12:58:20,644 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:20,650 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 12:58:20,655 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:20,657 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 12:58:20,662 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:20,667 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 12:58:20,669 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-16 12:58:20,673 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:20,677 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-16 12:58:20,737 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 12:58:20,737 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 12:58:20,737 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:58:20,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 12:58:20,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:58:20,738 INFO L87 Difference]: Start difference. First operand 2418 states and 9214 transitions. Second operand 5 states. [2020-10-16 12:58:20,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:58:20,812 INFO L93 Difference]: Finished difference Result 2410 states and 9174 transitions. [2020-10-16 12:58:20,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:58:20,814 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-10-16 12:58:20,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:58:20,834 INFO L225 Difference]: With dead ends: 2410 [2020-10-16 12:58:20,834 INFO L226 Difference]: Without dead ends: 2410 [2020-10-16 12:58:20,834 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:58:20,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2410 states. [2020-10-16 12:58:20,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2410 to 2410. [2020-10-16 12:58:20,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2410 states. [2020-10-16 12:58:20,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2410 states to 2410 states and 9174 transitions. [2020-10-16 12:58:20,915 INFO L78 Accepts]: Start accepts. Automaton has 2410 states and 9174 transitions. Word has length 14 [2020-10-16 12:58:20,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:58:20,916 INFO L481 AbstractCegarLoop]: Abstraction has 2410 states and 9174 transitions. [2020-10-16 12:58:20,916 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 12:58:20,916 INFO L276 IsEmpty]: Start isEmpty. Operand 2410 states and 9174 transitions. [2020-10-16 12:58:20,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-16 12:58:20,919 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:58:20,919 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:58:20,919 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 12:58:20,919 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:58:20,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:58:20,920 INFO L82 PathProgramCache]: Analyzing trace with hash -31126931, now seen corresponding path program 1 times [2020-10-16 12:58:20,921 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:58:20,921 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20936616] [2020-10-16 12:58:20,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:58:20,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:58:21,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:58:21,004 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20936616] [2020-10-16 12:58:21,005 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:58:21,005 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:58:21,005 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1010478102] [2020-10-16 12:58:21,005 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 12:58:21,007 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 12:58:21,012 INFO L258 McrAutomatonBuilder]: Finished intersection with 38 states and 63 transitions. [2020-10-16 12:58:21,013 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 12:58:21,019 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 12:58:21,019 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:21,020 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 12:58:21,021 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:21,021 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 2, 2, 2, 1] term [2020-10-16 12:58:21,022 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:21,022 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:21,029 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:21,046 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 12:58:21,046 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:21,047 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 12:58:21,047 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:21,048 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 2, 2, 2, 1] term [2020-10-16 12:58:21,048 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:21,049 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:21,056 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 12:58:21,061 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:21,064 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:21,067 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:21,124 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 12:58:21,125 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 12:58:21,125 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:58:21,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 12:58:21,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:58:21,126 INFO L87 Difference]: Start difference. First operand 2410 states and 9174 transitions. Second operand 5 states. [2020-10-16 12:58:21,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:58:21,251 INFO L93 Difference]: Finished difference Result 2402 states and 9128 transitions. [2020-10-16 12:58:21,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:58:21,252 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-10-16 12:58:21,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:58:21,325 INFO L225 Difference]: With dead ends: 2402 [2020-10-16 12:58:21,325 INFO L226 Difference]: Without dead ends: 2402 [2020-10-16 12:58:21,326 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:58:21,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2402 states. [2020-10-16 12:58:21,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2402 to 2362. [2020-10-16 12:58:21,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2362 states. [2020-10-16 12:58:21,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2362 states to 2362 states and 8974 transitions. [2020-10-16 12:58:21,411 INFO L78 Accepts]: Start accepts. Automaton has 2362 states and 8974 transitions. Word has length 15 [2020-10-16 12:58:21,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:58:21,411 INFO L481 AbstractCegarLoop]: Abstraction has 2362 states and 8974 transitions. [2020-10-16 12:58:21,411 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 12:58:21,412 INFO L276 IsEmpty]: Start isEmpty. Operand 2362 states and 8974 transitions. [2020-10-16 12:58:21,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-16 12:58:21,418 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:58:21,418 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:58:21,418 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 12:58:21,418 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:58:21,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:58:21,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1170026438, now seen corresponding path program 1 times [2020-10-16 12:58:21,420 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:58:21,421 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358869074] [2020-10-16 12:58:21,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:58:21,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:58:21,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:58:21,537 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358869074] [2020-10-16 12:58:21,538 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:58:21,538 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:58:21,538 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [598615420] [2020-10-16 12:58:21,538 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 12:58:21,541 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 12:58:21,548 INFO L258 McrAutomatonBuilder]: Finished intersection with 47 states and 92 transitions. [2020-10-16 12:58:21,548 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 12:58:21,557 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-10-16 12:58:21,558 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:21,558 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-16 12:58:21,559 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:21,559 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:21,561 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 12:58:21,565 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:21,570 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 12:58:21,575 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 12:58:21,579 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 12:58:21,583 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:21,607 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-10-16 12:58:21,608 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:21,608 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-16 12:58:21,609 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:21,610 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 12:58:21,611 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:21,612 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:21,613 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:21,622 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-16 12:58:21,623 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:21,624 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 12:58:21,629 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:21,634 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 12:58:21,638 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:21,642 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 12:58:21,644 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:21,644 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:21,673 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-10-16 12:58:21,674 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:21,674 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-16 12:58:21,675 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:21,675 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 12:58:21,677 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:21,678 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:21,681 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:21,687 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-16 12:58:21,688 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:21,689 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 12:58:21,694 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:21,699 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 12:58:21,704 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:21,709 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 12:58:21,711 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:21,711 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:21,772 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-10-16 12:58:21,772 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:21,773 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-16 12:58:21,773 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:21,774 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 12:58:21,776 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:21,777 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:21,780 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:21,788 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-16 12:58:21,788 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:21,789 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 12:58:21,794 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:21,799 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 12:58:21,803 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:21,807 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 12:58:21,809 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:21,809 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:21,833 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-10-16 12:58:21,833 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:21,834 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-16 12:58:21,834 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:21,835 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:21,835 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:21,843 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 12:58:21,847 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 12:58:21,852 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 12:58:21,853 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:21,963 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 12:58:21,963 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 12:58:21,963 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:58:21,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 12:58:21,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:58:21,964 INFO L87 Difference]: Start difference. First operand 2362 states and 8974 transitions. Second operand 5 states. [2020-10-16 12:58:22,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:58:22,053 INFO L93 Difference]: Finished difference Result 2434 states and 9238 transitions. [2020-10-16 12:58:22,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:58:22,054 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-10-16 12:58:22,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:58:22,065 INFO L225 Difference]: With dead ends: 2434 [2020-10-16 12:58:22,065 INFO L226 Difference]: Without dead ends: 2434 [2020-10-16 12:58:22,065 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 5 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:58:22,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2434 states. [2020-10-16 12:58:22,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2434 to 2434. [2020-10-16 12:58:22,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2434 states. [2020-10-16 12:58:22,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2434 states to 2434 states and 9238 transitions. [2020-10-16 12:58:22,144 INFO L78 Accepts]: Start accepts. Automaton has 2434 states and 9238 transitions. Word has length 15 [2020-10-16 12:58:22,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:58:22,144 INFO L481 AbstractCegarLoop]: Abstraction has 2434 states and 9238 transitions. [2020-10-16 12:58:22,144 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 12:58:22,144 INFO L276 IsEmpty]: Start isEmpty. Operand 2434 states and 9238 transitions. [2020-10-16 12:58:22,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-16 12:58:22,148 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:58:22,149 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:58:22,149 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 12:58:22,149 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:58:22,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:58:22,149 INFO L82 PathProgramCache]: Analyzing trace with hash -758016294, now seen corresponding path program 1 times [2020-10-16 12:58:22,151 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:58:22,151 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5174555] [2020-10-16 12:58:22,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:58:22,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:58:22,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:58:22,253 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5174555] [2020-10-16 12:58:22,253 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:58:22,254 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:58:22,254 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1041316008] [2020-10-16 12:58:22,255 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 12:58:22,258 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 12:58:22,269 INFO L258 McrAutomatonBuilder]: Finished intersection with 62 states and 130 transitions. [2020-10-16 12:58:22,269 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 12:58:22,283 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-16 12:58:22,283 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:22,284 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:22,285 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:22,287 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 12:58:22,291 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:22,292 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:22,313 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-16 12:58:22,313 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:22,314 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:22,315 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 12:58:22,316 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:22,317 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:22,319 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-16 12:58:22,319 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:22,319 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 12:58:22,323 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:22,330 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:22,333 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:22,337 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:22,339 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:22,340 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:22,341 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:22,342 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 12:58:22,343 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:22,348 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 12:58:22,694 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [60080#(or (and (= ~y~0 1) (= ~y$w_buff0_used~0 0) (= ~y$r_buff0_thd0~0 0)) (not (= (mod ~y$w_buff0_used~0 256) 0))), 60081#(or (and (= ~y$w_buff0_used~0 0) (= ~y$r_buff0_thd0~0 0)) (not (= (mod ~y$w_buff0_used~0 256) 0))), 60079#(and (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd0~0 0))] [2020-10-16 12:58:22,694 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 12:58:22,694 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:58:22,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 12:58:22,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-10-16 12:58:22,695 INFO L87 Difference]: Start difference. First operand 2434 states and 9238 transitions. Second operand 8 states. [2020-10-16 12:58:22,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:58:22,947 INFO L93 Difference]: Finished difference Result 2994 states and 11274 transitions. [2020-10-16 12:58:22,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 12:58:22,950 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2020-10-16 12:58:22,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:58:22,962 INFO L225 Difference]: With dead ends: 2994 [2020-10-16 12:58:22,963 INFO L226 Difference]: Without dead ends: 2994 [2020-10-16 12:58:22,963 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 37 SyntacticMatches, 6 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2020-10-16 12:58:22,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2994 states. [2020-10-16 12:58:23,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2994 to 2946. [2020-10-16 12:58:23,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2946 states. [2020-10-16 12:58:23,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2946 states to 2946 states and 11126 transitions. [2020-10-16 12:58:23,064 INFO L78 Accepts]: Start accepts. Automaton has 2946 states and 11126 transitions. Word has length 16 [2020-10-16 12:58:23,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:58:23,064 INFO L481 AbstractCegarLoop]: Abstraction has 2946 states and 11126 transitions. [2020-10-16 12:58:23,064 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 12:58:23,064 INFO L276 IsEmpty]: Start isEmpty. Operand 2946 states and 11126 transitions. [2020-10-16 12:58:23,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-16 12:58:23,070 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:58:23,070 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:58:23,070 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 12:58:23,071 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:58:23,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:58:23,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1782844021, now seen corresponding path program 1 times [2020-10-16 12:58:23,076 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:58:23,076 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742188924] [2020-10-16 12:58:23,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:58:23,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:58:23,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:58:23,114 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742188924] [2020-10-16 12:58:23,114 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:58:23,114 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:58:23,115 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1977356658] [2020-10-16 12:58:23,115 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 12:58:23,118 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 12:58:23,123 INFO L258 McrAutomatonBuilder]: Finished intersection with 30 states and 45 transitions. [2020-10-16 12:58:23,124 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 12:58:23,200 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 12:58:23,200 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:58:23,201 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:58:23,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:58:23,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:58:23,201 INFO L87 Difference]: Start difference. First operand 2946 states and 11126 transitions. Second operand 3 states. [2020-10-16 12:58:23,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:58:23,226 INFO L93 Difference]: Finished difference Result 2922 states and 11022 transitions. [2020-10-16 12:58:23,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:58:23,227 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-10-16 12:58:23,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:58:23,238 INFO L225 Difference]: With dead ends: 2922 [2020-10-16 12:58:23,238 INFO L226 Difference]: Without dead ends: 2922 [2020-10-16 12:58:23,239 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:58:23,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2922 states. [2020-10-16 12:58:23,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2922 to 2922. [2020-10-16 12:58:23,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2922 states. [2020-10-16 12:58:23,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2922 states to 2922 states and 11022 transitions. [2020-10-16 12:58:23,325 INFO L78 Accepts]: Start accepts. Automaton has 2922 states and 11022 transitions. Word has length 16 [2020-10-16 12:58:23,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:58:23,325 INFO L481 AbstractCegarLoop]: Abstraction has 2922 states and 11022 transitions. [2020-10-16 12:58:23,325 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:58:23,325 INFO L276 IsEmpty]: Start isEmpty. Operand 2922 states and 11022 transitions. [2020-10-16 12:58:23,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-16 12:58:23,331 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:58:23,331 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:58:23,332 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 12:58:23,332 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:58:23,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:58:23,332 INFO L82 PathProgramCache]: Analyzing trace with hash -262450869, now seen corresponding path program 1 times [2020-10-16 12:58:23,338 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:58:23,338 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002647049] [2020-10-16 12:58:23,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:58:23,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:58:23,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:58:23,549 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002647049] [2020-10-16 12:58:23,550 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:58:23,550 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 12:58:23,550 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2083107898] [2020-10-16 12:58:23,550 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 12:58:23,553 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 12:58:23,567 INFO L258 McrAutomatonBuilder]: Finished intersection with 70 states and 147 transitions. [2020-10-16 12:58:23,567 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 12:58:23,582 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-10-16 12:58:23,582 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:23,583 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-16 12:58:23,583 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:23,584 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:23,584 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:23,585 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 12:58:23,599 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:23,623 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 3, 2, 1] term [2020-10-16 12:58:23,624 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:23,624 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term [2020-10-16 12:58:23,624 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:23,625 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-16 12:58:23,626 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:23,627 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 3, 2, 2, 1] term [2020-10-16 12:58:23,627 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-16 12:58:23,628 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 4, 4, 2, 3, 2, 1] term [2020-10-16 12:58:23,629 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:23,629 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 4, 3, 4, 1] term [2020-10-16 12:58:23,629 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-16 12:58:23,630 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-16 12:58:23,630 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:23,631 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:23,631 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:23,632 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:23,637 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 12:58:23,648 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 12:58:23,653 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:23,655 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:23,656 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:23,660 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:23,666 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:23,667 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:23,668 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:23,670 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:23,679 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 3, 3, 4, 3, 4, 1] term [2020-10-16 12:58:23,680 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-16 12:58:23,682 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:23,682 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:23,683 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:23,689 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-16 12:58:23,690 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 12:58:23,694 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:23,700 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:23,701 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:23,955 WARN L193 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 27 [2020-10-16 12:58:23,960 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 3, 2, 1] term [2020-10-16 12:58:23,961 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:23,961 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term [2020-10-16 12:58:23,962 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:23,966 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-16 12:58:23,966 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:23,967 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 3, 2, 2, 1] term [2020-10-16 12:58:23,968 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-16 12:58:23,969 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 4, 4, 2, 3, 2, 1] term [2020-10-16 12:58:23,969 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:23,970 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 4, 3, 4, 1] term [2020-10-16 12:58:23,971 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-16 12:58:23,971 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-16 12:58:23,972 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:23,976 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:23,977 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:23,982 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:23,983 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 12:58:23,985 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:23,989 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 12:58:23,995 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:23,998 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:23,999 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:24,002 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:24,007 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 3, 3, 4, 3, 4, 1] term [2020-10-16 12:58:24,007 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-16 12:58:24,010 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:24,013 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:24,013 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:24,018 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-16 12:58:24,019 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:24,019 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:24,020 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:24,024 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 12:58:24,188 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 20 [2020-10-16 12:58:24,215 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-10-16 12:58:24,215 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:24,215 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-16 12:58:24,216 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:24,217 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 12:58:24,218 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:24,219 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:24,226 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:24,251 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 3, 2, 1] term [2020-10-16 12:58:24,251 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:24,252 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term [2020-10-16 12:58:24,252 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:24,253 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-16 12:58:24,253 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:24,254 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 4, 3, 4, 1] term [2020-10-16 12:58:24,254 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-16 12:58:24,255 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:24,256 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:24,257 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:24,258 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:24,268 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-16 12:58:24,269 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:24,269 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 12:58:24,270 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:24,282 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:24,284 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:24,284 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:24,289 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:24,289 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:24,290 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:24,297 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 12:58:24,305 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 4, 4, 2, 3, 2, 1] term [2020-10-16 12:58:24,305 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:24,405 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 3, 2, 1] term [2020-10-16 12:58:24,405 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:24,406 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term [2020-10-16 12:58:24,406 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:24,407 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-16 12:58:24,407 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:24,408 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 4, 3, 4, 1] term [2020-10-16 12:58:24,409 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-16 12:58:24,409 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:24,410 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:24,414 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:24,415 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:24,421 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-16 12:58:24,421 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:24,422 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:24,422 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:24,422 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:24,427 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 12:58:24,430 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:24,436 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:24,437 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:24,437 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:24,442 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 12:58:24,450 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 4, 4, 2, 3, 2, 1] term [2020-10-16 12:58:24,451 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:24,502 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 3, 2, 1] term [2020-10-16 12:58:24,502 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:24,503 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term [2020-10-16 12:58:24,503 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:24,504 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-16 12:58:24,504 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:24,505 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 4, 3, 4, 1] term [2020-10-16 12:58:24,506 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-16 12:58:24,506 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:24,507 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:24,508 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:24,511 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:24,515 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-16 12:58:24,515 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:24,516 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:24,516 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 12:58:24,521 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:24,522 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:24,526 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:24,533 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:24,533 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:24,534 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:24,538 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 12:58:24,546 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 4, 4, 2, 3, 2, 1] term [2020-10-16 12:58:24,547 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:24,605 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 3, 2, 1] term [2020-10-16 12:58:24,606 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:24,606 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term [2020-10-16 12:58:24,607 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:24,608 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-16 12:58:24,608 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:24,609 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 4, 3, 4, 1] term [2020-10-16 12:58:24,609 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-16 12:58:24,610 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-16 12:58:24,611 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:24,612 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:24,612 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:24,613 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:24,618 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 12:58:24,625 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 12:58:24,628 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:24,635 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:24,638 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:24,638 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:24,645 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:24,646 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:24,646 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:24,650 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:24,657 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 4, 4, 2, 3, 2, 1] term [2020-10-16 12:58:24,657 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:24,887 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 3, 2, 1] term [2020-10-16 12:58:24,888 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:24,888 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term [2020-10-16 12:58:24,888 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:24,890 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-16 12:58:24,890 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:24,891 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 4, 3, 4, 1] term [2020-10-16 12:58:24,891 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-16 12:58:24,892 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:24,897 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:24,898 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:24,899 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:24,905 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-16 12:58:24,907 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:24,910 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:24,912 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:24,913 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 12:58:24,918 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 12:58:24,921 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:24,925 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:24,930 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 4, 4, 2, 3, 2, 1] term [2020-10-16 12:58:24,930 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:25,147 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [77755#(and (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$r_buff0_thd2~0 256) 0) (= ~y$w_buff0~0 1)) (= ~y$w_buff1~0 0) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd0~0 0)), 77754#(and (or (and (= ~y~0 1) (= ~y$w_buff1~0 0) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd0~0 0)) (and (not (= (mod ~y$r_buff0_thd2~0 256) 0)) (not (= (mod ~y$w_buff0_used~0 256) 0)))) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$r_buff0_thd2~0 256) 0) (and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 1) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd0~0 0)))), 77757#(and (= ~y$w_buff1~0 0) (= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1)) (= ~y$r_buff0_thd0~0 0)), 77756#(or (and (= ~y~0 1) (= (mod ~y$r_buff0_thd2~0 256) 0) (= ~y$w_buff0~0 0) (= ~y$w_buff0_used~0 0) (= ~y$r_buff0_thd0~0 0)) (not (= (mod ~y$w_buff0_used~0 256) 0))), 77758#(or (and (= (mod ~y$r_buff0_thd2~0 256) 0) (= ~y$w_buff0~0 0) (= ~y$w_buff0_used~0 0) (= ~y$r_buff0_thd0~0 0)) (not (= (mod ~y$w_buff0_used~0 256) 0)))] [2020-10-16 12:58:25,147 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-16 12:58:25,147 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:58:25,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-16 12:58:25,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2020-10-16 12:58:25,148 INFO L87 Difference]: Start difference. First operand 2922 states and 11022 transitions. Second operand 12 states. [2020-10-16 12:58:25,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:58:25,727 INFO L93 Difference]: Finished difference Result 3594 states and 13150 transitions. [2020-10-16 12:58:25,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 12:58:25,729 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2020-10-16 12:58:25,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:58:25,747 INFO L225 Difference]: With dead ends: 3594 [2020-10-16 12:58:25,748 INFO L226 Difference]: Without dead ends: 3450 [2020-10-16 12:58:25,748 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 25 SyntacticMatches, 22 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2020-10-16 12:58:25,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3450 states. [2020-10-16 12:58:25,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3450 to 2842. [2020-10-16 12:58:25,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2842 states. [2020-10-16 12:58:25,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2842 states to 2842 states and 10562 transitions. [2020-10-16 12:58:25,883 INFO L78 Accepts]: Start accepts. Automaton has 2842 states and 10562 transitions. Word has length 17 [2020-10-16 12:58:25,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:58:25,883 INFO L481 AbstractCegarLoop]: Abstraction has 2842 states and 10562 transitions. [2020-10-16 12:58:25,883 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-16 12:58:25,884 INFO L276 IsEmpty]: Start isEmpty. Operand 2842 states and 10562 transitions. [2020-10-16 12:58:25,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-16 12:58:25,892 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:58:25,892 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:58:25,893 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 12:58:25,893 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:58:25,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:58:25,893 INFO L82 PathProgramCache]: Analyzing trace with hash 825285145, now seen corresponding path program 1 times [2020-10-16 12:58:25,895 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:58:25,896 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809279080] [2020-10-16 12:58:25,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:58:25,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:58:26,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:58:26,094 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809279080] [2020-10-16 12:58:26,095 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:58:26,095 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 12:58:26,095 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1618132240] [2020-10-16 12:58:26,096 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 12:58:26,102 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 12:58:26,117 INFO L258 McrAutomatonBuilder]: Finished intersection with 55 states and 110 transitions. [2020-10-16 12:58:26,118 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 12:58:26,128 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-10-16 12:58:26,129 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:26,129 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-16 12:58:26,130 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:26,131 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 12:58:26,132 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:26,133 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:26,162 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 3, 2, 1] term [2020-10-16 12:58:26,163 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:26,163 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term [2020-10-16 12:58:26,163 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:26,166 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-16 12:58:26,167 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:26,168 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-16 12:58:26,168 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:26,170 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:26,171 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:26,172 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:26,178 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:26,179 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-16 12:58:26,180 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:26,180 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:26,181 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:26,186 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:26,187 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:26,192 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 12:58:26,194 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:26,199 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 12:58:26,204 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:26,205 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:26,208 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:26,212 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:26,217 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 12:58:26,222 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:26,223 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:26,223 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:26,226 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:26,230 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:26,231 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:26,233 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:26,238 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:26,240 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:26,243 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:26,246 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 12:58:26,249 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 12:58:26,253 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:26,257 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-16 12:58:26,257 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:26,258 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-16 12:58:26,258 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 12:58:26,264 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:26,267 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:26,274 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-16 12:58:26,275 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:26,275 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 12:58:26,278 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 12:58:26,283 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:26,288 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:26,291 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 12:58:26,295 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 12:58:26,300 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:26,305 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 12:58:26,308 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 12:58:26,314 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:26,317 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:26,318 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 12:58:26,319 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:26,325 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 12:58:26,328 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 12:58:26,334 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:26,338 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 12:58:26,339 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:26,341 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:26,348 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:26,352 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:26,354 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:26,355 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:26,356 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:26,358 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:26,362 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:26,363 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:26,366 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:26,374 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:26,377 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 12:58:26,377 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts [2020-10-16 12:58:26,381 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts [2020-10-16 12:58:26,383 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 12:58:26,385 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts [2020-10-16 12:58:26,387 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-16 12:58:26,406 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 12:58:26,409 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:26,409 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-16 12:58:26,410 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:26,470 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 12:58:26,480 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:26,482 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:26,482 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 12:58:26,486 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 12:58:26,491 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:26,495 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-16 12:58:26,499 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:26,500 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-16 12:58:26,501 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:26,502 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:26,506 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 12:58:26,557 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 3, 2, 1] term [2020-10-16 12:58:26,557 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:26,558 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term [2020-10-16 12:58:26,558 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:26,559 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-16 12:58:26,560 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:26,561 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-16 12:58:26,561 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:26,562 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:26,564 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:26,569 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:26,570 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:26,575 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:26,576 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:26,576 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:26,582 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:26,582 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 12:58:26,585 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:26,588 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 12:58:26,591 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:26,595 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:26,596 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:26,599 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 12:58:26,599 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-16 12:58:26,600 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:26,605 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 12:58:26,611 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-16 12:58:26,614 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:26,619 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 12:58:26,623 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:26,624 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:26,624 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:26,625 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:26,629 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:26,630 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:26,634 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-16 12:58:26,636 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 12:58:26,639 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 12:58:26,647 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-16 12:58:26,650 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 12:58:26,655 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:26,658 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:26,659 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 12:58:26,661 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:26,666 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:26,669 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 12:58:26,670 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 12:58:26,673 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 12:58:26,678 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-16 12:58:26,684 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 12:58:26,696 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:26,699 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:26,699 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 12:58:26,702 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:26,706 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:26,709 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:26,709 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:26,710 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 12:58:26,712 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:26,717 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:26,720 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-16 12:58:26,721 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 12:58:26,725 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 12:58:26,729 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-16 12:58:26,732 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 12:58:26,738 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:26,741 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:26,742 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 12:58:26,745 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:26,749 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:26,755 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:26,756 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 12:58:26,758 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:26,762 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 12:58:26,764 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:26,767 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:26,768 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-16 12:58:26,771 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 12:58:26,807 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 12:58:26,824 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:26,844 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-16 12:58:26,884 INFO L721 QuantifierPusher]: Run 10 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-10-16 12:58:26,994 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:27,225 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:27,403 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:27,547 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:27,682 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 12:58:27,859 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:28,054 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:28,214 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:28,444 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 12:58:28,600 INFO L721 QuantifierPusher]: Run 10 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-10-16 12:58:28,765 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:28,807 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-16 12:58:28,851 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:29,075 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 12:58:29,160 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 12:58:29,389 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:29,427 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-16 12:58:29,481 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:29,657 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 12:58:29,750 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 12:58:29,950 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:29,974 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-16 12:58:30,019 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:30,173 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 12:58:30,243 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 12:58:30,479 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:30,502 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-16 12:58:30,539 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:30,665 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 12:58:30,735 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 12:58:30,957 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:30,978 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-16 12:58:31,019 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:31,195 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 12:58:31,262 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 12:58:31,441 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:31,462 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-16 12:58:31,494 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:31,617 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 12:58:31,694 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 12:58:31,939 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:31,961 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-16 12:58:31,993 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:32,106 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 12:58:32,176 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 12:58:32,482 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:32,510 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-16 12:58:32,554 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:32,673 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 12:58:32,740 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 12:58:32,912 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:32,932 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-16 12:58:32,964 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:33,062 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 12:58:33,111 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 12:58:33,260 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:33,261 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-16 12:58:33,262 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:33,284 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:33,295 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 12:58:33,318 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:33,333 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:33,353 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:33,428 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:33,465 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-16 12:58:33,520 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:33,682 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 12:58:33,751 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 12:58:33,963 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:33,983 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-16 12:58:34,014 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:34,115 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 12:58:34,179 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 12:58:34,337 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:34,355 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-16 12:58:34,385 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:34,482 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 12:58:34,576 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 12:58:34,810 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-16 12:58:34,811 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-16 12:58:34,813 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 12:58:34,880 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:34,895 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 12:58:34,924 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:34,941 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 12:58:34,972 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:35,172 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 12:58:35,172 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 12:58:35,172 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:58:35,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 12:58:35,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:58:35,173 INFO L87 Difference]: Start difference. First operand 2842 states and 10562 transitions. Second operand 6 states. [2020-10-16 12:58:35,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:58:35,299 INFO L93 Difference]: Finished difference Result 3218 states and 11906 transitions. [2020-10-16 12:58:35,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:58:35,300 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-10-16 12:58:35,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:58:35,312 INFO L225 Difference]: With dead ends: 3218 [2020-10-16 12:58:35,313 INFO L226 Difference]: Without dead ends: 3218 [2020-10-16 12:58:35,313 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-16 12:58:35,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3218 states. [2020-10-16 12:58:35,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3218 to 2930. [2020-10-16 12:58:35,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2930 states. [2020-10-16 12:58:35,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2930 states to 2930 states and 10874 transitions. [2020-10-16 12:58:35,399 INFO L78 Accepts]: Start accepts. Automaton has 2930 states and 10874 transitions. Word has length 17 [2020-10-16 12:58:35,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:58:35,399 INFO L481 AbstractCegarLoop]: Abstraction has 2930 states and 10874 transitions. [2020-10-16 12:58:35,399 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 12:58:35,400 INFO L276 IsEmpty]: Start isEmpty. Operand 2930 states and 10874 transitions. [2020-10-16 12:58:35,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-16 12:58:35,405 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:58:35,406 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:58:35,406 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 12:58:35,406 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:58:35,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:58:35,406 INFO L82 PathProgramCache]: Analyzing trace with hash 885957849, now seen corresponding path program 1 times [2020-10-16 12:58:35,408 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:58:35,408 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367327832] [2020-10-16 12:58:35,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:58:35,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:58:35,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:58:35,450 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367327832] [2020-10-16 12:58:35,450 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:58:35,450 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:58:35,451 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [745706905] [2020-10-16 12:58:35,451 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 12:58:35,454 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 12:58:35,468 INFO L258 McrAutomatonBuilder]: Finished intersection with 63 states and 132 transitions. [2020-10-16 12:58:35,468 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 12:58:35,614 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 12:58:35,614 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 12:58:35,615 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:58:35,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 12:58:35,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:58:35,616 INFO L87 Difference]: Start difference. First operand 2930 states and 10874 transitions. Second operand 4 states. [2020-10-16 12:58:35,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:58:35,664 INFO L93 Difference]: Finished difference Result 4238 states and 15571 transitions. [2020-10-16 12:58:35,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:58:35,665 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2020-10-16 12:58:35,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:58:35,675 INFO L225 Difference]: With dead ends: 4238 [2020-10-16 12:58:35,675 INFO L226 Difference]: Without dead ends: 2594 [2020-10-16 12:58:35,677 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:58:35,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2594 states. [2020-10-16 12:58:35,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2594 to 2546. [2020-10-16 12:58:35,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2546 states. [2020-10-16 12:58:35,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2546 states to 2546 states and 9022 transitions. [2020-10-16 12:58:35,745 INFO L78 Accepts]: Start accepts. Automaton has 2546 states and 9022 transitions. Word has length 17 [2020-10-16 12:58:35,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:58:35,746 INFO L481 AbstractCegarLoop]: Abstraction has 2546 states and 9022 transitions. [2020-10-16 12:58:35,746 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 12:58:35,746 INFO L276 IsEmpty]: Start isEmpty. Operand 2546 states and 9022 transitions. [2020-10-16 12:58:35,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-16 12:58:35,751 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:58:35,752 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:58:35,752 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 12:58:35,752 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:58:35,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:58:35,752 INFO L82 PathProgramCache]: Analyzing trace with hash -388101251, now seen corresponding path program 2 times [2020-10-16 12:58:35,754 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:58:35,754 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084655297] [2020-10-16 12:58:35,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:58:35,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:58:35,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:58:35,825 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084655297] [2020-10-16 12:58:35,825 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:58:35,825 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:58:35,825 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1255258380] [2020-10-16 12:58:35,826 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 12:58:35,829 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 12:58:35,841 INFO L258 McrAutomatonBuilder]: Finished intersection with 55 states and 104 transitions. [2020-10-16 12:58:35,841 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 12:58:35,851 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:35,868 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:35,897 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:35,902 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:35,915 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:35,941 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:35,958 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:35,981 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:35,999 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:36,053 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [105472#(not (= 4 ~__unbuffered_cnt~0))] [2020-10-16 12:58:36,053 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 12:58:36,053 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:58:36,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 12:58:36,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:58:36,054 INFO L87 Difference]: Start difference. First operand 2546 states and 9022 transitions. Second operand 5 states. [2020-10-16 12:58:36,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:58:36,132 INFO L93 Difference]: Finished difference Result 2031 states and 6482 transitions. [2020-10-16 12:58:36,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 12:58:36,133 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-10-16 12:58:36,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:58:36,138 INFO L225 Difference]: With dead ends: 2031 [2020-10-16 12:58:36,138 INFO L226 Difference]: Without dead ends: 1351 [2020-10-16 12:58:36,139 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 24 SyntacticMatches, 13 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-16 12:58:36,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2020-10-16 12:58:36,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 1351. [2020-10-16 12:58:36,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1351 states. [2020-10-16 12:58:36,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1351 states to 1351 states and 3950 transitions. [2020-10-16 12:58:36,168 INFO L78 Accepts]: Start accepts. Automaton has 1351 states and 3950 transitions. Word has length 17 [2020-10-16 12:58:36,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:58:36,169 INFO L481 AbstractCegarLoop]: Abstraction has 1351 states and 3950 transitions. [2020-10-16 12:58:36,169 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 12:58:36,169 INFO L276 IsEmpty]: Start isEmpty. Operand 1351 states and 3950 transitions. [2020-10-16 12:58:36,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-16 12:58:36,172 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:58:36,172 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:58:36,173 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 12:58:36,173 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:58:36,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:58:36,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1193922686, now seen corresponding path program 1 times [2020-10-16 12:58:36,174 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:58:36,175 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966252858] [2020-10-16 12:58:36,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:58:36,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:58:36,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:58:36,211 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966252858] [2020-10-16 12:58:36,212 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:58:36,212 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 12:58:36,212 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [504137387] [2020-10-16 12:58:36,212 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 12:58:36,216 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 12:58:36,238 INFO L258 McrAutomatonBuilder]: Finished intersection with 94 states and 190 transitions. [2020-10-16 12:58:36,238 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 12:58:36,388 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 12:58:36,389 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:58:36,389 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:58:36,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:58:36,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:58:36,390 INFO L87 Difference]: Start difference. First operand 1351 states and 3950 transitions. Second operand 3 states. [2020-10-16 12:58:36,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:58:36,406 INFO L93 Difference]: Finished difference Result 1975 states and 5601 transitions. [2020-10-16 12:58:36,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:58:36,407 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-10-16 12:58:36,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:58:36,411 INFO L225 Difference]: With dead ends: 1975 [2020-10-16 12:58:36,411 INFO L226 Difference]: Without dead ends: 1365 [2020-10-16 12:58:36,412 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:58:36,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1365 states. [2020-10-16 12:58:36,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1365 to 1345. [2020-10-16 12:58:36,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1345 states. [2020-10-16 12:58:36,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1345 states to 1345 states and 3687 transitions. [2020-10-16 12:58:36,439 INFO L78 Accepts]: Start accepts. Automaton has 1345 states and 3687 transitions. Word has length 20 [2020-10-16 12:58:36,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:58:36,439 INFO L481 AbstractCegarLoop]: Abstraction has 1345 states and 3687 transitions. [2020-10-16 12:58:36,439 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:58:36,439 INFO L276 IsEmpty]: Start isEmpty. Operand 1345 states and 3687 transitions. [2020-10-16 12:58:36,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-16 12:58:36,442 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:58:36,442 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:58:36,442 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-16 12:58:36,443 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:58:36,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:58:36,443 INFO L82 PathProgramCache]: Analyzing trace with hash 453402744, now seen corresponding path program 1 times [2020-10-16 12:58:36,444 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:58:36,445 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060118704] [2020-10-16 12:58:36,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:58:36,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:58:36,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:58:36,537 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060118704] [2020-10-16 12:58:36,537 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:58:36,537 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 12:58:36,537 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2099877722] [2020-10-16 12:58:36,538 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 12:58:36,543 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 12:58:36,597 INFO L258 McrAutomatonBuilder]: Finished intersection with 177 states and 428 transitions. [2020-10-16 12:58:36,597 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 12:58:36,614 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:36,668 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:36,689 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:36,740 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:36,777 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:37,290 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [114884#(<= ~__unbuffered_cnt~0 0)] [2020-10-16 12:58:37,290 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 12:58:37,291 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:58:37,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 12:58:37,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-16 12:58:37,291 INFO L87 Difference]: Start difference. First operand 1345 states and 3687 transitions. Second operand 7 states. [2020-10-16 12:58:37,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:58:37,359 INFO L93 Difference]: Finished difference Result 1203 states and 3247 transitions. [2020-10-16 12:58:37,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 12:58:37,360 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2020-10-16 12:58:37,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:58:37,364 INFO L225 Difference]: With dead ends: 1203 [2020-10-16 12:58:37,364 INFO L226 Difference]: Without dead ends: 1009 [2020-10-16 12:58:37,365 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 108 SyntacticMatches, 11 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-16 12:58:37,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2020-10-16 12:58:37,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 889. [2020-10-16 12:58:37,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 889 states. [2020-10-16 12:58:37,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 2427 transitions. [2020-10-16 12:58:37,391 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 2427 transitions. Word has length 21 [2020-10-16 12:58:37,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:58:37,391 INFO L481 AbstractCegarLoop]: Abstraction has 889 states and 2427 transitions. [2020-10-16 12:58:37,391 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 12:58:37,391 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 2427 transitions. [2020-10-16 12:58:37,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-16 12:58:37,394 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:58:37,394 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:58:37,394 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-16 12:58:37,394 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:58:37,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:58:37,395 INFO L82 PathProgramCache]: Analyzing trace with hash -168689361, now seen corresponding path program 1 times [2020-10-16 12:58:37,396 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:58:37,396 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332994212] [2020-10-16 12:58:37,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:58:37,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:58:37,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:58:37,498 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332994212] [2020-10-16 12:58:37,498 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:58:37,498 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 12:58:37,498 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1764459119] [2020-10-16 12:58:37,499 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 12:58:37,505 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 12:58:37,585 INFO L258 McrAutomatonBuilder]: Finished intersection with 172 states and 358 transitions. [2020-10-16 12:58:37,585 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 12:58:37,600 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:37,631 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 12:58:38,053 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [117875#(<= ~__unbuffered_cnt~0 0)] [2020-10-16 12:58:38,054 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 12:58:38,054 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:58:38,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 12:58:38,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-10-16 12:58:38,054 INFO L87 Difference]: Start difference. First operand 889 states and 2427 transitions. Second operand 8 states. [2020-10-16 12:58:38,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:58:38,146 INFO L93 Difference]: Finished difference Result 858 states and 2366 transitions. [2020-10-16 12:58:38,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 12:58:38,147 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2020-10-16 12:58:38,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:58:38,149 INFO L225 Difference]: With dead ends: 858 [2020-10-16 12:58:38,150 INFO L226 Difference]: Without dead ends: 493 [2020-10-16 12:58:38,150 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 86 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-10-16 12:58:38,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2020-10-16 12:58:38,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 373. [2020-10-16 12:58:38,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-10-16 12:58:38,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1007 transitions. [2020-10-16 12:58:38,158 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1007 transitions. Word has length 24 [2020-10-16 12:58:38,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:58:38,158 INFO L481 AbstractCegarLoop]: Abstraction has 373 states and 1007 transitions. [2020-10-16 12:58:38,158 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 12:58:38,158 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1007 transitions. [2020-10-16 12:58:38,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-16 12:58:38,160 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:58:38,160 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:58:38,160 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-16 12:58:38,160 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:58:38,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:58:38,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1803739716, now seen corresponding path program 1 times [2020-10-16 12:58:38,162 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:58:38,162 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893265275] [2020-10-16 12:58:38,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:58:38,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:58:38,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:58:38,216 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893265275] [2020-10-16 12:58:38,216 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:58:38,216 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:58:38,217 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1369825748] [2020-10-16 12:58:38,217 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 12:58:38,223 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 12:58:38,273 INFO L258 McrAutomatonBuilder]: Finished intersection with 139 states and 271 transitions. [2020-10-16 12:58:38,273 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 12:58:38,493 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 12:58:38,494 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 12:58:38,494 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:58:38,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 12:58:38,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:58:38,495 INFO L87 Difference]: Start difference. First operand 373 states and 1007 transitions. Second operand 4 states. [2020-10-16 12:58:38,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:58:38,512 INFO L93 Difference]: Finished difference Result 454 states and 1199 transitions. [2020-10-16 12:58:38,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:58:38,513 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2020-10-16 12:58:38,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:58:38,514 INFO L225 Difference]: With dead ends: 454 [2020-10-16 12:58:38,514 INFO L226 Difference]: Without dead ends: 114 [2020-10-16 12:58:38,514 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:58:38,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2020-10-16 12:58:38,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2020-10-16 12:58:38,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2020-10-16 12:58:38,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 243 transitions. [2020-10-16 12:58:38,518 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 243 transitions. Word has length 27 [2020-10-16 12:58:38,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:58:38,518 INFO L481 AbstractCegarLoop]: Abstraction has 114 states and 243 transitions. [2020-10-16 12:58:38,518 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 12:58:38,518 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 243 transitions. [2020-10-16 12:58:38,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-16 12:58:38,519 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:58:38,519 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:58:38,519 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-16 12:58:38,519 INFO L429 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:58:38,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:58:38,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1014745852, now seen corresponding path program 2 times [2020-10-16 12:58:38,526 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:58:38,526 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883851064] [2020-10-16 12:58:38,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:58:38,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 12:58:38,603 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 12:58:38,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 12:58:38,663 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 12:58:38,713 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 12:58:38,713 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 12:58:38,713 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-16 12:58:38,714 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-16 12:58:38,729 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1067] [1067] L2-->L853: Formula: (let ((.cse9 (= (mod ~y$r_buff1_thd0~0_In531917355 256) 0)) (.cse8 (= (mod ~y$w_buff1_used~0_In531917355 256) 0)) (.cse6 (= (mod ~y$r_buff0_thd0~0_In531917355 256) 0)) (.cse7 (= (mod ~y$w_buff0_used~0_In531917355 256) 0))) (let ((.cse0 (or .cse6 .cse7)) (.cse5 (or .cse9 .cse8)) (.cse3 (not .cse9)) (.cse4 (not .cse8)) (.cse1 (not .cse7)) (.cse2 (not .cse6))) (and (= |ULTIMATE.start_assume_abort_if_not_#in~cond_In531917355| ULTIMATE.start_assume_abort_if_not_~cond_Out531917355) (or (and .cse0 (= ~y$w_buff0_used~0_Out531917355 ~y$w_buff0_used~0_In531917355)) (and .cse1 (= ~y$w_buff0_used~0_Out531917355 0) .cse2)) (= ~y$r_buff1_thd0~0_In531917355 ~y$r_buff1_thd0~0_Out531917355) (or (and (= ~y$w_buff1_used~0_Out531917355 0) .cse3 .cse4) (and (= ~y$w_buff1_used~0_Out531917355 ~y$w_buff1_used~0_In531917355) .cse5)) (or (and .cse0 (or (and .cse5 (= ~y~0_In531917355 ~y~0_Out531917355)) (and .cse3 (= ~y$w_buff1~0_In531917355 ~y~0_Out531917355) .cse4))) (and .cse1 .cse2 (= ~y$w_buff0~0_In531917355 ~y~0_Out531917355))) (= ~y$r_buff0_thd0~0_In531917355 ~y$r_buff0_thd0~0_Out531917355) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out531917355 0))))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In531917355|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In531917355, ~y$w_buff1~0=~y$w_buff1~0_In531917355, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In531917355, ~y$w_buff0~0=~y$w_buff0~0_In531917355, ~y~0=~y~0_In531917355, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In531917355, ~y$w_buff1_used~0=~y$w_buff1_used~0_In531917355} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out531917355, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out531917355|, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out531917355|, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out531917355|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out531917355|, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out531917355|, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out531917355|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In531917355|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out531917355, ~y$w_buff1~0=~y$w_buff1~0_In531917355, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out531917355, ~y$w_buff0~0=~y$w_buff0~0_In531917355, ~y~0=~y~0_Out531917355, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out531917355, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out531917355} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_#t~ite29, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite27, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] because there is no mapped edge [2020-10-16 12:58:38,735 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:58:38,735 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:58:38,737 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:58:38,737 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:58:38,737 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:58:38,737 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:58:38,738 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:58:38,738 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:58:38,738 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:58:38,738 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:58:38,738 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:58:38,738 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:58:38,739 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:58:38,739 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:58:38,739 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:58:38,740 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:58:38,740 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:58:38,740 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:58:38,740 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:58:38,740 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:58:38,740 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:58:38,741 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:58:38,741 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:58:38,741 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:58:38,741 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:58:38,741 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:58:38,742 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:58:38,742 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:58:38,742 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:58:38,742 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:58:38,742 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:58:38,742 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:58:38,743 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:58:38,743 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:58:38,743 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:58:38,744 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:58:38,744 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:58:38,744 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:58:38,744 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:58:38,744 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:58:38,744 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:58:38,745 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:58:38,745 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:58:38,745 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:58:38,745 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:58:38,745 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:58:38,745 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:58:38,746 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:58:38,746 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:58:38,746 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:58:38,746 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:58:38,746 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:58:38,746 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:58:38,746 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:58:38,747 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:58:38,747 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:58:38,816 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 12:58:38 BasicIcfg [2020-10-16 12:58:38,816 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 12:58:38,818 INFO L168 Benchmark]: Toolchain (without parser) took 32674.12 ms. Allocated memory was 140.0 MB in the beginning and 892.9 MB in the end (delta: 752.9 MB). Free memory was 100.0 MB in the beginning and 540.2 MB in the end (delta: -440.2 MB). Peak memory consumption was 312.7 MB. Max. memory is 7.1 GB. [2020-10-16 12:58:38,818 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 140.0 MB. Free memory was 120.2 MB in the beginning and 120.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-10-16 12:58:38,819 INFO L168 Benchmark]: CACSL2BoogieTranslator took 748.59 ms. Allocated memory was 140.0 MB in the beginning and 203.4 MB in the end (delta: 63.4 MB). Free memory was 99.6 MB in the beginning and 157.0 MB in the end (delta: -57.4 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. [2020-10-16 12:58:38,819 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.72 ms. Allocated memory is still 203.4 MB. Free memory was 156.3 MB in the beginning and 153.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2020-10-16 12:58:38,820 INFO L168 Benchmark]: Boogie Preprocessor took 42.61 ms. Allocated memory is still 203.4 MB. Free memory was 153.7 MB in the beginning and 151.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2020-10-16 12:58:38,821 INFO L168 Benchmark]: RCFGBuilder took 2144.84 ms. Allocated memory was 203.4 MB in the beginning and 250.1 MB in the end (delta: 46.7 MB). Free memory was 151.1 MB in the beginning and 171.1 MB in the end (delta: -20.0 MB). Peak memory consumption was 104.1 MB. Max. memory is 7.1 GB. [2020-10-16 12:58:38,821 INFO L168 Benchmark]: TraceAbstraction took 29664.85 ms. Allocated memory was 250.1 MB in the beginning and 892.9 MB in the end (delta: 642.8 MB). Free memory was 169.3 MB in the beginning and 540.2 MB in the end (delta: -370.9 MB). Peak memory consumption was 271.9 MB. Max. memory is 7.1 GB. [2020-10-16 12:58:38,827 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.17 ms. Allocated memory is still 140.0 MB. Free memory was 120.2 MB in the beginning and 120.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 748.59 ms. Allocated memory was 140.0 MB in the beginning and 203.4 MB in the end (delta: 63.4 MB). Free memory was 99.6 MB in the beginning and 157.0 MB in the end (delta: -57.4 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 67.72 ms. Allocated memory is still 203.4 MB. Free memory was 156.3 MB in the beginning and 153.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.61 ms. Allocated memory is still 203.4 MB. Free memory was 153.7 MB in the beginning and 151.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2144.84 ms. Allocated memory was 203.4 MB in the beginning and 250.1 MB in the end (delta: 46.7 MB). Free memory was 151.1 MB in the beginning and 171.1 MB in the end (delta: -20.0 MB). Peak memory consumption was 104.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 29664.85 ms. Allocated memory was 250.1 MB in the beginning and 892.9 MB in the end (delta: 642.8 MB). Free memory was 169.3 MB in the beginning and 540.2 MB in the end (delta: -370.9 MB). Peak memory consumption was 271.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1318 VarBasedMoverChecksPositive, 45 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 127 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 8.4s, 122 PlacesBefore, 46 PlacesAfterwards, 111 TransitionsBefore, 33 TransitionsAfterwards, 2572 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 2 ChoiceCompositions, 90 TotalNumberOfCompositions, 7917 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L699] 0 int __unbuffered_cnt = 0; [L701] 0 int __unbuffered_p2_EAX = 0; [L703] 0 int __unbuffered_p3_EAX = 0; [L705] 0 int __unbuffered_p3_EBX = 0; [L707] 0 int a = 0; [L708] 0 _Bool main$tmp_guard0; [L709] 0 _Bool main$tmp_guard1; [L711] 0 int x = 0; [L713] 0 int y = 0; [L714] 0 _Bool y$flush_delayed; [L715] 0 int y$mem_tmp; [L716] 0 _Bool y$r_buff0_thd0; [L717] 0 _Bool y$r_buff0_thd1; [L718] 0 _Bool y$r_buff0_thd2; [L719] 0 _Bool y$r_buff0_thd3; [L720] 0 _Bool y$r_buff0_thd4; [L721] 0 _Bool y$r_buff1_thd0; [L722] 0 _Bool y$r_buff1_thd1; [L723] 0 _Bool y$r_buff1_thd2; [L724] 0 _Bool y$r_buff1_thd3; [L725] 0 _Bool y$r_buff1_thd4; [L726] 0 _Bool y$read_delayed; [L727] 0 int *y$read_delayed_var; [L728] 0 int y$w_buff0; [L729] 0 _Bool y$w_buff0_used; [L730] 0 int y$w_buff1; [L731] 0 _Bool y$w_buff1_used; [L733] 0 int z = 0; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L835] 0 pthread_t t577; [L836] FCALL, FORK 0 pthread_create(&t577, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L837] 0 pthread_t t578; [L838] FCALL, FORK 0 pthread_create(&t578, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L839] 0 pthread_t t579; [L840] FCALL, FORK 0 pthread_create(&t579, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L841] 0 pthread_t t580; [L774] 3 y$w_buff1 = y$w_buff0 [L775] 3 y$w_buff0 = 2 [L776] 3 y$w_buff1_used = y$w_buff0_used [L777] 3 y$w_buff0_used = (_Bool)1 [L7] COND TRUE 3 !expression [L7] 3 __VERIFIER_error() [L779] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L780] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L781] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L782] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L783] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L784] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L842] FCALL, FORK 0 pthread_create(&t580, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L787] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L804] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L807] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L739] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L813] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L813] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L813] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L813] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L814] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L814] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L815] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L815] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L816] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L816] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L817] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L817] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L820] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 4 return 0; [L742] 1 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L754] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L757] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L760] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L760] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L761] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L761] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L762] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L762] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L763] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L763] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L764] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L764] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L767] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 2 return 0; [L790] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L790] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L791] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L792] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L792] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L793] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L794] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L794] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L797] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 3 return 0; [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L749] 1 return 0; [L844] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L855] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L856] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L857] 0 y$flush_delayed = weak$$choice2 [L858] 0 y$mem_tmp = y [L859] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L859] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1 [L859] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L859] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L860] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L860] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L861] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L861] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L862] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L862] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L863] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L863] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L863] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L863] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L864] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L865] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L865] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L866] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L867] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L867] 0 y = y$flush_delayed ? y$mem_tmp : y [L868] 0 y$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 110 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 29.4s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.7s, HoareTripleCheckerStatistics: 560 SDtfs, 690 SDslu, 926 SDs, 0 SdLazy, 388 SolverSat, 179 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 727 GetRequests, 581 SyntacticMatches, 75 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3890occurred 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: 1.3s AutomataMinimizationTime, 17 MinimizatonAttempts, 1292 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 308 NumberOfCodeBlocks, 308 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 264 ConstructedInterpolants, 0 QuantifiedInterpolants, 30278 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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...