/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi003_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 12:53:39,473 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 12:53:39,475 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 12:53:39,494 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 12:53:39,494 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 12:53:39,496 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 12:53:39,499 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 12:53:39,509 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 12:53:39,512 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 12:53:39,515 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 12:53:39,518 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 12:53:39,520 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 12:53:39,520 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 12:53:39,522 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 12:53:39,524 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 12:53:39,526 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 12:53:39,528 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 12:53:39,529 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 12:53:39,530 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 12:53:39,535 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 12:53:39,539 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 12:53:39,544 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 12:53:39,546 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 12:53:39,546 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 12:53:39,549 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 12:53:39,549 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 12:53:39,549 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 12:53:39,551 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 12:53:39,552 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 12:53:39,553 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 12:53:39,553 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 12:53:39,554 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 12:53:39,555 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 12:53:39,556 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 12:53:39,557 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 12:53:39,558 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 12:53:39,558 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 12:53:39,559 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 12:53:39,559 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 12:53:39,560 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 12:53:39,561 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 12:53:39,562 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2019-12-27 12:53:39,584 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 12:53:39,585 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 12:53:39,586 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 12:53:39,589 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 12:53:39,589 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 12:53:39,589 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 12:53:39,590 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 12:53:39,591 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 12:53:39,591 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 12:53:39,591 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 12:53:39,591 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 12:53:39,591 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 12:53:39,591 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 12:53:39,592 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 12:53:39,593 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 12:53:39,593 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 12:53:39,593 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 12:53:39,594 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 12:53:39,594 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 12:53:39,594 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 12:53:39,594 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 12:53:39,594 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 12:53:39,597 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 12:53:39,597 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 12:53:39,598 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 12:53:39,598 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 12:53:39,598 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 12:53:39,598 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-27 12:53:39,599 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 12:53:39,599 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 12:53:39,909 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 12:53:39,930 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 12:53:39,934 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 12:53:39,935 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 12:53:39,935 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 12:53:39,936 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi003_power.oepc.i [2019-12-27 12:53:40,003 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e56b702b7/00eae9f51de44797a7602c7f4d65bd7f/FLAG8a2690858 [2019-12-27 12:53:40,584 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 12:53:40,587 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi003_power.oepc.i [2019-12-27 12:53:40,617 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e56b702b7/00eae9f51de44797a7602c7f4d65bd7f/FLAG8a2690858 [2019-12-27 12:53:40,885 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e56b702b7/00eae9f51de44797a7602c7f4d65bd7f [2019-12-27 12:53:40,896 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 12:53:40,901 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 12:53:40,902 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 12:53:40,902 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 12:53:40,906 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 12:53:40,908 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 12:53:40" (1/1) ... [2019-12-27 12:53:40,911 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7215fff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:53:40, skipping insertion in model container [2019-12-27 12:53:40,912 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 12:53:40" (1/1) ... [2019-12-27 12:53:40,921 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 12:53:40,986 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 12:53:41,525 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 12:53:41,544 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 12:53:41,628 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 12:53:41,697 INFO L208 MainTranslator]: Completed translation [2019-12-27 12:53:41,698 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:53:41 WrapperNode [2019-12-27 12:53:41,698 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 12:53:41,699 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 12:53:41,699 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 12:53:41,699 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 12:53:41,708 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:53:41" (1/1) ... [2019-12-27 12:53:41,728 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:53:41" (1/1) ... [2019-12-27 12:53:41,765 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 12:53:41,765 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 12:53:41,766 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 12:53:41,766 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 12:53:41,775 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:53:41" (1/1) ... [2019-12-27 12:53:41,775 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:53:41" (1/1) ... [2019-12-27 12:53:41,779 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:53:41" (1/1) ... [2019-12-27 12:53:41,780 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:53:41" (1/1) ... [2019-12-27 12:53:41,789 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:53:41" (1/1) ... [2019-12-27 12:53:41,793 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:53:41" (1/1) ... [2019-12-27 12:53:41,796 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:53:41" (1/1) ... [2019-12-27 12:53:41,801 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 12:53:41,801 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 12:53:41,801 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 12:53:41,801 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 12:53:41,802 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:53:41" (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 [2019-12-27 12:53:41,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 12:53:41,888 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 12:53:41,888 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 12:53:41,888 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 12:53:41,888 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 12:53:41,889 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 12:53:41,889 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 12:53:41,889 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 12:53:41,889 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 12:53:41,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 12:53:41,890 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 12:53:41,891 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 12:53:42,547 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 12:53:42,547 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 12:53:42,548 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 12:53:42 BoogieIcfgContainer [2019-12-27 12:53:42,548 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 12:53:42,550 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 12:53:42,550 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 12:53:42,554 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 12:53:42,555 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 12:53:40" (1/3) ... [2019-12-27 12:53:42,556 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b06fc8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 12:53:42, skipping insertion in model container [2019-12-27 12:53:42,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:53:41" (2/3) ... [2019-12-27 12:53:42,558 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b06fc8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 12:53:42, skipping insertion in model container [2019-12-27 12:53:42,558 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 12:53:42" (3/3) ... [2019-12-27 12:53:42,560 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi003_power.oepc.i [2019-12-27 12:53:42,570 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 12:53:42,570 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 12:53:42,583 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 12:53:42,584 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 12:53:42,642 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,643 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,643 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,643 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,643 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,643 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,644 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,644 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,644 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,645 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,645 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,645 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,646 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,646 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,646 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,646 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,647 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,647 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,647 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,647 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,647 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,648 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,648 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,648 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,648 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,649 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,649 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,649 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,649 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,650 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,650 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,651 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,651 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,651 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,652 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,652 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,652 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,652 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,653 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,654 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,654 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,655 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,655 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,655 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,656 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,656 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,657 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,657 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,657 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,657 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,659 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,659 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,659 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,659 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,659 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,660 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,660 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,660 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,660 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,661 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,661 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,661 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,662 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,662 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,662 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,662 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,663 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,663 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,664 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,665 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,665 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,666 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,667 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,667 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,667 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,667 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,668 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,668 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,668 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,668 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,669 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,669 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,670 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,670 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,670 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,671 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,671 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,673 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,673 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,673 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,674 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,674 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,674 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,674 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,676 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,676 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,677 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,677 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,677 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,677 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,678 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,678 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,678 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,679 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,699 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,700 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,700 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,705 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,706 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,706 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,706 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,706 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,707 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,707 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,707 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,707 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,707 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,708 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,708 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,708 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,708 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,708 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,709 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,709 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,709 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,709 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,710 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,710 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,710 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,710 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,710 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,711 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,711 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,711 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:53:42,729 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 12:53:42,751 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 12:53:42,751 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 12:53:42,751 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 12:53:42,751 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 12:53:42,753 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 12:53:42,753 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 12:53:42,754 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 12:53:42,754 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 12:53:42,783 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 136 places, 164 transitions [2019-12-27 12:53:44,469 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25976 states. [2019-12-27 12:53:44,471 INFO L276 IsEmpty]: Start isEmpty. Operand 25976 states. [2019-12-27 12:53:44,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 12:53:44,481 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:53:44,482 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:53:44,482 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:53:44,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:53:44,488 INFO L82 PathProgramCache]: Analyzing trace with hash 2111627556, now seen corresponding path program 1 times [2019-12-27 12:53:44,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:53:44,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385130667] [2019-12-27 12:53:44,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:53:44,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:53:44,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:53:44,842 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385130667] [2019-12-27 12:53:44,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:53:44,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 12:53:44,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199114331] [2019-12-27 12:53:44,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 12:53:44,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:53:44,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 12:53:44,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 12:53:44,866 INFO L87 Difference]: Start difference. First operand 25976 states. Second operand 4 states. [2019-12-27 12:53:46,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:53:46,316 INFO L93 Difference]: Finished difference Result 26616 states and 102121 transitions. [2019-12-27 12:53:46,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 12:53:46,318 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-12-27 12:53:46,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:53:46,538 INFO L225 Difference]: With dead ends: 26616 [2019-12-27 12:53:46,538 INFO L226 Difference]: Without dead ends: 20360 [2019-12-27 12:53:46,542 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 12:53:46,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20360 states. [2019-12-27 12:53:47,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20360 to 20360. [2019-12-27 12:53:47,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20360 states. [2019-12-27 12:53:47,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20360 states to 20360 states and 78425 transitions. [2019-12-27 12:53:47,536 INFO L78 Accepts]: Start accepts. Automaton has 20360 states and 78425 transitions. Word has length 39 [2019-12-27 12:53:47,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:53:47,537 INFO L462 AbstractCegarLoop]: Abstraction has 20360 states and 78425 transitions. [2019-12-27 12:53:47,537 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 12:53:47,537 INFO L276 IsEmpty]: Start isEmpty. Operand 20360 states and 78425 transitions. [2019-12-27 12:53:47,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 12:53:47,545 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:53:47,545 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:53:47,546 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:53:47,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:53:47,547 INFO L82 PathProgramCache]: Analyzing trace with hash 341542856, now seen corresponding path program 1 times [2019-12-27 12:53:47,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:53:47,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009572344] [2019-12-27 12:53:47,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:53:47,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:53:47,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:53:47,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009572344] [2019-12-27 12:53:47,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:53:47,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 12:53:47,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351530079] [2019-12-27 12:53:47,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 12:53:47,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:53:47,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 12:53:47,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 12:53:47,666 INFO L87 Difference]: Start difference. First operand 20360 states and 78425 transitions. Second operand 5 states. [2019-12-27 12:53:48,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:53:48,925 INFO L93 Difference]: Finished difference Result 31838 states and 116042 transitions. [2019-12-27 12:53:48,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 12:53:48,926 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-12-27 12:53:48,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:53:49,066 INFO L225 Difference]: With dead ends: 31838 [2019-12-27 12:53:49,066 INFO L226 Difference]: Without dead ends: 31286 [2019-12-27 12:53:49,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 12:53:49,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31286 states. [2019-12-27 12:53:51,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31286 to 29705. [2019-12-27 12:53:51,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29705 states. [2019-12-27 12:53:51,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29705 states to 29705 states and 109519 transitions. [2019-12-27 12:53:51,306 INFO L78 Accepts]: Start accepts. Automaton has 29705 states and 109519 transitions. Word has length 47 [2019-12-27 12:53:51,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:53:51,308 INFO L462 AbstractCegarLoop]: Abstraction has 29705 states and 109519 transitions. [2019-12-27 12:53:51,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 12:53:51,308 INFO L276 IsEmpty]: Start isEmpty. Operand 29705 states and 109519 transitions. [2019-12-27 12:53:51,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 12:53:51,313 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:53:51,314 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:53:51,314 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:53:51,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:53:51,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1959299271, now seen corresponding path program 1 times [2019-12-27 12:53:51,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:53:51,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664668056] [2019-12-27 12:53:51,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:53:51,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:53:51,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:53:51,414 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664668056] [2019-12-27 12:53:51,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:53:51,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 12:53:51,415 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486767011] [2019-12-27 12:53:51,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 12:53:51,416 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:53:51,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 12:53:51,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 12:53:51,417 INFO L87 Difference]: Start difference. First operand 29705 states and 109519 transitions. Second operand 5 states. [2019-12-27 12:53:51,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:53:51,955 INFO L93 Difference]: Finished difference Result 38696 states and 139691 transitions. [2019-12-27 12:53:51,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 12:53:51,956 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-12-27 12:53:51,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:53:52,207 INFO L225 Difference]: With dead ends: 38696 [2019-12-27 12:53:52,208 INFO L226 Difference]: Without dead ends: 38248 [2019-12-27 12:53:52,208 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 12:53:52,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38248 states. [2019-12-27 12:53:54,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38248 to 32951. [2019-12-27 12:53:54,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32951 states. [2019-12-27 12:53:54,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32951 states to 32951 states and 120528 transitions. [2019-12-27 12:53:54,576 INFO L78 Accepts]: Start accepts. Automaton has 32951 states and 120528 transitions. Word has length 48 [2019-12-27 12:53:54,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:53:54,577 INFO L462 AbstractCegarLoop]: Abstraction has 32951 states and 120528 transitions. [2019-12-27 12:53:54,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 12:53:54,577 INFO L276 IsEmpty]: Start isEmpty. Operand 32951 states and 120528 transitions. [2019-12-27 12:53:54,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-27 12:53:54,587 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:53:54,587 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:53:54,587 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:53:54,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:53:54,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1720517523, now seen corresponding path program 1 times [2019-12-27 12:53:54,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:53:54,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281528658] [2019-12-27 12:53:54,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:53:54,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:53:54,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:53:54,642 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281528658] [2019-12-27 12:53:54,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:53:54,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 12:53:54,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438693364] [2019-12-27 12:53:54,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 12:53:54,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:53:54,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 12:53:54,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 12:53:54,644 INFO L87 Difference]: Start difference. First operand 32951 states and 120528 transitions. Second operand 3 states. [2019-12-27 12:53:55,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:53:55,088 INFO L93 Difference]: Finished difference Result 42412 states and 152019 transitions. [2019-12-27 12:53:55,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 12:53:55,089 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-12-27 12:53:55,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:53:55,210 INFO L225 Difference]: With dead ends: 42412 [2019-12-27 12:53:55,210 INFO L226 Difference]: Without dead ends: 42412 [2019-12-27 12:53:55,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 12:53:55,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42412 states. [2019-12-27 12:53:57,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42412 to 37665. [2019-12-27 12:53:57,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37665 states. [2019-12-27 12:53:57,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37665 states to 37665 states and 136332 transitions. [2019-12-27 12:53:57,540 INFO L78 Accepts]: Start accepts. Automaton has 37665 states and 136332 transitions. Word has length 50 [2019-12-27 12:53:57,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:53:57,541 INFO L462 AbstractCegarLoop]: Abstraction has 37665 states and 136332 transitions. [2019-12-27 12:53:57,541 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 12:53:57,541 INFO L276 IsEmpty]: Start isEmpty. Operand 37665 states and 136332 transitions. [2019-12-27 12:53:57,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 12:53:57,559 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:53:57,559 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:53:57,560 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:53:57,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:53:57,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1662860822, now seen corresponding path program 1 times [2019-12-27 12:53:57,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:53:57,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2578528] [2019-12-27 12:53:57,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:53:57,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:53:57,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:53:57,717 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2578528] [2019-12-27 12:53:57,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:53:57,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 12:53:57,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631097925] [2019-12-27 12:53:57,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 12:53:57,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:53:57,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 12:53:57,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 12:53:57,719 INFO L87 Difference]: Start difference. First operand 37665 states and 136332 transitions. Second operand 6 states. [2019-12-27 12:53:58,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:53:58,393 INFO L93 Difference]: Finished difference Result 48756 states and 172981 transitions. [2019-12-27 12:53:58,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 12:53:58,394 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-12-27 12:53:58,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:53:58,520 INFO L225 Difference]: With dead ends: 48756 [2019-12-27 12:53:58,521 INFO L226 Difference]: Without dead ends: 48236 [2019-12-27 12:53:58,521 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-12-27 12:53:59,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48236 states. [2019-12-27 12:53:59,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48236 to 38229. [2019-12-27 12:53:59,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38229 states. [2019-12-27 12:53:59,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38229 states to 38229 states and 138495 transitions. [2019-12-27 12:53:59,598 INFO L78 Accepts]: Start accepts. Automaton has 38229 states and 138495 transitions. Word has length 54 [2019-12-27 12:53:59,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:53:59,598 INFO L462 AbstractCegarLoop]: Abstraction has 38229 states and 138495 transitions. [2019-12-27 12:53:59,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 12:53:59,599 INFO L276 IsEmpty]: Start isEmpty. Operand 38229 states and 138495 transitions. [2019-12-27 12:53:59,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 12:53:59,612 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:53:59,613 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:53:59,613 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:53:59,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:53:59,613 INFO L82 PathProgramCache]: Analyzing trace with hash -1119592545, now seen corresponding path program 1 times [2019-12-27 12:53:59,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:53:59,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493102290] [2019-12-27 12:53:59,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:53:59,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:53:59,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:53:59,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493102290] [2019-12-27 12:53:59,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:53:59,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 12:53:59,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695019153] [2019-12-27 12:53:59,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 12:53:59,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:53:59,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 12:53:59,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 12:53:59,662 INFO L87 Difference]: Start difference. First operand 38229 states and 138495 transitions. Second operand 3 states. [2019-12-27 12:54:01,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:54:01,283 INFO L93 Difference]: Finished difference Result 42347 states and 153425 transitions. [2019-12-27 12:54:01,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 12:54:01,284 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-27 12:54:01,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:54:01,411 INFO L225 Difference]: With dead ends: 42347 [2019-12-27 12:54:01,411 INFO L226 Difference]: Without dead ends: 42347 [2019-12-27 12:54:01,412 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 12:54:01,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42347 states. [2019-12-27 12:54:02,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42347 to 40235. [2019-12-27 12:54:02,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40235 states. [2019-12-27 12:54:02,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40235 states to 40235 states and 145783 transitions. [2019-12-27 12:54:02,526 INFO L78 Accepts]: Start accepts. Automaton has 40235 states and 145783 transitions. Word has length 54 [2019-12-27 12:54:02,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:54:02,526 INFO L462 AbstractCegarLoop]: Abstraction has 40235 states and 145783 transitions. [2019-12-27 12:54:02,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 12:54:02,527 INFO L276 IsEmpty]: Start isEmpty. Operand 40235 states and 145783 transitions. [2019-12-27 12:54:02,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 12:54:02,539 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:54:02,539 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:54:02,539 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:54:02,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:54:02,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1661323295, now seen corresponding path program 1 times [2019-12-27 12:54:02,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:54:02,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768902253] [2019-12-27 12:54:02,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:54:02,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:54:02,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:54:02,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768902253] [2019-12-27 12:54:02,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:54:02,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 12:54:02,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487976286] [2019-12-27 12:54:02,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 12:54:02,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:54:02,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 12:54:02,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 12:54:02,665 INFO L87 Difference]: Start difference. First operand 40235 states and 145783 transitions. Second operand 6 states. [2019-12-27 12:54:03,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:54:03,423 INFO L93 Difference]: Finished difference Result 54445 states and 194725 transitions. [2019-12-27 12:54:03,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 12:54:03,424 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-12-27 12:54:03,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:54:03,550 INFO L225 Difference]: With dead ends: 54445 [2019-12-27 12:54:03,550 INFO L226 Difference]: Without dead ends: 53469 [2019-12-27 12:54:03,550 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 12:54:03,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53469 states. [2019-12-27 12:54:06,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53469 to 48782. [2019-12-27 12:54:06,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48782 states. [2019-12-27 12:54:06,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48782 states to 48782 states and 175226 transitions. [2019-12-27 12:54:06,147 INFO L78 Accepts]: Start accepts. Automaton has 48782 states and 175226 transitions. Word has length 54 [2019-12-27 12:54:06,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:54:06,147 INFO L462 AbstractCegarLoop]: Abstraction has 48782 states and 175226 transitions. [2019-12-27 12:54:06,147 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 12:54:06,147 INFO L276 IsEmpty]: Start isEmpty. Operand 48782 states and 175226 transitions. [2019-12-27 12:54:06,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 12:54:06,160 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:54:06,160 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:54:06,160 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:54:06,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:54:06,160 INFO L82 PathProgramCache]: Analyzing trace with hash -135628064, now seen corresponding path program 1 times [2019-12-27 12:54:06,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:54:06,161 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142769239] [2019-12-27 12:54:06,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:54:06,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:54:06,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:54:06,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142769239] [2019-12-27 12:54:06,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:54:06,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 12:54:06,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25050681] [2019-12-27 12:54:06,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 12:54:06,271 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:54:06,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 12:54:06,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 12:54:06,271 INFO L87 Difference]: Start difference. First operand 48782 states and 175226 transitions. Second operand 7 states. [2019-12-27 12:54:07,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:54:07,480 INFO L93 Difference]: Finished difference Result 70897 states and 244523 transitions. [2019-12-27 12:54:07,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 12:54:07,481 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-27 12:54:07,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:54:07,630 INFO L225 Difference]: With dead ends: 70897 [2019-12-27 12:54:07,630 INFO L226 Difference]: Without dead ends: 70897 [2019-12-27 12:54:07,630 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 12:54:08,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70897 states. [2019-12-27 12:54:08,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70897 to 57890. [2019-12-27 12:54:08,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57890 states. [2019-12-27 12:54:09,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57890 states to 57890 states and 203150 transitions. [2019-12-27 12:54:09,099 INFO L78 Accepts]: Start accepts. Automaton has 57890 states and 203150 transitions. Word has length 54 [2019-12-27 12:54:09,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:54:09,099 INFO L462 AbstractCegarLoop]: Abstraction has 57890 states and 203150 transitions. [2019-12-27 12:54:09,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 12:54:09,099 INFO L276 IsEmpty]: Start isEmpty. Operand 57890 states and 203150 transitions. [2019-12-27 12:54:09,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 12:54:09,113 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:54:09,113 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:54:09,113 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:54:09,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:54:09,113 INFO L82 PathProgramCache]: Analyzing trace with hash 751875617, now seen corresponding path program 1 times [2019-12-27 12:54:09,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:54:09,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659750402] [2019-12-27 12:54:09,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:54:09,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:54:09,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:54:09,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659750402] [2019-12-27 12:54:09,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:54:09,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 12:54:09,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27222146] [2019-12-27 12:54:09,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 12:54:09,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:54:09,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 12:54:09,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 12:54:09,196 INFO L87 Difference]: Start difference. First operand 57890 states and 203150 transitions. Second operand 3 states. [2019-12-27 12:54:09,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:54:09,929 INFO L93 Difference]: Finished difference Result 43856 states and 152833 transitions. [2019-12-27 12:54:09,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 12:54:09,929 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-27 12:54:09,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:54:10,013 INFO L225 Difference]: With dead ends: 43856 [2019-12-27 12:54:10,013 INFO L226 Difference]: Without dead ends: 43352 [2019-12-27 12:54:10,013 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 12:54:10,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43352 states. [2019-12-27 12:54:10,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43352 to 41886. [2019-12-27 12:54:10,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41886 states. [2019-12-27 12:54:10,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41886 states to 41886 states and 146704 transitions. [2019-12-27 12:54:10,754 INFO L78 Accepts]: Start accepts. Automaton has 41886 states and 146704 transitions. Word has length 54 [2019-12-27 12:54:10,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:54:10,755 INFO L462 AbstractCegarLoop]: Abstraction has 41886 states and 146704 transitions. [2019-12-27 12:54:10,755 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 12:54:10,755 INFO L276 IsEmpty]: Start isEmpty. Operand 41886 states and 146704 transitions. [2019-12-27 12:54:10,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 12:54:10,766 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:54:10,766 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:54:10,766 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:54:10,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:54:10,767 INFO L82 PathProgramCache]: Analyzing trace with hash 807428207, now seen corresponding path program 1 times [2019-12-27 12:54:10,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:54:10,767 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110621482] [2019-12-27 12:54:10,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:54:10,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:54:10,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:54:10,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110621482] [2019-12-27 12:54:10,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:54:10,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 12:54:10,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101598659] [2019-12-27 12:54:10,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 12:54:10,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:54:10,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 12:54:10,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 12:54:10,901 INFO L87 Difference]: Start difference. First operand 41886 states and 146704 transitions. Second operand 6 states. [2019-12-27 12:54:11,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:54:11,895 INFO L93 Difference]: Finished difference Result 54549 states and 184834 transitions. [2019-12-27 12:54:11,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 12:54:11,896 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-12-27 12:54:11,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:54:12,008 INFO L225 Difference]: With dead ends: 54549 [2019-12-27 12:54:12,008 INFO L226 Difference]: Without dead ends: 54549 [2019-12-27 12:54:12,009 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-27 12:54:12,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54549 states. [2019-12-27 12:54:12,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54549 to 45861. [2019-12-27 12:54:12,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45861 states. [2019-12-27 12:54:12,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45861 states to 45861 states and 158167 transitions. [2019-12-27 12:54:12,857 INFO L78 Accepts]: Start accepts. Automaton has 45861 states and 158167 transitions. Word has length 55 [2019-12-27 12:54:12,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:54:12,858 INFO L462 AbstractCegarLoop]: Abstraction has 45861 states and 158167 transitions. [2019-12-27 12:54:12,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 12:54:12,858 INFO L276 IsEmpty]: Start isEmpty. Operand 45861 states and 158167 transitions. [2019-12-27 12:54:12,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 12:54:12,868 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:54:12,868 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:54:12,868 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:54:12,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:54:12,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1694931888, now seen corresponding path program 1 times [2019-12-27 12:54:12,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:54:12,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083986439] [2019-12-27 12:54:12,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:54:12,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:54:12,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:54:12,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083986439] [2019-12-27 12:54:12,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:54:12,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 12:54:12,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466270349] [2019-12-27 12:54:12,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 12:54:12,934 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:54:12,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 12:54:12,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 12:54:12,935 INFO L87 Difference]: Start difference. First operand 45861 states and 158167 transitions. Second operand 4 states. [2019-12-27 12:54:12,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:54:12,988 INFO L93 Difference]: Finished difference Result 8163 states and 24871 transitions. [2019-12-27 12:54:12,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 12:54:12,988 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-12-27 12:54:12,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:54:13,001 INFO L225 Difference]: With dead ends: 8163 [2019-12-27 12:54:13,001 INFO L226 Difference]: Without dead ends: 6754 [2019-12-27 12:54:13,002 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 12:54:13,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6754 states. [2019-12-27 12:54:13,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6754 to 6706. [2019-12-27 12:54:13,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6706 states. [2019-12-27 12:54:13,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6706 states to 6706 states and 20040 transitions. [2019-12-27 12:54:13,101 INFO L78 Accepts]: Start accepts. Automaton has 6706 states and 20040 transitions. Word has length 55 [2019-12-27 12:54:13,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:54:13,101 INFO L462 AbstractCegarLoop]: Abstraction has 6706 states and 20040 transitions. [2019-12-27 12:54:13,101 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 12:54:13,101 INFO L276 IsEmpty]: Start isEmpty. Operand 6706 states and 20040 transitions. [2019-12-27 12:54:13,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 12:54:13,105 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:54:13,105 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:54:13,105 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:54:13,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:54:13,105 INFO L82 PathProgramCache]: Analyzing trace with hash -2058299368, now seen corresponding path program 1 times [2019-12-27 12:54:13,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:54:13,106 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960054176] [2019-12-27 12:54:13,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:54:13,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:54:13,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:54:13,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960054176] [2019-12-27 12:54:13,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:54:13,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 12:54:13,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051984263] [2019-12-27 12:54:13,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 12:54:13,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:54:13,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 12:54:13,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 12:54:13,151 INFO L87 Difference]: Start difference. First operand 6706 states and 20040 transitions. Second operand 4 states. [2019-12-27 12:54:13,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:54:13,282 INFO L93 Difference]: Finished difference Result 7891 states and 23389 transitions. [2019-12-27 12:54:13,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 12:54:13,283 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-12-27 12:54:13,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:54:13,293 INFO L225 Difference]: With dead ends: 7891 [2019-12-27 12:54:13,293 INFO L226 Difference]: Without dead ends: 7891 [2019-12-27 12:54:13,294 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 12:54:13,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7891 states. [2019-12-27 12:54:13,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7891 to 7213. [2019-12-27 12:54:13,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7213 states. [2019-12-27 12:54:13,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7213 states to 7213 states and 21446 transitions. [2019-12-27 12:54:13,432 INFO L78 Accepts]: Start accepts. Automaton has 7213 states and 21446 transitions. Word has length 64 [2019-12-27 12:54:13,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:54:13,432 INFO L462 AbstractCegarLoop]: Abstraction has 7213 states and 21446 transitions. [2019-12-27 12:54:13,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 12:54:13,432 INFO L276 IsEmpty]: Start isEmpty. Operand 7213 states and 21446 transitions. [2019-12-27 12:54:13,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 12:54:13,436 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:54:13,436 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:54:13,437 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:54:13,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:54:13,437 INFO L82 PathProgramCache]: Analyzing trace with hash -315489033, now seen corresponding path program 1 times [2019-12-27 12:54:13,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:54:13,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726938410] [2019-12-27 12:54:13,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:54:13,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:54:13,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:54:13,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726938410] [2019-12-27 12:54:13,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:54:13,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 12:54:13,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499733010] [2019-12-27 12:54:13,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 12:54:13,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:54:13,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 12:54:13,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 12:54:13,501 INFO L87 Difference]: Start difference. First operand 7213 states and 21446 transitions. Second operand 6 states. [2019-12-27 12:54:13,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:54:13,864 INFO L93 Difference]: Finished difference Result 9268 states and 27195 transitions. [2019-12-27 12:54:13,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 12:54:13,865 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2019-12-27 12:54:13,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:54:13,884 INFO L225 Difference]: With dead ends: 9268 [2019-12-27 12:54:13,884 INFO L226 Difference]: Without dead ends: 9220 [2019-12-27 12:54:13,885 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-27 12:54:13,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9220 states. [2019-12-27 12:54:14,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9220 to 8052. [2019-12-27 12:54:14,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8052 states. [2019-12-27 12:54:14,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8052 states to 8052 states and 23826 transitions. [2019-12-27 12:54:14,045 INFO L78 Accepts]: Start accepts. Automaton has 8052 states and 23826 transitions. Word has length 64 [2019-12-27 12:54:14,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:54:14,046 INFO L462 AbstractCegarLoop]: Abstraction has 8052 states and 23826 transitions. [2019-12-27 12:54:14,046 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 12:54:14,046 INFO L276 IsEmpty]: Start isEmpty. Operand 8052 states and 23826 transitions. [2019-12-27 12:54:14,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 12:54:14,055 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:54:14,056 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:54:14,056 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:54:14,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:54:14,056 INFO L82 PathProgramCache]: Analyzing trace with hash 502763189, now seen corresponding path program 1 times [2019-12-27 12:54:14,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:54:14,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342644339] [2019-12-27 12:54:14,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:54:14,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:54:14,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:54:14,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342644339] [2019-12-27 12:54:14,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:54:14,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 12:54:14,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164333614] [2019-12-27 12:54:14,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 12:54:14,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:54:14,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 12:54:14,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 12:54:14,141 INFO L87 Difference]: Start difference. First operand 8052 states and 23826 transitions. Second operand 4 states. [2019-12-27 12:54:14,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:54:14,406 INFO L93 Difference]: Finished difference Result 10665 states and 31175 transitions. [2019-12-27 12:54:14,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 12:54:14,407 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-12-27 12:54:14,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:54:14,426 INFO L225 Difference]: With dead ends: 10665 [2019-12-27 12:54:14,426 INFO L226 Difference]: Without dead ends: 10665 [2019-12-27 12:54:14,427 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 12:54:14,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10665 states. [2019-12-27 12:54:14,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10665 to 9075. [2019-12-27 12:54:14,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9075 states. [2019-12-27 12:54:14,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9075 states to 9075 states and 26645 transitions. [2019-12-27 12:54:14,587 INFO L78 Accepts]: Start accepts. Automaton has 9075 states and 26645 transitions. Word has length 68 [2019-12-27 12:54:14,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:54:14,587 INFO L462 AbstractCegarLoop]: Abstraction has 9075 states and 26645 transitions. [2019-12-27 12:54:14,587 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 12:54:14,587 INFO L276 IsEmpty]: Start isEmpty. Operand 9075 states and 26645 transitions. [2019-12-27 12:54:14,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 12:54:14,594 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:54:14,594 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:54:14,595 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:54:14,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:54:14,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1747527670, now seen corresponding path program 1 times [2019-12-27 12:54:14,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:54:14,595 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837697228] [2019-12-27 12:54:14,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:54:14,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:54:14,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:54:14,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837697228] [2019-12-27 12:54:14,693 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:54:14,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 12:54:14,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54702549] [2019-12-27 12:54:14,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 12:54:14,694 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:54:14,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 12:54:14,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 12:54:14,694 INFO L87 Difference]: Start difference. First operand 9075 states and 26645 transitions. Second operand 6 states. [2019-12-27 12:54:15,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:54:15,162 INFO L93 Difference]: Finished difference Result 10385 states and 29896 transitions. [2019-12-27 12:54:15,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 12:54:15,163 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-12-27 12:54:15,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:54:15,176 INFO L225 Difference]: With dead ends: 10385 [2019-12-27 12:54:15,176 INFO L226 Difference]: Without dead ends: 10385 [2019-12-27 12:54:15,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 12:54:15,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10385 states. [2019-12-27 12:54:15,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10385 to 10082. [2019-12-27 12:54:15,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10082 states. [2019-12-27 12:54:15,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10082 states to 10082 states and 29119 transitions. [2019-12-27 12:54:15,297 INFO L78 Accepts]: Start accepts. Automaton has 10082 states and 29119 transitions. Word has length 68 [2019-12-27 12:54:15,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:54:15,297 INFO L462 AbstractCegarLoop]: Abstraction has 10082 states and 29119 transitions. [2019-12-27 12:54:15,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 12:54:15,298 INFO L276 IsEmpty]: Start isEmpty. Operand 10082 states and 29119 transitions. [2019-12-27 12:54:15,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 12:54:15,306 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:54:15,307 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:54:15,307 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:54:15,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:54:15,307 INFO L82 PathProgramCache]: Analyzing trace with hash -329681673, now seen corresponding path program 1 times [2019-12-27 12:54:15,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:54:15,307 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127446512] [2019-12-27 12:54:15,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:54:15,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:54:15,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:54:15,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127446512] [2019-12-27 12:54:15,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:54:15,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 12:54:15,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045371839] [2019-12-27 12:54:15,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 12:54:15,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:54:15,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 12:54:15,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 12:54:15,420 INFO L87 Difference]: Start difference. First operand 10082 states and 29119 transitions. Second operand 6 states. [2019-12-27 12:54:15,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:54:15,827 INFO L93 Difference]: Finished difference Result 11999 states and 33626 transitions. [2019-12-27 12:54:15,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 12:54:15,828 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-12-27 12:54:15,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:54:15,844 INFO L225 Difference]: With dead ends: 11999 [2019-12-27 12:54:15,844 INFO L226 Difference]: Without dead ends: 11999 [2019-12-27 12:54:15,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-12-27 12:54:15,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11999 states. [2019-12-27 12:54:15,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11999 to 10301. [2019-12-27 12:54:15,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10301 states. [2019-12-27 12:54:15,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10301 states to 10301 states and 29171 transitions. [2019-12-27 12:54:15,981 INFO L78 Accepts]: Start accepts. Automaton has 10301 states and 29171 transitions. Word has length 68 [2019-12-27 12:54:15,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:54:15,982 INFO L462 AbstractCegarLoop]: Abstraction has 10301 states and 29171 transitions. [2019-12-27 12:54:15,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 12:54:15,982 INFO L276 IsEmpty]: Start isEmpty. Operand 10301 states and 29171 transitions. [2019-12-27 12:54:15,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 12:54:15,988 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:54:15,989 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:54:15,989 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:54:15,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:54:15,989 INFO L82 PathProgramCache]: Analyzing trace with hash -118330760, now seen corresponding path program 1 times [2019-12-27 12:54:15,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:54:15,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053622826] [2019-12-27 12:54:15,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:54:16,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:54:16,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:54:16,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053622826] [2019-12-27 12:54:16,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:54:16,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 12:54:16,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154383158] [2019-12-27 12:54:16,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 12:54:16,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:54:16,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 12:54:16,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 12:54:16,059 INFO L87 Difference]: Start difference. First operand 10301 states and 29171 transitions. Second operand 5 states. [2019-12-27 12:54:16,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:54:16,357 INFO L93 Difference]: Finished difference Result 12576 states and 35464 transitions. [2019-12-27 12:54:16,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 12:54:16,357 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-12-27 12:54:16,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:54:16,373 INFO L225 Difference]: With dead ends: 12576 [2019-12-27 12:54:16,373 INFO L226 Difference]: Without dead ends: 12576 [2019-12-27 12:54:16,374 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 12:54:16,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12576 states. [2019-12-27 12:54:16,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12576 to 11076. [2019-12-27 12:54:16,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11076 states. [2019-12-27 12:54:16,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11076 states to 11076 states and 31105 transitions. [2019-12-27 12:54:16,631 INFO L78 Accepts]: Start accepts. Automaton has 11076 states and 31105 transitions. Word has length 68 [2019-12-27 12:54:16,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:54:16,632 INFO L462 AbstractCegarLoop]: Abstraction has 11076 states and 31105 transitions. [2019-12-27 12:54:16,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 12:54:16,632 INFO L276 IsEmpty]: Start isEmpty. Operand 11076 states and 31105 transitions. [2019-12-27 12:54:16,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 12:54:16,639 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:54:16,639 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:54:16,639 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:54:16,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:54:16,639 INFO L82 PathProgramCache]: Analyzing trace with hash -628864937, now seen corresponding path program 1 times [2019-12-27 12:54:16,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:54:16,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518574151] [2019-12-27 12:54:16,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:54:16,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:54:16,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:54:16,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518574151] [2019-12-27 12:54:16,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:54:16,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 12:54:16,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593900258] [2019-12-27 12:54:16,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 12:54:16,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:54:16,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 12:54:16,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 12:54:16,741 INFO L87 Difference]: Start difference. First operand 11076 states and 31105 transitions. Second operand 6 states. [2019-12-27 12:54:17,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:54:17,590 INFO L93 Difference]: Finished difference Result 17070 states and 47866 transitions. [2019-12-27 12:54:17,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 12:54:17,590 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-12-27 12:54:17,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:54:17,614 INFO L225 Difference]: With dead ends: 17070 [2019-12-27 12:54:17,614 INFO L226 Difference]: Without dead ends: 17070 [2019-12-27 12:54:17,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-27 12:54:17,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17070 states. [2019-12-27 12:54:17,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17070 to 14148. [2019-12-27 12:54:17,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14148 states. [2019-12-27 12:54:17,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14148 states to 14148 states and 39930 transitions. [2019-12-27 12:54:17,804 INFO L78 Accepts]: Start accepts. Automaton has 14148 states and 39930 transitions. Word has length 68 [2019-12-27 12:54:17,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:54:17,805 INFO L462 AbstractCegarLoop]: Abstraction has 14148 states and 39930 transitions. [2019-12-27 12:54:17,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 12:54:17,805 INFO L276 IsEmpty]: Start isEmpty. Operand 14148 states and 39930 transitions. [2019-12-27 12:54:17,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 12:54:17,813 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:54:17,813 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:54:17,813 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:54:17,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:54:17,813 INFO L82 PathProgramCache]: Analyzing trace with hash 258638744, now seen corresponding path program 1 times [2019-12-27 12:54:17,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:54:17,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904474944] [2019-12-27 12:54:17,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:54:17,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:54:17,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:54:17,871 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904474944] [2019-12-27 12:54:17,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:54:17,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 12:54:17,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552611166] [2019-12-27 12:54:17,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 12:54:17,872 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:54:17,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 12:54:17,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 12:54:17,873 INFO L87 Difference]: Start difference. First operand 14148 states and 39930 transitions. Second operand 4 states. [2019-12-27 12:54:18,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:54:18,306 INFO L93 Difference]: Finished difference Result 14460 states and 40606 transitions. [2019-12-27 12:54:18,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 12:54:18,306 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-12-27 12:54:18,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:54:18,324 INFO L225 Difference]: With dead ends: 14460 [2019-12-27 12:54:18,324 INFO L226 Difference]: Without dead ends: 13986 [2019-12-27 12:54:18,325 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 12:54:18,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13986 states. [2019-12-27 12:54:18,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13986 to 13425. [2019-12-27 12:54:18,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13425 states. [2019-12-27 12:54:18,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13425 states to 13425 states and 37675 transitions. [2019-12-27 12:54:18,489 INFO L78 Accepts]: Start accepts. Automaton has 13425 states and 37675 transitions. Word has length 68 [2019-12-27 12:54:18,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:54:18,489 INFO L462 AbstractCegarLoop]: Abstraction has 13425 states and 37675 transitions. [2019-12-27 12:54:18,490 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 12:54:18,490 INFO L276 IsEmpty]: Start isEmpty. Operand 13425 states and 37675 transitions. [2019-12-27 12:54:18,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 12:54:18,497 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:54:18,497 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:54:18,497 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:54:18,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:54:18,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1869151000, now seen corresponding path program 1 times [2019-12-27 12:54:18,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:54:18,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353418429] [2019-12-27 12:54:18,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:54:18,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:54:18,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:54:18,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353418429] [2019-12-27 12:54:18,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:54:18,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 12:54:18,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831733854] [2019-12-27 12:54:18,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 12:54:18,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:54:18,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 12:54:18,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 12:54:18,613 INFO L87 Difference]: Start difference. First operand 13425 states and 37675 transitions. Second operand 9 states. [2019-12-27 12:54:19,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:54:19,316 INFO L93 Difference]: Finished difference Result 19154 states and 53543 transitions. [2019-12-27 12:54:19,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 12:54:19,317 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 68 [2019-12-27 12:54:19,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:54:19,342 INFO L225 Difference]: With dead ends: 19154 [2019-12-27 12:54:19,342 INFO L226 Difference]: Without dead ends: 19154 [2019-12-27 12:54:19,343 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-12-27 12:54:19,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19154 states. [2019-12-27 12:54:19,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19154 to 15590. [2019-12-27 12:54:19,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15590 states. [2019-12-27 12:54:19,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15590 states to 15590 states and 43630 transitions. [2019-12-27 12:54:19,557 INFO L78 Accepts]: Start accepts. Automaton has 15590 states and 43630 transitions. Word has length 68 [2019-12-27 12:54:19,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:54:19,557 INFO L462 AbstractCegarLoop]: Abstraction has 15590 states and 43630 transitions. [2019-12-27 12:54:19,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 12:54:19,557 INFO L276 IsEmpty]: Start isEmpty. Operand 15590 states and 43630 transitions. [2019-12-27 12:54:19,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 12:54:19,566 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:54:19,566 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:54:19,567 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:54:19,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:54:19,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1538312615, now seen corresponding path program 1 times [2019-12-27 12:54:19,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:54:19,567 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995230386] [2019-12-27 12:54:19,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:54:19,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:54:19,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:54:19,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995230386] [2019-12-27 12:54:19,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:54:19,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 12:54:19,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471615561] [2019-12-27 12:54:19,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 12:54:19,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:54:19,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 12:54:19,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 12:54:19,661 INFO L87 Difference]: Start difference. First operand 15590 states and 43630 transitions. Second operand 5 states. [2019-12-27 12:54:19,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:54:19,711 INFO L93 Difference]: Finished difference Result 4904 states and 11471 transitions. [2019-12-27 12:54:19,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 12:54:19,711 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-12-27 12:54:19,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:54:19,717 INFO L225 Difference]: With dead ends: 4904 [2019-12-27 12:54:19,717 INFO L226 Difference]: Without dead ends: 4032 [2019-12-27 12:54:19,718 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 12:54:19,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4032 states. [2019-12-27 12:54:19,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4032 to 3409. [2019-12-27 12:54:19,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3409 states. [2019-12-27 12:54:19,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3409 states to 3409 states and 7848 transitions. [2019-12-27 12:54:19,774 INFO L78 Accepts]: Start accepts. Automaton has 3409 states and 7848 transitions. Word has length 68 [2019-12-27 12:54:19,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:54:19,775 INFO L462 AbstractCegarLoop]: Abstraction has 3409 states and 7848 transitions. [2019-12-27 12:54:19,775 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 12:54:19,775 INFO L276 IsEmpty]: Start isEmpty. Operand 3409 states and 7848 transitions. [2019-12-27 12:54:19,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-27 12:54:19,780 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:54:19,781 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:54:19,781 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:54:19,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:54:19,781 INFO L82 PathProgramCache]: Analyzing trace with hash 814821392, now seen corresponding path program 1 times [2019-12-27 12:54:19,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:54:19,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842300613] [2019-12-27 12:54:19,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:54:19,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:54:19,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:54:19,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842300613] [2019-12-27 12:54:19,838 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:54:19,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 12:54:19,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196077144] [2019-12-27 12:54:19,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 12:54:19,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:54:19,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 12:54:19,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 12:54:19,840 INFO L87 Difference]: Start difference. First operand 3409 states and 7848 transitions. Second operand 4 states. [2019-12-27 12:54:19,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:54:19,873 INFO L93 Difference]: Finished difference Result 3364 states and 7725 transitions. [2019-12-27 12:54:19,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 12:54:19,874 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-12-27 12:54:19,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:54:19,878 INFO L225 Difference]: With dead ends: 3364 [2019-12-27 12:54:19,879 INFO L226 Difference]: Without dead ends: 3364 [2019-12-27 12:54:19,879 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 12:54:19,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3364 states. [2019-12-27 12:54:19,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3364 to 2982. [2019-12-27 12:54:19,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2982 states. [2019-12-27 12:54:19,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2982 states to 2982 states and 6852 transitions. [2019-12-27 12:54:19,913 INFO L78 Accepts]: Start accepts. Automaton has 2982 states and 6852 transitions. Word has length 85 [2019-12-27 12:54:19,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:54:19,914 INFO L462 AbstractCegarLoop]: Abstraction has 2982 states and 6852 transitions. [2019-12-27 12:54:19,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 12:54:19,914 INFO L276 IsEmpty]: Start isEmpty. Operand 2982 states and 6852 transitions. [2019-12-27 12:54:19,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-27 12:54:19,917 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:54:19,917 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:54:19,917 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:54:19,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:54:19,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1492664144, now seen corresponding path program 1 times [2019-12-27 12:54:19,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:54:19,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817850373] [2019-12-27 12:54:19,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:54:19,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:54:20,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:54:20,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817850373] [2019-12-27 12:54:20,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:54:20,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 12:54:20,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528701454] [2019-12-27 12:54:20,098 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 12:54:20,098 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:54:20,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 12:54:20,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 12:54:20,098 INFO L87 Difference]: Start difference. First operand 2982 states and 6852 transitions. Second operand 8 states. [2019-12-27 12:54:20,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:54:20,466 INFO L93 Difference]: Finished difference Result 3633 states and 8221 transitions. [2019-12-27 12:54:20,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 12:54:20,466 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 85 [2019-12-27 12:54:20,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:54:20,472 INFO L225 Difference]: With dead ends: 3633 [2019-12-27 12:54:20,472 INFO L226 Difference]: Without dead ends: 3611 [2019-12-27 12:54:20,472 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2019-12-27 12:54:20,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3611 states. [2019-12-27 12:54:20,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3611 to 3165. [2019-12-27 12:54:20,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3165 states. [2019-12-27 12:54:20,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3165 states to 3165 states and 7225 transitions. [2019-12-27 12:54:20,506 INFO L78 Accepts]: Start accepts. Automaton has 3165 states and 7225 transitions. Word has length 85 [2019-12-27 12:54:20,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:54:20,506 INFO L462 AbstractCegarLoop]: Abstraction has 3165 states and 7225 transitions. [2019-12-27 12:54:20,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 12:54:20,506 INFO L276 IsEmpty]: Start isEmpty. Operand 3165 states and 7225 transitions. [2019-12-27 12:54:20,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-27 12:54:20,509 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:54:20,509 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:54:20,509 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:54:20,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:54:20,510 INFO L82 PathProgramCache]: Analyzing trace with hash -605160463, now seen corresponding path program 1 times [2019-12-27 12:54:20,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:54:20,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742266842] [2019-12-27 12:54:20,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:54:20,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:54:20,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:54:20,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742266842] [2019-12-27 12:54:20,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:54:20,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 12:54:20,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726365024] [2019-12-27 12:54:20,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 12:54:20,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:54:20,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 12:54:20,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-12-27 12:54:20,665 INFO L87 Difference]: Start difference. First operand 3165 states and 7225 transitions. Second operand 9 states. [2019-12-27 12:54:21,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:54:21,292 INFO L93 Difference]: Finished difference Result 11435 states and 26306 transitions. [2019-12-27 12:54:21,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 12:54:21,292 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-12-27 12:54:21,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:54:21,301 INFO L225 Difference]: With dead ends: 11435 [2019-12-27 12:54:21,302 INFO L226 Difference]: Without dead ends: 7337 [2019-12-27 12:54:21,302 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2019-12-27 12:54:21,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7337 states. [2019-12-27 12:54:21,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7337 to 3288. [2019-12-27 12:54:21,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3288 states. [2019-12-27 12:54:21,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3288 states to 3288 states and 7466 transitions. [2019-12-27 12:54:21,347 INFO L78 Accepts]: Start accepts. Automaton has 3288 states and 7466 transitions. Word has length 85 [2019-12-27 12:54:21,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:54:21,347 INFO L462 AbstractCegarLoop]: Abstraction has 3288 states and 7466 transitions. [2019-12-27 12:54:21,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 12:54:21,348 INFO L276 IsEmpty]: Start isEmpty. Operand 3288 states and 7466 transitions. [2019-12-27 12:54:21,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-27 12:54:21,351 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:54:21,351 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:54:21,352 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:54:21,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:54:21,352 INFO L82 PathProgramCache]: Analyzing trace with hash -779070116, now seen corresponding path program 1 times [2019-12-27 12:54:21,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:54:21,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278152816] [2019-12-27 12:54:21,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:54:21,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:54:21,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:54:21,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278152816] [2019-12-27 12:54:21,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:54:21,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 12:54:21,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205291209] [2019-12-27 12:54:21,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 12:54:21,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:54:21,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 12:54:21,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 12:54:21,465 INFO L87 Difference]: Start difference. First operand 3288 states and 7466 transitions. Second operand 6 states. [2019-12-27 12:54:21,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:54:21,723 INFO L93 Difference]: Finished difference Result 3693 states and 8318 transitions. [2019-12-27 12:54:21,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 12:54:21,723 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 85 [2019-12-27 12:54:21,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:54:21,726 INFO L225 Difference]: With dead ends: 3693 [2019-12-27 12:54:21,727 INFO L226 Difference]: Without dead ends: 3621 [2019-12-27 12:54:21,727 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-27 12:54:21,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3621 states. [2019-12-27 12:54:21,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3621 to 3182. [2019-12-27 12:54:21,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3182 states. [2019-12-27 12:54:21,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3182 states to 3182 states and 7161 transitions. [2019-12-27 12:54:21,755 INFO L78 Accepts]: Start accepts. Automaton has 3182 states and 7161 transitions. Word has length 85 [2019-12-27 12:54:21,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:54:21,756 INFO L462 AbstractCegarLoop]: Abstraction has 3182 states and 7161 transitions. [2019-12-27 12:54:21,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 12:54:21,756 INFO L276 IsEmpty]: Start isEmpty. Operand 3182 states and 7161 transitions. [2019-12-27 12:54:21,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-27 12:54:21,758 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:54:21,758 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:54:21,758 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:54:21,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:54:21,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1438687837, now seen corresponding path program 2 times [2019-12-27 12:54:21,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:54:21,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720646429] [2019-12-27 12:54:21,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:54:21,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:54:21,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:54:21,881 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720646429] [2019-12-27 12:54:21,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:54:21,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 12:54:21,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322348870] [2019-12-27 12:54:21,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 12:54:21,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:54:21,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 12:54:21,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 12:54:21,882 INFO L87 Difference]: Start difference. First operand 3182 states and 7161 transitions. Second operand 7 states. [2019-12-27 12:54:21,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:54:21,967 INFO L93 Difference]: Finished difference Result 5397 states and 12204 transitions. [2019-12-27 12:54:21,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 12:54:21,968 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 85 [2019-12-27 12:54:21,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:54:21,971 INFO L225 Difference]: With dead ends: 5397 [2019-12-27 12:54:21,971 INFO L226 Difference]: Without dead ends: 2304 [2019-12-27 12:54:21,971 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-12-27 12:54:21,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2304 states. [2019-12-27 12:54:21,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2304 to 2304. [2019-12-27 12:54:21,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2304 states. [2019-12-27 12:54:21,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2304 states to 2304 states and 5189 transitions. [2019-12-27 12:54:21,994 INFO L78 Accepts]: Start accepts. Automaton has 2304 states and 5189 transitions. Word has length 85 [2019-12-27 12:54:21,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:54:21,994 INFO L462 AbstractCegarLoop]: Abstraction has 2304 states and 5189 transitions. [2019-12-27 12:54:21,994 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 12:54:21,995 INFO L276 IsEmpty]: Start isEmpty. Operand 2304 states and 5189 transitions. [2019-12-27 12:54:21,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-27 12:54:21,997 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:54:21,997 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:54:21,998 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:54:21,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:54:21,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1677225695, now seen corresponding path program 3 times [2019-12-27 12:54:21,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:54:21,998 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004020644] [2019-12-27 12:54:21,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:54:22,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:54:22,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:54:22,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004020644] [2019-12-27 12:54:22,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:54:22,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 12:54:22,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684887209] [2019-12-27 12:54:22,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 12:54:22,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:54:22,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 12:54:22,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 12:54:22,100 INFO L87 Difference]: Start difference. First operand 2304 states and 5189 transitions. Second operand 5 states. [2019-12-27 12:54:22,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:54:22,142 INFO L93 Difference]: Finished difference Result 2429 states and 5444 transitions. [2019-12-27 12:54:22,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 12:54:22,143 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2019-12-27 12:54:22,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:54:22,146 INFO L225 Difference]: With dead ends: 2429 [2019-12-27 12:54:22,146 INFO L226 Difference]: Without dead ends: 2429 [2019-12-27 12:54:22,146 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 12:54:22,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2429 states. [2019-12-27 12:54:22,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2429 to 2388. [2019-12-27 12:54:22,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2388 states. [2019-12-27 12:54:22,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2388 states to 2388 states and 5359 transitions. [2019-12-27 12:54:22,177 INFO L78 Accepts]: Start accepts. Automaton has 2388 states and 5359 transitions. Word has length 85 [2019-12-27 12:54:22,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:54:22,178 INFO L462 AbstractCegarLoop]: Abstraction has 2388 states and 5359 transitions. [2019-12-27 12:54:22,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 12:54:22,178 INFO L276 IsEmpty]: Start isEmpty. Operand 2388 states and 5359 transitions. [2019-12-27 12:54:22,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-27 12:54:22,181 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:54:22,181 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:54:22,182 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:54:22,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:54:22,182 INFO L82 PathProgramCache]: Analyzing trace with hash -641388152, now seen corresponding path program 1 times [2019-12-27 12:54:22,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:54:22,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186950273] [2019-12-27 12:54:22,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:54:22,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 12:54:22,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 12:54:22,258 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 12:54:22,259 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 12:54:22,453 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 12:54:22 BasicIcfg [2019-12-27 12:54:22,453 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 12:54:22,456 INFO L168 Benchmark]: Toolchain (without parser) took 41556.35 ms. Allocated memory was 145.8 MB in the beginning and 2.1 GB in the end (delta: 1.9 GB). Free memory was 101.8 MB in the beginning and 969.2 MB in the end (delta: -867.4 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-27 12:54:22,457 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 12:54:22,460 INFO L168 Benchmark]: CACSL2BoogieTranslator took 796.29 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 101.4 MB in the beginning and 157.7 MB in the end (delta: -56.3 MB). Peak memory consumption was 21.6 MB. Max. memory is 7.1 GB. [2019-12-27 12:54:22,465 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.45 ms. Allocated memory is still 202.9 MB. Free memory was 157.7 MB in the beginning and 155.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 12:54:22,465 INFO L168 Benchmark]: Boogie Preprocessor took 35.31 ms. Allocated memory is still 202.9 MB. Free memory was 155.0 MB in the beginning and 153.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 12:54:22,466 INFO L168 Benchmark]: RCFGBuilder took 747.83 ms. Allocated memory is still 202.9 MB. Free memory was 153.1 MB in the beginning and 111.7 MB in the end (delta: 41.4 MB). Peak memory consumption was 41.4 MB. Max. memory is 7.1 GB. [2019-12-27 12:54:22,466 INFO L168 Benchmark]: TraceAbstraction took 39903.28 ms. Allocated memory was 202.9 MB in the beginning and 2.1 GB in the end (delta: 1.9 GB). Free memory was 111.0 MB in the beginning and 969.2 MB in the end (delta: -858.2 MB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2019-12-27 12:54:22,472 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 796.29 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 101.4 MB in the beginning and 157.7 MB in the end (delta: -56.3 MB). Peak memory consumption was 21.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 66.45 ms. Allocated memory is still 202.9 MB. Free memory was 157.7 MB in the beginning and 155.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 35.31 ms. Allocated memory is still 202.9 MB. Free memory was 155.0 MB in the beginning and 153.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 747.83 ms. Allocated memory is still 202.9 MB. Free memory was 153.1 MB in the beginning and 111.7 MB in the end (delta: 41.4 MB). Peak memory consumption was 41.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 39903.28 ms. Allocated memory was 202.9 MB in the beginning and 2.1 GB in the end (delta: 1.9 GB). Free memory was 111.0 MB in the beginning and 969.2 MB in the end (delta: -858.2 MB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L695] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L697] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L699] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L701] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L702] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L703] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L705] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L706] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L707] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L708] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L709] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L710] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L711] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L712] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L713] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L714] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L715] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=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}] [L716] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L717] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L718] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L719] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L721] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L722] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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] [L723] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L799] 0 pthread_t t1633; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L800] FCALL, FORK 0 pthread_create(&t1633, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L801] 0 pthread_t t1634; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L802] FCALL, FORK 0 pthread_create(&t1634, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L757] 2 x$w_buff1 = x$w_buff0 [L758] 2 x$w_buff0 = 1 [L759] 2 x$w_buff1_used = x$w_buff0_used [L760] 2 x$w_buff0_used = (_Bool)1 [L5] COND FALSE 2 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L762] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L763] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L764] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L765] 2 x$r_buff0_thd2 = (_Bool)1 [L768] 2 y = 1 [L771] 2 __unbuffered_p1_EAX = y [L774] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L727] 1 y = 2 [L732] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L733] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L734] 1 x$flush_delayed = weak$$choice2 [L735] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L736] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L736] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L737] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L777] 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) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L737] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L738] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L738] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L739] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L739] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L740] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L740] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L741] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))=0, x=0, x$flush_delayed=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L741] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L742] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L742] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L743] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L777] 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) [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L778] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L779] 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 [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L780] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L781] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L744] EXPR 1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=1, x$flush_delayed ? x$mem_tmp : x=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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L744] 1 x = x$flush_delayed ? x$mem_tmp : x [L745] 1 x$flush_delayed = (_Bool)0 [L750] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L781] 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 [L784] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L804] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L808] 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) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L808] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L808] 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) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L808] 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) [L809] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L809] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L810] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L810] 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 [L811] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L811] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L812] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L812] 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 [L815] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L5] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L5] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 130 locations, 2 error locations. Result: UNSAFE, OverallTime: 39.5s, OverallIterations: 28, TraceHistogramMax: 1, AutomataDifference: 16.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7173 SDtfs, 8336 SDslu, 16031 SDs, 0 SdLazy, 5796 SolverSat, 438 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 247 GetRequests, 73 SyntacticMatches, 12 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57890occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 17.6s AutomataMinimizationTime, 27 MinimizatonAttempts, 71604 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 1831 NumberOfCodeBlocks, 1831 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1719 ConstructedInterpolants, 0 QuantifiedInterpolants, 350736 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...