/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix046_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-c7e336b [2020-10-06 00:41:29,415 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-06 00:41:29,419 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-06 00:41:29,460 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-06 00:41:29,460 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-06 00:41:29,469 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-06 00:41:29,472 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-06 00:41:29,476 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-06 00:41:29,479 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-06 00:41:29,483 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-06 00:41:29,484 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-06 00:41:29,485 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-06 00:41:29,485 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-06 00:41:29,488 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-06 00:41:29,490 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-06 00:41:29,492 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-06 00:41:29,493 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-06 00:41:29,494 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-06 00:41:29,495 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-06 00:41:29,503 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-06 00:41:29,505 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-06 00:41:29,506 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-06 00:41:29,507 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-06 00:41:29,507 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-06 00:41:29,517 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-06 00:41:29,517 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-06 00:41:29,518 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-06 00:41:29,523 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-06 00:41:29,525 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-06 00:41:29,525 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-06 00:41:29,526 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-06 00:41:29,526 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-06 00:41:29,527 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-06 00:41:29,528 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-06 00:41:29,529 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-06 00:41:29,529 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-06 00:41:29,530 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-06 00:41:29,530 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-06 00:41:29,530 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-06 00:41:29,531 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-06 00:41:29,532 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-06 00:41:29,533 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-WP.epf [2020-10-06 00:41:29,576 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-06 00:41:29,576 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-06 00:41:29,578 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-06 00:41:29,578 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-06 00:41:29,578 INFO L138 SettingsManager]: * Use SBE=true [2020-10-06 00:41:29,579 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-06 00:41:29,579 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-06 00:41:29,579 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-06 00:41:29,579 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-06 00:41:29,579 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-06 00:41:29,580 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-06 00:41:29,581 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-06 00:41:29,581 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-06 00:41:29,581 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-06 00:41:29,582 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-06 00:41:29,582 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-06 00:41:29,582 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-06 00:41:29,582 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-06 00:41:29,582 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-06 00:41:29,583 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-06 00:41:29,583 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-06 00:41:29,583 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-06 00:41:29,583 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-06 00:41:29,583 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-06 00:41:29,584 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-06 00:41:29,584 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-06 00:41:29,584 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-06 00:41:29,584 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-10-06 00:41:29,584 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-06 00:41:29,585 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-06 00:41:29,585 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2020-10-06 00:41:29,895 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-06 00:41:29,910 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-06 00:41:29,914 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-06 00:41:29,915 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-06 00:41:29,916 INFO L275 PluginConnector]: CDTParser initialized [2020-10-06 00:41:29,917 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix046_power.opt.i [2020-10-06 00:41:29,988 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4dc9156c/f235b23acd0d45eb8b22c75a66dded47/FLAG26b555eb8 [2020-10-06 00:41:30,575 INFO L306 CDTParser]: Found 1 translation units. [2020-10-06 00:41:30,576 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix046_power.opt.i [2020-10-06 00:41:30,595 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4dc9156c/f235b23acd0d45eb8b22c75a66dded47/FLAG26b555eb8 [2020-10-06 00:41:30,884 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4dc9156c/f235b23acd0d45eb8b22c75a66dded47 [2020-10-06 00:41:30,893 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-06 00:41:30,895 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-06 00:41:30,896 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-06 00:41:30,897 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-06 00:41:30,902 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-06 00:41:30,903 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 12:41:30" (1/1) ... [2020-10-06 00:41:30,906 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1467314f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:41:30, skipping insertion in model container [2020-10-06 00:41:30,906 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 12:41:30" (1/1) ... [2020-10-06 00:41:30,916 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-06 00:41:30,969 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-06 00:41:31,536 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-06 00:41:31,548 INFO L203 MainTranslator]: Completed pre-run [2020-10-06 00:41:31,615 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-06 00:41:31,692 INFO L208 MainTranslator]: Completed translation [2020-10-06 00:41:31,693 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:41:31 WrapperNode [2020-10-06 00:41:31,693 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-06 00:41:31,694 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-06 00:41:31,694 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-06 00:41:31,695 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-06 00:41:31,704 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:41:31" (1/1) ... [2020-10-06 00:41:31,724 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:41:31" (1/1) ... [2020-10-06 00:41:31,769 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-06 00:41:31,770 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-06 00:41:31,770 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-06 00:41:31,770 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-06 00:41:31,784 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:41:31" (1/1) ... [2020-10-06 00:41:31,784 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:41:31" (1/1) ... [2020-10-06 00:41:31,790 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:41:31" (1/1) ... [2020-10-06 00:41:31,790 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:41:31" (1/1) ... [2020-10-06 00:41:31,801 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:41:31" (1/1) ... [2020-10-06 00:41:31,805 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:41:31" (1/1) ... [2020-10-06 00:41:31,809 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:41:31" (1/1) ... [2020-10-06 00:41:31,815 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-06 00:41:31,816 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-06 00:41:31,816 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-06 00:41:31,816 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-06 00:41:31,817 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:41:31" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-06 00:41:31,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-06 00:41:31,896 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-06 00:41:31,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-06 00:41:31,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-06 00:41:31,896 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-06 00:41:31,897 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-06 00:41:31,897 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-06 00:41:31,897 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-06 00:41:31,897 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-06 00:41:31,898 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-06 00:41:31,898 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-06 00:41:31,898 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-06 00:41:31,898 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-06 00:41:31,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-06 00:41:31,899 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-06 00:41:31,901 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-06 00:41:33,904 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-06 00:41:33,904 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-06 00:41:33,907 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 12:41:33 BoogieIcfgContainer [2020-10-06 00:41:33,907 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-06 00:41:33,909 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-06 00:41:33,909 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-06 00:41:33,913 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-06 00:41:33,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.10 12:41:30" (1/3) ... [2020-10-06 00:41:33,914 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18fa348b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 12:41:33, skipping insertion in model container [2020-10-06 00:41:33,914 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:41:31" (2/3) ... [2020-10-06 00:41:33,915 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18fa348b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 12:41:33, skipping insertion in model container [2020-10-06 00:41:33,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 12:41:33" (3/3) ... [2020-10-06 00:41:33,918 INFO L109 eAbstractionObserver]: Analyzing ICFG mix046_power.opt.i [2020-10-06 00:41:33,929 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-06 00:41:33,930 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-06 00:41:33,941 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-06 00:41:33,941 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-06 00:41:33,974 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:33,974 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:33,974 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:33,974 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:33,975 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:33,975 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:33,975 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:33,976 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:33,976 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:33,976 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:33,976 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:33,976 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:33,977 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:33,977 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:33,977 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:33,977 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:33,978 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:33,978 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:33,978 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:33,978 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:33,978 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:33,978 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:33,979 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:33,979 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:33,979 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:33,980 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:33,980 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:33,980 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:33,981 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:33,981 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:33,981 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:33,981 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:33,981 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:33,982 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:33,982 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:33,982 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:33,982 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:33,983 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:33,983 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:33,983 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:33,984 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:33,984 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:33,988 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:33,988 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:33,988 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:33,989 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:33,993 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:33,993 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:33,993 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:33,993 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:33,994 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:33,994 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:33,994 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:33,994 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:33,994 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:33,995 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:33,996 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:33,997 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:33,997 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:33,997 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:33,997 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:33,997 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:33,998 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:33,998 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:33,998 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:33,998 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:33,999 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:33,999 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:34,001 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:34,001 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:34,002 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:34,002 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:34,017 INFO L251 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-06 00:41:34,041 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-06 00:41:34,041 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-06 00:41:34,041 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-06 00:41:34,042 INFO L378 AbstractCegarLoop]: Backedges is MCR [2020-10-06 00:41:34,042 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-06 00:41:34,042 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-06 00:41:34,042 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-06 00:41:34,042 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-06 00:41:34,061 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 112 transitions, 244 flow [2020-10-06 00:41:34,063 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 123 places, 112 transitions, 244 flow [2020-10-06 00:41:34,124 INFO L129 PetriNetUnfolder]: 2/108 cut-off events. [2020-10-06 00:41:34,124 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-06 00:41:34,130 INFO L80 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 108 events. 2/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 84 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2020-10-06 00:41:34,136 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 123 places, 112 transitions, 244 flow [2020-10-06 00:41:34,165 INFO L129 PetriNetUnfolder]: 2/108 cut-off events. [2020-10-06 00:41:34,165 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-06 00:41:34,166 INFO L80 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 108 events. 2/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 84 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2020-10-06 00:41:34,170 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2540 [2020-10-06 00:41:34,172 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-10-06 00:41:34,452 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2020-10-06 00:41:34,936 WARN L193 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-06 00:41:36,852 WARN L193 SmtUtils]: Spent 1.64 s on a formula simplification. DAG size of input: 230 DAG size of output: 189 [2020-10-06 00:41:36,891 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-10-06 00:41:36,891 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-06 00:41:36,894 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-06 00:41:36,895 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-06 00:41:38,284 WARN L193 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 147 DAG size of output: 127 [2020-10-06 00:41:38,704 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-06 00:41:38,811 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-06 00:41:40,551 WARN L193 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 138 DAG size of output: 129 [2020-10-06 00:41:40,888 WARN L193 SmtUtils]: Spent 333.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2020-10-06 00:41:41,558 WARN L193 SmtUtils]: Spent 665.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 112 [2020-10-06 00:41:41,864 WARN L193 SmtUtils]: Spent 303.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-10-06 00:41:42,545 WARN L193 SmtUtils]: Spent 322.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2020-10-06 00:41:42,899 WARN L193 SmtUtils]: Spent 350.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-10-06 00:41:43,339 WARN L193 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2020-10-06 00:41:43,483 WARN L193 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-10-06 00:41:43,493 INFO L206 etLargeBlockEncoding]: Checked pairs total: 6492 [2020-10-06 00:41:43,494 INFO L214 etLargeBlockEncoding]: Total number of compositions: 90 [2020-10-06 00:41:43,497 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 45 places, 32 transitions, 84 flow [2020-10-06 00:41:43,729 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3002 states. [2020-10-06 00:41:43,732 INFO L276 IsEmpty]: Start isEmpty. Operand 3002 states. [2020-10-06 00:41:43,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-06 00:41:43,757 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:41:43,758 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:41:43,758 INFO L427 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:41:43,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:41:43,765 INFO L82 PathProgramCache]: Analyzing trace with hash -681881970, now seen corresponding path program 1 times [2020-10-06 00:41:43,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:41:43,794 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184849956] [2020-10-06 00:41:43,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:41:44,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:41:44,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 00:41:44,202 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184849956] [2020-10-06 00:41:44,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:41:44,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-06 00:41:44,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [18502122] [2020-10-06 00:41:44,205 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:41:44,209 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:41:44,225 INFO L258 McrAutomatonBuilder]: Finished intersection with 10 states and 9 transitions. [2020-10-06 00:41:44,225 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:41:44,230 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 00:41:44,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-06 00:41:44,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:41:44,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-06 00:41:44,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-06 00:41:44,248 INFO L87 Difference]: Start difference. First operand 3002 states. Second operand 3 states. [2020-10-06 00:41:44,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:41:44,374 INFO L93 Difference]: Finished difference Result 2602 states and 10064 transitions. [2020-10-06 00:41:44,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-06 00:41:44,377 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-06 00:41:44,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:41:44,434 INFO L225 Difference]: With dead ends: 2602 [2020-10-06 00:41:44,434 INFO L226 Difference]: Without dead ends: 2122 [2020-10-06 00:41:44,436 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-06 00:41:44,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2122 states. [2020-10-06 00:41:44,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2122 to 2122. [2020-10-06 00:41:44,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2122 states. [2020-10-06 00:41:44,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2122 states to 2122 states and 8080 transitions. [2020-10-06 00:41:44,654 INFO L78 Accepts]: Start accepts. Automaton has 2122 states and 8080 transitions. Word has length 9 [2020-10-06 00:41:44,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:41:44,655 INFO L479 AbstractCegarLoop]: Abstraction has 2122 states and 8080 transitions. [2020-10-06 00:41:44,656 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-06 00:41:44,656 INFO L276 IsEmpty]: Start isEmpty. Operand 2122 states and 8080 transitions. [2020-10-06 00:41:44,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-06 00:41:44,661 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:41:44,661 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:41:44,662 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-06 00:41:44,662 INFO L427 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:41:44,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:41:44,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1841504421, now seen corresponding path program 1 times [2020-10-06 00:41:44,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:41:44,665 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003136771] [2020-10-06 00:41:44,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:41:44,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:41:44,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 00:41:44,810 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003136771] [2020-10-06 00:41:44,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:41:44,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-06 00:41:44,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [136946461] [2020-10-06 00:41:44,811 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:41:44,813 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:41:44,816 INFO L258 McrAutomatonBuilder]: Finished intersection with 12 states and 11 transitions. [2020-10-06 00:41:44,816 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:41:44,817 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 00:41:44,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-06 00:41:44,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:41:44,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-06 00:41:44,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-06 00:41:44,819 INFO L87 Difference]: Start difference. First operand 2122 states and 8080 transitions. Second operand 3 states. [2020-10-06 00:41:44,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:41:44,876 INFO L93 Difference]: Finished difference Result 2114 states and 8042 transitions. [2020-10-06 00:41:44,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-06 00:41:44,878 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-06 00:41:44,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:41:44,899 INFO L225 Difference]: With dead ends: 2114 [2020-10-06 00:41:44,900 INFO L226 Difference]: Without dead ends: 2114 [2020-10-06 00:41:44,901 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-06 00:41:44,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2114 states. [2020-10-06 00:41:44,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2114 to 2114. [2020-10-06 00:41:44,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2114 states. [2020-10-06 00:41:44,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2114 states to 2114 states and 8042 transitions. [2020-10-06 00:41:44,998 INFO L78 Accepts]: Start accepts. Automaton has 2114 states and 8042 transitions. Word has length 11 [2020-10-06 00:41:44,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:41:44,998 INFO L479 AbstractCegarLoop]: Abstraction has 2114 states and 8042 transitions. [2020-10-06 00:41:44,998 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-06 00:41:44,999 INFO L276 IsEmpty]: Start isEmpty. Operand 2114 states and 8042 transitions. [2020-10-06 00:41:45,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-06 00:41:45,002 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:41:45,002 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:41:45,002 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-06 00:41:45,002 INFO L427 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:41:45,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:41:45,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1250521648, now seen corresponding path program 1 times [2020-10-06 00:41:45,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:41:45,005 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291456888] [2020-10-06 00:41:45,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:41:45,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:41:45,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 00:41:45,097 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291456888] [2020-10-06 00:41:45,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:41:45,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-06 00:41:45,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2068403160] [2020-10-06 00:41:45,098 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:41:45,100 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:41:45,102 INFO L258 McrAutomatonBuilder]: Finished intersection with 14 states and 14 transitions. [2020-10-06 00:41:45,103 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:41:45,129 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [19329#(or (not (= (mod ~z$w_buff0_used~0 256) 0)) (and (= ~z$r_buff0_thd0~0 0) (= ~__unbuffered_p3_EAX~0 0)))] [2020-10-06 00:41:45,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-06 00:41:45,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:41:45,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-06 00:41:45,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-06 00:41:45,130 INFO L87 Difference]: Start difference. First operand 2114 states and 8042 transitions. Second operand 6 states. [2020-10-06 00:41:45,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:41:45,236 INFO L93 Difference]: Finished difference Result 2346 states and 8944 transitions. [2020-10-06 00:41:45,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-06 00:41:45,237 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2020-10-06 00:41:45,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:41:45,261 INFO L225 Difference]: With dead ends: 2346 [2020-10-06 00:41:45,261 INFO L226 Difference]: Without dead ends: 2346 [2020-10-06 00:41:45,262 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-06 00:41:45,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2346 states. [2020-10-06 00:41:45,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2346 to 1962. [2020-10-06 00:41:45,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1962 states. [2020-10-06 00:41:45,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1962 states to 1962 states and 7392 transitions. [2020-10-06 00:41:45,418 INFO L78 Accepts]: Start accepts. Automaton has 1962 states and 7392 transitions. Word has length 12 [2020-10-06 00:41:45,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:41:45,418 INFO L479 AbstractCegarLoop]: Abstraction has 1962 states and 7392 transitions. [2020-10-06 00:41:45,419 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-06 00:41:45,419 INFO L276 IsEmpty]: Start isEmpty. Operand 1962 states and 7392 transitions. [2020-10-06 00:41:45,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-06 00:41:45,423 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:41:45,423 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:41:45,424 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-06 00:41:45,424 INFO L427 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:41:45,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:41:45,424 INFO L82 PathProgramCache]: Analyzing trace with hash 110610062, now seen corresponding path program 1 times [2020-10-06 00:41:45,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:41:45,426 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092231170] [2020-10-06 00:41:45,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:41:45,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:41:45,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 00:41:45,475 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092231170] [2020-10-06 00:41:45,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:41:45,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-06 00:41:45,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1806804024] [2020-10-06 00:41:45,476 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:41:45,480 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:41:45,484 INFO L258 McrAutomatonBuilder]: Finished intersection with 17 states and 19 transitions. [2020-10-06 00:41:45,484 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:41:45,515 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 00:41:45,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-06 00:41:45,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:41:45,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-06 00:41:45,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-06 00:41:45,517 INFO L87 Difference]: Start difference. First operand 1962 states and 7392 transitions. Second operand 3 states. [2020-10-06 00:41:45,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:41:45,551 INFO L93 Difference]: Finished difference Result 1930 states and 7248 transitions. [2020-10-06 00:41:45,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-06 00:41:45,552 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-10-06 00:41:45,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:41:45,569 INFO L225 Difference]: With dead ends: 1930 [2020-10-06 00:41:45,569 INFO L226 Difference]: Without dead ends: 1930 [2020-10-06 00:41:45,570 INFO L675 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-10-06 00:41:45,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1930 states. [2020-10-06 00:41:45,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1930 to 1930. [2020-10-06 00:41:45,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1930 states. [2020-10-06 00:41:45,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1930 states to 1930 states and 7248 transitions. [2020-10-06 00:41:45,659 INFO L78 Accepts]: Start accepts. Automaton has 1930 states and 7248 transitions. Word has length 13 [2020-10-06 00:41:45,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:41:45,659 INFO L479 AbstractCegarLoop]: Abstraction has 1930 states and 7248 transitions. [2020-10-06 00:41:45,660 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-06 00:41:45,660 INFO L276 IsEmpty]: Start isEmpty. Operand 1930 states and 7248 transitions. [2020-10-06 00:41:45,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-06 00:41:45,663 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:41:45,663 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:41:45,663 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-06 00:41:45,664 INFO L427 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:41:45,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:41:45,664 INFO L82 PathProgramCache]: Analyzing trace with hash -866056128, now seen corresponding path program 1 times [2020-10-06 00:41:45,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:41:45,666 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57732180] [2020-10-06 00:41:45,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:41:45,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:41:45,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 00:41:45,872 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57732180] [2020-10-06 00:41:45,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:41:45,872 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-06 00:41:45,873 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [520522872] [2020-10-06 00:41:45,873 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:41:45,876 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:41:45,881 INFO L258 McrAutomatonBuilder]: Finished intersection with 27 states and 41 transitions. [2020-10-06 00:41:45,882 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:41:45,895 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-10-06 00:41:45,895 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:45,896 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-06 00:41:45,897 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:45,898 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:45,904 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:41:45,909 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:45,912 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:45,932 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:41:45,939 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:45,940 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:45,972 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-10-06 00:41:45,973 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:45,974 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-06 00:41:45,974 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:45,975 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:41:45,980 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:45,982 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:45,986 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:45,997 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:41:46,005 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-06 00:41:46,007 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:46,009 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:46,017 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:46,018 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:46,028 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:46,088 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-10-06 00:41:46,088 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:46,089 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-06 00:41:46,089 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:46,091 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:46,095 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:46,097 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:41:46,104 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:46,109 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:46,112 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:41:46,118 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:41:46,123 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:46,145 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 00:41:46,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-06 00:41:46,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:41:46,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-06 00:41:46,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-06 00:41:46,147 INFO L87 Difference]: Start difference. First operand 1930 states and 7248 transitions. Second operand 5 states. [2020-10-06 00:41:46,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:41:46,244 INFO L93 Difference]: Finished difference Result 1882 states and 7036 transitions. [2020-10-06 00:41:46,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-06 00:41:46,245 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-10-06 00:41:46,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:41:46,262 INFO L225 Difference]: With dead ends: 1882 [2020-10-06 00:41:46,263 INFO L226 Difference]: Without dead ends: 1882 [2020-10-06 00:41:46,263 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-06 00:41:46,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1882 states. [2020-10-06 00:41:46,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1882 to 1882. [2020-10-06 00:41:46,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1882 states. [2020-10-06 00:41:46,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1882 states to 1882 states and 7036 transitions. [2020-10-06 00:41:46,343 INFO L78 Accepts]: Start accepts. Automaton has 1882 states and 7036 transitions. Word has length 14 [2020-10-06 00:41:46,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:41:46,343 INFO L479 AbstractCegarLoop]: Abstraction has 1882 states and 7036 transitions. [2020-10-06 00:41:46,343 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-06 00:41:46,343 INFO L276 IsEmpty]: Start isEmpty. Operand 1882 states and 7036 transitions. [2020-10-06 00:41:46,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-06 00:41:46,348 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:41:46,348 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:41:46,348 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-06 00:41:46,348 INFO L427 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:41:46,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:41:46,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1077938372, now seen corresponding path program 1 times [2020-10-06 00:41:46,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:41:46,351 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688339228] [2020-10-06 00:41:46,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:41:46,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:41:46,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 00:41:46,437 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688339228] [2020-10-06 00:41:46,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:41:46,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-06 00:41:46,438 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [754749635] [2020-10-06 00:41:46,439 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:41:46,443 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:41:46,451 INFO L258 McrAutomatonBuilder]: Finished intersection with 29 states and 44 transitions. [2020-10-06 00:41:46,451 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:41:46,468 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:41:46,470 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:46,471 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:46,487 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:41:46,501 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 4 conjuncts [2020-10-06 00:41:46,506 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-06 00:41:46,516 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:46,521 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:41:46,546 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:41:46,551 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:46,552 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:46,572 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:41:46,579 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 4 conjuncts [2020-10-06 00:41:46,581 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-06 00:41:46,587 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:46,589 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:41:46,654 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:41:46,660 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:46,661 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:46,668 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:41:46,675 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 4 conjuncts [2020-10-06 00:41:46,683 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:46,684 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:41:46,691 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-06 00:41:46,711 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 00:41:46,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-06 00:41:46,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:41:46,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-06 00:41:46,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-06 00:41:46,713 INFO L87 Difference]: Start difference. First operand 1882 states and 7036 transitions. Second operand 5 states. [2020-10-06 00:41:46,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:41:46,881 INFO L93 Difference]: Finished difference Result 2074 states and 7708 transitions. [2020-10-06 00:41:46,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-06 00:41:46,882 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-10-06 00:41:46,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:41:46,901 INFO L225 Difference]: With dead ends: 2074 [2020-10-06 00:41:46,902 INFO L226 Difference]: Without dead ends: 2074 [2020-10-06 00:41:46,902 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-06 00:41:46,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2074 states. [2020-10-06 00:41:46,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2074 to 1978. [2020-10-06 00:41:46,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1978 states. [2020-10-06 00:41:46,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1978 states to 1978 states and 7356 transitions. [2020-10-06 00:41:46,980 INFO L78 Accepts]: Start accepts. Automaton has 1978 states and 7356 transitions. Word has length 15 [2020-10-06 00:41:46,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:41:46,981 INFO L479 AbstractCegarLoop]: Abstraction has 1978 states and 7356 transitions. [2020-10-06 00:41:46,981 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-06 00:41:46,981 INFO L276 IsEmpty]: Start isEmpty. Operand 1978 states and 7356 transitions. [2020-10-06 00:41:46,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-06 00:41:46,984 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:41:46,984 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:41:46,985 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-06 00:41:46,985 INFO L427 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:41:46,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:41:46,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1079558432, now seen corresponding path program 2 times [2020-10-06 00:41:46,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:41:46,987 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360605921] [2020-10-06 00:41:46,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:41:47,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:41:47,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 00:41:47,086 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360605921] [2020-10-06 00:41:47,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:41:47,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-06 00:41:47,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2031679804] [2020-10-06 00:41:47,087 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:41:47,090 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:41:47,095 INFO L258 McrAutomatonBuilder]: Finished intersection with 33 states and 53 transitions. [2020-10-06 00:41:47,096 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:41:47,105 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-10-06 00:41:47,106 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:47,106 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-06 00:41:47,107 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:47,108 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:47,112 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:47,112 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:47,119 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:41:47,125 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:41:47,132 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:47,135 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:47,239 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [43091#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 1))] [2020-10-06 00:41:47,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-06 00:41:47,240 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:41:47,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-06 00:41:47,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-06 00:41:47,241 INFO L87 Difference]: Start difference. First operand 1978 states and 7356 transitions. Second operand 7 states. [2020-10-06 00:41:47,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:41:47,421 INFO L93 Difference]: Finished difference Result 2074 states and 7660 transitions. [2020-10-06 00:41:47,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-06 00:41:47,422 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-10-06 00:41:47,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:41:47,436 INFO L225 Difference]: With dead ends: 2074 [2020-10-06 00:41:47,436 INFO L226 Difference]: Without dead ends: 2074 [2020-10-06 00:41:47,437 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2020-10-06 00:41:47,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2074 states. [2020-10-06 00:41:47,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2074 to 1946. [2020-10-06 00:41:47,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1946 states. [2020-10-06 00:41:47,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1946 states to 1946 states and 7244 transitions. [2020-10-06 00:41:47,513 INFO L78 Accepts]: Start accepts. Automaton has 1946 states and 7244 transitions. Word has length 15 [2020-10-06 00:41:47,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:41:47,513 INFO L479 AbstractCegarLoop]: Abstraction has 1946 states and 7244 transitions. [2020-10-06 00:41:47,513 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-06 00:41:47,514 INFO L276 IsEmpty]: Start isEmpty. Operand 1946 states and 7244 transitions. [2020-10-06 00:41:47,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-06 00:41:47,517 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:41:47,518 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:41:47,518 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-06 00:41:47,518 INFO L427 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:41:47,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:41:47,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1026156863, now seen corresponding path program 1 times [2020-10-06 00:41:47,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:41:47,520 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347528745] [2020-10-06 00:41:47,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:41:47,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:41:47,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 00:41:47,582 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347528745] [2020-10-06 00:41:47,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:41:47,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-06 00:41:47,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1588725150] [2020-10-06 00:41:47,583 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:41:47,586 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:41:47,592 INFO L258 McrAutomatonBuilder]: Finished intersection with 33 states and 52 transitions. [2020-10-06 00:41:47,592 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:41:47,620 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:47,637 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:47,644 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:47,651 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:47,666 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:47,695 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [49066#(not (= 4 ~__unbuffered_cnt~0))] [2020-10-06 00:41:47,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-06 00:41:47,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:41:47,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-06 00:41:47,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-06 00:41:47,696 INFO L87 Difference]: Start difference. First operand 1946 states and 7244 transitions. Second operand 5 states. [2020-10-06 00:41:47,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:41:47,783 INFO L93 Difference]: Finished difference Result 1509 states and 5027 transitions. [2020-10-06 00:41:47,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-06 00:41:47,784 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-10-06 00:41:47,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:41:47,789 INFO L225 Difference]: With dead ends: 1509 [2020-10-06 00:41:47,789 INFO L226 Difference]: Without dead ends: 997 [2020-10-06 00:41:47,789 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-06 00:41:47,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2020-10-06 00:41:47,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 997. [2020-10-06 00:41:47,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2020-10-06 00:41:47,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 3022 transitions. [2020-10-06 00:41:47,820 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 3022 transitions. Word has length 16 [2020-10-06 00:41:47,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:41:47,821 INFO L479 AbstractCegarLoop]: Abstraction has 997 states and 3022 transitions. [2020-10-06 00:41:47,821 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-06 00:41:47,821 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 3022 transitions. [2020-10-06 00:41:47,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-06 00:41:47,824 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:41:47,824 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:41:47,824 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-06 00:41:47,824 INFO L427 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:41:47,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:41:47,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1553780394, now seen corresponding path program 1 times [2020-10-06 00:41:47,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:41:47,826 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303875547] [2020-10-06 00:41:47,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:41:47,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:41:47,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 00:41:47,868 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303875547] [2020-10-06 00:41:47,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:41:47,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-06 00:41:47,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [95854563] [2020-10-06 00:41:47,869 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:41:47,872 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:41:47,882 INFO L258 McrAutomatonBuilder]: Finished intersection with 44 states and 67 transitions. [2020-10-06 00:41:47,883 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:41:47,932 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 00:41:47,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-06 00:41:47,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:41:47,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-06 00:41:47,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-06 00:41:47,933 INFO L87 Difference]: Start difference. First operand 997 states and 3022 transitions. Second operand 3 states. [2020-10-06 00:41:47,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:41:47,998 INFO L93 Difference]: Finished difference Result 1421 states and 4197 transitions. [2020-10-06 00:41:47,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-06 00:41:47,999 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-10-06 00:41:48,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:41:48,004 INFO L225 Difference]: With dead ends: 1421 [2020-10-06 00:41:48,004 INFO L226 Difference]: Without dead ends: 1011 [2020-10-06 00:41:48,004 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-06 00:41:48,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2020-10-06 00:41:48,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 991. [2020-10-06 00:41:48,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 991 states. [2020-10-06 00:41:48,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 2843 transitions. [2020-10-06 00:41:48,033 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 2843 transitions. Word has length 19 [2020-10-06 00:41:48,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:41:48,033 INFO L479 AbstractCegarLoop]: Abstraction has 991 states and 2843 transitions. [2020-10-06 00:41:48,033 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-06 00:41:48,033 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 2843 transitions. [2020-10-06 00:41:48,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-06 00:41:48,036 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:41:48,036 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:41:48,037 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-06 00:41:48,037 INFO L427 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:41:48,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:41:48,037 INFO L82 PathProgramCache]: Analyzing trace with hash 922551204, now seen corresponding path program 1 times [2020-10-06 00:41:48,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:41:48,039 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029803384] [2020-10-06 00:41:48,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:41:48,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:41:48,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 00:41:48,113 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029803384] [2020-10-06 00:41:48,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:41:48,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-06 00:41:48,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1797618601] [2020-10-06 00:41:48,114 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:41:48,117 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:41:48,136 INFO L258 McrAutomatonBuilder]: Finished intersection with 75 states and 139 transitions. [2020-10-06 00:41:48,136 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:41:48,149 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:48,376 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [55986#(not (= 4 ~__unbuffered_cnt~0)), 55987#(not (= ~__unbuffered_cnt~0 3)), 55988#(not (= ~__unbuffered_cnt~0 2)), 55989#(<= ~__unbuffered_cnt~0 0)] [2020-10-06 00:41:48,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-06 00:41:48,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:41:48,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-06 00:41:48,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2020-10-06 00:41:48,377 INFO L87 Difference]: Start difference. First operand 991 states and 2843 transitions. Second operand 10 states. [2020-10-06 00:41:48,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:41:48,492 INFO L93 Difference]: Finished difference Result 824 states and 2380 transitions. [2020-10-06 00:41:48,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-06 00:41:48,493 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2020-10-06 00:41:48,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:41:48,495 INFO L225 Difference]: With dead ends: 824 [2020-10-06 00:41:48,495 INFO L226 Difference]: Without dead ends: 445 [2020-10-06 00:41:48,496 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 23 SyntacticMatches, 14 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2020-10-06 00:41:48,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2020-10-06 00:41:48,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 429. [2020-10-06 00:41:48,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2020-10-06 00:41:48,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 1203 transitions. [2020-10-06 00:41:48,507 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 1203 transitions. Word has length 20 [2020-10-06 00:41:48,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:41:48,507 INFO L479 AbstractCegarLoop]: Abstraction has 429 states and 1203 transitions. [2020-10-06 00:41:48,507 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-06 00:41:48,507 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 1203 transitions. [2020-10-06 00:41:48,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-06 00:41:48,509 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:41:48,509 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] [2020-10-06 00:41:48,509 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-06 00:41:48,509 INFO L427 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:41:48,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:41:48,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1669399518, now seen corresponding path program 1 times [2020-10-06 00:41:48,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:41:48,511 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424329705] [2020-10-06 00:41:48,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:41:48,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:41:48,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 00:41:48,620 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424329705] [2020-10-06 00:41:48,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:41:48,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-06 00:41:48,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2008992677] [2020-10-06 00:41:48,621 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:41:48,627 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:41:48,716 INFO L258 McrAutomatonBuilder]: Finished intersection with 194 states and 438 transitions. [2020-10-06 00:41:48,717 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:41:48,731 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-06 00:41:48,732 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:48,734 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:48,735 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:48,738 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:48,742 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-06 00:41:48,743 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:48,744 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:48,761 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-06 00:41:48,761 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:48,762 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:48,763 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:48,768 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:48,772 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:41:48,778 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:48,779 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:48,781 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:48,782 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:41:48,787 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:48,789 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:48,790 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:48,795 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:48,833 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-06 00:41:48,834 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:48,835 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:48,836 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:48,842 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:48,847 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-06 00:41:48,847 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:48,848 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:48,864 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-06 00:41:48,865 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:48,866 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:48,868 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:48,871 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:48,875 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-06 00:41:48,876 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:48,877 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:48,891 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-06 00:41:48,892 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:48,893 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:48,893 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:41:48,898 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:48,899 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:48,909 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:48,913 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:48,916 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:48,921 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:48,949 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-06 00:41:48,949 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:48,951 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:48,953 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:41:48,959 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:48,960 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:48,967 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:48,970 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:48,974 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:48,978 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:48,998 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-06 00:41:48,998 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:49,000 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:49,000 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:49,005 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:49,007 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:41:49,013 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:49,014 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:49,015 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:49,020 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:49,024 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:49,025 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:41:49,030 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:49,042 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:49,063 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-06 00:41:49,063 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:49,065 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:49,065 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:49,071 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:49,073 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:41:49,079 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:49,081 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:49,082 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:49,083 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:41:49,186 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:49,187 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:49,192 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:49,212 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-06 00:41:49,212 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:49,214 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:49,216 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:49,217 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:49,222 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-06 00:41:49,223 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:49,224 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:49,240 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-06 00:41:49,240 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:49,241 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:49,243 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:49,248 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:49,252 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-06 00:41:49,253 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:49,254 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:49,271 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-06 00:41:49,271 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:49,272 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:49,273 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:49,276 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:49,282 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-06 00:41:49,282 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:49,283 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:49,294 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-06 00:41:49,295 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:49,296 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:49,297 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:49,297 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:49,305 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-06 00:41:49,305 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:49,306 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:49,444 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-06 00:41:49,444 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:49,445 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:49,447 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:49,447 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:49,452 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-06 00:41:49,453 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:49,454 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:49,654 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [57682#(and (= ~x~0 1) (= ~z$w_buff1~0 0)), 57683#(= ~z$w_buff1~0 0)] [2020-10-06 00:41:49,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-06 00:41:49,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:41:49,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-06 00:41:49,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-06 00:41:49,655 INFO L87 Difference]: Start difference. First operand 429 states and 1203 transitions. Second operand 8 states. [2020-10-06 00:41:49,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:41:49,767 INFO L93 Difference]: Finished difference Result 619 states and 1697 transitions. [2020-10-06 00:41:49,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-06 00:41:49,768 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2020-10-06 00:41:49,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:41:49,769 INFO L225 Difference]: With dead ends: 619 [2020-10-06 00:41:49,770 INFO L226 Difference]: Without dead ends: 241 [2020-10-06 00:41:49,770 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2020-10-06 00:41:49,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2020-10-06 00:41:49,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2020-10-06 00:41:49,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2020-10-06 00:41:49,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 597 transitions. [2020-10-06 00:41:49,776 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 597 transitions. Word has length 26 [2020-10-06 00:41:49,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:41:49,776 INFO L479 AbstractCegarLoop]: Abstraction has 241 states and 597 transitions. [2020-10-06 00:41:49,776 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-06 00:41:49,777 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 597 transitions. [2020-10-06 00:41:49,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-06 00:41:49,778 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:41:49,778 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] [2020-10-06 00:41:49,778 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-06 00:41:49,778 INFO L427 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:41:49,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:41:49,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1064545320, now seen corresponding path program 2 times [2020-10-06 00:41:49,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:41:49,780 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887286306] [2020-10-06 00:41:49,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:41:49,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:41:49,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 00:41:49,856 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887286306] [2020-10-06 00:41:49,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:41:49,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-06 00:41:49,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2114159550] [2020-10-06 00:41:49,857 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:41:49,862 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:41:49,928 INFO L258 McrAutomatonBuilder]: Finished intersection with 174 states and 382 transitions. [2020-10-06 00:41:49,928 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:41:50,304 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 00:41:50,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-06 00:41:50,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:41:50,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-06 00:41:50,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-06 00:41:50,305 INFO L87 Difference]: Start difference. First operand 241 states and 597 transitions. Second operand 4 states. [2020-10-06 00:41:50,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:41:50,323 INFO L93 Difference]: Finished difference Result 318 states and 778 transitions. [2020-10-06 00:41:50,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-06 00:41:50,324 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2020-10-06 00:41:50,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:41:50,325 INFO L225 Difference]: With dead ends: 318 [2020-10-06 00:41:50,325 INFO L226 Difference]: Without dead ends: 92 [2020-10-06 00:41:50,325 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-06 00:41:50,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-10-06 00:41:50,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2020-10-06 00:41:50,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-10-06 00:41:50,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 198 transitions. [2020-10-06 00:41:50,330 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 198 transitions. Word has length 26 [2020-10-06 00:41:50,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:41:50,330 INFO L479 AbstractCegarLoop]: Abstraction has 92 states and 198 transitions. [2020-10-06 00:41:50,330 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-06 00:41:50,331 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 198 transitions. [2020-10-06 00:41:50,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-06 00:41:50,332 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:41:50,333 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] [2020-10-06 00:41:50,333 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-06 00:41:50,333 INFO L427 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:41:50,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:41:50,333 INFO L82 PathProgramCache]: Analyzing trace with hash 741210188, now seen corresponding path program 3 times [2020-10-06 00:41:50,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:41:50,335 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930170561] [2020-10-06 00:41:50,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:41:50,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:41:50,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 00:41:50,597 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930170561] [2020-10-06 00:41:50,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:41:50,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-06 00:41:50,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1610623832] [2020-10-06 00:41:50,599 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:41:50,603 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:41:50,634 INFO L258 McrAutomatonBuilder]: Finished intersection with 78 states and 138 transitions. [2020-10-06 00:41:50,634 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:41:50,644 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-10-06 00:41:50,644 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:50,645 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-06 00:41:50,645 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:50,647 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-06 00:41:50,647 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:50,648 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-06 00:41:50,649 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:50,650 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:50,652 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:50,652 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:50,660 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:50,661 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:50,661 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:50,662 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:50,663 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:50,667 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:41:50,667 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:41:50,668 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:41:50,671 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:50,677 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:41:50,682 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:41:50,688 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:50,691 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:50,698 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:50,703 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:50,704 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:41:50,705 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:41:50,706 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:41:50,706 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:41:50,709 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:41:50,718 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:50,718 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:41:50,719 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-06 00:41:50,734 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts [2020-10-06 00:41:50,734 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts [2020-10-06 00:41:50,735 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-06 00:41:50,746 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:41:50,754 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:50,764 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts [2020-10-06 00:41:50,767 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:41:50,779 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:50,780 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:41:50,781 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:41:50,789 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:41:50,795 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:41:50,796 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:41:50,802 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:41:50,804 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:50,805 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:50,809 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:41:50,809 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:41:50,813 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:50,819 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:50,819 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:50,822 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:50,829 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:50,830 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:41:50,831 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:41:50,840 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:50,842 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:50,847 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:50,853 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:50,854 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:50,857 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:50,865 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:50,867 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:50,872 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:50,873 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:41:50,874 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:41:50,884 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:50,884 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-06 00:41:50,886 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:41:50,888 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:50,889 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:50,892 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:50,896 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:50,902 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:50,902 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:50,905 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:50,928 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-10-06 00:41:50,928 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:50,928 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-06 00:41:50,929 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:50,930 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-06 00:41:50,930 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:50,931 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:50,932 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:50,933 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:50,939 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-06 00:41:50,939 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:50,940 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:50,941 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:50,942 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:50,943 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:50,944 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:50,945 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:50,949 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:41:50,951 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:41:50,955 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:50,958 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:50,960 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:50,967 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:50,971 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:50,972 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:50,973 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:50,974 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:50,977 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:41:50,980 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:41:50,984 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:50,987 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:50,990 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:50,997 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:51,001 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:51,002 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:51,003 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:41:51,004 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 6 conjuncts [2020-10-06 00:41:51,006 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:41:51,015 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:41:51,022 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:51,029 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts [2020-10-06 00:41:51,033 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:41:51,054 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:41:51,071 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 5 conjuncts [2020-10-06 00:41:51,075 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:41:51,086 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:41:51,089 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-06 00:41:51,096 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:51,099 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:51,100 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:41:51,104 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:51,107 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-06 00:41:51,109 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:51,113 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-06 00:41:51,115 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:51,122 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:41:51,126 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:41:51,129 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:51,134 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:41:51,135 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:51,143 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:51,143 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:41:51,144 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:51,146 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:51,148 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:51,152 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:41:51,152 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:51,157 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:41:51,157 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:51,163 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:41:51,166 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:41:51,175 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:41:51,179 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:41:51,180 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:51,184 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:51,185 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:41:51,195 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:51,201 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:51,202 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:51,205 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:51,210 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:51,211 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-06 00:41:51,212 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:41:51,214 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:51,217 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:51,225 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts [2020-10-06 00:41:51,241 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:41:51,252 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:41:51,258 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:41:51,260 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:51,263 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:51,298 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-06 00:41:51,299 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:51,300 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:51,300 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:51,305 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:51,308 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:41:51,316 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:51,318 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:51,319 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:51,323 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:51,329 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:51,330 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:41:51,336 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:51,353 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-10-06 00:41:51,353 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:51,353 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-06 00:41:51,354 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:51,355 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-06 00:41:51,355 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:51,357 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:51,358 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:51,359 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:51,365 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-06 00:41:51,365 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:51,366 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:51,367 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:51,367 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:51,368 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:51,369 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:41:51,373 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:41:51,376 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:41:51,381 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:51,384 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:41:51,385 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:51,394 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:41:51,395 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:51,402 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:51,402 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:41:51,403 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:51,403 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:51,405 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:41:51,408 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:51,412 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:51,420 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:51,421 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:51,421 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:51,425 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:51,431 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:51,433 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:51,433 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:41:51,434 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-06 00:41:51,435 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:51,443 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:41:51,448 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 5 conjuncts [2020-10-06 00:41:51,449 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:51,459 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:41:51,465 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 5 conjuncts [2020-10-06 00:41:51,465 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:51,474 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:41:51,482 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 5 conjuncts [2020-10-06 00:41:51,489 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:51,490 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:41:51,491 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 6 conjuncts [2020-10-06 00:41:51,497 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts [2020-10-06 00:41:51,499 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:41:51,515 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:41:51,526 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:41:51,527 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:51,534 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:41:51,539 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:41:51,540 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:41:51,541 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:51,542 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:51,545 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:51,548 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:51,554 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:51,555 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:51,556 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:51,561 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:41:51,567 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-06 00:41:51,573 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:51,579 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:51,580 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:51,581 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:51,583 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:41:51,586 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:41:51,591 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:51,592 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:51,598 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:51,638 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-06 00:41:51,638 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:51,639 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:51,641 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:51,641 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:51,647 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-06 00:41:51,647 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:51,648 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:51,663 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-06 00:41:51,663 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:51,664 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:51,665 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:51,666 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:51,672 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-06 00:41:51,672 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:51,673 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:51,688 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-06 00:41:51,689 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:51,690 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:51,692 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:51,692 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:51,698 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-06 00:41:51,699 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:51,700 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:51,714 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-06 00:41:51,714 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:51,716 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:51,716 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:51,721 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:51,723 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:41:51,728 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:51,729 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:51,731 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:51,735 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:51,738 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:51,738 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:51,740 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:41:51,745 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:51,754 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 00:41:51,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-06 00:41:51,755 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:41:51,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-06 00:41:51,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-06 00:41:51,756 INFO L87 Difference]: Start difference. First operand 92 states and 198 transitions. Second operand 7 states. [2020-10-06 00:41:51,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:41:51,888 INFO L93 Difference]: Finished difference Result 118 states and 252 transitions. [2020-10-06 00:41:51,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-06 00:41:51,889 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2020-10-06 00:41:51,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:41:51,889 INFO L225 Difference]: With dead ends: 118 [2020-10-06 00:41:51,889 INFO L226 Difference]: Without dead ends: 64 [2020-10-06 00:41:51,890 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2020-10-06 00:41:51,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-10-06 00:41:51,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2020-10-06 00:41:51,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-10-06 00:41:51,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 122 transitions. [2020-10-06 00:41:51,892 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 122 transitions. Word has length 26 [2020-10-06 00:41:51,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:41:51,893 INFO L479 AbstractCegarLoop]: Abstraction has 64 states and 122 transitions. [2020-10-06 00:41:51,893 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-06 00:41:51,893 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 122 transitions. [2020-10-06 00:41:51,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-06 00:41:51,894 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:41:51,894 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] [2020-10-06 00:41:51,894 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-06 00:41:51,894 INFO L427 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:41:51,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:41:51,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1649584844, now seen corresponding path program 4 times [2020-10-06 00:41:51,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:41:51,897 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721168322] [2020-10-06 00:41:51,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:41:51,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-06 00:41:51,939 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-06 00:41:51,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-06 00:41:51,983 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-06 00:41:52,021 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-06 00:41:52,022 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-10-06 00:41:52,022 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-06 00:41:52,023 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-06 00:41:52,095 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [979] [979] L846-->L853: Formula: (let ((.cse7 (= (mod ~z$r_buff1_thd0~0_In705741743 256) 0)) (.cse6 (= (mod ~z$w_buff1_used~0_In705741743 256) 0)) (.cse9 (= (mod ~z$w_buff0_used~0_In705741743 256) 0)) (.cse8 (= (mod ~z$r_buff0_thd0~0_In705741743 256) 0))) (let ((.cse1 (not .cse8)) (.cse2 (not .cse9)) (.cse0 (or .cse8 .cse9)) (.cse4 (not .cse6)) (.cse5 (not .cse7)) (.cse3 (or .cse6 .cse7))) (and (= ~z$r_buff1_thd0~0_Out705741743 ~z$r_buff1_thd0~0_In705741743) (or (and .cse0 (= ~z$w_buff0_used~0_Out705741743 ~z$w_buff0_used~0_In705741743)) (and .cse1 .cse2 (= ~z$w_buff0_used~0_Out705741743 0))) (or (and .cse1 .cse2 (= ~z~0_Out705741743 ~z$w_buff0~0_In705741743)) (and .cse0 (or (and .cse3 (= ~z~0_In705741743 ~z~0_Out705741743)) (and .cse4 .cse5 (= ~z$w_buff1~0_In705741743 ~z~0_Out705741743))))) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out705741743 0)) (or (and (= ~z$w_buff1_used~0_Out705741743 0) .cse4 .cse5) (and .cse3 (= ~z$w_buff1_used~0_Out705741743 ~z$w_buff1_used~0_In705741743))) (= ~z$r_buff0_thd0~0_Out705741743 ~z$r_buff0_thd0~0_In705741743) (= |ULTIMATE.start_assume_abort_if_not_#in~cond_In705741743| ULTIMATE.start_assume_abort_if_not_~cond_Out705741743)))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In705741743|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In705741743, ~z$w_buff0_used~0=~z$w_buff0_used~0_In705741743, ~z$w_buff0~0=~z$w_buff0~0_In705741743, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In705741743, ~z$w_buff1_used~0=~z$w_buff1_used~0_In705741743, ~z$w_buff1~0=~z$w_buff1~0_In705741743, ~z~0=~z~0_In705741743} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_Out705741743, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out705741743|, ~z$w_buff0~0=~z$w_buff0~0_In705741743, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out705741743|, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out705741743, ~z$w_buff1~0=~z$w_buff1~0_In705741743, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out705741743|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out705741743|, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out705741743|, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out705741743|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In705741743|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_Out705741743, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out705741743, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out705741743, ~z~0=~z~0_Out705741743} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond, ~z$w_buff0_used~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ~z~0, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2020-10-06 00:41:52,102 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:41:52,103 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:41:52,105 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:41:52,105 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:41:52,105 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:41:52,106 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:41:52,106 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:41:52,106 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:41:52,106 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:41:52,106 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:41:52,106 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:41:52,107 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:41:52,107 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:41:52,107 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:41:52,107 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:41:52,108 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:41:52,108 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:41:52,108 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:41:52,108 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:41:52,108 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:41:52,109 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:41:52,109 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:41:52,109 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:41:52,109 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:41:52,109 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:41:52,109 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:41:52,110 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:41:52,110 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:41:52,110 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:41:52,111 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:41:52,111 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:41:52,111 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:41:52,111 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:41:52,111 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:41:52,111 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:41:52,112 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:41:52,112 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:41:52,112 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:41:52,112 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:41:52,112 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:41:52,112 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:41:52,113 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:41:52,113 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:41:52,113 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:41:52,113 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:41:52,113 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:41:52,187 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.10 12:41:52 BasicIcfg [2020-10-06 00:41:52,187 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-06 00:41:52,189 INFO L168 Benchmark]: Toolchain (without parser) took 21294.10 ms. Allocated memory was 149.4 MB in the beginning and 485.0 MB in the end (delta: 335.5 MB). Free memory was 104.2 MB in the beginning and 379.8 MB in the end (delta: -275.7 MB). Peak memory consumption was 378.6 MB. Max. memory is 7.1 GB. [2020-10-06 00:41:52,190 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 149.4 MB. Free memory was 124.1 MB in the beginning and 123.9 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-10-06 00:41:52,190 INFO L168 Benchmark]: CACSL2BoogieTranslator took 797.34 ms. Allocated memory was 149.4 MB in the beginning and 205.5 MB in the end (delta: 56.1 MB). Free memory was 103.7 MB in the beginning and 158.3 MB in the end (delta: -54.5 MB). Peak memory consumption was 22.4 MB. Max. memory is 7.1 GB. [2020-10-06 00:41:52,191 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.12 ms. Allocated memory is still 205.5 MB. Free memory was 158.3 MB in the beginning and 155.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. [2020-10-06 00:41:52,192 INFO L168 Benchmark]: Boogie Preprocessor took 45.54 ms. Allocated memory is still 205.5 MB. Free memory was 155.1 MB in the beginning and 152.6 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2020-10-06 00:41:52,192 INFO L168 Benchmark]: RCFGBuilder took 2091.56 ms. Allocated memory was 205.5 MB in the beginning and 244.3 MB in the end (delta: 38.8 MB). Free memory was 152.6 MB in the beginning and 170.9 MB in the end (delta: -18.2 MB). Peak memory consumption was 92.8 MB. Max. memory is 7.1 GB. [2020-10-06 00:41:52,193 INFO L168 Benchmark]: TraceAbstraction took 18278.26 ms. Allocated memory was 244.3 MB in the beginning and 485.0 MB in the end (delta: 240.6 MB). Free memory was 169.3 MB in the beginning and 379.8 MB in the end (delta: -210.6 MB). Peak memory consumption was 348.8 MB. Max. memory is 7.1 GB. [2020-10-06 00:41:52,196 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 149.4 MB. Free memory was 124.1 MB in the beginning and 123.9 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 797.34 ms. Allocated memory was 149.4 MB in the beginning and 205.5 MB in the end (delta: 56.1 MB). Free memory was 103.7 MB in the beginning and 158.3 MB in the end (delta: -54.5 MB). Peak memory consumption was 22.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 75.12 ms. Allocated memory is still 205.5 MB. Free memory was 158.3 MB in the beginning and 155.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 45.54 ms. Allocated memory is still 205.5 MB. Free memory was 155.1 MB in the beginning and 152.6 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2091.56 ms. Allocated memory was 205.5 MB in the beginning and 244.3 MB in the end (delta: 38.8 MB). Free memory was 152.6 MB in the beginning and 170.9 MB in the end (delta: -18.2 MB). Peak memory consumption was 92.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 18278.26 ms. Allocated memory was 244.3 MB in the beginning and 485.0 MB in the end (delta: 240.6 MB). Free memory was 169.3 MB in the beginning and 379.8 MB in the end (delta: -210.6 MB). Peak memory consumption was 348.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 9.4s, 123 ProgramPointsBefore, 45 ProgramPointsAfterwards, 112 TransitionsBefore, 32 TransitionsAfterwards, 2540 CoEnabledTransitionPairs, 8 FixpointIterations, 37 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 2 ChoiceCompositions, 1334 VarBasedMoverChecksPositive, 46 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 6492 CheckedPairsTotal, 90 TotalNumberOfCompositions - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L699] 0 int __unbuffered_cnt = 0; [L701] 0 int __unbuffered_p0_EAX = 0; [L703] 0 int __unbuffered_p3_EAX = 0; [L705] 0 int __unbuffered_p3_EBX = 0; [L707] 0 int a = 0; [L709] 0 int b = 0; [L710] 0 _Bool main$tmp_guard0; [L711] 0 _Bool main$tmp_guard1; [L713] 0 int x = 0; [L715] 0 int y = 0; [L717] 0 int z = 0; [L718] 0 _Bool z$flush_delayed; [L719] 0 int z$mem_tmp; [L720] 0 _Bool z$r_buff0_thd0; [L721] 0 _Bool z$r_buff0_thd1; [L722] 0 _Bool z$r_buff0_thd2; [L723] 0 _Bool z$r_buff0_thd3; [L724] 0 _Bool z$r_buff0_thd4; [L725] 0 _Bool z$r_buff1_thd0; [L726] 0 _Bool z$r_buff1_thd1; [L727] 0 _Bool z$r_buff1_thd2; [L728] 0 _Bool z$r_buff1_thd3; [L729] 0 _Bool z$r_buff1_thd4; [L730] 0 _Bool z$read_delayed; [L731] 0 int *z$read_delayed_var; [L732] 0 int z$w_buff0; [L733] 0 _Bool z$w_buff0_used; [L734] 0 int z$w_buff1; [L735] 0 _Bool z$w_buff1_used; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L835] 0 pthread_t t1221; [L836] FCALL, FORK 0 pthread_create(&t1221, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L837] 0 pthread_t t1222; [L838] FCALL, FORK 0 pthread_create(&t1222, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L839] 0 pthread_t t1223; [L840] FCALL, FORK 0 pthread_create(&t1223, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L841] 0 pthread_t t1224; [L842] FCALL, FORK 0 pthread_create(&t1224, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L791] 4 z$w_buff1 = z$w_buff0 [L792] 4 z$w_buff0 = 2 [L793] 4 z$w_buff1_used = z$w_buff0_used [L794] 4 z$w_buff0_used = (_Bool)1 [L7] COND FALSE 4 !(!expression) [L796] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L797] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L798] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L799] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L800] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L801] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L804] 4 a = 1 [L807] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L810] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L741] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L749] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L751] 1 return 0; [L759] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L766] 2 return 0; [L771] 3 y = 2 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L774] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L777] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L777] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L777] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L778] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L778] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L779] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L779] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L780] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L780] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L781] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L781] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L784] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L786] 3 return 0; [L813] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L813] EXPR 4 z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z [L813] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L813] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L814] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L814] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L815] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L815] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L816] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L816] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L817] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L817] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L820] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 4 return 0; [L844] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L855] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L856] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L857] 0 z$flush_delayed = weak$$choice2 [L858] 0 z$mem_tmp = z [L859] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L859] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L860] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L860] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L861] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L861] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1) [L861] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L861] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L862] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L862] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L863] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L863] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L864] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L864] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L864] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L865] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L866] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L867] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L867] 0 z = z$flush_delayed ? z$mem_tmp : z [L868] 0 z$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=0, x=1, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 111 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 17.9s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.6s, HoareTripleCheckerStatistics: 412 SDtfs, 520 SDslu, 704 SDs, 0 SdLazy, 307 SolverSat, 93 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 421 GetRequests, 340 SyntacticMatches, 22 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3002occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 13 MinimizatonAttempts, 644 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 248 NumberOfCodeBlocks, 248 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 209 ConstructedInterpolants, 0 QuantifiedInterpolants, 22730 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...