/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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-SP.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix030_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7a177ad [2020-11-09 16:44:56,949 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-09 16:44:56,953 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-09 16:44:57,013 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-09 16:44:57,014 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-09 16:44:57,019 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-09 16:44:57,024 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-09 16:44:57,033 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-09 16:44:57,037 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-09 16:44:57,044 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-09 16:44:57,046 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-09 16:44:57,048 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-09 16:44:57,048 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-09 16:44:57,052 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-09 16:44:57,055 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-09 16:44:57,058 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-09 16:44:57,059 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-09 16:44:57,075 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-09 16:44:57,085 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-09 16:44:57,093 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-09 16:44:57,097 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-09 16:44:57,099 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-09 16:44:57,101 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-09 16:44:57,105 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-09 16:44:57,115 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-09 16:44:57,116 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-09 16:44:57,116 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-09 16:44:57,120 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-09 16:44:57,121 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-09 16:44:57,122 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-09 16:44:57,123 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-09 16:44:57,124 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-09 16:44:57,127 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-09 16:44:57,128 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-09 16:44:57,129 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-09 16:44:57,129 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-09 16:44:57,130 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-09 16:44:57,130 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-09 16:44:57,130 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-09 16:44:57,132 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-09 16:44:57,133 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-09 16:44:57,134 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-SP.epf [2020-11-09 16:44:57,199 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-09 16:44:57,199 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-09 16:44:57,201 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-09 16:44:57,201 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-09 16:44:57,201 INFO L138 SettingsManager]: * Use SBE=true [2020-11-09 16:44:57,202 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-09 16:44:57,202 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-09 16:44:57,202 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-09 16:44:57,202 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-09 16:44:57,203 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-09 16:44:57,203 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-09 16:44:57,203 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-09 16:44:57,203 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-09 16:44:57,203 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-09 16:44:57,203 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-09 16:44:57,204 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-09 16:44:57,204 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-09 16:44:57,204 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-09 16:44:57,204 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-09 16:44:57,205 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-09 16:44:57,205 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-09 16:44:57,205 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-09 16:44:57,205 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-09 16:44:57,205 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-11-09 16:44:57,205 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-09 16:44:57,206 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-09 16:44:57,206 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-09 16:44:57,206 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-11-09 16:44:57,206 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-11-09 16:44:57,206 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-09 16:44:57,207 INFO L138 SettingsManager]: * Interpolant automaton=MCR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-11-09 16:44:57,578 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-09 16:44:57,611 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-09 16:44:57,614 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-09 16:44:57,615 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-09 16:44:57,616 INFO L275 PluginConnector]: CDTParser initialized [2020-11-09 16:44:57,617 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix030_power.opt.i [2020-11-09 16:44:57,699 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03db1bbc7/60a13d858e254ec28df5e80538036484/FLAGd880742fa [2020-11-09 16:44:58,550 INFO L306 CDTParser]: Found 1 translation units. [2020-11-09 16:44:58,551 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix030_power.opt.i [2020-11-09 16:44:58,574 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03db1bbc7/60a13d858e254ec28df5e80538036484/FLAGd880742fa [2020-11-09 16:44:58,749 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03db1bbc7/60a13d858e254ec28df5e80538036484 [2020-11-09 16:44:58,755 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-09 16:44:58,768 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-11-09 16:44:58,772 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-09 16:44:58,772 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-09 16:44:58,776 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-09 16:44:58,777 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:44:58" (1/1) ... [2020-11-09 16:44:58,782 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3009b1d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:44:58, skipping insertion in model container [2020-11-09 16:44:58,782 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:44:58" (1/1) ... [2020-11-09 16:44:58,791 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-09 16:44:58,867 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-09 16:44:59,580 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-09 16:44:59,603 INFO L203 MainTranslator]: Completed pre-run [2020-11-09 16:44:59,735 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-09 16:44:59,917 INFO L208 MainTranslator]: Completed translation [2020-11-09 16:44:59,919 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:44:59 WrapperNode [2020-11-09 16:44:59,920 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-09 16:44:59,921 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-09 16:44:59,921 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-09 16:44:59,922 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-09 16:44:59,934 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:44:59" (1/1) ... [2020-11-09 16:44:59,984 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:44:59" (1/1) ... [2020-11-09 16:45:00,045 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-09 16:45:00,046 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-09 16:45:00,046 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-09 16:45:00,047 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-09 16:45:00,058 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:44:59" (1/1) ... [2020-11-09 16:45:00,058 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:44:59" (1/1) ... [2020-11-09 16:45:00,076 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:44:59" (1/1) ... [2020-11-09 16:45:00,076 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:44:59" (1/1) ... [2020-11-09 16:45:00,102 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:44:59" (1/1) ... [2020-11-09 16:45:00,112 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:44:59" (1/1) ... [2020-11-09 16:45:00,117 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:44:59" (1/1) ... [2020-11-09 16:45:00,127 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-09 16:45:00,129 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-09 16:45:00,129 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-09 16:45:00,129 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-09 16:45:00,131 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:44:59" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-09 16:45:00,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-09 16:45:00,212 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-09 16:45:00,213 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-09 16:45:00,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-09 16:45:00,214 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-11-09 16:45:00,214 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-11-09 16:45:00,215 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-11-09 16:45:00,215 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-11-09 16:45:00,216 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-11-09 16:45:00,216 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-11-09 16:45:00,216 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-11-09 16:45:00,217 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-11-09 16:45:00,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-09 16:45:00,217 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-09 16:45:00,217 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-09 16:45:00,217 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-09 16:45:00,220 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-11-09 16:45:03,092 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-09 16:45:03,093 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-11-09 16:45:03,095 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:45:03 BoogieIcfgContainer [2020-11-09 16:45:03,095 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-09 16:45:03,097 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-09 16:45:03,097 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-09 16:45:03,101 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-09 16:45:03,102 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 04:44:58" (1/3) ... [2020-11-09 16:45:03,102 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55e1c38c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 04:45:03, skipping insertion in model container [2020-11-09 16:45:03,103 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:44:59" (2/3) ... [2020-11-09 16:45:03,103 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55e1c38c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 04:45:03, skipping insertion in model container [2020-11-09 16:45:03,103 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:45:03" (3/3) ... [2020-11-09 16:45:03,105 INFO L111 eAbstractionObserver]: Analyzing ICFG mix030_power.opt.i [2020-11-09 16:45:03,122 WARN L168 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-09 16:45:03,122 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-09 16:45:03,127 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-09 16:45:03,128 INFO L351 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-09 16:45:03,183 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,184 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,184 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,184 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,184 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,184 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,185 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,185 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,185 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,186 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,186 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,186 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,186 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,186 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,187 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,187 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,187 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,187 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,187 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,187 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,188 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,188 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,188 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,189 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,189 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,189 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,190 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,190 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,190 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,190 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,191 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,191 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,192 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,192 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,193 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,193 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,193 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,193 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,194 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,194 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,194 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,194 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,194 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,194 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,195 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,195 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,195 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,195 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,195 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,195 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,196 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,196 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,196 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,196 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,196 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,197 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,197 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,197 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,197 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,197 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,197 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,198 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,198 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,198 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,199 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,199 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,199 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,199 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,199 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,200 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,200 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,200 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,200 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,201 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,201 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,202 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,202 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,203 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,203 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,203 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,204 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,204 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,205 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,205 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,205 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,205 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,205 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,206 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,206 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,206 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,206 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,206 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,207 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,207 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,207 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,207 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,208 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,209 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,211 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,214 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,214 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,214 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,215 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,215 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,215 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,215 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,216 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,216 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,217 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,217 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,220 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,220 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,220 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,220 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,222 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,223 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,223 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,223 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,223 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,224 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,224 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,224 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,224 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,224 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,226 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,226 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,227 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,227 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,227 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,227 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,227 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,228 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,228 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,228 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,228 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,228 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,229 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,229 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,231 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,231 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,231 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,231 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,231 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,232 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,232 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,232 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,232 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,232 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:45:03,234 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-09 16:45:03,247 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-11-09 16:45:03,284 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-09 16:45:03,284 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-09 16:45:03,284 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-11-09 16:45:03,284 INFO L380 AbstractCegarLoop]: Backedges is MCR [2020-11-09 16:45:03,285 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-09 16:45:03,285 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-09 16:45:03,285 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-09 16:45:03,285 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-09 16:45:03,304 INFO L128 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-11-09 16:45:03,305 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 129 places, 119 transitions, 258 flow [2020-11-09 16:45:03,309 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 129 places, 119 transitions, 258 flow [2020-11-09 16:45:03,311 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 129 places, 119 transitions, 258 flow [2020-11-09 16:45:03,398 INFO L129 PetriNetUnfolder]: 3/115 cut-off events. [2020-11-09 16:45:03,398 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-11-09 16:45:03,404 INFO L84 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 115 events. 3/115 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 92 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2020-11-09 16:45:03,413 INFO L116 LiptonReduction]: Number of co-enabled transitions 2862 [2020-11-09 16:45:05,316 WARN L194 SmtUtils]: Spent 1.44 s on a formula simplification. DAG size of input: 230 DAG size of output: 190 [2020-11-09 16:45:05,387 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 2, 1] term [2020-11-09 16:45:05,387 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:45:05,393 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-09 16:45:05,394 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:45:06,481 WARN L194 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 148 DAG size of output: 128 [2020-11-09 16:45:09,339 WARN L194 SmtUtils]: Spent 2.85 s on a formula simplification. DAG size of input: 314 DAG size of output: 270 [2020-11-09 16:45:09,348 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 2, 1] term [2020-11-09 16:45:09,348 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:45:09,354 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 2, 1] term [2020-11-09 16:45:09,354 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:45:09,356 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 16:45:09,356 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:45:09,361 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 2, 1] term [2020-11-09 16:45:09,362 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:45:09,365 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 2, 1] term [2020-11-09 16:45:09,366 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:45:09,368 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 16:45:09,368 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:45:09,385 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 1] term [2020-11-09 16:45:09,385 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:45:09,388 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 1] term [2020-11-09 16:45:09,389 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:45:09,390 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 16:45:09,390 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:45:09,396 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 1] term [2020-11-09 16:45:09,397 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:45:09,402 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 2, 1] term [2020-11-09 16:45:09,403 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:45:09,407 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 2, 1] term [2020-11-09 16:45:09,407 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:45:09,409 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 16:45:09,410 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:45:09,412 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 3, 2, 2, 1] term [2020-11-09 16:45:09,413 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:45:09,422 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:45:09,424 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:45:09,425 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:45:09,427 INFO L603 QuantifierPusher]: Distributing 5 conjuncts over 2 disjuncts [2020-11-09 16:45:09,436 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:45:09,444 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-09 16:45:09,445 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 16:45:09,447 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 16:45:09,448 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:45:09,449 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:45:09,455 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 1] term [2020-11-09 16:45:09,456 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:45:12,516 WARN L194 SmtUtils]: Spent 3.05 s on a formula simplification. DAG size of input: 363 DAG size of output: 275 [2020-11-09 16:45:13,001 WARN L194 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-11-09 16:45:13,135 WARN L194 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-11-09 16:45:13,693 WARN L194 SmtUtils]: Spent 555.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 84 [2020-11-09 16:45:13,700 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 3, 2, 1] term [2020-11-09 16:45:13,702 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:45:14,203 WARN L194 SmtUtils]: Spent 493.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 85 [2020-11-09 16:45:15,415 WARN L194 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2020-11-09 16:45:15,548 WARN L194 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2020-11-09 16:45:15,700 WARN L194 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2020-11-09 16:45:16,894 WARN L194 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-11-09 16:45:17,017 WARN L194 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-11-09 16:45:17,259 WARN L194 SmtUtils]: Spent 238.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-11-09 16:45:17,495 WARN L194 SmtUtils]: Spent 234.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-11-09 16:45:18,951 WARN L194 SmtUtils]: Spent 453.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-11-09 16:45:19,463 WARN L194 SmtUtils]: Spent 509.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-11-09 16:45:20,770 WARN L194 SmtUtils]: Spent 1.30 s on a formula simplification that was a NOOP. DAG size: 262 [2020-11-09 16:45:22,101 WARN L194 SmtUtils]: Spent 1.32 s on a formula simplification that was a NOOP. DAG size: 262 [2020-11-09 16:45:22,390 WARN L194 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2020-11-09 16:45:22,502 WARN L194 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2020-11-09 16:45:22,623 WARN L194 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2020-11-09 16:45:22,727 WARN L194 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2020-11-09 16:45:24,699 WARN L194 SmtUtils]: Spent 1.96 s on a formula simplification. DAG size of input: 147 DAG size of output: 138 [2020-11-09 16:45:25,387 WARN L194 SmtUtils]: Spent 685.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2020-11-09 16:45:29,166 WARN L194 SmtUtils]: Spent 3.77 s on a formula simplification. DAG size of input: 279 DAG size of output: 266 [2020-11-09 16:45:30,455 WARN L194 SmtUtils]: Spent 1.28 s on a formula simplification that was a NOOP. DAG size: 264 [2020-11-09 16:45:31,394 WARN L194 SmtUtils]: Spent 937.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 112 [2020-11-09 16:45:31,870 WARN L194 SmtUtils]: Spent 468.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-11-09 16:45:34,337 WARN L194 SmtUtils]: Spent 2.46 s on a formula simplification. DAG size of input: 263 DAG size of output: 224 [2020-11-09 16:45:35,547 WARN L194 SmtUtils]: Spent 1.21 s on a formula simplification that was a NOOP. DAG size: 222 [2020-11-09 16:45:36,085 WARN L194 SmtUtils]: Spent 260.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2020-11-09 16:45:36,337 WARN L194 SmtUtils]: Spent 249.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2020-11-09 16:45:36,581 WARN L194 SmtUtils]: Spent 242.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2020-11-09 16:45:36,813 WARN L194 SmtUtils]: Spent 229.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2020-11-09 16:45:37,528 WARN L194 SmtUtils]: Spent 667.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 120 [2020-11-09 16:45:37,841 WARN L194 SmtUtils]: Spent 310.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2020-11-09 16:45:38,609 WARN L194 SmtUtils]: Spent 766.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 120 [2020-11-09 16:45:38,930 WARN L194 SmtUtils]: Spent 314.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2020-11-09 16:45:38,938 INFO L131 LiptonReduction]: Checked pairs total: 8274 [2020-11-09 16:45:38,938 INFO L133 LiptonReduction]: Total number of compositions: 102 [2020-11-09 16:45:38,946 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 46 places, 33 transitions, 86 flow [2020-11-09 16:45:39,210 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3890 states. [2020-11-09 16:45:39,213 INFO L276 IsEmpty]: Start isEmpty. Operand 3890 states. [2020-11-09 16:45:39,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-11-09 16:45:39,220 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:45:39,221 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:45:39,222 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-11-09 16:45:39,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:45:39,232 INFO L82 PathProgramCache]: Analyzing trace with hash -162394625, now seen corresponding path program 1 times [2020-11-09 16:45:39,259 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:45:39,260 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087851179] [2020-11-09 16:45:39,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:45:39,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:45:39,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 16:45:39,630 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087851179] [2020-11-09 16:45:39,631 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:45:39,632 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-09 16:45:39,633 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [441997732] [2020-11-09 16:45:39,634 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:45:39,637 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:45:39,654 INFO L252 McrAutomatonBuilder]: Finished intersection with 8 states and 7 transitions. [2020-11-09 16:45:39,655 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:45:39,660 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 16:45:39,661 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 16:45:39,661 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:45:39,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 16:45:39,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 16:45:39,681 INFO L87 Difference]: Start difference. First operand 3890 states. Second operand 3 states. [2020-11-09 16:45:39,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:45:39,844 INFO L93 Difference]: Finished difference Result 3250 states and 12738 transitions. [2020-11-09 16:45:39,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 16:45:39,848 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-11-09 16:45:39,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:45:39,897 INFO L225 Difference]: With dead ends: 3250 [2020-11-09 16:45:39,897 INFO L226 Difference]: Without dead ends: 2650 [2020-11-09 16:45:39,899 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-11-09 16:45:39,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2650 states. [2020-11-09 16:45:40,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2650 to 2650. [2020-11-09 16:45:40,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2650 states. [2020-11-09 16:45:40,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2650 states to 2650 states and 10228 transitions. [2020-11-09 16:45:40,149 INFO L78 Accepts]: Start accepts. Automaton has 2650 states and 10228 transitions. Word has length 7 [2020-11-09 16:45:40,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:45:40,151 INFO L481 AbstractCegarLoop]: Abstraction has 2650 states and 10228 transitions. [2020-11-09 16:45:40,151 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 16:45:40,151 INFO L276 IsEmpty]: Start isEmpty. Operand 2650 states and 10228 transitions. [2020-11-09 16:45:40,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-09 16:45:40,157 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:45:40,157 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:45:40,158 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-09 16:45:40,158 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-11-09 16:45:40,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:45:40,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1169447099, now seen corresponding path program 1 times [2020-11-09 16:45:40,164 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:45:40,165 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464776794] [2020-11-09 16:45:40,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:45:40,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:45:40,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 16:45:40,299 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464776794] [2020-11-09 16:45:40,300 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:45:40,300 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-09 16:45:40,300 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1839381876] [2020-11-09 16:45:40,300 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:45:40,302 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:45:40,305 INFO L252 McrAutomatonBuilder]: Finished intersection with 12 states and 11 transitions. [2020-11-09 16:45:40,305 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:45:40,306 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 16:45:40,307 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 16:45:40,307 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:45:40,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 16:45:40,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 16:45:40,308 INFO L87 Difference]: Start difference. First operand 2650 states and 10228 transitions. Second operand 3 states. [2020-11-09 16:45:40,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:45:40,453 INFO L93 Difference]: Finished difference Result 2630 states and 10137 transitions. [2020-11-09 16:45:40,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 16:45:40,455 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-11-09 16:45:40,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:45:40,482 INFO L225 Difference]: With dead ends: 2630 [2020-11-09 16:45:40,482 INFO L226 Difference]: Without dead ends: 2630 [2020-11-09 16:45:40,483 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-11-09 16:45:40,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2630 states. [2020-11-09 16:45:40,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2630 to 2630. [2020-11-09 16:45:40,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2630 states. [2020-11-09 16:45:40,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2630 states to 2630 states and 10137 transitions. [2020-11-09 16:45:40,606 INFO L78 Accepts]: Start accepts. Automaton has 2630 states and 10137 transitions. Word has length 11 [2020-11-09 16:45:40,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:45:40,607 INFO L481 AbstractCegarLoop]: Abstraction has 2630 states and 10137 transitions. [2020-11-09 16:45:40,607 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 16:45:40,607 INFO L276 IsEmpty]: Start isEmpty. Operand 2630 states and 10137 transitions. [2020-11-09 16:45:40,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-09 16:45:40,610 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:45:40,610 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:45:40,611 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-09 16:45:40,611 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-11-09 16:45:40,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:45:40,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1324384364, now seen corresponding path program 1 times [2020-11-09 16:45:40,614 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:45:40,615 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512129087] [2020-11-09 16:45:40,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:45:40,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:45:40,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 16:45:40,742 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512129087] [2020-11-09 16:45:40,742 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:45:40,742 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-09 16:45:40,742 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1897276689] [2020-11-09 16:45:40,743 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:45:40,748 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:45:40,754 INFO L252 McrAutomatonBuilder]: Finished intersection with 16 states and 18 transitions. [2020-11-09 16:45:40,754 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:45:40,861 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 16:45:40,861 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 16:45:40,861 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:45:40,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 16:45:40,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 16:45:40,862 INFO L87 Difference]: Start difference. First operand 2630 states and 10137 transitions. Second operand 3 states. [2020-11-09 16:45:40,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:45:40,907 INFO L93 Difference]: Finished difference Result 2450 states and 9358 transitions. [2020-11-09 16:45:40,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 16:45:40,909 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-11-09 16:45:40,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:45:40,935 INFO L225 Difference]: With dead ends: 2450 [2020-11-09 16:45:40,935 INFO L226 Difference]: Without dead ends: 2450 [2020-11-09 16:45:40,936 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-11-09 16:45:40,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2450 states. [2020-11-09 16:45:41,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2450 to 2450. [2020-11-09 16:45:41,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2450 states. [2020-11-09 16:45:41,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2450 states to 2450 states and 9358 transitions. [2020-11-09 16:45:41,043 INFO L78 Accepts]: Start accepts. Automaton has 2450 states and 9358 transitions. Word has length 12 [2020-11-09 16:45:41,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:45:41,043 INFO L481 AbstractCegarLoop]: Abstraction has 2450 states and 9358 transitions. [2020-11-09 16:45:41,043 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 16:45:41,043 INFO L276 IsEmpty]: Start isEmpty. Operand 2450 states and 9358 transitions. [2020-11-09 16:45:41,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-09 16:45:41,048 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:45:41,048 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:45:41,048 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-09 16:45:41,048 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-11-09 16:45:41,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:45:41,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1430917360, now seen corresponding path program 1 times [2020-11-09 16:45:41,055 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:45:41,056 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46060278] [2020-11-09 16:45:41,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:45:41,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:45:41,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 16:45:41,158 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46060278] [2020-11-09 16:45:41,159 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:45:41,159 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-09 16:45:41,159 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [46229875] [2020-11-09 16:45:41,159 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:45:41,161 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:45:41,164 INFO L252 McrAutomatonBuilder]: Finished intersection with 18 states and 21 transitions. [2020-11-09 16:45:41,165 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:45:41,323 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 16:45:41,323 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 16:45:41,324 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:45:41,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 16:45:41,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 16:45:41,325 INFO L87 Difference]: Start difference. First operand 2450 states and 9358 transitions. Second operand 3 states. [2020-11-09 16:45:41,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:45:41,452 INFO L93 Difference]: Finished difference Result 2442 states and 9320 transitions. [2020-11-09 16:45:41,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 16:45:41,454 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-11-09 16:45:41,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:45:41,491 INFO L225 Difference]: With dead ends: 2442 [2020-11-09 16:45:41,491 INFO L226 Difference]: Without dead ends: 2442 [2020-11-09 16:45:41,492 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-11-09 16:45:41,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2442 states. [2020-11-09 16:45:41,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2442 to 2442. [2020-11-09 16:45:41,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2442 states. [2020-11-09 16:45:41,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2442 states to 2442 states and 9320 transitions. [2020-11-09 16:45:41,594 INFO L78 Accepts]: Start accepts. Automaton has 2442 states and 9320 transitions. Word has length 13 [2020-11-09 16:45:41,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:45:41,594 INFO L481 AbstractCegarLoop]: Abstraction has 2442 states and 9320 transitions. [2020-11-09 16:45:41,594 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 16:45:41,594 INFO L276 IsEmpty]: Start isEmpty. Operand 2442 states and 9320 transitions. [2020-11-09 16:45:41,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-09 16:45:41,598 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:45:41,598 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:45:41,598 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-09 16:45:41,598 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-11-09 16:45:41,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:45:41,599 INFO L82 PathProgramCache]: Analyzing trace with hash 2047578604, now seen corresponding path program 1 times [2020-11-09 16:45:41,603 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:45:41,604 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14925890] [2020-11-09 16:45:41,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:45:41,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:45:41,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 16:45:41,726 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14925890] [2020-11-09 16:45:41,727 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:45:41,727 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-09 16:45:41,727 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1904376855] [2020-11-09 16:45:41,727 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:45:41,730 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:45:41,734 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 50 transitions. [2020-11-09 16:45:41,735 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:45:41,747 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-11-09 16:45:41,748 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:41,749 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:41,750 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:41,839 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-11-09 16:45:41,840 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:41,840 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:41,840 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:41,891 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-11-09 16:45:41,891 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:41,892 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:41,892 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:41,958 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-11-09 16:45:41,959 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:41,959 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:41,960 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:42,019 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-11-09 16:45:42,020 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:42,020 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:42,021 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:42,108 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 16:45:42,108 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 16:45:42,108 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:45:42,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 16:45:42,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 16:45:42,109 INFO L87 Difference]: Start difference. First operand 2442 states and 9320 transitions. Second operand 3 states. [2020-11-09 16:45:42,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:45:42,176 INFO L93 Difference]: Finished difference Result 2418 states and 9214 transitions. [2020-11-09 16:45:42,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 16:45:42,178 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2020-11-09 16:45:42,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:45:42,202 INFO L225 Difference]: With dead ends: 2418 [2020-11-09 16:45:42,202 INFO L226 Difference]: Without dead ends: 2418 [2020-11-09 16:45:42,203 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 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-11-09 16:45:42,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2418 states. [2020-11-09 16:45:42,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2418 to 2418. [2020-11-09 16:45:42,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2418 states. [2020-11-09 16:45:42,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2418 states to 2418 states and 9214 transitions. [2020-11-09 16:45:42,294 INFO L78 Accepts]: Start accepts. Automaton has 2418 states and 9214 transitions. Word has length 14 [2020-11-09 16:45:42,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:45:42,296 INFO L481 AbstractCegarLoop]: Abstraction has 2418 states and 9214 transitions. [2020-11-09 16:45:42,296 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 16:45:42,296 INFO L276 IsEmpty]: Start isEmpty. Operand 2418 states and 9214 transitions. [2020-11-09 16:45:42,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-09 16:45:42,299 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:45:42,299 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:45:42,300 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-09 16:45:42,300 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-11-09 16:45:42,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:45:42,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1434906241, now seen corresponding path program 1 times [2020-11-09 16:45:42,302 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:45:42,302 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823311873] [2020-11-09 16:45:42,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:45:42,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:45:42,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 16:45:42,453 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823311873] [2020-11-09 16:45:42,453 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:45:42,454 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-09 16:45:42,455 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [367692389] [2020-11-09 16:45:42,455 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:45:42,482 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:45:42,489 INFO L252 McrAutomatonBuilder]: Finished intersection with 26 states and 38 transitions. [2020-11-09 16:45:42,489 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:45:42,777 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 16:45:42,777 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-09 16:45:42,777 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:45:42,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-09 16:45:42,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-09 16:45:42,778 INFO L87 Difference]: Start difference. First operand 2418 states and 9214 transitions. Second operand 4 states. [2020-11-09 16:45:42,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:45:42,919 INFO L93 Difference]: Finished difference Result 2386 states and 9070 transitions. [2020-11-09 16:45:42,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-09 16:45:42,921 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-11-09 16:45:42,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:45:42,935 INFO L225 Difference]: With dead ends: 2386 [2020-11-09 16:45:42,935 INFO L226 Difference]: Without dead ends: 2386 [2020-11-09 16:45:42,936 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 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-11-09 16:45:42,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2386 states. [2020-11-09 16:45:43,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2386 to 2386. [2020-11-09 16:45:43,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2386 states. [2020-11-09 16:45:43,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2386 states to 2386 states and 9070 transitions. [2020-11-09 16:45:43,020 INFO L78 Accepts]: Start accepts. Automaton has 2386 states and 9070 transitions. Word has length 14 [2020-11-09 16:45:43,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:45:43,021 INFO L481 AbstractCegarLoop]: Abstraction has 2386 states and 9070 transitions. [2020-11-09 16:45:43,021 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-09 16:45:43,021 INFO L276 IsEmpty]: Start isEmpty. Operand 2386 states and 9070 transitions. [2020-11-09 16:45:43,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-09 16:45:43,024 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:45:43,025 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:45:43,025 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-09 16:45:43,025 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-11-09 16:45:43,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:45:43,026 INFO L82 PathProgramCache]: Analyzing trace with hash 233598470, now seen corresponding path program 1 times [2020-11-09 16:45:43,032 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:45:43,032 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165573176] [2020-11-09 16:45:43,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:45:43,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:45:43,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 16:45:43,252 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165573176] [2020-11-09 16:45:43,252 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:45:43,252 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 16:45:43,252 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1946128741] [2020-11-09 16:45:43,253 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:45:43,255 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:45:43,260 INFO L252 McrAutomatonBuilder]: Finished intersection with 38 states and 63 transitions. [2020-11-09 16:45:43,260 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:45:43,272 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 16:45:43,273 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:43,273 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-11-09 16:45:43,274 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:43,274 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 2, 3, 2, 1] term [2020-11-09 16:45:43,275 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:43,331 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 16:45:43,331 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:43,332 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-11-09 16:45:43,332 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:43,333 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 2, 3, 2, 1] term [2020-11-09 16:45:43,334 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:43,462 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 16:45:43,462 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-09 16:45:43,463 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:45:43,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-09 16:45:43,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-09 16:45:43,464 INFO L87 Difference]: Start difference. First operand 2386 states and 9070 transitions. Second operand 5 states. [2020-11-09 16:45:43,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:45:43,690 INFO L93 Difference]: Finished difference Result 2402 states and 9126 transitions. [2020-11-09 16:45:43,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-09 16:45:43,692 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-11-09 16:45:43,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:45:43,713 INFO L225 Difference]: With dead ends: 2402 [2020-11-09 16:45:43,713 INFO L226 Difference]: Without dead ends: 2402 [2020-11-09 16:45:43,714 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-11-09 16:45:43,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2402 states. [2020-11-09 16:45:43,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2402 to 2402. [2020-11-09 16:45:43,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2402 states. [2020-11-09 16:45:43,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2402 states to 2402 states and 9126 transitions. [2020-11-09 16:45:43,850 INFO L78 Accepts]: Start accepts. Automaton has 2402 states and 9126 transitions. Word has length 15 [2020-11-09 16:45:43,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:45:43,850 INFO L481 AbstractCegarLoop]: Abstraction has 2402 states and 9126 transitions. [2020-11-09 16:45:43,850 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-09 16:45:43,850 INFO L276 IsEmpty]: Start isEmpty. Operand 2402 states and 9126 transitions. [2020-11-09 16:45:43,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-09 16:45:43,854 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:45:43,854 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:45:43,854 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-09 16:45:43,854 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-11-09 16:45:43,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:45:43,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1894098725, now seen corresponding path program 1 times [2020-11-09 16:45:43,857 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:45:43,858 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147905236] [2020-11-09 16:45:43,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:45:43,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:45:44,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 16:45:44,021 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147905236] [2020-11-09 16:45:44,021 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:45:44,021 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 16:45:44,022 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [517558310] [2020-11-09 16:45:44,022 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:45:44,024 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:45:44,034 INFO L252 McrAutomatonBuilder]: Finished intersection with 47 states and 92 transitions. [2020-11-09 16:45:44,034 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:45:44,037 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-11-09 16:45:44,038 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:44,038 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:44,039 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:44,093 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-11-09 16:45:44,094 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:44,094 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:44,095 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:44,150 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-11-09 16:45:44,150 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:44,151 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:44,151 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:44,297 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-11-09 16:45:44,298 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:44,298 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:44,299 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:44,347 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-11-09 16:45:44,347 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:44,348 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:44,348 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:44,652 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 16:45:44,652 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-09 16:45:44,653 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:45:44,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-09 16:45:44,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-09 16:45:44,654 INFO L87 Difference]: Start difference. First operand 2402 states and 9126 transitions. Second operand 5 states. [2020-11-09 16:45:44,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:45:44,802 INFO L93 Difference]: Finished difference Result 2474 states and 9390 transitions. [2020-11-09 16:45:44,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-09 16:45:44,804 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-11-09 16:45:44,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:45:44,816 INFO L225 Difference]: With dead ends: 2474 [2020-11-09 16:45:44,817 INFO L226 Difference]: Without dead ends: 2474 [2020-11-09 16:45:44,818 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 5 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-11-09 16:45:44,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2474 states. [2020-11-09 16:45:44,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2474 to 2474. [2020-11-09 16:45:44,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2474 states. [2020-11-09 16:45:44,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2474 states to 2474 states and 9390 transitions. [2020-11-09 16:45:44,959 INFO L78 Accepts]: Start accepts. Automaton has 2474 states and 9390 transitions. Word has length 15 [2020-11-09 16:45:44,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:45:44,960 INFO L481 AbstractCegarLoop]: Abstraction has 2474 states and 9390 transitions. [2020-11-09 16:45:44,960 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-09 16:45:44,960 INFO L276 IsEmpty]: Start isEmpty. Operand 2474 states and 9390 transitions. [2020-11-09 16:45:44,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 16:45:44,967 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:45:44,967 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:45:44,968 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-09 16:45:44,968 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-11-09 16:45:44,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:45:44,969 INFO L82 PathProgramCache]: Analyzing trace with hash -361724341, now seen corresponding path program 1 times [2020-11-09 16:45:44,971 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:45:44,972 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357872659] [2020-11-09 16:45:44,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:45:45,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:45:45,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 16:45:45,105 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357872659] [2020-11-09 16:45:45,105 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:45:45,106 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 16:45:45,106 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1327079467] [2020-11-09 16:45:45,106 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:45:45,110 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:45:45,120 INFO L252 McrAutomatonBuilder]: Finished intersection with 48 states and 84 transitions. [2020-11-09 16:45:45,120 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:45:45,125 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 4, 2, 3, 2, 1] term [2020-11-09 16:45:45,125 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:45,126 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:45,126 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:45,130 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:45,130 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:45,132 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:45,132 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:45,133 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:45,134 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:45,201 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-11-09 16:45:45,202 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:45,203 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:45,203 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:45,265 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 4, 2, 3, 2, 1] term [2020-11-09 16:45:45,265 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:45,266 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:45,267 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:45,271 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:45,272 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:45,273 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:45,273 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:45,273 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:45,274 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:45,344 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-11-09 16:45:45,345 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:45,346 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:45,346 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:45,401 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 4, 2, 3, 2, 1] term [2020-11-09 16:45:45,401 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:45,402 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:45,402 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:45,406 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:45,406 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:45,407 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:45,407 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:45,408 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:45,408 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:45,479 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:45,479 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:45,480 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:45,480 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:45,481 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:45,481 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:45,484 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 4, 2, 3, 2, 1] term [2020-11-09 16:45:45,484 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:45,485 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:45,485 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:45,540 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 4, 2, 3, 2, 1] term [2020-11-09 16:45:45,540 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:45,541 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:45,541 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:45,545 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:45,545 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:45,546 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:45,546 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:45,547 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:45,547 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:45,607 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 4, 2, 3, 2, 1] term [2020-11-09 16:45:45,607 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:45,608 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:45,608 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:45,612 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:45,612 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:45,613 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:45,613 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:45,614 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:45,614 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:45,715 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:45,715 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:45,716 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:45,716 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:45,717 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:45,717 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:45,719 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 4, 2, 3, 2, 1] term [2020-11-09 16:45:45,720 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:45,720 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:45,720 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:45,794 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:45,795 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:45,796 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:45,796 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:45,797 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:45,798 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:45,800 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 4, 2, 3, 2, 1] term [2020-11-09 16:45:45,800 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:45,801 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:45,801 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:45,870 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 4, 2, 3, 2, 1] term [2020-11-09 16:45:45,870 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:45,871 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:45,871 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:45,875 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:45,875 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:45,876 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:45,877 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:45,877 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:45,878 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:45,961 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 16:45:45,961 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-09 16:45:45,962 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:45:45,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-09 16:45:45,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-09 16:45:45,962 INFO L87 Difference]: Start difference. First operand 2474 states and 9390 transitions. Second operand 5 states. [2020-11-09 16:45:46,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:45:46,086 INFO L93 Difference]: Finished difference Result 2458 states and 9314 transitions. [2020-11-09 16:45:46,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-09 16:45:46,088 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-11-09 16:45:46,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:45:46,101 INFO L225 Difference]: With dead ends: 2458 [2020-11-09 16:45:46,101 INFO L226 Difference]: Without dead ends: 2458 [2020-11-09 16:45:46,101 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 21 SyntacticMatches, 11 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-09 16:45:46,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2458 states. [2020-11-09 16:45:46,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2458 to 2410. [2020-11-09 16:45:46,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2410 states. [2020-11-09 16:45:46,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2410 states to 2410 states and 9134 transitions. [2020-11-09 16:45:46,195 INFO L78 Accepts]: Start accepts. Automaton has 2410 states and 9134 transitions. Word has length 16 [2020-11-09 16:45:46,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:45:46,195 INFO L481 AbstractCegarLoop]: Abstraction has 2410 states and 9134 transitions. [2020-11-09 16:45:46,195 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-09 16:45:46,195 INFO L276 IsEmpty]: Start isEmpty. Operand 2410 states and 9134 transitions. [2020-11-09 16:45:46,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 16:45:46,200 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:45:46,200 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:45:46,200 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-09 16:45:46,200 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-11-09 16:45:46,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:45:46,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1495289419, now seen corresponding path program 1 times [2020-11-09 16:45:46,204 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:45:46,204 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491937509] [2020-11-09 16:45:46,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:45:46,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:45:46,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 16:45:46,332 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491937509] [2020-11-09 16:45:46,332 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:45:46,332 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-09 16:45:46,332 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2036073282] [2020-11-09 16:45:46,332 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:45:46,335 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:45:46,347 INFO L252 McrAutomatonBuilder]: Finished intersection with 62 states and 130 transitions. [2020-11-09 16:45:46,347 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:45:46,514 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 3, 2, 1] term [2020-11-09 16:45:46,515 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:46,516 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term [2020-11-09 16:45:46,516 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:46,631 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 3, 2, 1] term [2020-11-09 16:45:46,631 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:46,632 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term [2020-11-09 16:45:46,632 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:47,220 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [75393#(and (not (= 2 ~y~0)) (= ~y$r_buff0_thd0~0 0)), 75392#(and (= ~y$r_buff1_thd0~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= 2 ~y$w_buff0~0) (= ~y$r_buff0_thd0~0 0))] [2020-11-09 16:45:47,221 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-09 16:45:47,221 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:45:47,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-09 16:45:47,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-11-09 16:45:47,222 INFO L87 Difference]: Start difference. First operand 2410 states and 9134 transitions. Second operand 8 states. [2020-11-09 16:45:47,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:45:47,496 INFO L93 Difference]: Finished difference Result 2802 states and 10576 transitions. [2020-11-09 16:45:47,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-09 16:45:47,497 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2020-11-09 16:45:47,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:45:47,544 INFO L225 Difference]: With dead ends: 2802 [2020-11-09 16:45:47,545 INFO L226 Difference]: Without dead ends: 2802 [2020-11-09 16:45:47,545 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 34 SyntacticMatches, 9 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-11-09 16:45:47,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2802 states. [2020-11-09 16:45:47,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2802 to 2690. [2020-11-09 16:45:47,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2690 states. [2020-11-09 16:45:47,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2690 states to 2690 states and 10188 transitions. [2020-11-09 16:45:47,639 INFO L78 Accepts]: Start accepts. Automaton has 2690 states and 10188 transitions. Word has length 16 [2020-11-09 16:45:47,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:45:47,639 INFO L481 AbstractCegarLoop]: Abstraction has 2690 states and 10188 transitions. [2020-11-09 16:45:47,640 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-09 16:45:47,640 INFO L276 IsEmpty]: Start isEmpty. Operand 2690 states and 10188 transitions. [2020-11-09 16:45:47,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 16:45:47,645 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:45:47,645 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:45:47,645 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-09 16:45:47,645 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-11-09 16:45:47,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:45:47,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1348382509, now seen corresponding path program 2 times [2020-11-09 16:45:47,648 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:45:47,648 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920309326] [2020-11-09 16:45:47,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:45:47,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:45:47,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 16:45:47,881 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920309326] [2020-11-09 16:45:47,881 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:45:47,882 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-09 16:45:47,882 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [950658380] [2020-11-09 16:45:47,882 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:45:47,885 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:45:47,893 INFO L252 McrAutomatonBuilder]: Finished intersection with 41 states and 68 transitions. [2020-11-09 16:45:47,893 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:45:47,946 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 16:45:47,946 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:47,947 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-11-09 16:45:47,947 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:48,047 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 16:45:48,048 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:48,048 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-11-09 16:45:48,048 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:48,153 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 16:45:48,153 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-09 16:45:48,153 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:45:48,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-09 16:45:48,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-09 16:45:48,154 INFO L87 Difference]: Start difference. First operand 2690 states and 10188 transitions. Second operand 6 states. [2020-11-09 16:45:48,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:45:48,745 INFO L93 Difference]: Finished difference Result 3018 states and 11422 transitions. [2020-11-09 16:45:48,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-09 16:45:48,747 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-11-09 16:45:48,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:45:48,764 INFO L225 Difference]: With dead ends: 3018 [2020-11-09 16:45:48,764 INFO L226 Difference]: Without dead ends: 3018 [2020-11-09 16:45:48,764 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 18 SyntacticMatches, 6 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2020-11-09 16:45:48,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3018 states. [2020-11-09 16:45:48,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3018 to 2826. [2020-11-09 16:45:48,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2826 states. [2020-11-09 16:45:48,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2826 states to 2826 states and 10694 transitions. [2020-11-09 16:45:48,905 INFO L78 Accepts]: Start accepts. Automaton has 2826 states and 10694 transitions. Word has length 16 [2020-11-09 16:45:48,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:45:48,905 INFO L481 AbstractCegarLoop]: Abstraction has 2826 states and 10694 transitions. [2020-11-09 16:45:48,905 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-09 16:45:48,905 INFO L276 IsEmpty]: Start isEmpty. Operand 2826 states and 10694 transitions. [2020-11-09 16:45:48,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-09 16:45:48,912 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:45:48,912 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:45:48,912 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-09 16:45:48,912 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-11-09 16:45:48,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:45:48,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1533933320, now seen corresponding path program 1 times [2020-11-09 16:45:48,915 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:45:48,916 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353751710] [2020-11-09 16:45:48,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:45:48,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:45:49,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 16:45:49,142 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353751710] [2020-11-09 16:45:49,142 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:45:49,142 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-09 16:45:49,143 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [219943668] [2020-11-09 16:45:49,143 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:45:49,145 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:45:49,158 INFO L252 McrAutomatonBuilder]: Finished intersection with 70 states and 147 transitions. [2020-11-09 16:45:49,158 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:45:49,168 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 4, 2, 3, 2, 1] term [2020-11-09 16:45:49,168 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:49,169 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:49,169 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:49,175 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:49,175 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:49,176 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:49,176 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:49,177 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:49,177 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:49,391 WARN L194 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 19 [2020-11-09 16:45:49,396 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-11-09 16:45:49,397 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:49,397 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:49,397 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:49,453 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 4, 2, 3, 2, 1] term [2020-11-09 16:45:49,453 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:49,454 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:49,454 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:49,458 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:49,458 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:49,459 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:49,459 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:49,460 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:49,460 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:49,587 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-11-09 16:45:49,588 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:49,588 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:49,588 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:49,636 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:49,637 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:49,637 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:49,638 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:49,638 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:49,638 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:49,641 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 4, 2, 3, 2, 1] term [2020-11-09 16:45:49,641 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:49,641 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:49,642 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:49,860 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 4, 2, 3, 2, 1] term [2020-11-09 16:45:49,861 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:49,861 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:49,861 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:49,865 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:49,865 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:49,866 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:49,866 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:49,867 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:49,867 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:49,947 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:49,947 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:49,948 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:49,948 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:49,948 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:49,949 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:49,950 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 4, 2, 3, 2, 1] term [2020-11-09 16:45:49,950 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:49,951 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:49,951 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:50,680 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [92269#(and (= ~y~0 1) (= ~y$w_buff1~0 0) (or (= (mod ~y$r_buff0_thd2~0 256) 0) (= ~y$w_buff0~0 1)) (= (mod ~y$w_buff1_used~0 256) 0) (= ~y$r_buff0_thd0~0 0)), 92271#(and (= ~y$w_buff1~0 0) (or (= (mod ~y$r_buff0_thd2~0 256) 0) (= ~y$w_buff0~0 1)) (= (mod ~y$w_buff1_used~0 256) 0) (= ~y$r_buff0_thd0~0 0)), 92270#(and (= ~y~0 1) (= (mod ~y$r_buff0_thd2~0 256) 0) (= ~y$w_buff0~0 0) (= ~y$r_buff0_thd0~0 0)), 92273#(and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0)), 92272#(and (= (mod ~y$r_buff0_thd2~0 256) 0) (= ~y$w_buff0~0 0) (= ~y$r_buff0_thd0~0 0))] [2020-11-09 16:45:50,681 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-09 16:45:50,681 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:45:50,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-09 16:45:50,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2020-11-09 16:45:50,682 INFO L87 Difference]: Start difference. First operand 2826 states and 10694 transitions. Second operand 12 states. [2020-11-09 16:45:51,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:45:51,159 INFO L93 Difference]: Finished difference Result 3570 states and 13080 transitions. [2020-11-09 16:45:51,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-09 16:45:51,161 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2020-11-09 16:45:51,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:45:51,180 INFO L225 Difference]: With dead ends: 3570 [2020-11-09 16:45:51,180 INFO L226 Difference]: Without dead ends: 3426 [2020-11-09 16:45:51,181 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 35 SyntacticMatches, 12 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2020-11-09 16:45:51,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3426 states. [2020-11-09 16:45:51,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3426 to 2842. [2020-11-09 16:45:51,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2842 states. [2020-11-09 16:45:51,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2842 states to 2842 states and 10562 transitions. [2020-11-09 16:45:51,306 INFO L78 Accepts]: Start accepts. Automaton has 2842 states and 10562 transitions. Word has length 17 [2020-11-09 16:45:51,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:45:51,307 INFO L481 AbstractCegarLoop]: Abstraction has 2842 states and 10562 transitions. [2020-11-09 16:45:51,307 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-09 16:45:51,307 INFO L276 IsEmpty]: Start isEmpty. Operand 2842 states and 10562 transitions. [2020-11-09 16:45:51,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-09 16:45:51,314 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:45:51,314 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:45:51,314 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-09 16:45:51,314 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-11-09 16:45:51,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:45:51,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1615625476, now seen corresponding path program 1 times [2020-11-09 16:45:51,317 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:45:51,317 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616070601] [2020-11-09 16:45:51,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:45:51,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:45:51,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 16:45:51,433 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616070601] [2020-11-09 16:45:51,433 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:45:51,434 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 16:45:51,434 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [924606894] [2020-11-09 16:45:51,434 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:45:51,437 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:45:51,455 INFO L252 McrAutomatonBuilder]: Finished intersection with 79 states and 168 transitions. [2020-11-09 16:45:51,455 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:45:51,504 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-09 16:45:51,505 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:51,519 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:51,519 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:51,520 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:51,520 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:51,521 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:51,521 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:51,559 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:51,559 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:51,560 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:51,560 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:51,561 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:51,561 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:51,592 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-09 16:45:51,593 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:51,598 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:51,598 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:51,599 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:51,599 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:51,600 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:51,601 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:51,650 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-09 16:45:51,651 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:51,656 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:51,656 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:51,657 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:51,657 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:51,658 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:51,658 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:51,739 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:51,740 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:51,741 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:51,741 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:51,742 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:51,742 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:51,832 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:51,833 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:51,834 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:51,834 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:51,834 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:51,835 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:51,876 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:51,877 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:51,877 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:51,877 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:51,878 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:51,878 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:51,879 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-09 16:45:51,879 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:51,921 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:51,921 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:51,922 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:51,922 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:51,923 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:51,923 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:51,926 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-09 16:45:51,927 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:52,025 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:52,025 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:52,027 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:52,027 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:52,028 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:52,028 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:52,137 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:52,137 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:52,138 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:52,138 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:52,139 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:52,140 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:52,229 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:52,229 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:52,230 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:52,231 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:52,231 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:52,232 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:52,277 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-09 16:45:52,278 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:52,285 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-09 16:45:52,286 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:52,304 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-09 16:45:52,304 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:52,310 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:52,310 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:52,311 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:52,311 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:52,312 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:52,313 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:52,359 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-09 16:45:52,359 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:52,432 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:52,433 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:52,433 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:52,433 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:52,434 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:52,434 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:52,491 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:52,491 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:52,492 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:52,492 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:52,493 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:52,493 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:52,540 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:52,541 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:52,542 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:52,542 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:52,542 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:52,543 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:52,580 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-09 16:45:52,580 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:52,589 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-09 16:45:52,589 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:52,604 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-09 16:45:52,604 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:52,641 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-09 16:45:52,641 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:52,728 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 16:45:52,728 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-09 16:45:52,728 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:45:52,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-09 16:45:52,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-09 16:45:52,729 INFO L87 Difference]: Start difference. First operand 2842 states and 10562 transitions. Second operand 4 states. [2020-11-09 16:45:52,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:45:52,797 INFO L93 Difference]: Finished difference Result 2992 states and 10144 transitions. [2020-11-09 16:45:52,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-09 16:45:52,798 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2020-11-09 16:45:52,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:45:52,808 INFO L225 Difference]: With dead ends: 2992 [2020-11-09 16:45:52,808 INFO L226 Difference]: Without dead ends: 2216 [2020-11-09 16:45:52,809 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 28 SyntacticMatches, 18 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-09 16:45:52,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2216 states. [2020-11-09 16:45:52,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2216 to 2216. [2020-11-09 16:45:52,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2216 states. [2020-11-09 16:45:52,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2216 states to 2216 states and 7438 transitions. [2020-11-09 16:45:52,882 INFO L78 Accepts]: Start accepts. Automaton has 2216 states and 7438 transitions. Word has length 17 [2020-11-09 16:45:52,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:45:52,883 INFO L481 AbstractCegarLoop]: Abstraction has 2216 states and 7438 transitions. [2020-11-09 16:45:52,883 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-09 16:45:52,883 INFO L276 IsEmpty]: Start isEmpty. Operand 2216 states and 7438 transitions. [2020-11-09 16:45:52,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-09 16:45:52,889 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:45:52,889 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:45:52,889 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-09 16:45:52,889 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-11-09 16:45:52,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:45:52,890 INFO L82 PathProgramCache]: Analyzing trace with hash -667234984, now seen corresponding path program 1 times [2020-11-09 16:45:52,897 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:45:52,898 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014712215] [2020-11-09 16:45:52,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:45:52,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:45:53,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 16:45:53,002 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014712215] [2020-11-09 16:45:53,003 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:45:53,003 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-09 16:45:53,003 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [864854995] [2020-11-09 16:45:53,003 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:45:53,008 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:45:53,030 INFO L252 McrAutomatonBuilder]: Finished intersection with 71 states and 138 transitions. [2020-11-09 16:45:53,030 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:45:53,108 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-09 16:45:53,108 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:53,130 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:53,131 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:53,131 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:53,131 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:53,132 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:53,132 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:53,177 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:53,177 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:53,178 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:53,179 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:53,179 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:53,180 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:53,225 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:53,225 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:53,226 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:53,226 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:53,227 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:53,227 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:53,266 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:53,266 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:53,267 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:53,267 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:53,268 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:53,268 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:53,396 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-09 16:45:53,396 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:53,423 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:53,424 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:53,424 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:53,425 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:53,425 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:53,426 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:53,568 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-09 16:45:53,568 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:53,603 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:53,603 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:53,604 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:53,604 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:53,605 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:53,605 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:53,651 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:53,651 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:53,652 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:53,652 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:53,653 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:53,653 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:53,709 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:53,710 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:53,710 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:53,711 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:53,711 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:53,711 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:53,776 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:53,776 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:53,777 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:53,777 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:53,778 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:53,778 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:53,942 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [108969#(<= ~__unbuffered_cnt~0 0)] [2020-11-09 16:45:53,944 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-09 16:45:53,945 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:45:53,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-09 16:45:53,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-09 16:45:53,945 INFO L87 Difference]: Start difference. First operand 2216 states and 7438 transitions. Second operand 6 states. [2020-11-09 16:45:54,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:45:54,070 INFO L93 Difference]: Finished difference Result 1949 states and 6031 transitions. [2020-11-09 16:45:54,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-09 16:45:54,072 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-11-09 16:45:54,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:45:54,077 INFO L225 Difference]: With dead ends: 1949 [2020-11-09 16:45:54,078 INFO L226 Difference]: Without dead ends: 1461 [2020-11-09 16:45:54,079 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 32 SyntacticMatches, 12 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-11-09 16:45:54,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1461 states. [2020-11-09 16:45:54,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1461 to 1461. [2020-11-09 16:45:54,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1461 states. [2020-11-09 16:45:54,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1461 states to 1461 states and 4432 transitions. [2020-11-09 16:45:54,154 INFO L78 Accepts]: Start accepts. Automaton has 1461 states and 4432 transitions. Word has length 18 [2020-11-09 16:45:54,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:45:54,156 INFO L481 AbstractCegarLoop]: Abstraction has 1461 states and 4432 transitions. [2020-11-09 16:45:54,156 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-09 16:45:54,156 INFO L276 IsEmpty]: Start isEmpty. Operand 1461 states and 4432 transitions. [2020-11-09 16:45:54,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-09 16:45:54,160 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:45:54,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] [2020-11-09 16:45:54,160 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-09 16:45:54,160 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-11-09 16:45:54,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:45:54,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1868355780, now seen corresponding path program 1 times [2020-11-09 16:45:54,163 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:45:54,163 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947076999] [2020-11-09 16:45:54,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:45:54,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:45:54,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 16:45:54,231 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947076999] [2020-11-09 16:45:54,231 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:45:54,232 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-09 16:45:54,232 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [542924768] [2020-11-09 16:45:54,232 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:45:54,236 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:45:54,263 INFO L252 McrAutomatonBuilder]: Finished intersection with 101 states and 206 transitions. [2020-11-09 16:45:54,263 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:45:54,368 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:54,369 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:54,370 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:54,374 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:54,375 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:54,375 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:54,421 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:54,422 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:54,422 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:54,423 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:54,423 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:54,423 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:54,464 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:54,464 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:54,465 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:54,465 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:54,466 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:54,466 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:54,534 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:54,534 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:54,535 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:54,536 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:54,536 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:54,537 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:54,609 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 16:45:54,610 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 16:45:54,610 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:45:54,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 16:45:54,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 16:45:54,611 INFO L87 Difference]: Start difference. First operand 1461 states and 4432 transitions. Second operand 3 states. [2020-11-09 16:45:54,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:45:54,644 INFO L93 Difference]: Finished difference Result 2123 states and 6261 transitions. [2020-11-09 16:45:54,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 16:45:54,647 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-11-09 16:45:54,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:45:54,652 INFO L225 Difference]: With dead ends: 2123 [2020-11-09 16:45:54,652 INFO L226 Difference]: Without dead ends: 1473 [2020-11-09 16:45:54,653 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 69 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-11-09 16:45:54,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1473 states. [2020-11-09 16:45:54,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1473 to 1445. [2020-11-09 16:45:54,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2020-11-09 16:45:54,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 4127 transitions. [2020-11-09 16:45:54,693 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 4127 transitions. Word has length 20 [2020-11-09 16:45:54,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:45:54,693 INFO L481 AbstractCegarLoop]: Abstraction has 1445 states and 4127 transitions. [2020-11-09 16:45:54,693 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 16:45:54,693 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 4127 transitions. [2020-11-09 16:45:54,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-09 16:45:54,698 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:45:54,698 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-11-09 16:45:54,698 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-09 16:45:54,698 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-11-09 16:45:54,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:45:54,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1472992942, now seen corresponding path program 1 times [2020-11-09 16:45:54,702 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:45:54,702 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13906675] [2020-11-09 16:45:54,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:45:54,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:45:54,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 16:45:54,791 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13906675] [2020-11-09 16:45:54,792 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:45:54,792 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-09 16:45:54,792 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [278321949] [2020-11-09 16:45:54,792 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:45:54,796 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:45:54,870 INFO L252 McrAutomatonBuilder]: Finished intersection with 193 states and 464 transitions. [2020-11-09 16:45:54,870 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:45:54,985 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-09 16:45:54,986 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:55,003 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-09 16:45:55,004 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:55,073 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:55,073 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:55,074 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:55,074 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:55,075 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:55,075 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:55,117 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:55,118 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:55,119 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:55,119 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:55,120 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:55,120 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:55,163 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:55,164 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:55,165 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:55,165 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:55,166 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:55,167 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:55,244 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-09 16:45:55,245 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:55,311 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-09 16:45:55,312 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:55,420 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-09 16:45:55,420 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:55,453 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:55,453 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:55,454 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:55,454 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:55,455 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:55,455 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:55,497 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:55,497 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:55,498 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:55,498 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:55,499 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:55,499 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:55,534 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:55,534 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:55,535 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:55,535 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:55,536 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:55,536 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:55,589 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:55,590 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:55,590 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:55,591 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:55,591 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:55,591 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:55,666 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:55,667 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:55,668 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:55,668 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:55,669 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:55,669 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:55,781 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:55,781 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:55,782 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:55,782 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:55,783 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:55,785 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:55,827 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:55,827 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:55,828 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:55,828 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:55,829 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:55,829 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:55,866 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:55,867 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:55,868 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:55,868 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:55,870 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:55,870 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:55,919 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:55,919 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:55,923 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:55,924 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:55,924 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:55,924 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:56,146 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:56,147 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:56,147 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:56,147 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:56,148 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:56,148 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:56,261 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:56,261 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:56,262 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:56,262 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:56,263 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:56,263 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:56,371 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:56,372 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:56,372 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:56,373 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:56,373 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:56,373 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:56,407 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:56,408 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:56,409 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:56,409 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:56,409 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:56,410 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:56,448 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:56,449 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:56,450 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:56,450 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:56,450 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:56,451 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:56,509 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:56,510 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:56,511 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:56,511 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:56,512 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:56,512 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:56,589 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:56,590 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:56,590 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:56,591 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:56,591 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:56,591 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:56,736 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [118867#(<= ~__unbuffered_cnt~0 0)] [2020-11-09 16:45:56,737 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-09 16:45:56,737 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:45:56,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-09 16:45:56,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-09 16:45:56,738 INFO L87 Difference]: Start difference. First operand 1445 states and 4127 transitions. Second operand 7 states. [2020-11-09 16:45:56,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:45:56,878 INFO L93 Difference]: Finished difference Result 1283 states and 3615 transitions. [2020-11-09 16:45:56,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-09 16:45:56,880 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2020-11-09 16:45:56,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:45:56,882 INFO L225 Difference]: With dead ends: 1283 [2020-11-09 16:45:56,882 INFO L226 Difference]: Without dead ends: 1117 [2020-11-09 16:45:56,884 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 79 SyntacticMatches, 22 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2020-11-09 16:45:56,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1117 states. [2020-11-09 16:45:56,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1117 to 997. [2020-11-09 16:45:56,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2020-11-09 16:45:56,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 2853 transitions. [2020-11-09 16:45:56,912 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 2853 transitions. Word has length 21 [2020-11-09 16:45:56,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:45:56,912 INFO L481 AbstractCegarLoop]: Abstraction has 997 states and 2853 transitions. [2020-11-09 16:45:56,912 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-09 16:45:56,912 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 2853 transitions. [2020-11-09 16:45:56,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-11-09 16:45:56,916 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:45:56,916 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-11-09 16:45:56,916 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-09 16:45:56,916 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-11-09 16:45:56,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:45:56,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1449693238, now seen corresponding path program 1 times [2020-11-09 16:45:56,919 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:45:56,920 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399755360] [2020-11-09 16:45:56,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:45:56,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:45:57,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 16:45:57,045 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399755360] [2020-11-09 16:45:57,045 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:45:57,045 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-09 16:45:57,045 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [815117795] [2020-11-09 16:45:57,046 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:45:57,050 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:45:57,140 INFO L252 McrAutomatonBuilder]: Finished intersection with 230 states and 505 transitions. [2020-11-09 16:45:57,140 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:45:57,162 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:57,162 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:57,163 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:57,163 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:57,163 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:57,163 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:57,196 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:57,197 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:57,197 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:57,197 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:57,198 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:57,198 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:57,235 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:57,235 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:57,236 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:57,236 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:57,236 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:57,237 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:57,323 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:57,324 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:57,324 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:57,325 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:57,325 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:57,326 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:57,370 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:57,371 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:57,372 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:57,372 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:57,373 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:57,373 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:57,420 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:57,421 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:57,422 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:57,422 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:57,423 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:57,423 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:57,512 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:57,513 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:57,513 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:57,513 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:57,516 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:57,517 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:57,580 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:57,581 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:57,582 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:57,582 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:57,583 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:57,583 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:57,665 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:57,666 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:57,667 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:57,667 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:57,668 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:57,668 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:57,756 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:57,756 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:57,757 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:57,758 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:57,758 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:57,759 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:57,803 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:57,803 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:57,804 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:57,804 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:57,805 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:57,805 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:57,845 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:57,846 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:57,846 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:57,847 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:57,848 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:57,848 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:57,932 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:57,933 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:57,933 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:57,934 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:57,935 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:57,935 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:58,162 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-09 16:45:58,163 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:58,178 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-09 16:45:58,178 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:58,206 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [122158#(<= ~__unbuffered_cnt~0 0)] [2020-11-09 16:45:58,207 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-09 16:45:58,207 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:45:58,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-09 16:45:58,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-11-09 16:45:58,208 INFO L87 Difference]: Start difference. First operand 997 states and 2853 transitions. Second operand 8 states. [2020-11-09 16:45:58,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:45:58,416 INFO L93 Difference]: Finished difference Result 964 states and 2787 transitions. [2020-11-09 16:45:58,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-09 16:45:58,419 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2020-11-09 16:45:58,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:45:58,421 INFO L225 Difference]: With dead ends: 964 [2020-11-09 16:45:58,421 INFO L226 Difference]: Without dead ends: 589 [2020-11-09 16:45:58,422 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 55 SyntacticMatches, 6 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2020-11-09 16:45:58,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2020-11-09 16:45:58,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 493. [2020-11-09 16:45:58,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2020-11-09 16:45:58,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 1397 transitions. [2020-11-09 16:45:58,435 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 1397 transitions. Word has length 24 [2020-11-09 16:45:58,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:45:58,435 INFO L481 AbstractCegarLoop]: Abstraction has 493 states and 1397 transitions. [2020-11-09 16:45:58,435 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-09 16:45:58,435 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 1397 transitions. [2020-11-09 16:45:58,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-11-09 16:45:58,437 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:45:58,437 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-11-09 16:45:58,438 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-09 16:45:58,438 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-11-09 16:45:58,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:45:58,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1532231772, now seen corresponding path program 1 times [2020-11-09 16:45:58,445 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:45:58,446 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887524232] [2020-11-09 16:45:58,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:45:58,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:45:58,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 16:45:58,527 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887524232] [2020-11-09 16:45:58,527 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:45:58,527 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 16:45:58,528 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [17523936] [2020-11-09 16:45:58,528 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:45:58,533 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:45:58,684 INFO L252 McrAutomatonBuilder]: Finished intersection with 254 states and 550 transitions. [2020-11-09 16:45:58,684 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:45:58,693 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:58,694 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:58,695 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:58,695 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:58,695 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:58,696 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:58,751 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:58,752 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:58,753 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:58,753 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:58,753 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:58,754 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:58,801 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:58,801 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:58,802 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:58,802 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:58,803 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:58,803 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:58,844 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:58,845 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:58,846 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:58,846 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:58,846 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:58,847 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:58,883 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:58,883 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:58,884 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:58,884 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:58,885 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:58,885 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:58,915 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:58,915 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:58,917 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:58,917 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:58,917 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:58,917 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:58,974 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:58,975 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:58,976 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:58,976 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:58,977 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:58,977 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:59,011 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:59,011 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:59,013 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:59,013 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:59,013 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:59,014 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:59,051 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:59,052 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:59,052 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:59,052 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:59,053 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:59,053 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:59,096 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:59,097 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:59,098 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:59,098 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:59,099 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:59,099 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:59,161 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:59,162 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:59,162 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:59,163 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:59,163 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:59,164 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:59,199 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:59,200 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:59,200 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:59,200 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:59,201 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:59,201 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:59,266 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:59,267 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:59,268 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:59,268 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:59,268 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:59,268 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:59,328 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:59,329 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:59,330 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:59,330 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:59,330 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:59,331 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:59,433 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:59,434 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:59,434 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:59,434 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:59,435 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:59,435 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:59,497 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:59,497 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:59,498 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:59,498 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:59,499 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:59,499 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:59,563 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:59,563 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:59,564 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:59,564 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:59,565 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:59,565 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:59,625 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 16:45:59,626 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-09 16:45:59,626 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:45:59,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-09 16:45:59,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-09 16:45:59,627 INFO L87 Difference]: Start difference. First operand 493 states and 1397 transitions. Second operand 4 states. [2020-11-09 16:45:59,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:45:59,659 INFO L93 Difference]: Finished difference Result 640 states and 1783 transitions. [2020-11-09 16:45:59,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-09 16:45:59,661 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2020-11-09 16:45:59,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:45:59,662 INFO L225 Difference]: With dead ends: 640 [2020-11-09 16:45:59,662 INFO L226 Difference]: Without dead ends: 190 [2020-11-09 16:45:59,662 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 60 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-11-09 16:45:59,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2020-11-09 16:45:59,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2020-11-09 16:45:59,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2020-11-09 16:45:59,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 463 transitions. [2020-11-09 16:45:59,668 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 463 transitions. Word has length 27 [2020-11-09 16:45:59,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:45:59,668 INFO L481 AbstractCegarLoop]: Abstraction has 190 states and 463 transitions. [2020-11-09 16:45:59,668 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-09 16:45:59,668 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 463 transitions. [2020-11-09 16:45:59,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-11-09 16:45:59,669 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:45:59,669 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-11-09 16:45:59,669 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-09 16:45:59,670 INFO L429 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:45:59,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:45:59,670 INFO L82 PathProgramCache]: Analyzing trace with hash 56148650, now seen corresponding path program 2 times [2020-11-09 16:45:59,679 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:45:59,679 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035825400] [2020-11-09 16:45:59,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:45:59,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:46:00,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 16:46:00,216 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035825400] [2020-11-09 16:46:00,216 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:46:00,216 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-09 16:46:00,217 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1511810000] [2020-11-09 16:46:00,217 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:46:00,221 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:46:00,273 INFO L252 McrAutomatonBuilder]: Finished intersection with 144 states and 281 transitions. [2020-11-09 16:46:00,273 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:46:00,300 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 7, 3, 2, 3, 2, 1] term [2020-11-09 16:46:00,301 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:46:00,301 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 7, 3, 2, 1] term [2020-11-09 16:46:00,301 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:46:00,303 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:46:00,304 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:46:00,304 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:46:00,304 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:46:00,305 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 7, 4, 2, 3, 2, 1] term [2020-11-09 16:46:00,305 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 16:46:00,504 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 7, 3, 2, 3, 2, 1] term [2020-11-09 16:46:00,504 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:46:00,506 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 7, 3, 2, 1] term [2020-11-09 16:46:00,506 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:46:00,508 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:46:00,509 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:46:00,510 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:46:00,510 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:46:00,511 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 7, 4, 2, 3, 2, 1] term [2020-11-09 16:46:00,511 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 16:46:00,681 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:46:00,681 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:46:00,682 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:46:00,682 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:46:00,682 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[5, 8, 3, 2, 2, 1] term [2020-11-09 16:46:00,683 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 16:46:01,107 WARN L194 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 29 [2020-11-09 16:46:01,122 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:46:01,122 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:46:01,123 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:46:01,123 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:46:01,124 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[5, 8, 3, 2, 2, 1] term [2020-11-09 16:46:01,124 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 16:46:01,264 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:46:01,264 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:46:01,265 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:46:01,265 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:46:01,266 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[5, 8, 3, 2, 2, 1] term [2020-11-09 16:46:01,266 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 16:46:01,470 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:46:01,471 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:46:01,471 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:46:01,472 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:46:01,472 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[5, 8, 3, 2, 2, 1] term [2020-11-09 16:46:01,472 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 16:46:01,670 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:46:01,670 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:46:01,671 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:46:01,671 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:46:01,672 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[5, 8, 3, 2, 2, 1] term [2020-11-09 16:46:01,672 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 16:46:01,892 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:46:01,892 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:46:01,893 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:46:01,893 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:46:01,893 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[5, 8, 3, 2, 2, 1] term [2020-11-09 16:46:01,894 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 16:46:02,069 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:46:02,070 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:46:02,070 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:46:02,071 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:46:02,071 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[5, 8, 3, 2, 2, 1] term [2020-11-09 16:46:02,071 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 16:46:02,205 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:46:02,205 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:46:02,206 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:46:02,206 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:46:02,207 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[5, 8, 3, 2, 2, 1] term [2020-11-09 16:46:02,207 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 16:46:02,420 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [125153#(and (or (not (= (mod ~y$w_buff0_used~0 256) 0)) (= ~y$r_buff0_thd2~0 0)) (or (not (= (mod ~y$w_buff0_used~0 256) 0)) (= ~y$r_buff0_thd0~0 0)) (or (not (= (mod ~y$w_buff0_used~0 256) 0)) (= ~y$r_buff0_thd4~0 0)) (or (= ~y$w_buff0~0 0) (not (= (mod ~y$w_buff0_used~0 256) 0)))), 125152#(and (= ~y$r_buff1_thd0~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (or (= ~y$w_buff0_used~0 0) (not (= (mod ~y$w_buff0_used~0 256) 0))) (or (not (= 0 (mod ~y$r_buff0_thd3~0 256))) (= ~y$w_buff0_used~0 0)) (= ~y$r_buff1_thd4~0 0) (= 2 ~y$w_buff0~0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0))] [2020-11-09 16:46:02,420 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-09 16:46:02,420 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:46:02,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-09 16:46:02,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2020-11-09 16:46:02,421 INFO L87 Difference]: Start difference. First operand 190 states and 463 transitions. Second operand 11 states. [2020-11-09 16:46:02,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:46:02,834 INFO L93 Difference]: Finished difference Result 336 states and 835 transitions. [2020-11-09 16:46:02,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-09 16:46:02,835 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2020-11-09 16:46:02,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:46:02,836 INFO L225 Difference]: With dead ends: 336 [2020-11-09 16:46:02,836 INFO L226 Difference]: Without dead ends: 276 [2020-11-09 16:46:02,836 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 12 SyntacticMatches, 10 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2020-11-09 16:46:02,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2020-11-09 16:46:02,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 168. [2020-11-09 16:46:02,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2020-11-09 16:46:02,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 415 transitions. [2020-11-09 16:46:02,841 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 415 transitions. Word has length 27 [2020-11-09 16:46:02,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:46:02,841 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 415 transitions. [2020-11-09 16:46:02,841 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-09 16:46:02,841 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 415 transitions. [2020-11-09 16:46:02,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-11-09 16:46:02,842 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:46:02,842 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-11-09 16:46:02,842 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-11-09 16:46:02,842 INFO L429 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:46:02,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:46:02,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1947413876, now seen corresponding path program 3 times [2020-11-09 16:46:02,851 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:46:02,851 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649694091] [2020-11-09 16:46:02,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:46:02,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-09 16:46:02,911 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-09 16:46:02,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-09 16:46:02,988 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-09 16:46:03,078 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-09 16:46:03,078 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-09 16:46:03,079 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-11-09 16:46:03,274 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 04:46:03 BasicIcfg [2020-11-09 16:46:03,274 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-09 16:46:03,276 INFO L168 Benchmark]: Toolchain (without parser) took 64518.54 ms. Allocated memory was 151.0 MB in the beginning and 519.0 MB in the end (delta: 368.1 MB). Free memory was 125.0 MB in the beginning and 271.4 MB in the end (delta: -146.4 MB). Peak memory consumption was 222.1 MB. Max. memory is 8.0 GB. [2020-11-09 16:46:03,276 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 151.0 MB. Free memory is still 123.2 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-09 16:46:03,277 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1148.70 ms. Allocated memory is still 151.0 MB. Free memory was 124.4 MB in the beginning and 124.3 MB in the end (delta: 117.1 kB). Peak memory consumption was 32.1 MB. Max. memory is 8.0 GB. [2020-11-09 16:46:03,277 INFO L168 Benchmark]: Boogie Procedure Inliner took 124.44 ms. Allocated memory is still 151.0 MB. Free memory was 124.3 MB in the beginning and 121.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-11-09 16:46:03,278 INFO L168 Benchmark]: Boogie Preprocessor took 81.42 ms. Allocated memory is still 151.0 MB. Free memory was 121.7 MB in the beginning and 119.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2020-11-09 16:46:03,279 INFO L168 Benchmark]: RCFGBuilder took 2967.02 ms. Allocated memory was 151.0 MB in the beginning and 192.9 MB in the end (delta: 41.9 MB). Free memory was 119.0 MB in the beginning and 103.5 MB in the end (delta: 15.5 MB). Peak memory consumption was 86.3 MB. Max. memory is 8.0 GB. [2020-11-09 16:46:03,279 INFO L168 Benchmark]: TraceAbstraction took 60177.08 ms. Allocated memory was 192.9 MB in the beginning and 519.0 MB in the end (delta: 326.1 MB). Free memory was 103.0 MB in the beginning and 271.4 MB in the end (delta: -168.4 MB). Peak memory consumption was 157.2 MB. Max. memory is 8.0 GB. [2020-11-09 16:46:03,282 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 151.0 MB. Free memory is still 123.2 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 1148.70 ms. Allocated memory is still 151.0 MB. Free memory was 124.4 MB in the beginning and 124.3 MB in the end (delta: 117.1 kB). Peak memory consumption was 32.1 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 124.44 ms. Allocated memory is still 151.0 MB. Free memory was 124.3 MB in the beginning and 121.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 81.42 ms. Allocated memory is still 151.0 MB. Free memory was 121.7 MB in the beginning and 119.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 2967.02 ms. Allocated memory was 151.0 MB in the beginning and 192.9 MB in the end (delta: 41.9 MB). Free memory was 119.0 MB in the beginning and 103.5 MB in the end (delta: 15.5 MB). Peak memory consumption was 86.3 MB. Max. memory is 8.0 GB. * TraceAbstraction took 60177.08 ms. Allocated memory was 192.9 MB in the beginning and 519.0 MB in the end (delta: 326.1 MB). Free memory was 103.0 MB in the beginning and 271.4 MB in the end (delta: -168.4 MB). Peak memory consumption was 157.2 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1550 VarBasedMoverChecksPositive, 51 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 132 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 35.6s, 129 PlacesBefore, 46 PlacesAfterwards, 119 TransitionsBefore, 33 TransitionsAfterwards, 2862 CoEnabledTransitionPairs, 7 FixpointIterations, 39 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 3 ChoiceCompositions, 102 TotalNumberOfCompositions, 8274 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p3_EAX = 0; [L714] 0 int __unbuffered_p3_EBX = 0; [L716] 0 int a = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L722] 0 int y = 0; [L723] 0 _Bool y$flush_delayed; [L724] 0 int y$mem_tmp; [L725] 0 _Bool y$r_buff0_thd0; [L726] 0 _Bool y$r_buff0_thd1; [L727] 0 _Bool y$r_buff0_thd2; [L728] 0 _Bool y$r_buff0_thd3; [L729] 0 _Bool y$r_buff0_thd4; [L730] 0 _Bool y$r_buff1_thd0; [L731] 0 _Bool y$r_buff1_thd1; [L732] 0 _Bool y$r_buff1_thd2; [L733] 0 _Bool y$r_buff1_thd3; [L734] 0 _Bool y$r_buff1_thd4; [L735] 0 _Bool y$read_delayed; [L736] 0 int *y$read_delayed_var; [L737] 0 int y$w_buff0; [L738] 0 _Bool y$w_buff0_used; [L739] 0 int y$w_buff1; [L740] 0 _Bool y$w_buff1_used; [L742] 0 int z = 0; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L844] 0 pthread_t t805; [L845] FCALL, FORK 0 pthread_create(&t805, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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] [L846] 0 pthread_t t806; [L847] FCALL, FORK 0 pthread_create(&t806, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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] [L848] 0 pthread_t t807; [L849] FCALL, FORK 0 pthread_create(&t807, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=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] [L783] 3 y$w_buff1 = y$w_buff0 [L784] 3 y$w_buff0 = 2 [L785] 3 y$w_buff1_used = y$w_buff0_used [L786] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L788] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L789] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L790] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L791] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L792] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L793] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=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] [L796] 3 z = 1 VAL [__unbuffered_cnt=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=1] [L850] 0 pthread_t t808; [L851] FCALL, FORK 0 pthread_create(&t808, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=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=1] [L813] 4 z = 2 VAL [__unbuffered_cnt=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=2] [L816] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __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=2] [L819] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __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=2] [L748] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __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=2] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __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=2] [L822] 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) [L822] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L822] 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) [L822] 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) [L823] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L823] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L824] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L824] 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 [L825] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L825] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L826] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L826] 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 [L829] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L831] 4 return 0; [L763] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=2, __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=2] [L766] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=2, __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=2] [L799] 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) [L799] 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) [L800] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L800] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L801] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L801] 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 [L802] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L802] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L803] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L803] 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 [L806] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L808] 3 return 0; [L769] 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) [L769] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L769] 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) [L769] 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) [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L770] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L771] 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 [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L772] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L773] 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 [L776] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L778] 2 return 0; [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L853] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __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=0, weak$$choice2=0, x=2, y=2, 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=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L3] COND FALSE 0 !(!cond) [L857] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L857] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L857] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L857] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L858] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L858] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L859] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L859] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L860] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L860] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L861] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L861] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L864] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L865] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L866] 0 y$flush_delayed = weak$$choice2 [L867] 0 y$mem_tmp = y [L868] 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) [L868] 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) [L869] 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)) [L869] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L869] 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)) [L869] 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)) [L870] 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)) [L870] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L870] 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)) [L870] 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)) [L871] 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)) [L871] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L871] 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)) [L871] 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)) [L872] 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)) [L872] 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) [L872] 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)) [L872] 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)) [L873] 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)) [L873] EXPR 0 !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) [L873] 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)) [L873] 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)) [L874] 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)) [L874] 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) [L874] 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)) [L874] 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)) [L875] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L876] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L876] 0 y = y$flush_delayed ? y$mem_tmp : y [L877] 0 y$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix030_power.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __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=50, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_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=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 117 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 59.7s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 35.9s, HoareTripleCheckerStatistics: 607 SDtfs, 954 SDslu, 1049 SDs, 0 SdLazy, 443 SolverSat, 238 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 726 GetRequests, 524 SyntacticMatches, 113 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 4.4s 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.7s AutomataMinimizationTime, 19 MinimizatonAttempts, 1288 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 347 NumberOfCodeBlocks, 347 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 301 ConstructedInterpolants, 0 QuantifiedInterpolants, 48584 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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...