/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/mix009_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 09:36:20,501 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 09:36:20,503 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 09:36:20,521 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 09:36:20,522 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 09:36:20,524 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 09:36:20,526 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 09:36:20,535 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 09:36:20,537 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 09:36:20,538 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 09:36:20,539 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 09:36:20,541 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 09:36:20,541 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 09:36:20,545 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 09:36:20,548 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 09:36:20,549 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 09:36:20,551 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 09:36:20,553 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 09:36:20,554 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 09:36:20,559 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 09:36:20,564 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 09:36:20,566 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 09:36:20,567 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 09:36:20,568 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 09:36:20,570 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 09:36:20,570 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 09:36:20,570 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 09:36:20,571 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 09:36:20,571 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 09:36:20,572 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 09:36:20,572 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 09:36:20,573 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 09:36:20,574 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 09:36:20,574 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 09:36:20,575 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 09:36:20,575 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 09:36:20,576 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 09:36:20,576 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 09:36:20,576 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 09:36:20,577 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 09:36:20,578 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 09:36:20,579 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 09:36:20,592 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 09:36:20,593 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 09:36:20,594 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 09:36:20,594 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 09:36:20,594 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 09:36:20,595 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 09:36:20,595 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 09:36:20,595 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 09:36:20,595 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 09:36:20,595 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 09:36:20,595 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 09:36:20,596 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 09:36:20,596 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 09:36:20,596 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 09:36:20,596 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 09:36:20,596 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 09:36:20,597 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 09:36:20,597 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 09:36:20,597 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 09:36:20,597 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 09:36:20,598 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 09:36:20,598 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 09:36:20,598 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 09:36:20,598 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 09:36:20,599 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 09:36:20,599 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 09:36:20,599 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 09:36:20,599 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-27 09:36:20,599 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 09:36:20,599 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 09:36:20,885 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 09:36:20,901 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 09:36:20,904 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 09:36:20,905 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 09:36:20,905 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 09:36:20,906 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix009_power.opt.i [2019-12-27 09:36:20,967 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49c82c680/64b1d211d59c44e0ba7971aaa36db006/FLAG421560e92 [2019-12-27 09:36:21,592 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 09:36:21,593 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix009_power.opt.i [2019-12-27 09:36:21,614 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49c82c680/64b1d211d59c44e0ba7971aaa36db006/FLAG421560e92 [2019-12-27 09:36:21,849 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49c82c680/64b1d211d59c44e0ba7971aaa36db006 [2019-12-27 09:36:21,857 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 09:36:21,860 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 09:36:21,861 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 09:36:21,861 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 09:36:21,867 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 09:36:21,867 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:36:21" (1/1) ... [2019-12-27 09:36:21,871 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5be7c6d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:36:21, skipping insertion in model container [2019-12-27 09:36:21,871 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:36:21" (1/1) ... [2019-12-27 09:36:21,879 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 09:36:21,932 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 09:36:22,439 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 09:36:22,458 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 09:36:22,526 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 09:36:22,598 INFO L208 MainTranslator]: Completed translation [2019-12-27 09:36:22,599 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:36:22 WrapperNode [2019-12-27 09:36:22,599 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 09:36:22,600 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 09:36:22,600 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 09:36:22,600 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 09:36:22,609 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:36:22" (1/1) ... [2019-12-27 09:36:22,631 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:36:22" (1/1) ... [2019-12-27 09:36:22,666 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 09:36:22,666 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 09:36:22,667 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 09:36:22,667 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 09:36:22,677 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:36:22" (1/1) ... [2019-12-27 09:36:22,677 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:36:22" (1/1) ... [2019-12-27 09:36:22,682 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:36:22" (1/1) ... [2019-12-27 09:36:22,683 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:36:22" (1/1) ... [2019-12-27 09:36:22,694 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:36:22" (1/1) ... [2019-12-27 09:36:22,699 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:36:22" (1/1) ... [2019-12-27 09:36:22,703 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:36:22" (1/1) ... [2019-12-27 09:36:22,718 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 09:36:22,722 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 09:36:22,722 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 09:36:22,722 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 09:36:22,723 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:36:22" (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 09:36:22,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 09:36:22,805 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 09:36:22,805 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 09:36:22,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 09:36:22,806 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 09:36:22,806 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 09:36:22,807 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 09:36:22,808 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 09:36:22,808 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 09:36:22,809 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 09:36:22,809 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 09:36:22,812 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 09:36:23,777 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 09:36:23,778 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 09:36:23,779 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:36:23 BoogieIcfgContainer [2019-12-27 09:36:23,780 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 09:36:23,781 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 09:36:23,781 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 09:36:23,784 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 09:36:23,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 09:36:21" (1/3) ... [2019-12-27 09:36:23,786 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30d66d34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:36:23, skipping insertion in model container [2019-12-27 09:36:23,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:36:22" (2/3) ... [2019-12-27 09:36:23,787 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30d66d34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:36:23, skipping insertion in model container [2019-12-27 09:36:23,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:36:23" (3/3) ... [2019-12-27 09:36:23,789 INFO L109 eAbstractionObserver]: Analyzing ICFG mix009_power.opt.i [2019-12-27 09:36:23,800 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 09:36:23,800 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 09:36:23,809 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 09:36:23,810 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 09:36:23,861 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,861 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,862 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,862 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,862 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,879 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,879 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,879 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,882 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,883 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,883 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,884 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,884 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,884 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,884 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,885 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,885 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,885 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,885 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,885 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,886 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,886 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,886 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,887 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,887 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,888 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,888 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,889 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,889 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,889 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,889 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,889 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,890 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,890 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,890 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,890 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,891 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,891 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,894 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,894 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,894 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,895 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,895 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,895 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,896 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,896 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,897 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,897 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,897 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,897 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,897 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,898 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,898 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,898 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,898 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,899 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,899 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,899 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,899 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,901 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,901 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,901 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,903 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,903 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,903 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,904 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,904 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,904 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,904 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,904 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,905 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,905 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,905 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,905 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,906 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,907 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,907 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,907 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,908 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,909 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,909 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,909 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,910 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,910 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,910 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,910 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,917 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,917 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,917 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,917 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,918 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,918 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,919 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,958 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,962 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,963 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,963 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,963 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,963 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,964 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,964 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,964 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,964 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,964 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,966 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,970 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,971 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,971 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,971 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,971 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,974 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,974 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,974 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,974 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,975 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,975 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,975 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,981 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,983 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,985 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:23,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:36:24,004 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 09:36:24,028 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 09:36:24,028 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 09:36:24,028 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 09:36:24,028 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 09:36:24,028 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 09:36:24,028 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 09:36:24,029 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 09:36:24,029 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 09:36:24,047 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 180 places, 229 transitions [2019-12-27 09:36:31,885 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 80074 states. [2019-12-27 09:36:31,887 INFO L276 IsEmpty]: Start isEmpty. Operand 80074 states. [2019-12-27 09:36:31,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 09:36:31,897 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:36:31,898 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] [2019-12-27 09:36:31,899 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:36:31,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:36:31,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1419186758, now seen corresponding path program 1 times [2019-12-27 09:36:31,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:36:31,915 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323345440] [2019-12-27 09:36:31,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:36:32,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:36:32,224 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 09:36:32,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323345440] [2019-12-27 09:36:32,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:36:32,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 09:36:32,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102006465] [2019-12-27 09:36:32,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 09:36:32,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:36:32,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 09:36:32,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 09:36:32,248 INFO L87 Difference]: Start difference. First operand 80074 states. Second operand 4 states. [2019-12-27 09:36:34,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:36:34,742 INFO L93 Difference]: Finished difference Result 80714 states and 324639 transitions. [2019-12-27 09:36:34,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 09:36:34,745 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-12-27 09:36:34,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:36:35,183 INFO L225 Difference]: With dead ends: 80714 [2019-12-27 09:36:35,183 INFO L226 Difference]: Without dead ends: 59002 [2019-12-27 09:36:35,187 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 09:36:37,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59002 states. [2019-12-27 09:36:39,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59002 to 59002. [2019-12-27 09:36:39,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59002 states. [2019-12-27 09:36:39,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59002 states to 59002 states and 240127 transitions. [2019-12-27 09:36:39,901 INFO L78 Accepts]: Start accepts. Automaton has 59002 states and 240127 transitions. Word has length 41 [2019-12-27 09:36:39,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:36:39,904 INFO L462 AbstractCegarLoop]: Abstraction has 59002 states and 240127 transitions. [2019-12-27 09:36:39,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 09:36:39,904 INFO L276 IsEmpty]: Start isEmpty. Operand 59002 states and 240127 transitions. [2019-12-27 09:36:39,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-27 09:36:39,919 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:36:39,919 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] [2019-12-27 09:36:39,920 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:36:39,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:36:39,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1596822137, now seen corresponding path program 1 times [2019-12-27 09:36:39,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:36:39,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141559141] [2019-12-27 09:36:39,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:36:39,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:36:40,134 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 09:36:40,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141559141] [2019-12-27 09:36:40,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:36:40,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 09:36:40,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430334698] [2019-12-27 09:36:40,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 09:36:40,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:36:40,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 09:36:40,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 09:36:40,139 INFO L87 Difference]: Start difference. First operand 59002 states and 240127 transitions. Second operand 5 states. [2019-12-27 09:36:43,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:36:43,785 INFO L93 Difference]: Finished difference Result 95596 states and 363718 transitions. [2019-12-27 09:36:43,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 09:36:43,786 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-12-27 09:36:43,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:36:44,419 INFO L225 Difference]: With dead ends: 95596 [2019-12-27 09:36:44,419 INFO L226 Difference]: Without dead ends: 95044 [2019-12-27 09:36:44,420 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 09:36:45,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95044 states. [2019-12-27 09:36:48,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95044 to 93166. [2019-12-27 09:36:48,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93166 states. [2019-12-27 09:36:51,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93166 states to 93166 states and 356304 transitions. [2019-12-27 09:36:51,953 INFO L78 Accepts]: Start accepts. Automaton has 93166 states and 356304 transitions. Word has length 49 [2019-12-27 09:36:51,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:36:51,955 INFO L462 AbstractCegarLoop]: Abstraction has 93166 states and 356304 transitions. [2019-12-27 09:36:51,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 09:36:51,955 INFO L276 IsEmpty]: Start isEmpty. Operand 93166 states and 356304 transitions. [2019-12-27 09:36:51,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-27 09:36:51,962 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:36:51,962 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 09:36:51,963 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:36:51,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:36:51,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1178649803, now seen corresponding path program 1 times [2019-12-27 09:36:51,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:36:51,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450707842] [2019-12-27 09:36:51,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:36:51,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:36:52,056 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 09:36:52,056 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450707842] [2019-12-27 09:36:52,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:36:52,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 09:36:52,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678105219] [2019-12-27 09:36:52,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 09:36:52,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:36:52,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 09:36:52,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 09:36:52,058 INFO L87 Difference]: Start difference. First operand 93166 states and 356304 transitions. Second operand 5 states. [2019-12-27 09:36:54,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:36:54,084 INFO L93 Difference]: Finished difference Result 118510 states and 442885 transitions. [2019-12-27 09:36:54,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 09:36:54,085 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2019-12-27 09:36:54,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:36:54,380 INFO L225 Difference]: With dead ends: 118510 [2019-12-27 09:36:54,380 INFO L226 Difference]: Without dead ends: 118062 [2019-12-27 09:36:54,380 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 09:36:59,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118062 states. [2019-12-27 09:37:00,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118062 to 104155. [2019-12-27 09:37:00,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104155 states. [2019-12-27 09:37:01,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104155 states to 104155 states and 394238 transitions. [2019-12-27 09:37:01,168 INFO L78 Accepts]: Start accepts. Automaton has 104155 states and 394238 transitions. Word has length 50 [2019-12-27 09:37:01,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:37:01,169 INFO L462 AbstractCegarLoop]: Abstraction has 104155 states and 394238 transitions. [2019-12-27 09:37:01,169 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 09:37:01,169 INFO L276 IsEmpty]: Start isEmpty. Operand 104155 states and 394238 transitions. [2019-12-27 09:37:01,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 09:37:01,181 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:37:01,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] [2019-12-27 09:37:01,181 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:37:01,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:37:01,182 INFO L82 PathProgramCache]: Analyzing trace with hash -305372623, now seen corresponding path program 1 times [2019-12-27 09:37:01,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:37:01,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461156155] [2019-12-27 09:37:01,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:37:01,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:37:01,237 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 09:37:01,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461156155] [2019-12-27 09:37:01,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:37:01,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 09:37:01,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712215161] [2019-12-27 09:37:01,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 09:37:01,240 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:37:01,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 09:37:01,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 09:37:01,240 INFO L87 Difference]: Start difference. First operand 104155 states and 394238 transitions. Second operand 3 states. [2019-12-27 09:37:02,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:37:02,817 INFO L93 Difference]: Finished difference Result 170913 states and 627060 transitions. [2019-12-27 09:37:02,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 09:37:02,818 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 09:37:02,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:37:03,261 INFO L225 Difference]: With dead ends: 170913 [2019-12-27 09:37:03,261 INFO L226 Difference]: Without dead ends: 170913 [2019-12-27 09:37:03,262 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 09:37:09,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170913 states. [2019-12-27 09:37:12,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170913 to 157191. [2019-12-27 09:37:12,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157191 states. [2019-12-27 09:37:12,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157191 states to 157191 states and 581292 transitions. [2019-12-27 09:37:12,557 INFO L78 Accepts]: Start accepts. Automaton has 157191 states and 581292 transitions. Word has length 52 [2019-12-27 09:37:12,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:37:12,557 INFO L462 AbstractCegarLoop]: Abstraction has 157191 states and 581292 transitions. [2019-12-27 09:37:12,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 09:37:12,557 INFO L276 IsEmpty]: Start isEmpty. Operand 157191 states and 581292 transitions. [2019-12-27 09:37:12,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 09:37:12,581 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:37:12,581 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] [2019-12-27 09:37:12,582 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:37:12,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:37:12,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1580132604, now seen corresponding path program 1 times [2019-12-27 09:37:12,582 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:37:12,583 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688942017] [2019-12-27 09:37:12,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:37:12,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:37:12,701 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 09:37:12,701 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688942017] [2019-12-27 09:37:12,702 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:37:12,702 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 09:37:12,702 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840831892] [2019-12-27 09:37:12,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 09:37:12,703 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:37:12,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 09:37:12,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 09:37:12,703 INFO L87 Difference]: Start difference. First operand 157191 states and 581292 transitions. Second operand 6 states. [2019-12-27 09:37:19,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:37:19,799 INFO L93 Difference]: Finished difference Result 212575 states and 766174 transitions. [2019-12-27 09:37:19,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 09:37:19,800 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-12-27 09:37:19,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:37:20,335 INFO L225 Difference]: With dead ends: 212575 [2019-12-27 09:37:20,335 INFO L226 Difference]: Without dead ends: 212055 [2019-12-27 09:37:20,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-12-27 09:37:22,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212055 states. [2019-12-27 09:37:25,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212055 to 157973. [2019-12-27 09:37:25,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157973 states. [2019-12-27 09:37:25,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157973 states to 157973 states and 584229 transitions. [2019-12-27 09:37:25,480 INFO L78 Accepts]: Start accepts. Automaton has 157973 states and 584229 transitions. Word has length 56 [2019-12-27 09:37:25,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:37:25,480 INFO L462 AbstractCegarLoop]: Abstraction has 157973 states and 584229 transitions. [2019-12-27 09:37:25,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 09:37:25,480 INFO L276 IsEmpty]: Start isEmpty. Operand 157973 states and 584229 transitions. [2019-12-27 09:37:25,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 09:37:25,500 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:37:25,500 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] [2019-12-27 09:37:25,500 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:37:25,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:37:25,501 INFO L82 PathProgramCache]: Analyzing trace with hash 193567859, now seen corresponding path program 1 times [2019-12-27 09:37:25,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:37:25,501 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18020832] [2019-12-27 09:37:25,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:37:25,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:37:25,587 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 09:37:25,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18020832] [2019-12-27 09:37:25,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:37:25,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 09:37:25,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164726192] [2019-12-27 09:37:25,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 09:37:25,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:37:25,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 09:37:25,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 09:37:25,590 INFO L87 Difference]: Start difference. First operand 157973 states and 584229 transitions. Second operand 3 states. [2019-12-27 09:37:27,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:37:27,882 INFO L93 Difference]: Finished difference Result 175833 states and 650717 transitions. [2019-12-27 09:37:27,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 09:37:27,884 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-27 09:37:27,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:37:28,332 INFO L225 Difference]: With dead ends: 175833 [2019-12-27 09:37:28,332 INFO L226 Difference]: Without dead ends: 175833 [2019-12-27 09:37:28,333 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 09:37:31,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175833 states. [2019-12-27 09:37:38,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175833 to 166853. [2019-12-27 09:37:38,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166853 states. [2019-12-27 09:37:40,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166853 states to 166853 states and 617305 transitions. [2019-12-27 09:37:40,174 INFO L78 Accepts]: Start accepts. Automaton has 166853 states and 617305 transitions. Word has length 56 [2019-12-27 09:37:40,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:37:40,174 INFO L462 AbstractCegarLoop]: Abstraction has 166853 states and 617305 transitions. [2019-12-27 09:37:40,174 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 09:37:40,174 INFO L276 IsEmpty]: Start isEmpty. Operand 166853 states and 617305 transitions. [2019-12-27 09:37:40,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 09:37:40,196 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:37:40,196 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] [2019-12-27 09:37:40,196 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:37:40,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:37:40,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1320483597, now seen corresponding path program 1 times [2019-12-27 09:37:40,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:37:40,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900490265] [2019-12-27 09:37:40,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:37:40,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:37:40,319 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 09:37:40,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900490265] [2019-12-27 09:37:40,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:37:40,320 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 09:37:40,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649957180] [2019-12-27 09:37:40,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 09:37:40,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:37:40,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 09:37:40,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 09:37:40,323 INFO L87 Difference]: Start difference. First operand 166853 states and 617305 transitions. Second operand 6 states. [2019-12-27 09:37:47,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:37:47,675 INFO L93 Difference]: Finished difference Result 213770 states and 787341 transitions. [2019-12-27 09:37:47,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 09:37:47,675 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-12-27 09:37:47,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:37:48,266 INFO L225 Difference]: With dead ends: 213770 [2019-12-27 09:37:48,266 INFO L226 Difference]: Without dead ends: 213770 [2019-12-27 09:37:48,266 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 09:37:50,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213770 states. [2019-12-27 09:37:53,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213770 to 193996. [2019-12-27 09:37:53,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193996 states. [2019-12-27 09:37:54,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193996 states to 193996 states and 714237 transitions. [2019-12-27 09:37:54,523 INFO L78 Accepts]: Start accepts. Automaton has 193996 states and 714237 transitions. Word has length 56 [2019-12-27 09:37:54,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:37:54,523 INFO L462 AbstractCegarLoop]: Abstraction has 193996 states and 714237 transitions. [2019-12-27 09:37:54,523 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 09:37:54,524 INFO L276 IsEmpty]: Start isEmpty. Operand 193996 states and 714237 transitions. [2019-12-27 09:37:54,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 09:37:54,548 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:37:54,548 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] [2019-12-27 09:37:54,548 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:37:54,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:37:54,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1177532340, now seen corresponding path program 1 times [2019-12-27 09:37:54,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:37:54,549 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819200872] [2019-12-27 09:37:54,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:37:54,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:37:54,652 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 09:37:54,652 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819200872] [2019-12-27 09:37:54,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:37:54,653 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 09:37:54,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450961590] [2019-12-27 09:37:54,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 09:37:54,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:37:54,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 09:37:54,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 09:37:54,654 INFO L87 Difference]: Start difference. First operand 193996 states and 714237 transitions. Second operand 7 states. [2019-12-27 09:37:58,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:37:58,223 INFO L93 Difference]: Finished difference Result 277139 states and 986577 transitions. [2019-12-27 09:37:58,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 09:37:58,224 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2019-12-27 09:37:58,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:37:58,980 INFO L225 Difference]: With dead ends: 277139 [2019-12-27 09:37:58,981 INFO L226 Difference]: Without dead ends: 277139 [2019-12-27 09:37:58,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 09:38:08,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277139 states. [2019-12-27 09:38:12,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277139 to 222095. [2019-12-27 09:38:12,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222095 states. [2019-12-27 09:38:12,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222095 states to 222095 states and 805381 transitions. [2019-12-27 09:38:12,841 INFO L78 Accepts]: Start accepts. Automaton has 222095 states and 805381 transitions. Word has length 56 [2019-12-27 09:38:12,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:38:12,842 INFO L462 AbstractCegarLoop]: Abstraction has 222095 states and 805381 transitions. [2019-12-27 09:38:12,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 09:38:12,842 INFO L276 IsEmpty]: Start isEmpty. Operand 222095 states and 805381 transitions. [2019-12-27 09:38:12,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 09:38:12,865 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:38:12,865 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] [2019-12-27 09:38:12,865 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:38:12,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:38:12,865 INFO L82 PathProgramCache]: Analyzing trace with hash 2065036021, now seen corresponding path program 1 times [2019-12-27 09:38:12,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:38:12,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136118342] [2019-12-27 09:38:12,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:38:12,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:38:12,916 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 09:38:12,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136118342] [2019-12-27 09:38:12,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:38:12,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 09:38:12,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564753349] [2019-12-27 09:38:12,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 09:38:12,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:38:12,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 09:38:12,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 09:38:12,918 INFO L87 Difference]: Start difference. First operand 222095 states and 805381 transitions. Second operand 3 states. [2019-12-27 09:38:15,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:38:15,007 INFO L93 Difference]: Finished difference Result 176991 states and 632039 transitions. [2019-12-27 09:38:15,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 09:38:15,007 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-27 09:38:15,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:38:15,451 INFO L225 Difference]: With dead ends: 176991 [2019-12-27 09:38:15,452 INFO L226 Difference]: Without dead ends: 176991 [2019-12-27 09:38:15,452 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 09:38:23,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176991 states. [2019-12-27 09:38:25,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176991 to 172179. [2019-12-27 09:38:25,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172179 states. [2019-12-27 09:38:27,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172179 states to 172179 states and 617064 transitions. [2019-12-27 09:38:27,122 INFO L78 Accepts]: Start accepts. Automaton has 172179 states and 617064 transitions. Word has length 56 [2019-12-27 09:38:27,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:38:27,122 INFO L462 AbstractCegarLoop]: Abstraction has 172179 states and 617064 transitions. [2019-12-27 09:38:27,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 09:38:27,122 INFO L276 IsEmpty]: Start isEmpty. Operand 172179 states and 617064 transitions. [2019-12-27 09:38:27,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 09:38:27,144 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:38:27,144 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] [2019-12-27 09:38:27,144 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:38:27,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:38:27,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1638616881, now seen corresponding path program 1 times [2019-12-27 09:38:27,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:38:27,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241027940] [2019-12-27 09:38:27,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:38:27,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:38:27,254 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 09:38:27,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241027940] [2019-12-27 09:38:27,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:38:27,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 09:38:27,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430513645] [2019-12-27 09:38:27,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 09:38:27,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:38:27,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 09:38:27,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 09:38:27,256 INFO L87 Difference]: Start difference. First operand 172179 states and 617064 transitions. Second operand 6 states. [2019-12-27 09:38:30,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:38:30,003 INFO L93 Difference]: Finished difference Result 216118 states and 757197 transitions. [2019-12-27 09:38:30,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 09:38:30,003 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-12-27 09:38:30,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:38:30,510 INFO L225 Difference]: With dead ends: 216118 [2019-12-27 09:38:30,511 INFO L226 Difference]: Without dead ends: 216118 [2019-12-27 09:38:30,511 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 09:38:38,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216118 states. [2019-12-27 09:38:41,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216118 to 185519. [2019-12-27 09:38:41,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185519 states. [2019-12-27 09:38:41,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185519 states to 185519 states and 660439 transitions. [2019-12-27 09:38:41,602 INFO L78 Accepts]: Start accepts. Automaton has 185519 states and 660439 transitions. Word has length 57 [2019-12-27 09:38:41,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:38:41,603 INFO L462 AbstractCegarLoop]: Abstraction has 185519 states and 660439 transitions. [2019-12-27 09:38:41,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 09:38:41,603 INFO L276 IsEmpty]: Start isEmpty. Operand 185519 states and 660439 transitions. [2019-12-27 09:38:41,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 09:38:41,618 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:38:41,618 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] [2019-12-27 09:38:41,619 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:38:41,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:38:41,619 INFO L82 PathProgramCache]: Analyzing trace with hash -751113200, now seen corresponding path program 1 times [2019-12-27 09:38:41,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:38:41,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932008677] [2019-12-27 09:38:41,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:38:41,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:38:41,705 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 09:38:41,705 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932008677] [2019-12-27 09:38:41,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:38:41,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 09:38:41,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736219587] [2019-12-27 09:38:41,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 09:38:41,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:38:41,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 09:38:41,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 09:38:41,707 INFO L87 Difference]: Start difference. First operand 185519 states and 660439 transitions. Second operand 4 states. [2019-12-27 09:38:41,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:38:41,847 INFO L93 Difference]: Finished difference Result 24459 states and 76335 transitions. [2019-12-27 09:38:41,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 09:38:41,848 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-12-27 09:38:41,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:38:41,880 INFO L225 Difference]: With dead ends: 24459 [2019-12-27 09:38:41,880 INFO L226 Difference]: Without dead ends: 18440 [2019-12-27 09:38:41,880 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 09:38:41,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18440 states. [2019-12-27 09:38:42,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18440 to 18193. [2019-12-27 09:38:42,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18193 states. [2019-12-27 09:38:42,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18193 states to 18193 states and 54576 transitions. [2019-12-27 09:38:42,118 INFO L78 Accepts]: Start accepts. Automaton has 18193 states and 54576 transitions. Word has length 57 [2019-12-27 09:38:42,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:38:42,119 INFO L462 AbstractCegarLoop]: Abstraction has 18193 states and 54576 transitions. [2019-12-27 09:38:42,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 09:38:42,119 INFO L276 IsEmpty]: Start isEmpty. Operand 18193 states and 54576 transitions. [2019-12-27 09:38:42,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 09:38:42,123 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:38:42,123 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] [2019-12-27 09:38:42,124 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:38:42,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:38:42,124 INFO L82 PathProgramCache]: Analyzing trace with hash -914504522, now seen corresponding path program 1 times [2019-12-27 09:38:42,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:38:42,124 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030343667] [2019-12-27 09:38:42,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:38:42,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:38:42,172 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 09:38:42,172 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030343667] [2019-12-27 09:38:42,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:38:42,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 09:38:42,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275529255] [2019-12-27 09:38:42,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 09:38:42,174 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:38:42,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 09:38:42,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 09:38:42,174 INFO L87 Difference]: Start difference. First operand 18193 states and 54576 transitions. Second operand 4 states. [2019-12-27 09:38:42,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:38:42,489 INFO L93 Difference]: Finished difference Result 23513 states and 70754 transitions. [2019-12-27 09:38:42,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 09:38:42,490 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-27 09:38:42,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:38:42,523 INFO L225 Difference]: With dead ends: 23513 [2019-12-27 09:38:42,523 INFO L226 Difference]: Without dead ends: 23513 [2019-12-27 09:38:42,523 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 09:38:42,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23513 states. [2019-12-27 09:38:43,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23513 to 21215. [2019-12-27 09:38:43,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21215 states. [2019-12-27 09:38:43,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21215 states to 21215 states and 63561 transitions. [2019-12-27 09:38:43,860 INFO L78 Accepts]: Start accepts. Automaton has 21215 states and 63561 transitions. Word has length 66 [2019-12-27 09:38:43,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:38:43,860 INFO L462 AbstractCegarLoop]: Abstraction has 21215 states and 63561 transitions. [2019-12-27 09:38:43,860 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 09:38:43,860 INFO L276 IsEmpty]: Start isEmpty. Operand 21215 states and 63561 transitions. [2019-12-27 09:38:43,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 09:38:43,866 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:38:43,866 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] [2019-12-27 09:38:43,866 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:38:43,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:38:43,867 INFO L82 PathProgramCache]: Analyzing trace with hash 828305813, now seen corresponding path program 1 times [2019-12-27 09:38:43,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:38:43,867 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590759840] [2019-12-27 09:38:43,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:38:43,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:38:43,941 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 09:38:43,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590759840] [2019-12-27 09:38:43,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:38:43,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 09:38:43,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298203128] [2019-12-27 09:38:43,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 09:38:43,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:38:43,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 09:38:43,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 09:38:43,944 INFO L87 Difference]: Start difference. First operand 21215 states and 63561 transitions. Second operand 6 states. [2019-12-27 09:38:44,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:38:44,616 INFO L93 Difference]: Finished difference Result 30327 states and 89101 transitions. [2019-12-27 09:38:44,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 09:38:44,616 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-12-27 09:38:44,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:38:44,660 INFO L225 Difference]: With dead ends: 30327 [2019-12-27 09:38:44,660 INFO L226 Difference]: Without dead ends: 30279 [2019-12-27 09:38:44,660 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 09:38:44,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30279 states. [2019-12-27 09:38:44,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30279 to 27632. [2019-12-27 09:38:44,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27632 states. [2019-12-27 09:38:45,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27632 states to 27632 states and 81448 transitions. [2019-12-27 09:38:45,029 INFO L78 Accepts]: Start accepts. Automaton has 27632 states and 81448 transitions. Word has length 66 [2019-12-27 09:38:45,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:38:45,029 INFO L462 AbstractCegarLoop]: Abstraction has 27632 states and 81448 transitions. [2019-12-27 09:38:45,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 09:38:45,029 INFO L276 IsEmpty]: Start isEmpty. Operand 27632 states and 81448 transitions. [2019-12-27 09:38:45,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-27 09:38:45,038 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:38:45,039 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] [2019-12-27 09:38:45,039 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:38:45,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:38:45,039 INFO L82 PathProgramCache]: Analyzing trace with hash 17339334, now seen corresponding path program 1 times [2019-12-27 09:38:45,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:38:45,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194750188] [2019-12-27 09:38:45,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:38:45,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:38:45,084 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 09:38:45,085 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194750188] [2019-12-27 09:38:45,085 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:38:45,085 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 09:38:45,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647724865] [2019-12-27 09:38:45,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 09:38:45,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:38:45,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 09:38:45,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 09:38:45,086 INFO L87 Difference]: Start difference. First operand 27632 states and 81448 transitions. Second operand 3 states. [2019-12-27 09:38:45,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:38:45,259 INFO L93 Difference]: Finished difference Result 30275 states and 87662 transitions. [2019-12-27 09:38:45,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 09:38:45,260 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-12-27 09:38:45,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:38:45,301 INFO L225 Difference]: With dead ends: 30275 [2019-12-27 09:38:45,301 INFO L226 Difference]: Without dead ends: 30275 [2019-12-27 09:38:45,302 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 09:38:45,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30275 states. [2019-12-27 09:38:46,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30275 to 26780. [2019-12-27 09:38:46,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26780 states. [2019-12-27 09:38:46,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26780 states to 26780 states and 76976 transitions. [2019-12-27 09:38:46,729 INFO L78 Accepts]: Start accepts. Automaton has 26780 states and 76976 transitions. Word has length 72 [2019-12-27 09:38:46,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:38:46,730 INFO L462 AbstractCegarLoop]: Abstraction has 26780 states and 76976 transitions. [2019-12-27 09:38:46,730 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 09:38:46,730 INFO L276 IsEmpty]: Start isEmpty. Operand 26780 states and 76976 transitions. [2019-12-27 09:38:46,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-27 09:38:46,740 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:38:46,740 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] [2019-12-27 09:38:46,741 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:38:46,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:38:46,741 INFO L82 PathProgramCache]: Analyzing trace with hash -709057717, now seen corresponding path program 1 times [2019-12-27 09:38:46,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:38:46,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135673805] [2019-12-27 09:38:46,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:38:46,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:38:46,812 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 09:38:46,813 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135673805] [2019-12-27 09:38:46,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:38:46,813 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 09:38:46,813 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836687591] [2019-12-27 09:38:46,814 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 09:38:46,814 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:38:46,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 09:38:46,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 09:38:46,814 INFO L87 Difference]: Start difference. First operand 26780 states and 76976 transitions. Second operand 5 states. [2019-12-27 09:38:46,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:38:46,878 INFO L93 Difference]: Finished difference Result 10367 states and 25885 transitions. [2019-12-27 09:38:46,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 09:38:46,879 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 74 [2019-12-27 09:38:46,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:38:46,890 INFO L225 Difference]: With dead ends: 10367 [2019-12-27 09:38:46,890 INFO L226 Difference]: Without dead ends: 9062 [2019-12-27 09:38:46,890 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 09:38:46,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9062 states. [2019-12-27 09:38:46,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9062 to 7007. [2019-12-27 09:38:46,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7007 states. [2019-12-27 09:38:46,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7007 states to 7007 states and 17495 transitions. [2019-12-27 09:38:46,983 INFO L78 Accepts]: Start accepts. Automaton has 7007 states and 17495 transitions. Word has length 74 [2019-12-27 09:38:46,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:38:46,983 INFO L462 AbstractCegarLoop]: Abstraction has 7007 states and 17495 transitions. [2019-12-27 09:38:46,983 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 09:38:46,983 INFO L276 IsEmpty]: Start isEmpty. Operand 7007 states and 17495 transitions. [2019-12-27 09:38:46,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-27 09:38:46,991 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:38:46,991 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 09:38:46,991 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:38:46,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:38:46,991 INFO L82 PathProgramCache]: Analyzing trace with hash -59117604, now seen corresponding path program 1 times [2019-12-27 09:38:46,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:38:46,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155136762] [2019-12-27 09:38:46,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:38:47,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:38:47,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 09:38:47,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155136762] [2019-12-27 09:38:47,100 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:38:47,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 09:38:47,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388293093] [2019-12-27 09:38:47,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 09:38:47,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:38:47,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 09:38:47,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 09:38:47,102 INFO L87 Difference]: Start difference. First operand 7007 states and 17495 transitions. Second operand 7 states. [2019-12-27 09:38:48,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:38:48,167 INFO L93 Difference]: Finished difference Result 13379 states and 32512 transitions. [2019-12-27 09:38:48,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 09:38:48,167 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 103 [2019-12-27 09:38:48,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:38:48,184 INFO L225 Difference]: With dead ends: 13379 [2019-12-27 09:38:48,184 INFO L226 Difference]: Without dead ends: 13357 [2019-12-27 09:38:48,184 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-12-27 09:38:48,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13357 states. [2019-12-27 09:38:48,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13357 to 11727. [2019-12-27 09:38:48,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11727 states. [2019-12-27 09:38:48,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11727 states to 11727 states and 28811 transitions. [2019-12-27 09:38:48,326 INFO L78 Accepts]: Start accepts. Automaton has 11727 states and 28811 transitions. Word has length 103 [2019-12-27 09:38:48,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:38:48,326 INFO L462 AbstractCegarLoop]: Abstraction has 11727 states and 28811 transitions. [2019-12-27 09:38:48,326 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 09:38:48,326 INFO L276 IsEmpty]: Start isEmpty. Operand 11727 states and 28811 transitions. [2019-12-27 09:38:48,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-27 09:38:48,342 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:38:48,342 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 09:38:48,343 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:38:48,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:38:48,343 INFO L82 PathProgramCache]: Analyzing trace with hash -70433731, now seen corresponding path program 1 times [2019-12-27 09:38:48,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:38:48,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950177339] [2019-12-27 09:38:48,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:38:48,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:38:48,418 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 09:38:48,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950177339] [2019-12-27 09:38:48,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:38:48,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 09:38:48,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355122890] [2019-12-27 09:38:48,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 09:38:48,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:38:48,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 09:38:48,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 09:38:48,420 INFO L87 Difference]: Start difference. First operand 11727 states and 28811 transitions. Second operand 4 states. [2019-12-27 09:38:48,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:38:48,690 INFO L93 Difference]: Finished difference Result 13008 states and 31435 transitions. [2019-12-27 09:38:48,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 09:38:48,690 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-12-27 09:38:48,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:38:48,709 INFO L225 Difference]: With dead ends: 13008 [2019-12-27 09:38:48,709 INFO L226 Difference]: Without dead ends: 12944 [2019-12-27 09:38:48,710 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 09:38:48,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12944 states. [2019-12-27 09:38:48,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12944 to 12430. [2019-12-27 09:38:48,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12430 states. [2019-12-27 09:38:48,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12430 states to 12430 states and 30202 transitions. [2019-12-27 09:38:48,915 INFO L78 Accepts]: Start accepts. Automaton has 12430 states and 30202 transitions. Word has length 103 [2019-12-27 09:38:48,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:38:48,915 INFO L462 AbstractCegarLoop]: Abstraction has 12430 states and 30202 transitions. [2019-12-27 09:38:48,915 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 09:38:48,915 INFO L276 IsEmpty]: Start isEmpty. Operand 12430 states and 30202 transitions. [2019-12-27 09:38:48,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-27 09:38:48,931 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:38:48,931 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 09:38:48,931 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:38:48,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:38:48,932 INFO L82 PathProgramCache]: Analyzing trace with hash -2069221445, now seen corresponding path program 1 times [2019-12-27 09:38:48,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:38:48,932 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545120033] [2019-12-27 09:38:48,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:38:48,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:38:49,076 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 09:38:49,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545120033] [2019-12-27 09:38:49,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:38:49,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 09:38:49,078 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780445431] [2019-12-27 09:38:49,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 09:38:49,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:38:49,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 09:38:49,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 09:38:49,086 INFO L87 Difference]: Start difference. First operand 12430 states and 30202 transitions. Second operand 7 states. [2019-12-27 09:38:49,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:38:49,743 INFO L93 Difference]: Finished difference Result 17333 states and 40395 transitions. [2019-12-27 09:38:49,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 09:38:49,744 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 103 [2019-12-27 09:38:49,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:38:49,762 INFO L225 Difference]: With dead ends: 17333 [2019-12-27 09:38:49,762 INFO L226 Difference]: Without dead ends: 17333 [2019-12-27 09:38:49,762 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-12-27 09:38:49,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17333 states. [2019-12-27 09:38:51,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17333 to 14822. [2019-12-27 09:38:51,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14822 states. [2019-12-27 09:38:51,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14822 states to 14822 states and 35027 transitions. [2019-12-27 09:38:51,322 INFO L78 Accepts]: Start accepts. Automaton has 14822 states and 35027 transitions. Word has length 103 [2019-12-27 09:38:51,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:38:51,322 INFO L462 AbstractCegarLoop]: Abstraction has 14822 states and 35027 transitions. [2019-12-27 09:38:51,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 09:38:51,322 INFO L276 IsEmpty]: Start isEmpty. Operand 14822 states and 35027 transitions. [2019-12-27 09:38:51,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-27 09:38:51,342 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:38:51,342 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 09:38:51,342 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:38:51,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:38:51,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1971009306, now seen corresponding path program 1 times [2019-12-27 09:38:51,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:38:51,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788884919] [2019-12-27 09:38:51,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:38:51,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:38:51,410 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 09:38:51,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788884919] [2019-12-27 09:38:51,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:38:51,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 09:38:51,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36558809] [2019-12-27 09:38:51,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 09:38:51,411 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:38:51,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 09:38:51,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 09:38:51,412 INFO L87 Difference]: Start difference. First operand 14822 states and 35027 transitions. Second operand 4 states. [2019-12-27 09:38:51,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:38:51,487 INFO L93 Difference]: Finished difference Result 14822 states and 35009 transitions. [2019-12-27 09:38:51,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 09:38:51,487 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-12-27 09:38:51,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:38:51,508 INFO L225 Difference]: With dead ends: 14822 [2019-12-27 09:38:51,509 INFO L226 Difference]: Without dead ends: 14822 [2019-12-27 09:38:51,509 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 09:38:51,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14822 states. [2019-12-27 09:38:51,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14822 to 14501. [2019-12-27 09:38:51,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14501 states. [2019-12-27 09:38:51,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14501 states to 14501 states and 34280 transitions. [2019-12-27 09:38:51,689 INFO L78 Accepts]: Start accepts. Automaton has 14501 states and 34280 transitions. Word has length 103 [2019-12-27 09:38:51,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:38:51,689 INFO L462 AbstractCegarLoop]: Abstraction has 14501 states and 34280 transitions. [2019-12-27 09:38:51,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 09:38:51,689 INFO L276 IsEmpty]: Start isEmpty. Operand 14501 states and 34280 transitions. [2019-12-27 09:38:51,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-27 09:38:51,702 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:38:51,702 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 09:38:51,703 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:38:51,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:38:51,703 INFO L82 PathProgramCache]: Analyzing trace with hash -336476230, now seen corresponding path program 1 times [2019-12-27 09:38:51,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:38:51,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177253355] [2019-12-27 09:38:51,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:38:51,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:38:51,786 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 09:38:51,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177253355] [2019-12-27 09:38:51,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:38:51,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 09:38:51,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906166999] [2019-12-27 09:38:51,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 09:38:51,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:38:51,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 09:38:51,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 09:38:51,788 INFO L87 Difference]: Start difference. First operand 14501 states and 34280 transitions. Second operand 4 states. [2019-12-27 09:38:52,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:38:52,093 INFO L93 Difference]: Finished difference Result 14577 states and 34470 transitions. [2019-12-27 09:38:52,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 09:38:52,093 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-12-27 09:38:52,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:38:52,109 INFO L225 Difference]: With dead ends: 14577 [2019-12-27 09:38:52,109 INFO L226 Difference]: Without dead ends: 14577 [2019-12-27 09:38:52,109 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 09:38:52,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14577 states. [2019-12-27 09:38:52,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14577 to 13987. [2019-12-27 09:38:52,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13987 states. [2019-12-27 09:38:52,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13987 states to 13987 states and 33135 transitions. [2019-12-27 09:38:52,256 INFO L78 Accepts]: Start accepts. Automaton has 13987 states and 33135 transitions. Word has length 103 [2019-12-27 09:38:52,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:38:52,256 INFO L462 AbstractCegarLoop]: Abstraction has 13987 states and 33135 transitions. [2019-12-27 09:38:52,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 09:38:52,256 INFO L276 IsEmpty]: Start isEmpty. Operand 13987 states and 33135 transitions. [2019-12-27 09:38:52,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-27 09:38:52,268 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:38:52,268 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 09:38:52,269 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:38:52,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:38:52,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1879253812, now seen corresponding path program 2 times [2019-12-27 09:38:52,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:38:52,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002827510] [2019-12-27 09:38:52,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:38:52,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:38:52,378 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 09:38:52,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002827510] [2019-12-27 09:38:52,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:38:52,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 09:38:52,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036738238] [2019-12-27 09:38:52,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 09:38:52,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:38:52,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 09:38:52,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 09:38:52,380 INFO L87 Difference]: Start difference. First operand 13987 states and 33135 transitions. Second operand 5 states. [2019-12-27 09:38:52,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:38:52,457 INFO L93 Difference]: Finished difference Result 13987 states and 33126 transitions. [2019-12-27 09:38:52,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 09:38:52,458 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-12-27 09:38:52,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:38:52,478 INFO L225 Difference]: With dead ends: 13987 [2019-12-27 09:38:52,478 INFO L226 Difference]: Without dead ends: 13987 [2019-12-27 09:38:52,478 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 09:38:52,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13987 states. [2019-12-27 09:38:52,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13987 to 13987. [2019-12-27 09:38:52,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13987 states. [2019-12-27 09:38:52,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13987 states to 13987 states and 33126 transitions. [2019-12-27 09:38:52,647 INFO L78 Accepts]: Start accepts. Automaton has 13987 states and 33126 transitions. Word has length 103 [2019-12-27 09:38:52,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:38:52,647 INFO L462 AbstractCegarLoop]: Abstraction has 13987 states and 33126 transitions. [2019-12-27 09:38:52,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 09:38:52,647 INFO L276 IsEmpty]: Start isEmpty. Operand 13987 states and 33126 transitions. [2019-12-27 09:38:52,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-27 09:38:52,660 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:38:52,661 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 09:38:52,661 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:38:52,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:38:52,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1528209803, now seen corresponding path program 1 times [2019-12-27 09:38:52,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:38:52,661 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450063193] [2019-12-27 09:38:52,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:38:52,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:38:52,724 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 09:38:52,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450063193] [2019-12-27 09:38:52,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:38:52,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 09:38:52,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530835859] [2019-12-27 09:38:52,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 09:38:52,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:38:52,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 09:38:52,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 09:38:52,727 INFO L87 Difference]: Start difference. First operand 13987 states and 33126 transitions. Second operand 5 states. [2019-12-27 09:38:53,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:38:53,140 INFO L93 Difference]: Finished difference Result 14917 states and 35123 transitions. [2019-12-27 09:38:53,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 09:38:53,141 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-12-27 09:38:53,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:38:53,158 INFO L225 Difference]: With dead ends: 14917 [2019-12-27 09:38:53,158 INFO L226 Difference]: Without dead ends: 14917 [2019-12-27 09:38:53,159 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 09:38:53,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14917 states. [2019-12-27 09:38:53,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14917 to 13954. [2019-12-27 09:38:53,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13954 states. [2019-12-27 09:38:53,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13954 states to 13954 states and 32992 transitions. [2019-12-27 09:38:53,428 INFO L78 Accepts]: Start accepts. Automaton has 13954 states and 32992 transitions. Word has length 103 [2019-12-27 09:38:53,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:38:53,428 INFO L462 AbstractCegarLoop]: Abstraction has 13954 states and 32992 transitions. [2019-12-27 09:38:53,429 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 09:38:53,429 INFO L276 IsEmpty]: Start isEmpty. Operand 13954 states and 32992 transitions. [2019-12-27 09:38:53,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-27 09:38:53,442 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:38:53,442 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 09:38:53,442 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:38:53,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:38:53,443 INFO L82 PathProgramCache]: Analyzing trace with hash -606803679, now seen corresponding path program 2 times [2019-12-27 09:38:53,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:38:53,443 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044261623] [2019-12-27 09:38:53,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:38:53,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:38:53,493 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 09:38:53,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044261623] [2019-12-27 09:38:53,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:38:53,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 09:38:53,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970686662] [2019-12-27 09:38:53,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 09:38:53,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:38:53,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 09:38:53,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 09:38:53,503 INFO L87 Difference]: Start difference. First operand 13954 states and 32992 transitions. Second operand 3 states. [2019-12-27 09:38:53,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:38:53,567 INFO L93 Difference]: Finished difference Result 16696 states and 39413 transitions. [2019-12-27 09:38:53,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 09:38:53,568 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2019-12-27 09:38:53,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:38:53,592 INFO L225 Difference]: With dead ends: 16696 [2019-12-27 09:38:53,592 INFO L226 Difference]: Without dead ends: 16696 [2019-12-27 09:38:53,592 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 09:38:53,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16696 states. [2019-12-27 09:38:53,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16696 to 16642. [2019-12-27 09:38:53,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16642 states. [2019-12-27 09:38:53,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16642 states to 16642 states and 39295 transitions. [2019-12-27 09:38:53,812 INFO L78 Accepts]: Start accepts. Automaton has 16642 states and 39295 transitions. Word has length 103 [2019-12-27 09:38:53,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:38:53,812 INFO L462 AbstractCegarLoop]: Abstraction has 16642 states and 39295 transitions. [2019-12-27 09:38:53,812 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 09:38:53,812 INFO L276 IsEmpty]: Start isEmpty. Operand 16642 states and 39295 transitions. [2019-12-27 09:38:53,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-27 09:38:53,826 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:38:53,826 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 09:38:53,826 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:38:53,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:38:53,827 INFO L82 PathProgramCache]: Analyzing trace with hash -395452766, now seen corresponding path program 1 times [2019-12-27 09:38:53,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:38:53,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559364899] [2019-12-27 09:38:53,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:38:53,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:38:53,900 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 09:38:53,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559364899] [2019-12-27 09:38:53,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:38:53,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 09:38:53,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485359527] [2019-12-27 09:38:53,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 09:38:53,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:38:53,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 09:38:53,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 09:38:53,902 INFO L87 Difference]: Start difference. First operand 16642 states and 39295 transitions. Second operand 6 states. [2019-12-27 09:38:54,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:38:54,727 INFO L93 Difference]: Finished difference Result 19819 states and 46535 transitions. [2019-12-27 09:38:54,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 09:38:54,728 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 103 [2019-12-27 09:38:54,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:38:54,761 INFO L225 Difference]: With dead ends: 19819 [2019-12-27 09:38:54,762 INFO L226 Difference]: Without dead ends: 19819 [2019-12-27 09:38:54,762 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-27 09:38:54,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19819 states. [2019-12-27 09:38:55,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19819 to 16677. [2019-12-27 09:38:55,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16677 states. [2019-12-27 09:38:55,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16677 states to 16677 states and 39371 transitions. [2019-12-27 09:38:55,096 INFO L78 Accepts]: Start accepts. Automaton has 16677 states and 39371 transitions. Word has length 103 [2019-12-27 09:38:55,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:38:55,096 INFO L462 AbstractCegarLoop]: Abstraction has 16677 states and 39371 transitions. [2019-12-27 09:38:55,096 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 09:38:55,096 INFO L276 IsEmpty]: Start isEmpty. Operand 16677 states and 39371 transitions. [2019-12-27 09:38:55,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-27 09:38:55,119 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:38:55,119 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 09:38:55,120 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:38:55,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:38:55,120 INFO L82 PathProgramCache]: Analyzing trace with hash 2015950754, now seen corresponding path program 2 times [2019-12-27 09:38:55,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:38:55,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757750433] [2019-12-27 09:38:55,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:38:55,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:38:55,186 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 09:38:55,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757750433] [2019-12-27 09:38:55,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:38:55,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 09:38:55,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770072049] [2019-12-27 09:38:55,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 09:38:55,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:38:55,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 09:38:55,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 09:38:55,188 INFO L87 Difference]: Start difference. First operand 16677 states and 39371 transitions. Second operand 5 states. [2019-12-27 09:38:55,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:38:55,528 INFO L93 Difference]: Finished difference Result 18781 states and 43674 transitions. [2019-12-27 09:38:55,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 09:38:55,528 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-12-27 09:38:55,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:38:55,555 INFO L225 Difference]: With dead ends: 18781 [2019-12-27 09:38:55,555 INFO L226 Difference]: Without dead ends: 18781 [2019-12-27 09:38:55,555 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 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 09:38:55,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18781 states. [2019-12-27 09:38:55,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18781 to 16883. [2019-12-27 09:38:55,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16883 states. [2019-12-27 09:38:55,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16883 states to 16883 states and 39797 transitions. [2019-12-27 09:38:55,769 INFO L78 Accepts]: Start accepts. Automaton has 16883 states and 39797 transitions. Word has length 103 [2019-12-27 09:38:55,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:38:55,769 INFO L462 AbstractCegarLoop]: Abstraction has 16883 states and 39797 transitions. [2019-12-27 09:38:55,769 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 09:38:55,769 INFO L276 IsEmpty]: Start isEmpty. Operand 16883 states and 39797 transitions. [2019-12-27 09:38:55,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-12-27 09:38:55,785 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:38:55,785 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 09:38:55,785 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:38:55,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:38:55,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1862635831, now seen corresponding path program 1 times [2019-12-27 09:38:55,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:38:55,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012150956] [2019-12-27 09:38:55,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:38:55,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:38:56,048 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2019-12-27 09:38:56,091 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 09:38:56,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012150956] [2019-12-27 09:38:56,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:38:56,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 09:38:56,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649866129] [2019-12-27 09:38:56,092 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 09:38:56,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:38:56,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 09:38:56,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-27 09:38:56,093 INFO L87 Difference]: Start difference. First operand 16883 states and 39797 transitions. Second operand 9 states. [2019-12-27 09:38:56,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:38:56,440 INFO L93 Difference]: Finished difference Result 23924 states and 56546 transitions. [2019-12-27 09:38:56,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 09:38:56,441 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 105 [2019-12-27 09:38:56,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:38:56,478 INFO L225 Difference]: With dead ends: 23924 [2019-12-27 09:38:56,478 INFO L226 Difference]: Without dead ends: 21919 [2019-12-27 09:38:56,479 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-12-27 09:38:56,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21919 states. [2019-12-27 09:38:56,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21919 to 19691. [2019-12-27 09:38:56,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19691 states. [2019-12-27 09:38:56,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19691 states to 19691 states and 46272 transitions. [2019-12-27 09:38:56,820 INFO L78 Accepts]: Start accepts. Automaton has 19691 states and 46272 transitions. Word has length 105 [2019-12-27 09:38:56,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:38:56,821 INFO L462 AbstractCegarLoop]: Abstraction has 19691 states and 46272 transitions. [2019-12-27 09:38:56,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 09:38:56,821 INFO L276 IsEmpty]: Start isEmpty. Operand 19691 states and 46272 transitions. [2019-12-27 09:38:56,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-12-27 09:38:56,849 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:38:56,849 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 09:38:56,849 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:38:56,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:38:56,850 INFO L82 PathProgramCache]: Analyzing trace with hash 543960296, now seen corresponding path program 1 times [2019-12-27 09:38:56,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:38:56,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310809692] [2019-12-27 09:38:56,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:38:56,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:38:56,939 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 09:38:56,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310809692] [2019-12-27 09:38:56,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:38:56,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 09:38:56,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054827720] [2019-12-27 09:38:56,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 09:38:56,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:38:56,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 09:38:56,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 09:38:56,941 INFO L87 Difference]: Start difference. First operand 19691 states and 46272 transitions. Second operand 7 states. [2019-12-27 09:38:58,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:38:58,299 INFO L93 Difference]: Finished difference Result 24990 states and 57885 transitions. [2019-12-27 09:38:58,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 09:38:58,300 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 105 [2019-12-27 09:38:58,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:38:58,345 INFO L225 Difference]: With dead ends: 24990 [2019-12-27 09:38:58,346 INFO L226 Difference]: Without dead ends: 24938 [2019-12-27 09:38:58,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-27 09:38:58,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24938 states. [2019-12-27 09:38:58,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24938 to 20268. [2019-12-27 09:38:58,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20268 states. [2019-12-27 09:38:58,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20268 states to 20268 states and 47469 transitions. [2019-12-27 09:38:58,765 INFO L78 Accepts]: Start accepts. Automaton has 20268 states and 47469 transitions. Word has length 105 [2019-12-27 09:38:58,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:38:58,765 INFO L462 AbstractCegarLoop]: Abstraction has 20268 states and 47469 transitions. [2019-12-27 09:38:58,766 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 09:38:58,766 INFO L276 IsEmpty]: Start isEmpty. Operand 20268 states and 47469 transitions. [2019-12-27 09:38:58,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-12-27 09:38:58,794 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:38:58,794 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 09:38:58,794 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:38:58,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:38:58,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1533249047, now seen corresponding path program 1 times [2019-12-27 09:38:58,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:38:58,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419901316] [2019-12-27 09:38:58,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:38:58,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:38:58,927 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 09:38:58,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419901316] [2019-12-27 09:38:58,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:38:58,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 09:38:58,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722553803] [2019-12-27 09:38:58,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 09:38:58,929 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:38:58,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 09:38:58,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 09:38:58,929 INFO L87 Difference]: Start difference. First operand 20268 states and 47469 transitions. Second operand 7 states. [2019-12-27 09:38:59,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:38:59,160 INFO L93 Difference]: Finished difference Result 20806 states and 48604 transitions. [2019-12-27 09:38:59,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 09:38:59,161 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 105 [2019-12-27 09:38:59,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:38:59,186 INFO L225 Difference]: With dead ends: 20806 [2019-12-27 09:38:59,186 INFO L226 Difference]: Without dead ends: 15607 [2019-12-27 09:38:59,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 09:38:59,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15607 states. [2019-12-27 09:38:59,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15607 to 15605. [2019-12-27 09:38:59,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15605 states. [2019-12-27 09:38:59,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15605 states to 15605 states and 36838 transitions. [2019-12-27 09:38:59,616 INFO L78 Accepts]: Start accepts. Automaton has 15605 states and 36838 transitions. Word has length 105 [2019-12-27 09:38:59,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:38:59,616 INFO L462 AbstractCegarLoop]: Abstraction has 15605 states and 36838 transitions. [2019-12-27 09:38:59,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 09:38:59,616 INFO L276 IsEmpty]: Start isEmpty. Operand 15605 states and 36838 transitions. [2019-12-27 09:38:59,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-12-27 09:38:59,637 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:38:59,637 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 09:38:59,638 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:38:59,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:38:59,638 INFO L82 PathProgramCache]: Analyzing trace with hash -283821612, now seen corresponding path program 1 times [2019-12-27 09:38:59,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:38:59,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500239696] [2019-12-27 09:38:59,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:38:59,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:38:59,723 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 09:38:59,724 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500239696] [2019-12-27 09:38:59,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:38:59,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 09:38:59,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137460316] [2019-12-27 09:38:59,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 09:38:59,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:38:59,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 09:38:59,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 09:38:59,727 INFO L87 Difference]: Start difference. First operand 15605 states and 36838 transitions. Second operand 7 states. [2019-12-27 09:39:00,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:39:00,278 INFO L93 Difference]: Finished difference Result 17207 states and 40245 transitions. [2019-12-27 09:39:00,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 09:39:00,278 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 105 [2019-12-27 09:39:00,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:39:00,298 INFO L225 Difference]: With dead ends: 17207 [2019-12-27 09:39:00,298 INFO L226 Difference]: Without dead ends: 17207 [2019-12-27 09:39:00,299 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-27 09:39:00,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17207 states. [2019-12-27 09:39:00,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17207 to 15413. [2019-12-27 09:39:00,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15413 states. [2019-12-27 09:39:00,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15413 states to 15413 states and 36450 transitions. [2019-12-27 09:39:00,472 INFO L78 Accepts]: Start accepts. Automaton has 15413 states and 36450 transitions. Word has length 105 [2019-12-27 09:39:00,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:39:00,473 INFO L462 AbstractCegarLoop]: Abstraction has 15413 states and 36450 transitions. [2019-12-27 09:39:00,473 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 09:39:00,473 INFO L276 IsEmpty]: Start isEmpty. Operand 15413 states and 36450 transitions. [2019-12-27 09:39:00,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-12-27 09:39:00,486 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:39:00,486 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 09:39:00,486 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:39:00,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:39:00,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1637589431, now seen corresponding path program 2 times [2019-12-27 09:39:00,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:39:00,487 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839288722] [2019-12-27 09:39:00,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:39:00,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:39:00,632 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 09:39:00,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839288722] [2019-12-27 09:39:00,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:39:00,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 09:39:00,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947595544] [2019-12-27 09:39:00,633 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 09:39:00,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:39:00,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 09:39:00,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 09:39:00,634 INFO L87 Difference]: Start difference. First operand 15413 states and 36450 transitions. Second operand 8 states. [2019-12-27 09:39:00,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:39:00,853 INFO L93 Difference]: Finished difference Result 15746 states and 37174 transitions. [2019-12-27 09:39:00,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 09:39:00,854 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 105 [2019-12-27 09:39:00,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:39:00,860 INFO L225 Difference]: With dead ends: 15746 [2019-12-27 09:39:00,860 INFO L226 Difference]: Without dead ends: 2898 [2019-12-27 09:39:00,861 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-12-27 09:39:00,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2898 states. [2019-12-27 09:39:00,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2898 to 2896. [2019-12-27 09:39:00,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2896 states. [2019-12-27 09:39:00,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2896 states to 2896 states and 6855 transitions. [2019-12-27 09:39:00,922 INFO L78 Accepts]: Start accepts. Automaton has 2896 states and 6855 transitions. Word has length 105 [2019-12-27 09:39:00,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:39:00,922 INFO L462 AbstractCegarLoop]: Abstraction has 2896 states and 6855 transitions. [2019-12-27 09:39:00,922 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 09:39:00,922 INFO L276 IsEmpty]: Start isEmpty. Operand 2896 states and 6855 transitions. [2019-12-27 09:39:00,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-12-27 09:39:00,927 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:39:00,928 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 09:39:00,928 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:39:00,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:39:00,928 INFO L82 PathProgramCache]: Analyzing trace with hash -582979528, now seen corresponding path program 1 times [2019-12-27 09:39:00,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:39:00,929 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739065862] [2019-12-27 09:39:00,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:39:00,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:39:01,217 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 09:39:01,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739065862] [2019-12-27 09:39:01,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:39:01,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 09:39:01,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651331793] [2019-12-27 09:39:01,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 09:39:01,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:39:01,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 09:39:01,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-12-27 09:39:01,220 INFO L87 Difference]: Start difference. First operand 2896 states and 6855 transitions. Second operand 11 states. [2019-12-27 09:39:01,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:39:01,642 INFO L93 Difference]: Finished difference Result 4398 states and 10179 transitions. [2019-12-27 09:39:01,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 09:39:01,642 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 105 [2019-12-27 09:39:01,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:39:01,647 INFO L225 Difference]: With dead ends: 4398 [2019-12-27 09:39:01,647 INFO L226 Difference]: Without dead ends: 3266 [2019-12-27 09:39:01,647 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-12-27 09:39:01,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3266 states. [2019-12-27 09:39:01,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3266 to 2951. [2019-12-27 09:39:01,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2951 states. [2019-12-27 09:39:01,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2951 states to 2951 states and 6916 transitions. [2019-12-27 09:39:01,677 INFO L78 Accepts]: Start accepts. Automaton has 2951 states and 6916 transitions. Word has length 105 [2019-12-27 09:39:01,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:39:01,677 INFO L462 AbstractCegarLoop]: Abstraction has 2951 states and 6916 transitions. [2019-12-27 09:39:01,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 09:39:01,677 INFO L276 IsEmpty]: Start isEmpty. Operand 2951 states and 6916 transitions. [2019-12-27 09:39:01,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-12-27 09:39:01,679 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:39:01,680 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 09:39:01,680 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:39:01,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:39:01,680 INFO L82 PathProgramCache]: Analyzing trace with hash -633160074, now seen corresponding path program 2 times [2019-12-27 09:39:01,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:39:01,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374498949] [2019-12-27 09:39:01,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:39:01,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 09:39:01,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 09:39:01,774 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 09:39:01,774 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 09:39:02,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 09:39:02 BasicIcfg [2019-12-27 09:39:02,005 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 09:39:02,007 INFO L168 Benchmark]: Toolchain (without parser) took 160147.88 ms. Allocated memory was 138.4 MB in the beginning and 3.4 GB in the end (delta: 3.3 GB). Free memory was 99.9 MB in the beginning and 2.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 970.9 MB. Max. memory is 7.1 GB. [2019-12-27 09:39:02,007 INFO L168 Benchmark]: CDTParser took 1.07 ms. Allocated memory is still 138.4 MB. Free memory is still 119.9 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 09:39:02,008 INFO L168 Benchmark]: CACSL2BoogieTranslator took 738.46 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 99.5 MB in the beginning and 156.1 MB in the end (delta: -56.6 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. [2019-12-27 09:39:02,008 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.69 ms. Allocated memory is still 202.9 MB. Free memory was 156.1 MB in the beginning and 153.2 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-27 09:39:02,009 INFO L168 Benchmark]: Boogie Preprocessor took 52.10 ms. Allocated memory is still 202.9 MB. Free memory was 153.2 MB in the beginning and 150.3 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-27 09:39:02,009 INFO L168 Benchmark]: RCFGBuilder took 1058.14 ms. Allocated memory is still 202.9 MB. Free memory was 150.3 MB in the beginning and 97.5 MB in the end (delta: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. [2019-12-27 09:39:02,010 INFO L168 Benchmark]: TraceAbstraction took 158224.22 ms. Allocated memory was 202.9 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 96.5 MB in the beginning and 2.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 903.1 MB. Max. memory is 7.1 GB. [2019-12-27 09:39:02,012 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.07 ms. Allocated memory is still 138.4 MB. Free memory is still 119.9 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 738.46 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 99.5 MB in the beginning and 156.1 MB in the end (delta: -56.6 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 66.69 ms. Allocated memory is still 202.9 MB. Free memory was 156.1 MB in the beginning and 153.2 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 52.10 ms. Allocated memory is still 202.9 MB. Free memory was 153.2 MB in the beginning and 150.3 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1058.14 ms. Allocated memory is still 202.9 MB. Free memory was 150.3 MB in the beginning and 97.5 MB in the end (delta: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 158224.22 ms. Allocated memory was 202.9 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 96.5 MB in the beginning and 2.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 903.1 MB. 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_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L701] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L703] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L704] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L705] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L707] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L709] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L710] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L711] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L712] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L713] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L714] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L715] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L716] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L717] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L718] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L719] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L720] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L721] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L722] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L723] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L725] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L726] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L727] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L817] 0 pthread_t t243; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L818] FCALL, FORK 0 pthread_create(&t243, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L819] 0 pthread_t t244; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L820] FCALL, FORK 0 pthread_create(&t244, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L765] 2 y$w_buff1 = y$w_buff0 [L766] 2 y$w_buff0 = 1 [L767] 2 y$w_buff1_used = y$w_buff0_used [L768] 2 y$w_buff0_used = (_Bool)1 [L5] COND FALSE 2 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L770] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L771] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L772] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L773] 2 y$r_buff0_thd2 = (_Bool)1 [L776] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L777] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L778] 2 y$flush_delayed = weak$$choice2 [L779] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L780] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L780] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L780] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L780] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L781] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L781] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L782] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L782] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L783] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L783] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L784] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L784] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L785] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L785] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L786] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L786] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L787] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L788] EXPR 2 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L788] 2 y = y$flush_delayed ? y$mem_tmp : y [L789] 2 y$flush_delayed = (_Bool)0 [L792] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L795] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L731] 1 z = 1 [L734] 1 x = 1 [L737] 1 __unbuffered_p0_EAX = x [L740] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L741] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L742] 1 y$flush_delayed = weak$$choice2 [L743] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L744] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L795] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L796] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L796] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L797] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L797] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L798] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L798] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L799] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L802] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L744] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L745] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L745] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L746] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L747] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L747] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L748] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L748] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L749] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L749] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L750] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L750] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L751] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L752] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L752] 1 y = y$flush_delayed ? y$mem_tmp : y [L753] 1 y$flush_delayed = (_Bool)0 [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L822] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L826] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L826] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L827] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L827] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L828] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L828] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L829] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L829] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L830] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L830] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L833] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L5] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L5] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 174 locations, 2 error locations. Result: UNSAFE, OverallTime: 157.7s, OverallIterations: 32, TraceHistogramMax: 1, AutomataDifference: 49.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 10845 SDtfs, 11757 SDslu, 24882 SDs, 0 SdLazy, 8788 SolverSat, 596 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 277 GetRequests, 79 SyntacticMatches, 14 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=222095occurred 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: 96.5s AutomataMinimizationTime, 31 MinimizatonAttempts, 234174 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 2629 NumberOfCodeBlocks, 2629 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 2493 ConstructedInterpolants, 0 QuantifiedInterpolants, 597432 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 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...