/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix054_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7a177ad [2020-11-09 15:25:15,777 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-09 15:25:15,782 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-09 15:25:15,843 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-09 15:25:15,843 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-09 15:25:15,848 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-09 15:25:15,854 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-09 15:25:15,864 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-09 15:25:15,867 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-09 15:25:15,881 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-09 15:25:15,887 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-09 15:25:15,888 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-09 15:25:15,888 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-09 15:25:15,892 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-09 15:25:15,894 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-09 15:25:15,896 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-09 15:25:15,897 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-09 15:25:15,900 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-09 15:25:15,913 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-09 15:25:15,921 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-09 15:25:15,923 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-09 15:25:15,930 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-09 15:25:15,935 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-09 15:25:15,936 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-09 15:25:15,944 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-09 15:25:15,944 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-09 15:25:15,945 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-09 15:25:15,947 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-09 15:25:15,947 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-09 15:25:15,948 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-09 15:25:15,949 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-09 15:25:15,950 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-09 15:25:15,952 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-09 15:25:15,953 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-09 15:25:15,954 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-09 15:25:15,954 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-09 15:25:15,955 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-09 15:25:15,955 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-09 15:25:15,956 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-09 15:25:15,957 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-09 15:25:15,957 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-09 15:25:15,958 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-11-09 15:25:16,013 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-09 15:25:16,013 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-09 15:25:16,018 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-09 15:25:16,018 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-09 15:25:16,019 INFO L138 SettingsManager]: * Use SBE=true [2020-11-09 15:25:16,019 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-09 15:25:16,019 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-09 15:25:16,019 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-09 15:25:16,019 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-09 15:25:16,020 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-09 15:25:16,021 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-09 15:25:16,021 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-09 15:25:16,021 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-09 15:25:16,021 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-09 15:25:16,022 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-09 15:25:16,022 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-09 15:25:16,022 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-09 15:25:16,022 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-09 15:25:16,022 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-09 15:25:16,023 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-09 15:25:16,023 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-09 15:25:16,023 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-09 15:25:16,023 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-09 15:25:16,024 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-11-09 15:25:16,024 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-09 15:25:16,024 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-09 15:25:16,024 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-09 15:25:16,024 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-11-09 15:25:16,024 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-11-09 15:25:16,025 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-09 15:25:16,025 INFO L138 SettingsManager]: * Interpolant automaton=MCR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-11-09 15:25:16,498 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-09 15:25:16,531 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-09 15:25:16,534 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-09 15:25:16,536 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-09 15:25:16,537 INFO L275 PluginConnector]: CDTParser initialized [2020-11-09 15:25:16,538 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix054_pso.opt.i [2020-11-09 15:25:16,616 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74b136485/0f882cec1daf4c93be1ce5720018619f/FLAG10bb309cb [2020-11-09 15:25:17,338 INFO L306 CDTParser]: Found 1 translation units. [2020-11-09 15:25:17,339 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix054_pso.opt.i [2020-11-09 15:25:17,369 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74b136485/0f882cec1daf4c93be1ce5720018619f/FLAG10bb309cb [2020-11-09 15:25:17,544 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74b136485/0f882cec1daf4c93be1ce5720018619f [2020-11-09 15:25:17,550 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-09 15:25:17,558 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-11-09 15:25:17,563 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-09 15:25:17,563 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-09 15:25:17,568 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-09 15:25:17,569 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:25:17" (1/1) ... [2020-11-09 15:25:17,579 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10873ea4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:25:17, skipping insertion in model container [2020-11-09 15:25:17,579 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:25:17" (1/1) ... [2020-11-09 15:25:17,589 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-09 15:25:17,675 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-09 15:25:18,294 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-09 15:25:18,304 INFO L203 MainTranslator]: Completed pre-run [2020-11-09 15:25:18,417 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-09 15:25:18,526 INFO L208 MainTranslator]: Completed translation [2020-11-09 15:25:18,526 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:25:18 WrapperNode [2020-11-09 15:25:18,526 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-09 15:25:18,529 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-09 15:25:18,529 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-09 15:25:18,529 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-09 15:25:18,539 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:25:18" (1/1) ... [2020-11-09 15:25:18,588 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:25:18" (1/1) ... [2020-11-09 15:25:18,641 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-09 15:25:18,645 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-09 15:25:18,645 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-09 15:25:18,645 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-09 15:25:18,657 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:25:18" (1/1) ... [2020-11-09 15:25:18,657 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:25:18" (1/1) ... [2020-11-09 15:25:18,671 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:25:18" (1/1) ... [2020-11-09 15:25:18,672 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:25:18" (1/1) ... [2020-11-09 15:25:18,695 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:25:18" (1/1) ... [2020-11-09 15:25:18,701 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:25:18" (1/1) ... [2020-11-09 15:25:18,709 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:25:18" (1/1) ... [2020-11-09 15:25:18,717 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-09 15:25:18,718 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-09 15:25:18,718 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-09 15:25:18,719 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-09 15:25:18,726 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:25:18" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-09 15:25:18,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-09 15:25:18,811 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-09 15:25:18,811 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-09 15:25:18,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-09 15:25:18,812 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-11-09 15:25:18,812 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-11-09 15:25:18,812 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-11-09 15:25:18,812 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-11-09 15:25:18,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-09 15:25:18,812 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-09 15:25:18,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-09 15:25:18,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-09 15:25:18,815 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-11-09 15:25:20,711 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-09 15:25:20,711 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-11-09 15:25:20,713 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:25:20 BoogieIcfgContainer [2020-11-09 15:25:20,713 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-09 15:25:20,715 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-09 15:25:20,715 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-09 15:25:20,719 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-09 15:25:20,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 03:25:17" (1/3) ... [2020-11-09 15:25:20,720 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@251268e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 03:25:20, skipping insertion in model container [2020-11-09 15:25:20,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:25:18" (2/3) ... [2020-11-09 15:25:20,720 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@251268e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 03:25:20, skipping insertion in model container [2020-11-09 15:25:20,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:25:20" (3/3) ... [2020-11-09 15:25:20,722 INFO L111 eAbstractionObserver]: Analyzing ICFG mix054_pso.opt.i [2020-11-09 15:25:20,738 WARN L168 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-09 15:25:20,738 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-09 15:25:20,742 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-09 15:25:20,743 INFO L351 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-09 15:25:20,774 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:20,775 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:20,775 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:20,775 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:20,775 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:20,775 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:20,775 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:20,776 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:20,776 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:20,776 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:20,776 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:20,776 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:20,776 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:20,777 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:20,777 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:20,777 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:20,777 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:20,777 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:20,778 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:20,778 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:20,778 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:20,778 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:20,779 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:20,779 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:20,779 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:20,779 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:20,780 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:20,780 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:20,780 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:20,780 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:20,780 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:20,781 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:20,781 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:20,781 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:20,781 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:20,781 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:20,781 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:20,782 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:20,782 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:20,782 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:20,782 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:20,782 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:20,783 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:20,783 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:20,783 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:20,783 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:20,783 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:20,783 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:20,784 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:20,784 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:20,784 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:20,784 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:20,784 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:20,784 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:20,785 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:20,785 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:20,785 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:20,785 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:20,785 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:20,786 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:20,786 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:20,786 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:20,786 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:20,786 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:20,787 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:20,787 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:20,787 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:20,787 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:20,788 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:20,788 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:20,788 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:20,788 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:20,790 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:20,791 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:20,791 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:20,791 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:20,791 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:20,791 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:20,792 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:20,792 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:20,792 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:20,792 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:20,796 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:20,797 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:20,797 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:20,797 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:20,797 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:20,797 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:20,798 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:20,798 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:20,798 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:20,798 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:20,798 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:20,798 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:20,799 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:20,799 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:25:20,800 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-09 15:25:20,813 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-11-09 15:25:20,835 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-09 15:25:20,835 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-09 15:25:20,836 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-11-09 15:25:20,836 INFO L380 AbstractCegarLoop]: Backedges is MCR [2020-11-09 15:25:20,836 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-09 15:25:20,836 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-09 15:25:20,836 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-09 15:25:20,836 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-09 15:25:20,849 INFO L128 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-11-09 15:25:20,849 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 88 places, 84 transitions, 178 flow [2020-11-09 15:25:20,853 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 84 transitions, 178 flow [2020-11-09 15:25:20,855 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 88 places, 84 transitions, 178 flow [2020-11-09 15:25:20,899 INFO L129 PetriNetUnfolder]: 3/82 cut-off events. [2020-11-09 15:25:20,900 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-11-09 15:25:20,903 INFO L84 FinitePrefix]: Finished finitePrefix Result has 89 conditions, 82 events. 3/82 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 59 event pairs, 0 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 50. Up to 2 conditions per place. [2020-11-09 15:25:20,906 INFO L116 LiptonReduction]: Number of co-enabled transitions 1038 [2020-11-09 15:25:21,902 WARN L194 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2020-11-09 15:25:23,359 WARN L194 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2020-11-09 15:25:23,531 WARN L194 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2020-11-09 15:25:23,864 WARN L194 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-11-09 15:25:23,980 WARN L194 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-11-09 15:25:24,522 WARN L194 SmtUtils]: Spent 539.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 83 [2020-11-09 15:25:24,537 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 3, 2, 1] term [2020-11-09 15:25:24,538 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:25:24,959 WARN L194 SmtUtils]: Spent 413.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 85 [2020-11-09 15:25:27,327 WARN L194 SmtUtils]: Spent 1.88 s on a formula simplification. DAG size of input: 230 DAG size of output: 189 [2020-11-09 15:25:27,365 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 1] term [2020-11-09 15:25:27,365 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:25:27,367 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-11-09 15:25:27,368 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:25:28,479 WARN L194 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 144 DAG size of output: 115 [2020-11-09 15:25:31,070 WARN L194 SmtUtils]: Spent 2.59 s on a formula simplification. DAG size of input: 314 DAG size of output: 270 [2020-11-09 15:25:31,076 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 2, 1] term [2020-11-09 15:25:31,077 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:25:31,091 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 2, 1] term [2020-11-09 15:25:31,091 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:25:31,092 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 15:25:31,093 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:25:31,096 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 3, 2, 2, 1] term [2020-11-09 15:25:31,096 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:25:31,109 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:25:31,111 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:25:31,112 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:25:31,113 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 2, 1] term [2020-11-09 15:25:31,114 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:25:31,115 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 1] term [2020-11-09 15:25:31,115 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:25:31,134 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:25:31,137 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 15:25:31,139 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:25:31,141 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:25:31,147 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:25:31,155 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 1] term [2020-11-09 15:25:31,155 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:25:31,159 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 2, 1] term [2020-11-09 15:25:31,159 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:25:31,161 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 2, 1] term [2020-11-09 15:25:31,161 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:25:31,163 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 15:25:31,163 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:25:31,169 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 2, 1] term [2020-11-09 15:25:31,169 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:25:31,174 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 2, 1] term [2020-11-09 15:25:31,175 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:25:31,176 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 15:25:31,176 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:25:31,181 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 1] term [2020-11-09 15:25:31,182 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:25:31,186 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 1] term [2020-11-09 15:25:31,187 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:25:31,187 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 15:25:31,188 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:25:31,192 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 1] term [2020-11-09 15:25:31,192 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:25:35,135 WARN L194 SmtUtils]: Spent 3.93 s on a formula simplification. DAG size of input: 367 DAG size of output: 260 [2020-11-09 15:25:36,522 WARN L194 SmtUtils]: Spent 1.36 s on a formula simplification. DAG size of input: 227 DAG size of output: 186 [2020-11-09 15:25:36,541 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 1] term [2020-11-09 15:25:36,541 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:25:36,543 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-11-09 15:25:36,543 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:25:37,406 WARN L194 SmtUtils]: Spent 832.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 105 [2020-11-09 15:25:40,246 WARN L194 SmtUtils]: Spent 2.84 s on a formula simplification. DAG size of input: 311 DAG size of output: 266 [2020-11-09 15:25:40,250 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 3, 2, 1] term [2020-11-09 15:25:40,251 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:25:40,256 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:25:40,258 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-09 15:25:40,260 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 15:25:40,262 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 15:25:40,263 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:25:40,264 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:25:40,271 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:25:40,272 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:25:40,273 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:25:40,277 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 1] term [2020-11-09 15:25:40,278 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:25:40,284 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 1] term [2020-11-09 15:25:40,284 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:25:40,286 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 15:25:40,286 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:25:40,288 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 1] term [2020-11-09 15:25:40,289 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:25:40,296 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 1] term [2020-11-09 15:25:40,296 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:25:40,297 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 15:25:40,298 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:25:40,300 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 1] term [2020-11-09 15:25:40,301 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:25:40,302 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 1] term [2020-11-09 15:25:40,303 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:25:40,303 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 15:25:40,304 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:25:40,307 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 1] term [2020-11-09 15:25:40,307 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:25:40,310 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 1] term [2020-11-09 15:25:40,311 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:25:40,324 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 1] term [2020-11-09 15:25:40,325 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:25:40,326 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 15:25:40,326 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:25:40,328 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 1] term [2020-11-09 15:25:40,328 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:25:44,020 WARN L194 SmtUtils]: Spent 3.68 s on a formula simplification. DAG size of input: 347 DAG size of output: 232 [2020-11-09 15:25:44,693 WARN L194 SmtUtils]: Spent 366.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2020-11-09 15:25:45,080 WARN L194 SmtUtils]: Spent 385.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2020-11-09 15:25:46,276 WARN L194 SmtUtils]: Spent 1.19 s on a formula simplification that was a NOOP. DAG size: 252 [2020-11-09 15:25:47,453 WARN L194 SmtUtils]: Spent 1.17 s on a formula simplification that was a NOOP. DAG size: 252 [2020-11-09 15:25:47,677 WARN L194 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-11-09 15:25:47,863 WARN L194 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-11-09 15:25:48,047 WARN L194 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-11-09 15:25:48,241 WARN L194 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-11-09 15:25:48,814 WARN L194 SmtUtils]: Spent 529.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 106 [2020-11-09 15:25:49,060 WARN L194 SmtUtils]: Spent 242.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2020-11-09 15:25:49,545 WARN L194 SmtUtils]: Spent 481.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 106 [2020-11-09 15:25:49,770 WARN L194 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2020-11-09 15:25:49,775 INFO L131 LiptonReduction]: Checked pairs total: 2926 [2020-11-09 15:25:49,775 INFO L133 LiptonReduction]: Total number of compositions: 85 [2020-11-09 15:25:49,788 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 26 places, 19 transitions, 48 flow [2020-11-09 15:25:49,817 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 162 states. [2020-11-09 15:25:49,820 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states. [2020-11-09 15:25:49,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-11-09 15:25:49,827 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:25:49,827 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-11-09 15:25:49,828 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:25:49,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:25:49,838 INFO L82 PathProgramCache]: Analyzing trace with hash 916373333, now seen corresponding path program 1 times [2020-11-09 15:25:49,860 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:25:49,861 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118090873] [2020-11-09 15:25:49,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:25:50,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:25:50,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:25:50,209 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118090873] [2020-11-09 15:25:50,210 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:25:50,210 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-09 15:25:50,211 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [266171923] [2020-11-09 15:25:50,213 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:25:50,218 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:25:50,233 INFO L252 McrAutomatonBuilder]: Finished intersection with 6 states and 5 transitions. [2020-11-09 15:25:50,233 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:25:50,239 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:25:50,239 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 15:25:50,240 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:25:50,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 15:25:50,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 15:25:50,262 INFO L87 Difference]: Start difference. First operand 162 states. Second operand 3 states. [2020-11-09 15:25:50,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:25:50,356 INFO L93 Difference]: Finished difference Result 137 states and 320 transitions. [2020-11-09 15:25:50,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 15:25:50,360 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-11-09 15:25:50,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:25:50,371 INFO L225 Difference]: With dead ends: 137 [2020-11-09 15:25:50,371 INFO L226 Difference]: Without dead ends: 112 [2020-11-09 15:25:50,373 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 15:25:50,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-11-09 15:25:50,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2020-11-09 15:25:50,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-11-09 15:25:50,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 255 transitions. [2020-11-09 15:25:50,425 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 255 transitions. Word has length 5 [2020-11-09 15:25:50,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:25:50,426 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 255 transitions. [2020-11-09 15:25:50,426 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 15:25:50,426 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 255 transitions. [2020-11-09 15:25:50,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-11-09 15:25:50,427 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:25:50,427 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:25:50,427 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-09 15:25:50,427 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:25:50,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:25:50,428 INFO L82 PathProgramCache]: Analyzing trace with hash 166530678, now seen corresponding path program 1 times [2020-11-09 15:25:50,434 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:25:50,434 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938830552] [2020-11-09 15:25:50,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:25:50,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:25:50,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:25:50,694 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938830552] [2020-11-09 15:25:50,694 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:25:50,695 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-09 15:25:50,695 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2086162247] [2020-11-09 15:25:50,695 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:25:50,697 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:25:50,699 INFO L252 McrAutomatonBuilder]: Finished intersection with 8 states and 7 transitions. [2020-11-09 15:25:50,700 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:25:50,700 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:25:50,701 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-09 15:25:50,701 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:25:50,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-09 15:25:50,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-09 15:25:50,703 INFO L87 Difference]: Start difference. First operand 112 states and 255 transitions. Second operand 4 states. [2020-11-09 15:25:50,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:25:50,770 INFO L93 Difference]: Finished difference Result 110 states and 249 transitions. [2020-11-09 15:25:50,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 15:25:50,772 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-11-09 15:25:50,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:25:50,774 INFO L225 Difference]: With dead ends: 110 [2020-11-09 15:25:50,774 INFO L226 Difference]: Without dead ends: 110 [2020-11-09 15:25:50,775 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-09 15:25:50,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2020-11-09 15:25:50,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2020-11-09 15:25:50,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-11-09 15:25:50,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 249 transitions. [2020-11-09 15:25:50,788 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 249 transitions. Word has length 7 [2020-11-09 15:25:50,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:25:50,789 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 249 transitions. [2020-11-09 15:25:50,789 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-09 15:25:50,789 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 249 transitions. [2020-11-09 15:25:50,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-11-09 15:25:50,790 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:25:50,790 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:25:50,790 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-09 15:25:50,790 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:25:50,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:25:50,791 INFO L82 PathProgramCache]: Analyzing trace with hash 867482972, now seen corresponding path program 1 times [2020-11-09 15:25:50,793 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:25:50,793 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690780248] [2020-11-09 15:25:50,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:25:50,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:25:50,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:25:50,966 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690780248] [2020-11-09 15:25:50,966 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:25:50,966 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 15:25:50,966 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1911151174] [2020-11-09 15:25:50,966 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:25:50,968 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:25:50,970 INFO L252 McrAutomatonBuilder]: Finished intersection with 9 states and 8 transitions. [2020-11-09 15:25:50,970 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:25:50,971 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:25:50,971 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-09 15:25:50,971 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:25:50,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-09 15:25:50,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-09 15:25:50,972 INFO L87 Difference]: Start difference. First operand 110 states and 249 transitions. Second operand 5 states. [2020-11-09 15:25:51,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:25:51,060 INFO L93 Difference]: Finished difference Result 106 states and 237 transitions. [2020-11-09 15:25:51,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-09 15:25:51,062 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2020-11-09 15:25:51,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:25:51,063 INFO L225 Difference]: With dead ends: 106 [2020-11-09 15:25:51,063 INFO L226 Difference]: Without dead ends: 106 [2020-11-09 15:25:51,064 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-11-09 15:25:51,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2020-11-09 15:25:51,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2020-11-09 15:25:51,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-11-09 15:25:51,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 237 transitions. [2020-11-09 15:25:51,077 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 237 transitions. Word has length 8 [2020-11-09 15:25:51,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:25:51,077 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 237 transitions. [2020-11-09 15:25:51,077 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-09 15:25:51,077 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 237 transitions. [2020-11-09 15:25:51,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-09 15:25:51,082 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:25:51,082 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:25:51,082 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-09 15:25:51,082 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:25:51,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:25:51,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1731741799, now seen corresponding path program 1 times [2020-11-09 15:25:51,092 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:25:51,093 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408901357] [2020-11-09 15:25:51,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:25:51,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:25:51,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:25:51,233 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408901357] [2020-11-09 15:25:51,233 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:25:51,233 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 15:25:51,233 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1130056014] [2020-11-09 15:25:51,234 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:25:51,235 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:25:51,237 INFO L252 McrAutomatonBuilder]: Finished intersection with 16 states and 21 transitions. [2020-11-09 15:25:51,237 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:25:51,272 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:25:51,272 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-09 15:25:51,272 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:25:51,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-09 15:25:51,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-09 15:25:51,273 INFO L87 Difference]: Start difference. First operand 106 states and 237 transitions. Second operand 5 states. [2020-11-09 15:25:51,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:25:51,339 INFO L93 Difference]: Finished difference Result 104 states and 231 transitions. [2020-11-09 15:25:51,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-09 15:25:51,341 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-11-09 15:25:51,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:25:51,343 INFO L225 Difference]: With dead ends: 104 [2020-11-09 15:25:51,343 INFO L226 Difference]: Without dead ends: 104 [2020-11-09 15:25:51,343 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-09 15:25:51,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2020-11-09 15:25:51,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2020-11-09 15:25:51,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-11-09 15:25:51,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 229 transitions. [2020-11-09 15:25:51,353 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 229 transitions. Word has length 9 [2020-11-09 15:25:51,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:25:51,354 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 229 transitions. [2020-11-09 15:25:51,354 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-09 15:25:51,354 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 229 transitions. [2020-11-09 15:25:51,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-09 15:25:51,355 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:25:51,355 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:25:51,356 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-09 15:25:51,356 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:25:51,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:25:51,357 INFO L82 PathProgramCache]: Analyzing trace with hash 2144387467, now seen corresponding path program 1 times [2020-11-09 15:25:51,361 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:25:51,361 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017722315] [2020-11-09 15:25:51,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:25:51,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:25:51,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-11-09 15:25:51,598 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017722315] [2020-11-09 15:25:51,599 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:25:51,599 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-09 15:25:51,599 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [7872192] [2020-11-09 15:25:51,599 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:25:51,602 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:25:51,604 INFO L252 McrAutomatonBuilder]: Finished intersection with 17 states and 22 transitions. [2020-11-09 15:25:51,605 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:25:51,631 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:25:51,631 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-09 15:25:51,632 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:25:51,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-09 15:25:51,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-11-09 15:25:51,633 INFO L87 Difference]: Start difference. First operand 103 states and 229 transitions. Second operand 6 states. [2020-11-09 15:25:51,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:25:51,737 INFO L93 Difference]: Finished difference Result 121 states and 271 transitions. [2020-11-09 15:25:51,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-09 15:25:51,740 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2020-11-09 15:25:51,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:25:51,741 INFO L225 Difference]: With dead ends: 121 [2020-11-09 15:25:51,741 INFO L226 Difference]: Without dead ends: 121 [2020-11-09 15:25:51,742 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-11-09 15:25:51,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2020-11-09 15:25:51,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2020-11-09 15:25:51,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2020-11-09 15:25:51,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 271 transitions. [2020-11-09 15:25:51,767 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 271 transitions. Word has length 10 [2020-11-09 15:25:51,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:25:51,767 INFO L481 AbstractCegarLoop]: Abstraction has 121 states and 271 transitions. [2020-11-09 15:25:51,767 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-09 15:25:51,767 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 271 transitions. [2020-11-09 15:25:51,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-09 15:25:51,771 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:25:51,771 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:25:51,771 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-09 15:25:51,771 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:25:51,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:25:51,772 INFO L82 PathProgramCache]: Analyzing trace with hash 61790047, now seen corresponding path program 2 times [2020-11-09 15:25:51,775 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:25:51,776 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110673567] [2020-11-09 15:25:51,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:25:51,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:25:51,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:25:51,901 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110673567] [2020-11-09 15:25:51,901 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:25:51,902 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 15:25:51,902 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1055753998] [2020-11-09 15:25:51,902 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:25:51,904 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:25:51,907 INFO L252 McrAutomatonBuilder]: Finished intersection with 17 states and 22 transitions. [2020-11-09 15:25:51,907 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:25:52,025 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [2127#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0))] [2020-11-09 15:25:52,026 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-09 15:25:52,026 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:25:52,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-09 15:25:52,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-11-09 15:25:52,027 INFO L87 Difference]: Start difference. First operand 121 states and 271 transitions. Second operand 6 states. [2020-11-09 15:25:52,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:25:52,119 INFO L93 Difference]: Finished difference Result 127 states and 281 transitions. [2020-11-09 15:25:52,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-09 15:25:52,125 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2020-11-09 15:25:52,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:25:52,126 INFO L225 Difference]: With dead ends: 127 [2020-11-09 15:25:52,127 INFO L226 Difference]: Without dead ends: 127 [2020-11-09 15:25:52,127 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-11-09 15:25:52,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2020-11-09 15:25:52,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 119. [2020-11-09 15:25:52,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2020-11-09 15:25:52,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 262 transitions. [2020-11-09 15:25:52,135 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 262 transitions. Word has length 10 [2020-11-09 15:25:52,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:25:52,136 INFO L481 AbstractCegarLoop]: Abstraction has 119 states and 262 transitions. [2020-11-09 15:25:52,136 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-09 15:25:52,136 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 262 transitions. [2020-11-09 15:25:52,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-09 15:25:52,137 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:25:52,137 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:25:52,137 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-09 15:25:52,137 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:25:52,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:25:52,138 INFO L82 PathProgramCache]: Analyzing trace with hash 427426939, now seen corresponding path program 1 times [2020-11-09 15:25:52,144 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:25:52,144 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803948954] [2020-11-09 15:25:52,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:25:52,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:25:52,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:25:52,241 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803948954] [2020-11-09 15:25:52,241 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:25:52,242 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 15:25:52,242 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1378425152] [2020-11-09 15:25:52,242 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:25:52,244 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:25:52,246 INFO L252 McrAutomatonBuilder]: Finished intersection with 11 states and 10 transitions. [2020-11-09 15:25:52,246 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:25:52,247 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:25:52,247 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-09 15:25:52,247 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:25:52,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-09 15:25:52,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-09 15:25:52,248 INFO L87 Difference]: Start difference. First operand 119 states and 262 transitions. Second operand 4 states. [2020-11-09 15:25:52,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:25:52,291 INFO L93 Difference]: Finished difference Result 106 states and 198 transitions. [2020-11-09 15:25:52,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-09 15:25:52,293 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-11-09 15:25:52,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:25:52,294 INFO L225 Difference]: With dead ends: 106 [2020-11-09 15:25:52,294 INFO L226 Difference]: Without dead ends: 75 [2020-11-09 15:25:52,294 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-09 15:25:52,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-11-09 15:25:52,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2020-11-09 15:25:52,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-11-09 15:25:52,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 130 transitions. [2020-11-09 15:25:52,299 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 130 transitions. Word has length 10 [2020-11-09 15:25:52,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:25:52,299 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 130 transitions. [2020-11-09 15:25:52,299 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-09 15:25:52,299 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 130 transitions. [2020-11-09 15:25:52,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-09 15:25:52,300 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:25:52,300 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:25:52,300 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-09 15:25:52,301 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:25:52,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:25:52,301 INFO L82 PathProgramCache]: Analyzing trace with hash 859195324, now seen corresponding path program 1 times [2020-11-09 15:25:52,303 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:25:52,303 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385040854] [2020-11-09 15:25:52,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:25:52,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:25:52,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:25:52,410 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385040854] [2020-11-09 15:25:52,410 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:25:52,410 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-09 15:25:52,410 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1269319458] [2020-11-09 15:25:52,411 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:25:52,412 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:25:52,415 INFO L252 McrAutomatonBuilder]: Finished intersection with 12 states and 11 transitions. [2020-11-09 15:25:52,415 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:25:52,415 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:25:52,415 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-09 15:25:52,416 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:25:52,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-09 15:25:52,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-09 15:25:52,417 INFO L87 Difference]: Start difference. First operand 75 states and 130 transitions. Second operand 5 states. [2020-11-09 15:25:52,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:25:52,476 INFO L93 Difference]: Finished difference Result 58 states and 94 transitions. [2020-11-09 15:25:52,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-09 15:25:52,478 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-11-09 15:25:52,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:25:52,479 INFO L225 Difference]: With dead ends: 58 [2020-11-09 15:25:52,479 INFO L226 Difference]: Without dead ends: 46 [2020-11-09 15:25:52,479 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-09 15:25:52,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-11-09 15:25:52,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 40. [2020-11-09 15:25:52,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-11-09 15:25:52,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 63 transitions. [2020-11-09 15:25:52,482 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 63 transitions. Word has length 11 [2020-11-09 15:25:52,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:25:52,482 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 63 transitions. [2020-11-09 15:25:52,482 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-09 15:25:52,483 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 63 transitions. [2020-11-09 15:25:52,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-09 15:25:52,483 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:25:52,483 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:25:52,483 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-09 15:25:52,484 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:25:52,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:25:52,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1015613484, now seen corresponding path program 1 times [2020-11-09 15:25:52,486 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:25:52,486 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154292404] [2020-11-09 15:25:52,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:25:52,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:25:52,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:25:52,587 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154292404] [2020-11-09 15:25:52,587 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:25:52,587 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 15:25:52,588 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1718095187] [2020-11-09 15:25:52,588 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:25:52,591 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:25:52,599 INFO L252 McrAutomatonBuilder]: Finished intersection with 27 states and 37 transitions. [2020-11-09 15:25:52,599 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:25:52,616 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:25:52,617 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:25:52,618 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:25:52,619 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:25:52,620 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:25:52,623 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:25:52,704 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:25:52,704 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:25:52,707 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:25:52,707 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:25:52,709 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:25:52,710 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:25:52,768 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:25:52,768 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:25:52,769 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:25:52,769 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:25:52,770 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:25:52,771 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:25:52,821 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:25:52,824 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-09 15:25:52,824 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:25:52,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-09 15:25:52,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-09 15:25:52,825 INFO L87 Difference]: Start difference. First operand 40 states and 63 transitions. Second operand 4 states. [2020-11-09 15:25:52,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:25:52,857 INFO L93 Difference]: Finished difference Result 54 states and 82 transitions. [2020-11-09 15:25:52,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-09 15:25:52,858 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-11-09 15:25:52,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:25:52,859 INFO L225 Difference]: With dead ends: 54 [2020-11-09 15:25:52,859 INFO L226 Difference]: Without dead ends: 24 [2020-11-09 15:25:52,860 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-09 15:25:52,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-11-09 15:25:52,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-11-09 15:25:52,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-11-09 15:25:52,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2020-11-09 15:25:52,862 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 15 [2020-11-09 15:25:52,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:25:52,862 INFO L481 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2020-11-09 15:25:52,862 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-09 15:25:52,862 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2020-11-09 15:25:52,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-09 15:25:52,863 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:25:52,863 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:25:52,863 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-09 15:25:52,864 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:25:52,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:25:52,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1062004012, now seen corresponding path program 2 times [2020-11-09 15:25:52,866 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:25:52,866 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744792714] [2020-11-09 15:25:52,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:25:52,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-09 15:25:52,965 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-09 15:25:53,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-09 15:25:53,047 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-09 15:25:53,103 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-09 15:25:53,103 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-09 15:25:53,104 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-09 15:25:53,201 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 03:25:53 BasicIcfg [2020-11-09 15:25:53,201 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-09 15:25:53,203 INFO L168 Benchmark]: Toolchain (without parser) took 35650.48 ms. Allocated memory was 160.4 MB in the beginning and 289.4 MB in the end (delta: 129.0 MB). Free memory was 140.8 MB in the beginning and 205.4 MB in the end (delta: -64.6 MB). Peak memory consumption was 63.8 MB. Max. memory is 8.0 GB. [2020-11-09 15:25:53,204 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 160.4 MB. Free memory was 132.1 MB in the beginning and 132.0 MB in the end (delta: 79.1 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-11-09 15:25:53,204 INFO L168 Benchmark]: CACSL2BoogieTranslator took 964.14 ms. Allocated memory is still 160.4 MB. Free memory was 140.2 MB in the beginning and 120.2 MB in the end (delta: 20.1 MB). Peak memory consumption was 19.4 MB. Max. memory is 8.0 GB. [2020-11-09 15:25:53,205 INFO L168 Benchmark]: Boogie Procedure Inliner took 115.24 ms. Allocated memory is still 160.4 MB. Free memory was 120.2 MB in the beginning and 117.2 MB in the end (delta: 2.9 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2020-11-09 15:25:53,206 INFO L168 Benchmark]: Boogie Preprocessor took 72.65 ms. Allocated memory is still 160.4 MB. Free memory was 117.2 MB in the beginning and 115.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-11-09 15:25:53,207 INFO L168 Benchmark]: RCFGBuilder took 1995.33 ms. Allocated memory was 160.4 MB in the beginning and 192.9 MB in the end (delta: 32.5 MB). Free memory was 115.1 MB in the beginning and 94.5 MB in the end (delta: 20.6 MB). Peak memory consumption was 78.8 MB. Max. memory is 8.0 GB. [2020-11-09 15:25:53,208 INFO L168 Benchmark]: TraceAbstraction took 32485.77 ms. Allocated memory was 192.9 MB in the beginning and 289.4 MB in the end (delta: 96.5 MB). Free memory was 94.0 MB in the beginning and 205.4 MB in the end (delta: -111.5 MB). There was no memory consumed. Max. memory is 8.0 GB. [2020-11-09 15:25:53,212 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 160.4 MB. Free memory was 132.1 MB in the beginning and 132.0 MB in the end (delta: 79.1 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 964.14 ms. Allocated memory is still 160.4 MB. Free memory was 140.2 MB in the beginning and 120.2 MB in the end (delta: 20.1 MB). Peak memory consumption was 19.4 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 115.24 ms. Allocated memory is still 160.4 MB. Free memory was 120.2 MB in the beginning and 117.2 MB in the end (delta: 2.9 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 72.65 ms. Allocated memory is still 160.4 MB. Free memory was 117.2 MB in the beginning and 115.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1995.33 ms. Allocated memory was 160.4 MB in the beginning and 192.9 MB in the end (delta: 32.5 MB). Free memory was 115.1 MB in the beginning and 94.5 MB in the end (delta: 20.6 MB). Peak memory consumption was 78.8 MB. Max. memory is 8.0 GB. * TraceAbstraction took 32485.77 ms. Allocated memory was 192.9 MB in the beginning and 289.4 MB in the end (delta: 96.5 MB). Free memory was 94.0 MB in the beginning and 205.4 MB in the end (delta: -111.5 MB). There was no memory consumed. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 547 VarBasedMoverChecksPositive, 32 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 36 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 28.9s, 88 PlacesBefore, 26 PlacesAfterwards, 84 TransitionsBefore, 19 TransitionsAfterwards, 1038 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 3 ChoiceCompositions, 85 TotalNumberOfCompositions, 2926 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L711] 0 _Bool main$tmp_guard0; [L712] 0 _Bool main$tmp_guard1; [L714] 0 int x = 0; [L715] 0 _Bool x$flush_delayed; [L716] 0 int x$mem_tmp; [L717] 0 _Bool x$r_buff0_thd0; [L718] 0 _Bool x$r_buff0_thd1; [L719] 0 _Bool x$r_buff0_thd2; [L720] 0 _Bool x$r_buff1_thd0; [L721] 0 _Bool x$r_buff1_thd1; [L722] 0 _Bool x$r_buff1_thd2; [L723] 0 _Bool x$read_delayed; [L724] 0 int *x$read_delayed_var; [L725] 0 int x$w_buff0; [L726] 0 _Bool x$w_buff0_used; [L727] 0 int x$w_buff1; [L728] 0 _Bool x$w_buff1_used; [L730] 0 int y = 0; [L731] 0 _Bool weak$$choice0; [L732] 0 _Bool weak$$choice2; [L792] 0 pthread_t t1447; [L793] FCALL, FORK 0 pthread_create(&t1447, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L794] 0 pthread_t t1448; [L795] FCALL, FORK 0 pthread_create(&t1448, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L756] 2 x$w_buff1 = x$w_buff0 [L757] 2 x$w_buff0 = 2 [L758] 2 x$w_buff1_used = x$w_buff0_used [L759] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L761] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L762] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L763] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L764] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L767] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L736] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L739] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L742] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L742] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L742] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L742] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L743] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L743] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L744] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L744] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L745] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L745] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L746] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L746] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L749] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L751] 1 return 0; [L770] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L770] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L771] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L771] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L772] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L772] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L773] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L773] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L774] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L774] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 2 return 0; [L797] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L3] COND FALSE 0 !(!cond) [L801] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L801] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L801] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L801] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L802] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L802] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L803] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L803] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L804] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L804] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L805] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L805] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L808] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L809] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L810] 0 x$flush_delayed = weak$$choice2 [L811] 0 x$mem_tmp = x [L812] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L812] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L813] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L813] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L813] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L813] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L814] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L814] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L814] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L814] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L815] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L815] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L815] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L815] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L816] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L816] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L816] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L816] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L817] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L817] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L817] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L818] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L818] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L818] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L818] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L819] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0) [L820] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L820] 0 x = x$flush_delayed ? x$mem_tmp : x [L821] 0 x$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix054_pso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 82 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 32.2s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 28.9s, HoareTripleCheckerStatistics: 141 SDtfs, 122 SDslu, 162 SDs, 0 SdLazy, 140 SolverSat, 49 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=162occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 15 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 100 NumberOfCodeBlocks, 100 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 76 ConstructedInterpolants, 0 QuantifiedInterpolants, 5219 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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...