/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/mix022_rmo.oepc.i


--------------------------------------------------------------------------------


This is Ultimate 0.1.25-4336eb1
[2019-12-27 10:28:23,612 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2019-12-27 10:28:23,615 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2019-12-27 10:28:23,627 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2019-12-27 10:28:23,628 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2019-12-27 10:28:23,629 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2019-12-27 10:28:23,630 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2019-12-27 10:28:23,632 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2019-12-27 10:28:23,634 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2019-12-27 10:28:23,635 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2019-12-27 10:28:23,636 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2019-12-27 10:28:23,637 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2019-12-27 10:28:23,637 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2019-12-27 10:28:23,638 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2019-12-27 10:28:23,639 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2019-12-27 10:28:23,640 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2019-12-27 10:28:23,641 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2019-12-27 10:28:23,642 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2019-12-27 10:28:23,644 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2019-12-27 10:28:23,646 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2019-12-27 10:28:23,647 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2019-12-27 10:28:23,649 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2019-12-27 10:28:23,650 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2019-12-27 10:28:23,651 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2019-12-27 10:28:23,653 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2019-12-27 10:28:23,653 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2019-12-27 10:28:23,654 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2019-12-27 10:28:23,654 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2019-12-27 10:28:23,657 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2019-12-27 10:28:23,658 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2019-12-27 10:28:23,659 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2019-12-27 10:28:23,659 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2019-12-27 10:28:23,663 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2019-12-27 10:28:23,664 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2019-12-27 10:28:23,665 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2019-12-27 10:28:23,665 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2019-12-27 10:28:23,666 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2019-12-27 10:28:23,666 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2019-12-27 10:28:23,666 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2019-12-27 10:28:23,670 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2019-12-27 10:28:23,671 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2019-12-27 10:28:23,672 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 10:28:23,695 INFO  L113        SettingsManager]: Loading preferences was successful
[2019-12-27 10:28:23,696 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2019-12-27 10:28:23,698 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2019-12-27 10:28:23,698 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2019-12-27 10:28:23,699 INFO  L138        SettingsManager]:  * Use SBE=true
[2019-12-27 10:28:23,699 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2019-12-27 10:28:23,699 INFO  L138        SettingsManager]:  * sizeof long=4
[2019-12-27 10:28:23,699 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2019-12-27 10:28:23,700 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2019-12-27 10:28:23,700 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2019-12-27 10:28:23,701 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2019-12-27 10:28:23,701 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2019-12-27 10:28:23,702 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2019-12-27 10:28:23,702 INFO  L138        SettingsManager]:  * sizeof long double=12
[2019-12-27 10:28:23,702 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2019-12-27 10:28:23,703 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2019-12-27 10:28:23,703 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2019-12-27 10:28:23,703 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2019-12-27 10:28:23,703 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2019-12-27 10:28:23,703 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2019-12-27 10:28:23,704 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2019-12-27 10:28:23,704 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2019-12-27 10:28:23,704 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2019-12-27 10:28:23,705 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2019-12-27 10:28:23,705 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2019-12-27 10:28:23,705 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2019-12-27 10:28:23,705 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2019-12-27 10:28:23,705 INFO  L138        SettingsManager]:  * Large block encoding in concurrent analysis=OFF
[2019-12-27 10:28:23,706 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2019-12-27 10:28:23,706 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2019-12-27 10:28:24,033 INFO  L81    nceAwareModelManager]: Repository-Root is: /tmp
[2019-12-27 10:28:24,059 INFO  L258   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2019-12-27 10:28:24,062 INFO  L214   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2019-12-27 10:28:24,064 INFO  L271        PluginConnector]: Initializing CDTParser...
[2019-12-27 10:28:24,064 INFO  L275        PluginConnector]: CDTParser initialized
[2019-12-27 10:28:24,065 INFO  L428   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix022_rmo.oepc.i
[2019-12-27 10:28:24,140 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb40864e8/d2399a0ed12541a38730349af6931c0e/FLAG23c255c83
[2019-12-27 10:28:24,683 INFO  L306              CDTParser]: Found 1 translation units.
[2019-12-27 10:28:24,684 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix022_rmo.oepc.i
[2019-12-27 10:28:24,701 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb40864e8/d2399a0ed12541a38730349af6931c0e/FLAG23c255c83
[2019-12-27 10:28:24,947 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb40864e8/d2399a0ed12541a38730349af6931c0e
[2019-12-27 10:28:24,958 INFO  L296   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2019-12-27 10:28:24,960 INFO  L131        ToolchainWalker]: Walking toolchain with 5 elements.
[2019-12-27 10:28:24,964 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2019-12-27 10:28:24,964 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2019-12-27 10:28:24,968 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2019-12-27 10:28:24,969 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 10:28:24" (1/1) ...
[2019-12-27 10:28:24,972 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7257e8c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:28:24, skipping insertion in model container
[2019-12-27 10:28:24,972 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 10:28:24" (1/1) ...
[2019-12-27 10:28:24,981 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2019-12-27 10:28:25,027 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2019-12-27 10:28:25,564 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2019-12-27 10:28:25,576 INFO  L203         MainTranslator]: Completed pre-run
[2019-12-27 10:28:25,671 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2019-12-27 10:28:25,748 INFO  L208         MainTranslator]: Completed translation
[2019-12-27 10:28:25,749 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:28:25 WrapperNode
[2019-12-27 10:28:25,749 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2019-12-27 10:28:25,750 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2019-12-27 10:28:25,750 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2019-12-27 10:28:25,751 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2019-12-27 10:28:25,758 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:28:25" (1/1) ...
[2019-12-27 10:28:25,780 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:28:25" (1/1) ...
[2019-12-27 10:28:25,813 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2019-12-27 10:28:25,813 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2019-12-27 10:28:25,813 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2019-12-27 10:28:25,814 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2019-12-27 10:28:25,824 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:28:25" (1/1) ...
[2019-12-27 10:28:25,824 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:28:25" (1/1) ...
[2019-12-27 10:28:25,829 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:28:25" (1/1) ...
[2019-12-27 10:28:25,830 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:28:25" (1/1) ...
[2019-12-27 10:28:25,844 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:28:25" (1/1) ...
[2019-12-27 10:28:25,849 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:28:25" (1/1) ...
[2019-12-27 10:28:25,853 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:28:25" (1/1) ...
[2019-12-27 10:28:25,859 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2019-12-27 10:28:25,859 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2019-12-27 10:28:25,859 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2019-12-27 10:28:25,860 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2019-12-27 10:28:25,861 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:28:25" (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 10:28:25,936 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2019-12-27 10:28:25,936 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2019-12-27 10:28:25,936 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2019-12-27 10:28:25,936 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2019-12-27 10:28:25,936 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2019-12-27 10:28:25,937 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2019-12-27 10:28:25,937 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2019-12-27 10:28:25,937 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2019-12-27 10:28:25,937 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2019-12-27 10:28:25,937 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2019-12-27 10:28:25,938 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2019-12-27 10:28:25,939 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 10:28:26,636 INFO  L282             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2019-12-27 10:28:26,637 INFO  L287             CfgBuilder]: Removed 8 assume(true) statements.
[2019-12-27 10:28:26,639 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 10:28:26 BoogieIcfgContainer
[2019-12-27 10:28:26,639 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2019-12-27 10:28:26,640 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2019-12-27 10:28:26,640 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2019-12-27 10:28:26,644 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2019-12-27 10:28:26,644 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 10:28:24" (1/3) ...
[2019-12-27 10:28:26,645 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@727fbce7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 10:28:26, skipping insertion in model container
[2019-12-27 10:28:26,645 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:28:25" (2/3) ...
[2019-12-27 10:28:26,646 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@727fbce7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 10:28:26, skipping insertion in model container
[2019-12-27 10:28:26,646 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 10:28:26" (3/3) ...
[2019-12-27 10:28:26,648 INFO  L109   eAbstractionObserver]: Analyzing ICFG mix022_rmo.oepc.i
[2019-12-27 10:28:26,659 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2019-12-27 10:28:26,659 INFO  L156   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2019-12-27 10:28:26,668 INFO  L168   ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations.
[2019-12-27 10:28:26,669 INFO  L340   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2019-12-27 10:28:26,709 WARN  L315   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,710 WARN  L315   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,710 WARN  L315   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,710 WARN  L315   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,710 WARN  L315   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,711 WARN  L315   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,711 WARN  L315   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,711 WARN  L315   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,712 WARN  L315   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,712 WARN  L315   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,712 WARN  L315   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,713 WARN  L315   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,713 WARN  L315   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,713 WARN  L315   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,714 WARN  L315   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,714 WARN  L315   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,714 WARN  L315   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,714 WARN  L315   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,715 WARN  L315   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,715 WARN  L315   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,715 WARN  L315   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,715 WARN  L315   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,716 WARN  L315   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,716 WARN  L315   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,716 WARN  L315   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,716 WARN  L315   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,717 WARN  L315   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,717 WARN  L315   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,717 WARN  L315   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,717 WARN  L315   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,718 WARN  L315   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,718 WARN  L315   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,718 WARN  L315   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,718 WARN  L315   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,720 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,720 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,720 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,720 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,721 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,721 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,721 WARN  L315   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,721 WARN  L315   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,722 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,722 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,722 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,722 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,723 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,723 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,723 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,724 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,724 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,724 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,724 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,725 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,725 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,725 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,725 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,726 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,726 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,726 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,726 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,727 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,727 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,727 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,727 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,728 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,728 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,728 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,729 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,729 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,729 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,729 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,730 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,730 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,730 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,730 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,731 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,731 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,731 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,732 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,732 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,732 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,732 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,733 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,733 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,733 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,733 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,734 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,734 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,734 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,734 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,735 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,735 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,735 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,735 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,736 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,736 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,736 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,736 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,737 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,737 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,737 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,737 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,738 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,738 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,738 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,738 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,739 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,739 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,739 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,739 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,740 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,740 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,740 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,741 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,741 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,741 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,741 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,742 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,742 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,742 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,742 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,743 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,743 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,743 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,743 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,744 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,744 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,744 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,744 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,745 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,745 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,745 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,745 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,746 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,746 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,746 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,746 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,746 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,747 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,747 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,747 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,747 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,748 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,748 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,748 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,748 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,749 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,749 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,749 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,749 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,749 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,753 WARN  L315   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,754 WARN  L315   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,754 WARN  L315   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,754 WARN  L315   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,755 WARN  L315   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,755 WARN  L315   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,755 WARN  L315   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,755 WARN  L315   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,755 WARN  L315   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,756 WARN  L315   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,756 WARN  L315   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,756 WARN  L315   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,759 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,759 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,760 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,760 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,760 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,760 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,760 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,761 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,761 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,761 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,761 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,762 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,762 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,762 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,762 WARN  L315   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,762 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,763 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,763 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,763 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,763 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,764 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,764 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,764 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,764 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,764 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,765 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,765 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,765 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,765 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,766 WARN  L315   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,766 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,766 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,766 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 10:28:26,783 INFO  L249      AbstractCegarLoop]: Starting to check reachability of 5 error locations.
[2019-12-27 10:28:26,821 INFO  L373      AbstractCegarLoop]: Interprodecural is true
[2019-12-27 10:28:26,821 INFO  L374      AbstractCegarLoop]: Hoare is true
[2019-12-27 10:28:26,821 INFO  L375      AbstractCegarLoop]: Compute interpolants for FPandBP
[2019-12-27 10:28:26,821 INFO  L376      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2019-12-27 10:28:26,821 INFO  L377      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2019-12-27 10:28:26,821 INFO  L378      AbstractCegarLoop]: Difference is false
[2019-12-27 10:28:26,822 INFO  L379      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2019-12-27 10:28:26,822 INFO  L383      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2019-12-27 10:28:26,836 INFO  L100   iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 147 places, 181 transitions
[2019-12-27 10:28:29,384 INFO  L122   iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 32591 states.
[2019-12-27 10:28:29,386 INFO  L276                IsEmpty]: Start isEmpty. Operand 32591 states.
[2019-12-27 10:28:29,393 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 35
[2019-12-27 10:28:29,393 INFO  L403         BasicCegarLoop]: Found error trace
[2019-12-27 10:28:29,394 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]
[2019-12-27 10:28:29,395 INFO  L410      AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-12-27 10:28:29,400 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-12-27 10:28:29,401 INFO  L82        PathProgramCache]: Analyzing trace with hash 515763664, now seen corresponding path program 1 times
[2019-12-27 10:28:29,408 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-12-27 10:28:29,408 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327099929]
[2019-12-27 10:28:29,409 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-12-27 10:28:29,542 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-12-27 10:28:29,692 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-12-27 10:28:29,693 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327099929]
[2019-12-27 10:28:29,694 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-12-27 10:28:29,694 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2019-12-27 10:28:29,695 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308198121]
[2019-12-27 10:28:29,700 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-12-27 10:28:29,701 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-12-27 10:28:29,716 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-12-27 10:28:29,717 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2019-12-27 10:28:29,719 INFO  L87              Difference]: Start difference. First operand 32591 states. Second operand 4 states.
[2019-12-27 10:28:30,680 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-12-27 10:28:30,681 INFO  L93              Difference]: Finished difference Result 33591 states and 129568 transitions.
[2019-12-27 10:28:30,681 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2019-12-27 10:28:30,683 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 34
[2019-12-27 10:28:30,683 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-12-27 10:28:30,965 INFO  L225             Difference]: With dead ends: 33591
[2019-12-27 10:28:30,965 INFO  L226             Difference]: Without dead ends: 25703
[2019-12-27 10:28:30,967 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 10:28:32,503 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 25703 states.
[2019-12-27 10:28:33,313 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 25703 to 25703.
[2019-12-27 10:28:33,314 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 25703 states.
[2019-12-27 10:28:33,579 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 25703 states to 25703 states and 99584 transitions.
[2019-12-27 10:28:33,580 INFO  L78                 Accepts]: Start accepts. Automaton has 25703 states and 99584 transitions. Word has length 34
[2019-12-27 10:28:33,581 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-12-27 10:28:33,582 INFO  L462      AbstractCegarLoop]: Abstraction has 25703 states and 99584 transitions.
[2019-12-27 10:28:33,582 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-12-27 10:28:33,582 INFO  L276                IsEmpty]: Start isEmpty. Operand 25703 states and 99584 transitions.
[2019-12-27 10:28:33,594 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 47
[2019-12-27 10:28:33,595 INFO  L403         BasicCegarLoop]: Found error trace
[2019-12-27 10:28:33,595 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]
[2019-12-27 10:28:33,595 INFO  L410      AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-12-27 10:28:33,596 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-12-27 10:28:33,596 INFO  L82        PathProgramCache]: Analyzing trace with hash 471938879, now seen corresponding path program 1 times
[2019-12-27 10:28:33,596 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-12-27 10:28:33,596 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907682158]
[2019-12-27 10:28:33,597 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-12-27 10:28:33,670 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-12-27 10:28:33,790 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 10:28:33,791 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907682158]
[2019-12-27 10:28:33,791 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-12-27 10:28:33,791 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2019-12-27 10:28:33,791 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240695562]
[2019-12-27 10:28:33,793 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 5 states
[2019-12-27 10:28:33,794 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-12-27 10:28:33,794 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2019-12-27 10:28:33,794 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2019-12-27 10:28:33,794 INFO  L87              Difference]: Start difference. First operand 25703 states and 99584 transitions. Second operand 5 states.
[2019-12-27 10:28:35,687 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-12-27 10:28:35,687 INFO  L93              Difference]: Finished difference Result 41081 states and 150431 transitions.
[2019-12-27 10:28:35,688 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2019-12-27 10:28:35,688 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 46
[2019-12-27 10:28:35,688 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-12-27 10:28:35,867 INFO  L225             Difference]: With dead ends: 41081
[2019-12-27 10:28:35,868 INFO  L226             Difference]: Without dead ends: 40545
[2019-12-27 10:28:35,869 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 10:28:36,220 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 40545 states.
[2019-12-27 10:28:37,100 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 40545 to 38925.
[2019-12-27 10:28:37,101 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 38925 states.
[2019-12-27 10:28:37,494 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 38925 states to 38925 states and 143581 transitions.
[2019-12-27 10:28:37,494 INFO  L78                 Accepts]: Start accepts. Automaton has 38925 states and 143581 transitions. Word has length 46
[2019-12-27 10:28:37,496 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-12-27 10:28:37,496 INFO  L462      AbstractCegarLoop]: Abstraction has 38925 states and 143581 transitions.
[2019-12-27 10:28:37,496 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2019-12-27 10:28:37,496 INFO  L276                IsEmpty]: Start isEmpty. Operand 38925 states and 143581 transitions.
[2019-12-27 10:28:37,504 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 48
[2019-12-27 10:28:37,504 INFO  L403         BasicCegarLoop]: Found error trace
[2019-12-27 10:28:37,504 INFO  L411         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-12-27 10:28:37,505 INFO  L410      AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-12-27 10:28:37,505 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-12-27 10:28:37,505 INFO  L82        PathProgramCache]: Analyzing trace with hash 1446923185, now seen corresponding path program 1 times
[2019-12-27 10:28:37,505 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-12-27 10:28:37,506 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515927519]
[2019-12-27 10:28:37,506 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-12-27 10:28:37,528 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-12-27 10:28:37,629 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 10:28:37,629 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515927519]
[2019-12-27 10:28:37,630 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-12-27 10:28:37,630 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2019-12-27 10:28:37,630 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365171156]
[2019-12-27 10:28:37,630 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 5 states
[2019-12-27 10:28:37,632 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-12-27 10:28:37,632 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2019-12-27 10:28:37,633 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2019-12-27 10:28:37,633 INFO  L87              Difference]: Start difference. First operand 38925 states and 143581 transitions. Second operand 5 states.
[2019-12-27 10:28:38,224 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-12-27 10:28:38,225 INFO  L93              Difference]: Finished difference Result 49778 states and 180633 transitions.
[2019-12-27 10:28:38,226 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2019-12-27 10:28:38,226 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 47
[2019-12-27 10:28:38,226 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-12-27 10:28:38,423 INFO  L225             Difference]: With dead ends: 49778
[2019-12-27 10:28:38,423 INFO  L226             Difference]: Without dead ends: 49274
[2019-12-27 10:28:38,424 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 10:28:40,410 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 49274 states.
[2019-12-27 10:28:41,398 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 49274 to 42677.
[2019-12-27 10:28:41,398 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 42677 states.
[2019-12-27 10:28:41,516 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 42677 states to 42677 states and 156592 transitions.
[2019-12-27 10:28:41,516 INFO  L78                 Accepts]: Start accepts. Automaton has 42677 states and 156592 transitions. Word has length 47
[2019-12-27 10:28:41,516 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-12-27 10:28:41,516 INFO  L462      AbstractCegarLoop]: Abstraction has 42677 states and 156592 transitions.
[2019-12-27 10:28:41,517 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2019-12-27 10:28:41,517 INFO  L276                IsEmpty]: Start isEmpty. Operand 42677 states and 156592 transitions.
[2019-12-27 10:28:41,525 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 50
[2019-12-27 10:28:41,525 INFO  L403         BasicCegarLoop]: Found error trace
[2019-12-27 10:28:41,525 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 10:28:41,526 INFO  L410      AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-12-27 10:28:41,526 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-12-27 10:28:41,526 INFO  L82        PathProgramCache]: Analyzing trace with hash -104992681, now seen corresponding path program 1 times
[2019-12-27 10:28:41,526 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-12-27 10:28:41,527 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631545477]
[2019-12-27 10:28:41,527 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-12-27 10:28:41,544 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-12-27 10:28:41,580 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 10:28:41,581 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631545477]
[2019-12-27 10:28:41,581 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-12-27 10:28:41,581 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-12-27 10:28:41,581 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294940998]
[2019-12-27 10:28:41,582 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-12-27 10:28:41,582 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-12-27 10:28:41,582 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-12-27 10:28:41,583 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-12-27 10:28:41,583 INFO  L87              Difference]: Start difference. First operand 42677 states and 156592 transitions. Second operand 3 states.
[2019-12-27 10:28:41,870 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-12-27 10:28:41,871 INFO  L93              Difference]: Finished difference Result 61087 states and 221430 transitions.
[2019-12-27 10:28:41,871 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-12-27 10:28:41,871 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 49
[2019-12-27 10:28:41,871 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-12-27 10:28:42,061 INFO  L225             Difference]: With dead ends: 61087
[2019-12-27 10:28:42,061 INFO  L226             Difference]: Without dead ends: 61087
[2019-12-27 10:28:42,062 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 10:28:44,344 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 61087 states.
[2019-12-27 10:28:45,013 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 61087 to 48016.
[2019-12-27 10:28:45,013 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 48016 states.
[2019-12-27 10:28:45,407 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 48016 states to 48016 states and 174179 transitions.
[2019-12-27 10:28:45,407 INFO  L78                 Accepts]: Start accepts. Automaton has 48016 states and 174179 transitions. Word has length 49
[2019-12-27 10:28:45,408 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-12-27 10:28:45,408 INFO  L462      AbstractCegarLoop]: Abstraction has 48016 states and 174179 transitions.
[2019-12-27 10:28:45,408 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-12-27 10:28:45,408 INFO  L276                IsEmpty]: Start isEmpty. Operand 48016 states and 174179 transitions.
[2019-12-27 10:28:45,426 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 54
[2019-12-27 10:28:45,426 INFO  L403         BasicCegarLoop]: Found error trace
[2019-12-27 10:28:45,426 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]
[2019-12-27 10:28:45,427 INFO  L410      AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-12-27 10:28:45,427 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-12-27 10:28:45,427 INFO  L82        PathProgramCache]: Analyzing trace with hash -604414232, now seen corresponding path program 1 times
[2019-12-27 10:28:45,427 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-12-27 10:28:45,428 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082759317]
[2019-12-27 10:28:45,428 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-12-27 10:28:45,454 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-12-27 10:28:45,501 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 10:28:45,502 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082759317]
[2019-12-27 10:28:45,502 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-12-27 10:28:45,502 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-12-27 10:28:45,503 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918866520]
[2019-12-27 10:28:45,503 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-12-27 10:28:45,503 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-12-27 10:28:45,504 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-12-27 10:28:45,504 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-12-27 10:28:45,504 INFO  L87              Difference]: Start difference. First operand 48016 states and 174179 transitions. Second operand 3 states.
[2019-12-27 10:28:45,975 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-12-27 10:28:45,975 INFO  L93              Difference]: Finished difference Result 53336 states and 193527 transitions.
[2019-12-27 10:28:45,975 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-12-27 10:28:45,976 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 53
[2019-12-27 10:28:45,976 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-12-27 10:28:46,137 INFO  L225             Difference]: With dead ends: 53336
[2019-12-27 10:28:46,137 INFO  L226             Difference]: Without dead ends: 53336
[2019-12-27 10:28:46,137 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 10:28:46,388 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 53336 states.
[2019-12-27 10:28:47,417 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 53336 to 50674.
[2019-12-27 10:28:47,418 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 50674 states.
[2019-12-27 10:28:47,552 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 50674 states to 50674 states and 183847 transitions.
[2019-12-27 10:28:47,552 INFO  L78                 Accepts]: Start accepts. Automaton has 50674 states and 183847 transitions. Word has length 53
[2019-12-27 10:28:47,552 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-12-27 10:28:47,553 INFO  L462      AbstractCegarLoop]: Abstraction has 50674 states and 183847 transitions.
[2019-12-27 10:28:47,553 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-12-27 10:28:47,553 INFO  L276                IsEmpty]: Start isEmpty. Operand 50674 states and 183847 transitions.
[2019-12-27 10:28:47,567 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 54
[2019-12-27 10:28:47,567 INFO  L403         BasicCegarLoop]: Found error trace
[2019-12-27 10:28:47,567 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]
[2019-12-27 10:28:47,568 INFO  L410      AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-12-27 10:28:47,568 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-12-27 10:28:47,568 INFO  L82        PathProgramCache]: Analyzing trace with hash -2118465688, now seen corresponding path program 1 times
[2019-12-27 10:28:47,568 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-12-27 10:28:47,569 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065804013]
[2019-12-27 10:28:47,569 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-12-27 10:28:47,587 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-12-27 10:28:47,691 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 10:28:47,692 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065804013]
[2019-12-27 10:28:47,692 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-12-27 10:28:47,692 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2019-12-27 10:28:47,693 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762268330]
[2019-12-27 10:28:47,693 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 6 states
[2019-12-27 10:28:47,693 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-12-27 10:28:47,693 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2019-12-27 10:28:47,694 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2019-12-27 10:28:47,694 INFO  L87              Difference]: Start difference. First operand 50674 states and 183847 transitions. Second operand 6 states.
[2019-12-27 10:28:50,541 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-12-27 10:28:50,541 INFO  L93              Difference]: Finished difference Result 65266 states and 234905 transitions.
[2019-12-27 10:28:50,542 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2019-12-27 10:28:50,542 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 53
[2019-12-27 10:28:50,543 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-12-27 10:28:50,707 INFO  L225             Difference]: With dead ends: 65266
[2019-12-27 10:28:50,707 INFO  L226             Difference]: Without dead ends: 65266
[2019-12-27 10:28:50,708 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 10:28:50,993 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 65266 states.
[2019-12-27 10:28:52,110 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 65266 to 59949.
[2019-12-27 10:28:52,110 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 59949 states.
[2019-12-27 10:28:52,261 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 59949 states to 59949 states and 215672 transitions.
[2019-12-27 10:28:52,262 INFO  L78                 Accepts]: Start accepts. Automaton has 59949 states and 215672 transitions. Word has length 53
[2019-12-27 10:28:52,262 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-12-27 10:28:52,262 INFO  L462      AbstractCegarLoop]: Abstraction has 59949 states and 215672 transitions.
[2019-12-27 10:28:52,262 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2019-12-27 10:28:52,262 INFO  L276                IsEmpty]: Start isEmpty. Operand 59949 states and 215672 transitions.
[2019-12-27 10:28:52,274 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 54
[2019-12-27 10:28:52,274 INFO  L403         BasicCegarLoop]: Found error trace
[2019-12-27 10:28:52,275 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]
[2019-12-27 10:28:52,275 INFO  L410      AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-12-27 10:28:52,275 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-12-27 10:28:52,275 INFO  L82        PathProgramCache]: Analyzing trace with hash 379550249, now seen corresponding path program 1 times
[2019-12-27 10:28:52,275 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-12-27 10:28:52,276 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984376995]
[2019-12-27 10:28:52,276 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-12-27 10:28:52,293 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-12-27 10:28:52,382 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 10:28:52,382 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984376995]
[2019-12-27 10:28:52,382 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-12-27 10:28:52,383 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2019-12-27 10:28:52,383 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470961435]
[2019-12-27 10:28:52,383 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 7 states
[2019-12-27 10:28:52,383 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-12-27 10:28:52,384 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2019-12-27 10:28:52,384 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2019-12-27 10:28:52,384 INFO  L87              Difference]: Start difference. First operand 59949 states and 215672 transitions. Second operand 7 states.
[2019-12-27 10:28:53,622 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-12-27 10:28:53,622 INFO  L93              Difference]: Finished difference Result 83685 states and 290097 transitions.
[2019-12-27 10:28:53,622 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2019-12-27 10:28:53,623 INFO  L78                 Accepts]: Start accepts. Automaton has 7 states. Word has length 53
[2019-12-27 10:28:53,623 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-12-27 10:28:53,795 INFO  L225             Difference]: With dead ends: 83685
[2019-12-27 10:28:53,795 INFO  L226             Difference]: Without dead ends: 83685
[2019-12-27 10:28:53,795 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 10:28:54,677 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 83685 states.
[2019-12-27 10:28:55,504 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 83685 to 71012.
[2019-12-27 10:28:55,504 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 71012 states.
[2019-12-27 10:28:58,905 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 71012 states to 71012 states and 249886 transitions.
[2019-12-27 10:28:58,905 INFO  L78                 Accepts]: Start accepts. Automaton has 71012 states and 249886 transitions. Word has length 53
[2019-12-27 10:28:58,906 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-12-27 10:28:58,906 INFO  L462      AbstractCegarLoop]: Abstraction has 71012 states and 249886 transitions.
[2019-12-27 10:28:58,906 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 7 states.
[2019-12-27 10:28:58,906 INFO  L276                IsEmpty]: Start isEmpty. Operand 71012 states and 249886 transitions.
[2019-12-27 10:28:58,924 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 54
[2019-12-27 10:28:58,924 INFO  L403         BasicCegarLoop]: Found error trace
[2019-12-27 10:28:58,924 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]
[2019-12-27 10:28:58,924 INFO  L410      AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-12-27 10:28:58,925 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-12-27 10:28:58,925 INFO  L82        PathProgramCache]: Analyzing trace with hash 1267053930, now seen corresponding path program 1 times
[2019-12-27 10:28:58,925 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-12-27 10:28:58,925 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150321035]
[2019-12-27 10:28:58,925 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-12-27 10:28:58,941 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-12-27 10:28:58,983 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 10:28:58,983 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150321035]
[2019-12-27 10:28:58,983 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-12-27 10:28:58,983 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-12-27 10:28:58,984 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673323887]
[2019-12-27 10:28:58,984 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-12-27 10:28:58,984 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-12-27 10:28:58,985 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-12-27 10:28:58,985 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-12-27 10:28:58,985 INFO  L87              Difference]: Start difference. First operand 71012 states and 249886 transitions. Second operand 3 states.
[2019-12-27 10:28:59,237 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-12-27 10:28:59,237 INFO  L93              Difference]: Finished difference Result 54021 states and 188918 transitions.
[2019-12-27 10:28:59,238 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-12-27 10:28:59,238 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 53
[2019-12-27 10:28:59,238 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-12-27 10:28:59,348 INFO  L225             Difference]: With dead ends: 54021
[2019-12-27 10:28:59,348 INFO  L226             Difference]: Without dead ends: 54021
[2019-12-27 10:28:59,348 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 10:28:59,605 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 54021 states.
[2019-12-27 10:29:00,570 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 54021 to 53406.
[2019-12-27 10:29:00,570 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 53406 states.
[2019-12-27 10:29:00,697 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 53406 states to 53406 states and 187037 transitions.
[2019-12-27 10:29:00,697 INFO  L78                 Accepts]: Start accepts. Automaton has 53406 states and 187037 transitions. Word has length 53
[2019-12-27 10:29:00,697 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-12-27 10:29:00,697 INFO  L462      AbstractCegarLoop]: Abstraction has 53406 states and 187037 transitions.
[2019-12-27 10:29:00,697 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-12-27 10:29:00,697 INFO  L276                IsEmpty]: Start isEmpty. Operand 53406 states and 187037 transitions.
[2019-12-27 10:29:00,706 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 54
[2019-12-27 10:29:00,706 INFO  L403         BasicCegarLoop]: Found error trace
[2019-12-27 10:29:00,706 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]
[2019-12-27 10:29:00,706 INFO  L410      AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-12-27 10:29:00,706 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-12-27 10:29:00,706 INFO  L82        PathProgramCache]: Analyzing trace with hash -2125589086, now seen corresponding path program 1 times
[2019-12-27 10:29:00,707 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-12-27 10:29:00,707 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390956783]
[2019-12-27 10:29:00,707 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-12-27 10:29:00,719 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-12-27 10:29:00,774 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 10:29:00,775 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390956783]
[2019-12-27 10:29:00,775 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-12-27 10:29:00,775 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2019-12-27 10:29:00,775 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610928772]
[2019-12-27 10:29:00,776 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 6 states
[2019-12-27 10:29:00,776 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-12-27 10:29:00,776 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2019-12-27 10:29:00,776 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2019-12-27 10:29:00,776 INFO  L87              Difference]: Start difference. First operand 53406 states and 187037 transitions. Second operand 6 states.
[2019-12-27 10:29:01,502 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-12-27 10:29:01,502 INFO  L93              Difference]: Finished difference Result 68646 states and 237301 transitions.
[2019-12-27 10:29:01,503 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2019-12-27 10:29:01,503 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 53
[2019-12-27 10:29:01,503 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-12-27 10:29:01,655 INFO  L225             Difference]: With dead ends: 68646
[2019-12-27 10:29:01,655 INFO  L226             Difference]: Without dead ends: 68078
[2019-12-27 10:29:01,655 INFO  L631         BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182
[2019-12-27 10:29:01,950 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 68078 states.
[2019-12-27 10:29:03,109 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 68078 to 53490.
[2019-12-27 10:29:03,110 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 53490 states.
[2019-12-27 10:29:03,246 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 53490 states to 53490 states and 187734 transitions.
[2019-12-27 10:29:03,246 INFO  L78                 Accepts]: Start accepts. Automaton has 53490 states and 187734 transitions. Word has length 53
[2019-12-27 10:29:03,247 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-12-27 10:29:03,247 INFO  L462      AbstractCegarLoop]: Abstraction has 53490 states and 187734 transitions.
[2019-12-27 10:29:03,247 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2019-12-27 10:29:03,247 INFO  L276                IsEmpty]: Start isEmpty. Operand 53490 states and 187734 transitions.
[2019-12-27 10:29:03,259 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 55
[2019-12-27 10:29:03,259 INFO  L403         BasicCegarLoop]: Found error trace
[2019-12-27 10:29:03,259 INFO  L411         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-12-27 10:29:03,259 INFO  L410      AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-12-27 10:29:03,259 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-12-27 10:29:03,259 INFO  L82        PathProgramCache]: Analyzing trace with hash 425705594, now seen corresponding path program 1 times
[2019-12-27 10:29:03,260 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-12-27 10:29:03,260 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447983195]
[2019-12-27 10:29:03,260 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-12-27 10:29:03,273 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-12-27 10:29:03,357 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 10:29:03,358 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447983195]
[2019-12-27 10:29:03,358 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-12-27 10:29:03,358 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2019-12-27 10:29:03,358 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74219511]
[2019-12-27 10:29:03,359 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 6 states
[2019-12-27 10:29:03,359 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-12-27 10:29:03,359 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2019-12-27 10:29:03,359 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2019-12-27 10:29:03,359 INFO  L87              Difference]: Start difference. First operand 53490 states and 187734 transitions. Second operand 6 states.
[2019-12-27 10:29:04,232 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-12-27 10:29:04,232 INFO  L93              Difference]: Finished difference Result 67849 states and 231360 transitions.
[2019-12-27 10:29:04,232 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2019-12-27 10:29:04,234 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 54
[2019-12-27 10:29:04,234 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-12-27 10:29:04,374 INFO  L225             Difference]: With dead ends: 67849
[2019-12-27 10:29:04,374 INFO  L226             Difference]: Without dead ends: 67849
[2019-12-27 10:29:04,375 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 10:29:04,661 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 67849 states.
[2019-12-27 10:29:05,920 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 67849 to 59081.
[2019-12-27 10:29:05,920 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 59081 states.
[2019-12-27 10:29:06,057 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 59081 states to 59081 states and 204130 transitions.
[2019-12-27 10:29:06,058 INFO  L78                 Accepts]: Start accepts. Automaton has 59081 states and 204130 transitions. Word has length 54
[2019-12-27 10:29:06,058 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-12-27 10:29:06,058 INFO  L462      AbstractCegarLoop]: Abstraction has 59081 states and 204130 transitions.
[2019-12-27 10:29:06,058 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2019-12-27 10:29:06,058 INFO  L276                IsEmpty]: Start isEmpty. Operand 59081 states and 204130 transitions.
[2019-12-27 10:29:06,071 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 55
[2019-12-27 10:29:06,072 INFO  L403         BasicCegarLoop]: Found error trace
[2019-12-27 10:29:06,072 INFO  L411         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-12-27 10:29:06,072 INFO  L410      AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-12-27 10:29:06,072 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-12-27 10:29:06,072 INFO  L82        PathProgramCache]: Analyzing trace with hash 1313209275, now seen corresponding path program 1 times
[2019-12-27 10:29:06,073 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-12-27 10:29:06,073 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500531264]
[2019-12-27 10:29:06,073 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-12-27 10:29:06,085 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-12-27 10:29:06,146 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 10:29:06,146 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500531264]
[2019-12-27 10:29:06,146 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-12-27 10:29:06,147 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2019-12-27 10:29:06,147 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252690124]
[2019-12-27 10:29:06,147 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-12-27 10:29:06,147 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-12-27 10:29:06,148 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-12-27 10:29:06,148 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2019-12-27 10:29:06,148 INFO  L87              Difference]: Start difference. First operand 59081 states and 204130 transitions. Second operand 4 states.
[2019-12-27 10:29:06,203 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-12-27 10:29:06,204 INFO  L93              Difference]: Finished difference Result 10212 states and 31246 transitions.
[2019-12-27 10:29:06,204 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2019-12-27 10:29:06,204 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 54
[2019-12-27 10:29:06,204 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-12-27 10:29:06,216 INFO  L225             Difference]: With dead ends: 10212
[2019-12-27 10:29:06,216 INFO  L226             Difference]: Without dead ends: 8507
[2019-12-27 10:29:06,216 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 10:29:06,233 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 8507 states.
[2019-12-27 10:29:06,307 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 8507 to 8459.
[2019-12-27 10:29:06,307 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8459 states.
[2019-12-27 10:29:06,322 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8459 states to 8459 states and 25325 transitions.
[2019-12-27 10:29:06,322 INFO  L78                 Accepts]: Start accepts. Automaton has 8459 states and 25325 transitions. Word has length 54
[2019-12-27 10:29:06,323 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-12-27 10:29:06,323 INFO  L462      AbstractCegarLoop]: Abstraction has 8459 states and 25325 transitions.
[2019-12-27 10:29:06,323 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-12-27 10:29:06,323 INFO  L276                IsEmpty]: Start isEmpty. Operand 8459 states and 25325 transitions.
[2019-12-27 10:29:06,327 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 62
[2019-12-27 10:29:06,327 INFO  L403         BasicCegarLoop]: Found error trace
[2019-12-27 10:29:06,327 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]
[2019-12-27 10:29:06,327 INFO  L410      AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-12-27 10:29:06,328 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-12-27 10:29:06,328 INFO  L82        PathProgramCache]: Analyzing trace with hash 340486782, now seen corresponding path program 1 times
[2019-12-27 10:29:06,328 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-12-27 10:29:06,328 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272466143]
[2019-12-27 10:29:06,328 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-12-27 10:29:06,340 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-12-27 10:29:06,383 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 10:29:06,383 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272466143]
[2019-12-27 10:29:06,383 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-12-27 10:29:06,383 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2019-12-27 10:29:06,384 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166034639]
[2019-12-27 10:29:06,384 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-12-27 10:29:06,384 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-12-27 10:29:06,384 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-12-27 10:29:06,385 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2019-12-27 10:29:06,385 INFO  L87              Difference]: Start difference. First operand 8459 states and 25325 transitions. Second operand 4 states.
[2019-12-27 10:29:06,499 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-12-27 10:29:06,499 INFO  L93              Difference]: Finished difference Result 9706 states and 29104 transitions.
[2019-12-27 10:29:06,499 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2019-12-27 10:29:06,499 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 61
[2019-12-27 10:29:06,500 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-12-27 10:29:06,520 INFO  L225             Difference]: With dead ends: 9706
[2019-12-27 10:29:06,520 INFO  L226             Difference]: Without dead ends: 9706
[2019-12-27 10:29:06,521 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 10:29:06,554 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 9706 states.
[2019-12-27 10:29:06,690 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 9706 to 8879.
[2019-12-27 10:29:06,690 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8879 states.
[2019-12-27 10:29:06,716 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8879 states to 8879 states and 26588 transitions.
[2019-12-27 10:29:06,716 INFO  L78                 Accepts]: Start accepts. Automaton has 8879 states and 26588 transitions. Word has length 61
[2019-12-27 10:29:06,716 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-12-27 10:29:06,716 INFO  L462      AbstractCegarLoop]: Abstraction has 8879 states and 26588 transitions.
[2019-12-27 10:29:06,717 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-12-27 10:29:06,717 INFO  L276                IsEmpty]: Start isEmpty. Operand 8879 states and 26588 transitions.
[2019-12-27 10:29:06,721 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 62
[2019-12-27 10:29:06,721 INFO  L403         BasicCegarLoop]: Found error trace
[2019-12-27 10:29:06,721 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]
[2019-12-27 10:29:06,722 INFO  L410      AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-12-27 10:29:06,722 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-12-27 10:29:06,722 INFO  L82        PathProgramCache]: Analyzing trace with hash 2083297117, now seen corresponding path program 1 times
[2019-12-27 10:29:06,722 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-12-27 10:29:06,723 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882959778]
[2019-12-27 10:29:06,723 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-12-27 10:29:06,736 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-12-27 10:29:06,824 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 10:29:06,825 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882959778]
[2019-12-27 10:29:06,825 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-12-27 10:29:06,825 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2019-12-27 10:29:06,825 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869687827]
[2019-12-27 10:29:06,826 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 6 states
[2019-12-27 10:29:06,826 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-12-27 10:29:06,827 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2019-12-27 10:29:06,827 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2019-12-27 10:29:06,827 INFO  L87              Difference]: Start difference. First operand 8879 states and 26588 transitions. Second operand 6 states.
[2019-12-27 10:29:07,225 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-12-27 10:29:07,225 INFO  L93              Difference]: Finished difference Result 11195 states and 33075 transitions.
[2019-12-27 10:29:07,226 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2019-12-27 10:29:07,226 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 61
[2019-12-27 10:29:07,226 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-12-27 10:29:07,241 INFO  L225             Difference]: With dead ends: 11195
[2019-12-27 10:29:07,241 INFO  L226             Difference]: Without dead ends: 11134
[2019-12-27 10:29:07,241 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 10:29:07,263 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 11134 states.
[2019-12-27 10:29:07,361 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 11134 to 10410.
[2019-12-27 10:29:07,362 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10410 states.
[2019-12-27 10:29:07,381 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10410 states to 10410 states and 30942 transitions.
[2019-12-27 10:29:07,381 INFO  L78                 Accepts]: Start accepts. Automaton has 10410 states and 30942 transitions. Word has length 61
[2019-12-27 10:29:07,381 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-12-27 10:29:07,381 INFO  L462      AbstractCegarLoop]: Abstraction has 10410 states and 30942 transitions.
[2019-12-27 10:29:07,381 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2019-12-27 10:29:07,382 INFO  L276                IsEmpty]: Start isEmpty. Operand 10410 states and 30942 transitions.
[2019-12-27 10:29:07,387 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 68
[2019-12-27 10:29:07,387 INFO  L403         BasicCegarLoop]: Found error trace
[2019-12-27 10:29:07,388 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]
[2019-12-27 10:29:07,388 INFO  L410      AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-12-27 10:29:07,388 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-12-27 10:29:07,388 INFO  L82        PathProgramCache]: Analyzing trace with hash 429763341, now seen corresponding path program 1 times
[2019-12-27 10:29:07,388 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-12-27 10:29:07,388 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041464370]
[2019-12-27 10:29:07,389 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-12-27 10:29:07,401 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-12-27 10:29:07,444 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 10:29:07,444 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041464370]
[2019-12-27 10:29:07,444 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-12-27 10:29:07,445 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2019-12-27 10:29:07,445 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695470951]
[2019-12-27 10:29:07,445 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-12-27 10:29:07,445 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-12-27 10:29:07,446 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-12-27 10:29:07,446 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2019-12-27 10:29:07,446 INFO  L87              Difference]: Start difference. First operand 10410 states and 30942 transitions. Second operand 4 states.
[2019-12-27 10:29:07,924 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-12-27 10:29:07,924 INFO  L93              Difference]: Finished difference Result 15178 states and 44225 transitions.
[2019-12-27 10:29:07,925 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2019-12-27 10:29:07,925 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 67
[2019-12-27 10:29:07,925 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-12-27 10:29:07,953 INFO  L225             Difference]: With dead ends: 15178
[2019-12-27 10:29:07,953 INFO  L226             Difference]: Without dead ends: 15178
[2019-12-27 10:29:07,956 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 10:29:07,992 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 15178 states.
[2019-12-27 10:29:08,123 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 15178 to 11727.
[2019-12-27 10:29:08,124 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11727 states.
[2019-12-27 10:29:08,144 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11727 states to 11727 states and 34516 transitions.
[2019-12-27 10:29:08,144 INFO  L78                 Accepts]: Start accepts. Automaton has 11727 states and 34516 transitions. Word has length 67
[2019-12-27 10:29:08,144 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-12-27 10:29:08,144 INFO  L462      AbstractCegarLoop]: Abstraction has 11727 states and 34516 transitions.
[2019-12-27 10:29:08,145 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-12-27 10:29:08,145 INFO  L276                IsEmpty]: Start isEmpty. Operand 11727 states and 34516 transitions.
[2019-12-27 10:29:08,151 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 68
[2019-12-27 10:29:08,152 INFO  L403         BasicCegarLoop]: Found error trace
[2019-12-27 10:29:08,152 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]
[2019-12-27 10:29:08,152 INFO  L410      AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-12-27 10:29:08,152 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-12-27 10:29:08,152 INFO  L82        PathProgramCache]: Analyzing trace with hash 1674527822, now seen corresponding path program 1 times
[2019-12-27 10:29:08,152 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-12-27 10:29:08,152 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108925736]
[2019-12-27 10:29:08,153 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-12-27 10:29:08,166 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-12-27 10:29:08,235 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 10:29:08,235 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108925736]
[2019-12-27 10:29:08,236 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-12-27 10:29:08,236 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2019-12-27 10:29:08,236 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072144289]
[2019-12-27 10:29:08,236 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 6 states
[2019-12-27 10:29:08,237 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-12-27 10:29:08,237 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2019-12-27 10:29:08,237 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2019-12-27 10:29:08,237 INFO  L87              Difference]: Start difference. First operand 11727 states and 34516 transitions. Second operand 6 states.
[2019-12-27 10:29:08,668 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-12-27 10:29:08,668 INFO  L93              Difference]: Finished difference Result 12772 states and 36832 transitions.
[2019-12-27 10:29:08,669 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2019-12-27 10:29:08,669 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 67
[2019-12-27 10:29:08,669 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-12-27 10:29:08,686 INFO  L225             Difference]: With dead ends: 12772
[2019-12-27 10:29:08,686 INFO  L226             Difference]: Without dead ends: 12772
[2019-12-27 10:29:08,686 INFO  L631         BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72
[2019-12-27 10:29:08,710 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 12772 states.
[2019-12-27 10:29:08,820 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 12772 to 11925.
[2019-12-27 10:29:08,820 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11925 states.
[2019-12-27 10:29:08,842 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11925 states to 11925 states and 34759 transitions.
[2019-12-27 10:29:08,842 INFO  L78                 Accepts]: Start accepts. Automaton has 11925 states and 34759 transitions. Word has length 67
[2019-12-27 10:29:08,842 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-12-27 10:29:08,842 INFO  L462      AbstractCegarLoop]: Abstraction has 11925 states and 34759 transitions.
[2019-12-27 10:29:08,842 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2019-12-27 10:29:08,843 INFO  L276                IsEmpty]: Start isEmpty. Operand 11925 states and 34759 transitions.
[2019-12-27 10:29:08,849 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 68
[2019-12-27 10:29:08,849 INFO  L403         BasicCegarLoop]: Found error trace
[2019-12-27 10:29:08,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]
[2019-12-27 10:29:08,850 INFO  L410      AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-12-27 10:29:08,850 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-12-27 10:29:08,850 INFO  L82        PathProgramCache]: Analyzing trace with hash 1885878735, now seen corresponding path program 1 times
[2019-12-27 10:29:08,850 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-12-27 10:29:08,850 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271759986]
[2019-12-27 10:29:08,850 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-12-27 10:29:08,862 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-12-27 10:29:08,914 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 10:29:08,914 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271759986]
[2019-12-27 10:29:08,915 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-12-27 10:29:08,915 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2019-12-27 10:29:08,915 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826430848]
[2019-12-27 10:29:08,915 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 5 states
[2019-12-27 10:29:08,916 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-12-27 10:29:08,916 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2019-12-27 10:29:08,916 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2019-12-27 10:29:08,916 INFO  L87              Difference]: Start difference. First operand 11925 states and 34759 transitions. Second operand 5 states.
[2019-12-27 10:29:09,270 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-12-27 10:29:09,270 INFO  L93              Difference]: Finished difference Result 15220 states and 44029 transitions.
[2019-12-27 10:29:09,270 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2019-12-27 10:29:09,270 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 67
[2019-12-27 10:29:09,270 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-12-27 10:29:09,291 INFO  L225             Difference]: With dead ends: 15220
[2019-12-27 10:29:09,291 INFO  L226             Difference]: Without dead ends: 15220
[2019-12-27 10:29:09,291 INFO  L631         BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2019-12-27 10:29:09,318 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 15220 states.
[2019-12-27 10:29:09,451 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 15220 to 14156.
[2019-12-27 10:29:09,451 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 14156 states.
[2019-12-27 10:29:09,478 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 14156 states to 14156 states and 40894 transitions.
[2019-12-27 10:29:09,478 INFO  L78                 Accepts]: Start accepts. Automaton has 14156 states and 40894 transitions. Word has length 67
[2019-12-27 10:29:09,478 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-12-27 10:29:09,478 INFO  L462      AbstractCegarLoop]: Abstraction has 14156 states and 40894 transitions.
[2019-12-27 10:29:09,478 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2019-12-27 10:29:09,478 INFO  L276                IsEmpty]: Start isEmpty. Operand 14156 states and 40894 transitions.
[2019-12-27 10:29:09,487 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 68
[2019-12-27 10:29:09,487 INFO  L403         BasicCegarLoop]: Found error trace
[2019-12-27 10:29:09,488 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]
[2019-12-27 10:29:09,488 INFO  L410      AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-12-27 10:29:09,488 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-12-27 10:29:09,488 INFO  L82        PathProgramCache]: Analyzing trace with hash 1375344558, now seen corresponding path program 1 times
[2019-12-27 10:29:09,488 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-12-27 10:29:09,489 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036019417]
[2019-12-27 10:29:09,489 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-12-27 10:29:09,506 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-12-27 10:29:09,550 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 10:29:09,550 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036019417]
[2019-12-27 10:29:09,550 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-12-27 10:29:09,551 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2019-12-27 10:29:09,551 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302662436]
[2019-12-27 10:29:09,551 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-12-27 10:29:09,552 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-12-27 10:29:09,552 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-12-27 10:29:09,552 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2019-12-27 10:29:09,552 INFO  L87              Difference]: Start difference. First operand 14156 states and 40894 transitions. Second operand 4 states.
[2019-12-27 10:29:10,167 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-12-27 10:29:10,167 INFO  L93              Difference]: Finished difference Result 17525 states and 50589 transitions.
[2019-12-27 10:29:10,168 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2019-12-27 10:29:10,168 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 67
[2019-12-27 10:29:10,168 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-12-27 10:29:10,200 INFO  L225             Difference]: With dead ends: 17525
[2019-12-27 10:29:10,201 INFO  L226             Difference]: Without dead ends: 17354
[2019-12-27 10:29:10,202 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 10:29:10,236 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 17354 states.
[2019-12-27 10:29:10,391 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 17354 to 16508.
[2019-12-27 10:29:10,392 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 16508 states.
[2019-12-27 10:29:10,420 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 16508 states to 16508 states and 47592 transitions.
[2019-12-27 10:29:10,420 INFO  L78                 Accepts]: Start accepts. Automaton has 16508 states and 47592 transitions. Word has length 67
[2019-12-27 10:29:10,420 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-12-27 10:29:10,420 INFO  L462      AbstractCegarLoop]: Abstraction has 16508 states and 47592 transitions.
[2019-12-27 10:29:10,420 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-12-27 10:29:10,420 INFO  L276                IsEmpty]: Start isEmpty. Operand 16508 states and 47592 transitions.
[2019-12-27 10:29:10,426 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 68
[2019-12-27 10:29:10,426 INFO  L403         BasicCegarLoop]: Found error trace
[2019-12-27 10:29:10,427 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]
[2019-12-27 10:29:10,427 INFO  L410      AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-12-27 10:29:10,427 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-12-27 10:29:10,427 INFO  L82        PathProgramCache]: Analyzing trace with hash -421606801, now seen corresponding path program 1 times
[2019-12-27 10:29:10,427 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-12-27 10:29:10,428 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987051161]
[2019-12-27 10:29:10,428 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-12-27 10:29:10,440 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-12-27 10:29:10,574 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 10:29:10,574 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987051161]
[2019-12-27 10:29:10,575 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-12-27 10:29:10,575 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2019-12-27 10:29:10,575 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460525270]
[2019-12-27 10:29:10,575 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 7 states
[2019-12-27 10:29:10,576 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-12-27 10:29:10,576 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2019-12-27 10:29:10,577 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2019-12-27 10:29:10,578 INFO  L87              Difference]: Start difference. First operand 16508 states and 47592 transitions. Second operand 7 states.
[2019-12-27 10:29:11,301 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-12-27 10:29:11,301 INFO  L93              Difference]: Finished difference Result 21898 states and 61512 transitions.
[2019-12-27 10:29:11,302 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2019-12-27 10:29:11,302 INFO  L78                 Accepts]: Start accepts. Automaton has 7 states. Word has length 67
[2019-12-27 10:29:11,302 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-12-27 10:29:11,330 INFO  L225             Difference]: With dead ends: 21898
[2019-12-27 10:29:11,331 INFO  L226             Difference]: Without dead ends: 21898
[2019-12-27 10:29:11,331 INFO  L631         BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132
[2019-12-27 10:29:11,365 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 21898 states.
[2019-12-27 10:29:11,534 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 21898 to 18377.
[2019-12-27 10:29:11,535 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 18377 states.
[2019-12-27 10:29:11,566 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 18377 states to 18377 states and 51655 transitions.
[2019-12-27 10:29:11,566 INFO  L78                 Accepts]: Start accepts. Automaton has 18377 states and 51655 transitions. Word has length 67
[2019-12-27 10:29:11,567 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-12-27 10:29:11,567 INFO  L462      AbstractCegarLoop]: Abstraction has 18377 states and 51655 transitions.
[2019-12-27 10:29:11,567 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 7 states.
[2019-12-27 10:29:11,567 INFO  L276                IsEmpty]: Start isEmpty. Operand 18377 states and 51655 transitions.
[2019-12-27 10:29:11,574 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 68
[2019-12-27 10:29:11,575 INFO  L403         BasicCegarLoop]: Found error trace
[2019-12-27 10:29:11,575 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]
[2019-12-27 10:29:11,575 INFO  L410      AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-12-27 10:29:11,575 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-12-27 10:29:11,575 INFO  L82        PathProgramCache]: Analyzing trace with hash 465896880, now seen corresponding path program 1 times
[2019-12-27 10:29:11,575 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-12-27 10:29:11,576 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728859225]
[2019-12-27 10:29:11,576 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-12-27 10:29:11,589 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-12-27 10:29:11,639 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 10:29:11,640 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728859225]
[2019-12-27 10:29:11,640 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-12-27 10:29:11,640 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2019-12-27 10:29:11,640 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535516436]
[2019-12-27 10:29:11,641 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 5 states
[2019-12-27 10:29:11,641 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-12-27 10:29:11,641 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2019-12-27 10:29:11,641 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2019-12-27 10:29:11,642 INFO  L87              Difference]: Start difference. First operand 18377 states and 51655 transitions. Second operand 5 states.
[2019-12-27 10:29:11,689 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-12-27 10:29:11,689 INFO  L93              Difference]: Finished difference Result 5654 states and 13548 transitions.
[2019-12-27 10:29:11,690 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2019-12-27 10:29:11,690 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 67
[2019-12-27 10:29:11,690 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-12-27 10:29:11,696 INFO  L225             Difference]: With dead ends: 5654
[2019-12-27 10:29:11,697 INFO  L226             Difference]: Without dead ends: 4682
[2019-12-27 10:29:11,697 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 10:29:11,706 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4682 states.
[2019-12-27 10:29:11,748 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4682 to 3847.
[2019-12-27 10:29:11,748 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3847 states.
[2019-12-27 10:29:11,756 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3847 states to 3847 states and 9034 transitions.
[2019-12-27 10:29:11,756 INFO  L78                 Accepts]: Start accepts. Automaton has 3847 states and 9034 transitions. Word has length 67
[2019-12-27 10:29:11,756 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-12-27 10:29:11,756 INFO  L462      AbstractCegarLoop]: Abstraction has 3847 states and 9034 transitions.
[2019-12-27 10:29:11,756 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2019-12-27 10:29:11,757 INFO  L276                IsEmpty]: Start isEmpty. Operand 3847 states and 9034 transitions.
[2019-12-27 10:29:11,761 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 68
[2019-12-27 10:29:11,761 INFO  L403         BasicCegarLoop]: Found error trace
[2019-12-27 10:29:11,761 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]
[2019-12-27 10:29:11,761 INFO  L410      AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-12-27 10:29:11,762 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-12-27 10:29:11,762 INFO  L82        PathProgramCache]: Analyzing trace with hash 2130159502, now seen corresponding path program 1 times
[2019-12-27 10:29:11,762 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-12-27 10:29:11,762 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887250064]
[2019-12-27 10:29:11,762 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-12-27 10:29:11,771 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-12-27 10:29:11,789 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 10:29:11,790 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887250064]
[2019-12-27 10:29:11,790 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-12-27 10:29:11,790 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-12-27 10:29:11,790 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751410681]
[2019-12-27 10:29:11,791 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-12-27 10:29:11,791 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-12-27 10:29:11,791 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-12-27 10:29:11,791 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-12-27 10:29:11,792 INFO  L87              Difference]: Start difference. First operand 3847 states and 9034 transitions. Second operand 3 states.
[2019-12-27 10:29:11,825 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-12-27 10:29:11,825 INFO  L93              Difference]: Finished difference Result 4819 states and 11125 transitions.
[2019-12-27 10:29:11,826 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-12-27 10:29:11,826 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 67
[2019-12-27 10:29:11,826 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-12-27 10:29:11,832 INFO  L225             Difference]: With dead ends: 4819
[2019-12-27 10:29:11,832 INFO  L226             Difference]: Without dead ends: 4819
[2019-12-27 10:29:11,833 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 10:29:11,845 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4819 states.
[2019-12-27 10:29:11,889 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4819 to 3790.
[2019-12-27 10:29:11,890 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3790 states.
[2019-12-27 10:29:11,897 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3790 states to 3790 states and 8687 transitions.
[2019-12-27 10:29:11,898 INFO  L78                 Accepts]: Start accepts. Automaton has 3790 states and 8687 transitions. Word has length 67
[2019-12-27 10:29:11,898 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-12-27 10:29:11,898 INFO  L462      AbstractCegarLoop]: Abstraction has 3790 states and 8687 transitions.
[2019-12-27 10:29:11,898 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-12-27 10:29:11,898 INFO  L276                IsEmpty]: Start isEmpty. Operand 3790 states and 8687 transitions.
[2019-12-27 10:29:11,903 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 74
[2019-12-27 10:29:11,903 INFO  L403         BasicCegarLoop]: Found error trace
[2019-12-27 10:29:11,903 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]
[2019-12-27 10:29:11,903 INFO  L410      AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-12-27 10:29:11,904 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-12-27 10:29:11,904 INFO  L82        PathProgramCache]: Analyzing trace with hash -347462239, now seen corresponding path program 1 times
[2019-12-27 10:29:11,904 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-12-27 10:29:11,904 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287966098]
[2019-12-27 10:29:11,904 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-12-27 10:29:11,919 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-12-27 10:29:11,966 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 10:29:11,967 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287966098]
[2019-12-27 10:29:11,967 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-12-27 10:29:11,968 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2019-12-27 10:29:11,968 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646238600]
[2019-12-27 10:29:11,968 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 5 states
[2019-12-27 10:29:11,968 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-12-27 10:29:11,968 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2019-12-27 10:29:11,969 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2019-12-27 10:29:11,969 INFO  L87              Difference]: Start difference. First operand 3790 states and 8687 transitions. Second operand 5 states.
[2019-12-27 10:29:12,149 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-12-27 10:29:12,149 INFO  L93              Difference]: Finished difference Result 4737 states and 10904 transitions.
[2019-12-27 10:29:12,150 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2019-12-27 10:29:12,150 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 73
[2019-12-27 10:29:12,150 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-12-27 10:29:12,156 INFO  L225             Difference]: With dead ends: 4737
[2019-12-27 10:29:12,156 INFO  L226             Difference]: Without dead ends: 4737
[2019-12-27 10:29:12,157 INFO  L631         BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72
[2019-12-27 10:29:12,166 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4737 states.
[2019-12-27 10:29:12,213 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4737 to 4176.
[2019-12-27 10:29:12,213 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4176 states.
[2019-12-27 10:29:12,221 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4176 states to 4176 states and 9598 transitions.
[2019-12-27 10:29:12,221 INFO  L78                 Accepts]: Start accepts. Automaton has 4176 states and 9598 transitions. Word has length 73
[2019-12-27 10:29:12,221 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-12-27 10:29:12,222 INFO  L462      AbstractCegarLoop]: Abstraction has 4176 states and 9598 transitions.
[2019-12-27 10:29:12,222 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2019-12-27 10:29:12,222 INFO  L276                IsEmpty]: Start isEmpty. Operand 4176 states and 9598 transitions.
[2019-12-27 10:29:12,227 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 74
[2019-12-27 10:29:12,228 INFO  L403         BasicCegarLoop]: Found error trace
[2019-12-27 10:29:12,228 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]
[2019-12-27 10:29:12,228 INFO  L410      AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-12-27 10:29:12,228 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-12-27 10:29:12,228 INFO  L82        PathProgramCache]: Analyzing trace with hash 1395348096, now seen corresponding path program 1 times
[2019-12-27 10:29:12,229 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-12-27 10:29:12,229 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432048094]
[2019-12-27 10:29:12,229 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-12-27 10:29:12,244 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-12-27 10:29:12,303 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 10:29:12,304 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432048094]
[2019-12-27 10:29:12,304 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-12-27 10:29:12,304 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2019-12-27 10:29:12,304 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682131749]
[2019-12-27 10:29:12,305 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 7 states
[2019-12-27 10:29:12,305 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-12-27 10:29:12,305 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2019-12-27 10:29:12,305 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2019-12-27 10:29:12,306 INFO  L87              Difference]: Start difference. First operand 4176 states and 9598 transitions. Second operand 7 states.
[2019-12-27 10:29:12,782 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-12-27 10:29:12,782 INFO  L93              Difference]: Finished difference Result 4873 states and 11063 transitions.
[2019-12-27 10:29:12,783 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2019-12-27 10:29:12,783 INFO  L78                 Accepts]: Start accepts. Automaton has 7 states. Word has length 73
[2019-12-27 10:29:12,783 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-12-27 10:29:12,789 INFO  L225             Difference]: With dead ends: 4873
[2019-12-27 10:29:12,790 INFO  L226             Difference]: Without dead ends: 4820
[2019-12-27 10:29:12,790 INFO  L631         BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272
[2019-12-27 10:29:12,796 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4820 states.
[2019-12-27 10:29:12,828 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4820 to 4234.
[2019-12-27 10:29:12,828 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4234 states.
[2019-12-27 10:29:12,833 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4234 states to 4234 states and 9647 transitions.
[2019-12-27 10:29:12,834 INFO  L78                 Accepts]: Start accepts. Automaton has 4234 states and 9647 transitions. Word has length 73
[2019-12-27 10:29:12,834 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-12-27 10:29:12,834 INFO  L462      AbstractCegarLoop]: Abstraction has 4234 states and 9647 transitions.
[2019-12-27 10:29:12,834 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 7 states.
[2019-12-27 10:29:12,834 INFO  L276                IsEmpty]: Start isEmpty. Operand 4234 states and 9647 transitions.
[2019-12-27 10:29:12,838 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 95
[2019-12-27 10:29:12,838 INFO  L403         BasicCegarLoop]: Found error trace
[2019-12-27 10:29:12,838 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]
[2019-12-27 10:29:12,838 INFO  L410      AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-12-27 10:29:12,838 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-12-27 10:29:12,839 INFO  L82        PathProgramCache]: Analyzing trace with hash 1966822310, now seen corresponding path program 1 times
[2019-12-27 10:29:12,839 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-12-27 10:29:12,839 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709441080]
[2019-12-27 10:29:12,839 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-12-27 10:29:12,852 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-12-27 10:29:12,890 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 10:29:12,890 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709441080]
[2019-12-27 10:29:12,890 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-12-27 10:29:12,890 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-12-27 10:29:12,891 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771970897]
[2019-12-27 10:29:12,891 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-12-27 10:29:12,891 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-12-27 10:29:12,891 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-12-27 10:29:12,892 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-12-27 10:29:12,892 INFO  L87              Difference]: Start difference. First operand 4234 states and 9647 transitions. Second operand 3 states.
[2019-12-27 10:29:13,058 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-12-27 10:29:13,059 INFO  L93              Difference]: Finished difference Result 5804 states and 12895 transitions.
[2019-12-27 10:29:13,059 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-12-27 10:29:13,059 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 94
[2019-12-27 10:29:13,059 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-12-27 10:29:13,066 INFO  L225             Difference]: With dead ends: 5804
[2019-12-27 10:29:13,066 INFO  L226             Difference]: Without dead ends: 5513
[2019-12-27 10:29:13,066 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 10:29:13,074 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 5513 states.
[2019-12-27 10:29:13,111 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 5513 to 5040.
[2019-12-27 10:29:13,111 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5040 states.
[2019-12-27 10:29:13,118 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5040 states to 5040 states and 11341 transitions.
[2019-12-27 10:29:13,118 INFO  L78                 Accepts]: Start accepts. Automaton has 5040 states and 11341 transitions. Word has length 94
[2019-12-27 10:29:13,118 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-12-27 10:29:13,119 INFO  L462      AbstractCegarLoop]: Abstraction has 5040 states and 11341 transitions.
[2019-12-27 10:29:13,119 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-12-27 10:29:13,119 INFO  L276                IsEmpty]: Start isEmpty. Operand 5040 states and 11341 transitions.
[2019-12-27 10:29:13,123 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 95
[2019-12-27 10:29:13,124 INFO  L403         BasicCegarLoop]: Found error trace
[2019-12-27 10:29:13,124 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]
[2019-12-27 10:29:13,124 INFO  L410      AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-12-27 10:29:13,124 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-12-27 10:29:13,124 INFO  L82        PathProgramCache]: Analyzing trace with hash -2044994522, now seen corresponding path program 1 times
[2019-12-27 10:29:13,124 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-12-27 10:29:13,125 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147735199]
[2019-12-27 10:29:13,125 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-12-27 10:29:13,155 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-12-27 10:29:13,218 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 10:29:13,219 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147735199]
[2019-12-27 10:29:13,219 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-12-27 10:29:13,219 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2019-12-27 10:29:13,220 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307368825]
[2019-12-27 10:29:13,220 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-12-27 10:29:13,220 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-12-27 10:29:13,221 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-12-27 10:29:13,222 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2019-12-27 10:29:13,222 INFO  L87              Difference]: Start difference. First operand 5040 states and 11341 transitions. Second operand 4 states.
[2019-12-27 10:29:13,328 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-12-27 10:29:13,328 INFO  L93              Difference]: Finished difference Result 5316 states and 12003 transitions.
[2019-12-27 10:29:13,329 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2019-12-27 10:29:13,329 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 94
[2019-12-27 10:29:13,329 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-12-27 10:29:13,336 INFO  L225             Difference]: With dead ends: 5316
[2019-12-27 10:29:13,336 INFO  L226             Difference]: Without dead ends: 5316
[2019-12-27 10:29:13,338 INFO  L631         BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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 10:29:13,349 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 5316 states.
[2019-12-27 10:29:13,403 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 5316 to 4773.
[2019-12-27 10:29:13,403 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4773 states.
[2019-12-27 10:29:13,412 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4773 states to 4773 states and 10838 transitions.
[2019-12-27 10:29:13,413 INFO  L78                 Accepts]: Start accepts. Automaton has 4773 states and 10838 transitions. Word has length 94
[2019-12-27 10:29:13,413 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-12-27 10:29:13,413 INFO  L462      AbstractCegarLoop]: Abstraction has 4773 states and 10838 transitions.
[2019-12-27 10:29:13,413 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-12-27 10:29:13,413 INFO  L276                IsEmpty]: Start isEmpty. Operand 4773 states and 10838 transitions.
[2019-12-27 10:29:13,420 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 97
[2019-12-27 10:29:13,420 INFO  L403         BasicCegarLoop]: Found error trace
[2019-12-27 10:29:13,420 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]
[2019-12-27 10:29:13,420 INFO  L410      AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-12-27 10:29:13,421 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-12-27 10:29:13,421 INFO  L82        PathProgramCache]: Analyzing trace with hash -1707183412, now seen corresponding path program 1 times
[2019-12-27 10:29:13,421 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-12-27 10:29:13,421 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680880379]
[2019-12-27 10:29:13,421 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-12-27 10:29:13,437 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-12-27 10:29:13,485 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 10:29:13,486 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680880379]
[2019-12-27 10:29:13,486 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-12-27 10:29:13,486 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2019-12-27 10:29:13,486 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352394720]
[2019-12-27 10:29:13,487 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 5 states
[2019-12-27 10:29:13,487 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-12-27 10:29:13,487 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2019-12-27 10:29:13,487 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2019-12-27 10:29:13,488 INFO  L87              Difference]: Start difference. First operand 4773 states and 10838 transitions. Second operand 5 states.
[2019-12-27 10:29:13,594 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-12-27 10:29:13,594 INFO  L93              Difference]: Finished difference Result 5452 states and 12346 transitions.
[2019-12-27 10:29:13,594 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2019-12-27 10:29:13,594 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 96
[2019-12-27 10:29:13,595 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-12-27 10:29:13,602 INFO  L225             Difference]: With dead ends: 5452
[2019-12-27 10:29:13,602 INFO  L226             Difference]: Without dead ends: 5452
[2019-12-27 10:29:13,602 INFO  L631         BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 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 10:29:13,612 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 5452 states.
[2019-12-27 10:29:13,660 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 5452 to 4174.
[2019-12-27 10:29:13,661 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4174 states.
[2019-12-27 10:29:13,669 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4174 states to 4174 states and 9445 transitions.
[2019-12-27 10:29:13,669 INFO  L78                 Accepts]: Start accepts. Automaton has 4174 states and 9445 transitions. Word has length 96
[2019-12-27 10:29:13,669 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-12-27 10:29:13,669 INFO  L462      AbstractCegarLoop]: Abstraction has 4174 states and 9445 transitions.
[2019-12-27 10:29:13,669 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2019-12-27 10:29:13,670 INFO  L276                IsEmpty]: Start isEmpty. Operand 4174 states and 9445 transitions.
[2019-12-27 10:29:13,675 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 97
[2019-12-27 10:29:13,675 INFO  L403         BasicCegarLoop]: Found error trace
[2019-12-27 10:29:13,675 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]
[2019-12-27 10:29:13,675 INFO  L410      AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-12-27 10:29:13,676 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-12-27 10:29:13,676 INFO  L82        PathProgramCache]: Analyzing trace with hash -1695867285, now seen corresponding path program 1 times
[2019-12-27 10:29:13,676 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-12-27 10:29:13,676 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909231514]
[2019-12-27 10:29:13,676 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-12-27 10:29:13,690 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-12-27 10:29:13,744 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 10:29:13,744 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909231514]
[2019-12-27 10:29:13,744 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-12-27 10:29:13,745 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2019-12-27 10:29:13,745 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978988900]
[2019-12-27 10:29:13,745 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-12-27 10:29:13,745 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-12-27 10:29:13,746 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-12-27 10:29:13,746 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2019-12-27 10:29:13,746 INFO  L87              Difference]: Start difference. First operand 4174 states and 9445 transitions. Second operand 4 states.
[2019-12-27 10:29:13,983 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-12-27 10:29:13,983 INFO  L93              Difference]: Finished difference Result 4884 states and 10994 transitions.
[2019-12-27 10:29:13,984 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2019-12-27 10:29:13,984 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 96
[2019-12-27 10:29:13,984 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-12-27 10:29:13,990 INFO  L225             Difference]: With dead ends: 4884
[2019-12-27 10:29:13,991 INFO  L226             Difference]: Without dead ends: 4828
[2019-12-27 10:29:13,991 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 10:29:13,999 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4828 states.
[2019-12-27 10:29:14,036 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4828 to 4625.
[2019-12-27 10:29:14,037 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4625 states.
[2019-12-27 10:29:14,043 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4625 states to 4625 states and 10444 transitions.
[2019-12-27 10:29:14,043 INFO  L78                 Accepts]: Start accepts. Automaton has 4625 states and 10444 transitions. Word has length 96
[2019-12-27 10:29:14,043 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-12-27 10:29:14,043 INFO  L462      AbstractCegarLoop]: Abstraction has 4625 states and 10444 transitions.
[2019-12-27 10:29:14,043 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-12-27 10:29:14,043 INFO  L276                IsEmpty]: Start isEmpty. Operand 4625 states and 10444 transitions.
[2019-12-27 10:29:14,047 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 97
[2019-12-27 10:29:14,047 INFO  L403         BasicCegarLoop]: Found error trace
[2019-12-27 10:29:14,048 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]
[2019-12-27 10:29:14,048 INFO  L410      AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-12-27 10:29:14,048 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-12-27 10:29:14,048 INFO  L82        PathProgramCache]: Analyzing trace with hash 521890668, now seen corresponding path program 1 times
[2019-12-27 10:29:14,048 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-12-27 10:29:14,048 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200016722]
[2019-12-27 10:29:14,048 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-12-27 10:29:14,062 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-12-27 10:29:14,207 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 10:29:14,207 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200016722]
[2019-12-27 10:29:14,207 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-12-27 10:29:14,207 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2019-12-27 10:29:14,207 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823283518]
[2019-12-27 10:29:14,208 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 9 states
[2019-12-27 10:29:14,208 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-12-27 10:29:14,208 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2019-12-27 10:29:14,208 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2019-12-27 10:29:14,208 INFO  L87              Difference]: Start difference. First operand 4625 states and 10444 transitions. Second operand 9 states.
[2019-12-27 10:29:15,002 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-12-27 10:29:15,002 INFO  L93              Difference]: Finished difference Result 6285 states and 13941 transitions.
[2019-12-27 10:29:15,003 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. 
[2019-12-27 10:29:15,003 INFO  L78                 Accepts]: Start accepts. Automaton has 9 states. Word has length 96
[2019-12-27 10:29:15,003 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-12-27 10:29:15,010 INFO  L225             Difference]: With dead ends: 6285
[2019-12-27 10:29:15,010 INFO  L226             Difference]: Without dead ends: 6285
[2019-12-27 10:29:15,011 INFO  L631         BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420
[2019-12-27 10:29:15,018 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 6285 states.
[2019-12-27 10:29:15,058 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 6285 to 5107.
[2019-12-27 10:29:15,058 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5107 states.
[2019-12-27 10:29:15,065 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5107 states to 5107 states and 11442 transitions.
[2019-12-27 10:29:15,065 INFO  L78                 Accepts]: Start accepts. Automaton has 5107 states and 11442 transitions. Word has length 96
[2019-12-27 10:29:15,065 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-12-27 10:29:15,066 INFO  L462      AbstractCegarLoop]: Abstraction has 5107 states and 11442 transitions.
[2019-12-27 10:29:15,066 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 9 states.
[2019-12-27 10:29:15,066 INFO  L276                IsEmpty]: Start isEmpty. Operand 5107 states and 11442 transitions.
[2019-12-27 10:29:15,072 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 97
[2019-12-27 10:29:15,072 INFO  L403         BasicCegarLoop]: Found error trace
[2019-12-27 10:29:15,072 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]
[2019-12-27 10:29:15,073 INFO  L410      AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-12-27 10:29:15,073 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-12-27 10:29:15,073 INFO  L82        PathProgramCache]: Analyzing trace with hash 733241581, now seen corresponding path program 1 times
[2019-12-27 10:29:15,073 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-12-27 10:29:15,073 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541042856]
[2019-12-27 10:29:15,074 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-12-27 10:29:15,087 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-12-27 10:29:15,218 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 10:29:15,219 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541042856]
[2019-12-27 10:29:15,219 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-12-27 10:29:15,219 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2019-12-27 10:29:15,219 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739009620]
[2019-12-27 10:29:15,220 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 5 states
[2019-12-27 10:29:15,220 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-12-27 10:29:15,220 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2019-12-27 10:29:15,220 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2019-12-27 10:29:15,220 INFO  L87              Difference]: Start difference. First operand 5107 states and 11442 transitions. Second operand 5 states.
[2019-12-27 10:29:15,260 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-12-27 10:29:15,260 INFO  L93              Difference]: Finished difference Result 5107 states and 11433 transitions.
[2019-12-27 10:29:15,261 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2019-12-27 10:29:15,261 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 96
[2019-12-27 10:29:15,261 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-12-27 10:29:15,268 INFO  L225             Difference]: With dead ends: 5107
[2019-12-27 10:29:15,268 INFO  L226             Difference]: Without dead ends: 5107
[2019-12-27 10:29:15,268 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 10:29:15,277 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 5107 states.
[2019-12-27 10:29:15,333 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 5107 to 4871.
[2019-12-27 10:29:15,333 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4871 states.
[2019-12-27 10:29:15,343 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4871 states to 4871 states and 10906 transitions.
[2019-12-27 10:29:15,343 INFO  L78                 Accepts]: Start accepts. Automaton has 4871 states and 10906 transitions. Word has length 96
[2019-12-27 10:29:15,343 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-12-27 10:29:15,344 INFO  L462      AbstractCegarLoop]: Abstraction has 4871 states and 10906 transitions.
[2019-12-27 10:29:15,344 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2019-12-27 10:29:15,344 INFO  L276                IsEmpty]: Start isEmpty. Operand 4871 states and 10906 transitions.
[2019-12-27 10:29:15,351 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 97
[2019-12-27 10:29:15,351 INFO  L403         BasicCegarLoop]: Found error trace
[2019-12-27 10:29:15,351 INFO  L411         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-12-27 10:29:15,352 INFO  L410      AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-12-27 10:29:15,352 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-12-27 10:29:15,352 INFO  L82        PathProgramCache]: Analyzing trace with hash 1620745262, now seen corresponding path program 1 times
[2019-12-27 10:29:15,352 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-12-27 10:29:15,352 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854992795]
[2019-12-27 10:29:15,353 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-12-27 10:29:15,374 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-12-27 10:29:15,514 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 10:29:15,514 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854992795]
[2019-12-27 10:29:15,514 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-12-27 10:29:15,515 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2019-12-27 10:29:15,515 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388460295]
[2019-12-27 10:29:15,516 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 10 states
[2019-12-27 10:29:15,516 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-12-27 10:29:15,516 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2019-12-27 10:29:15,517 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90
[2019-12-27 10:29:15,517 INFO  L87              Difference]: Start difference. First operand 4871 states and 10906 transitions. Second operand 10 states.
[2019-12-27 10:29:16,114 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-12-27 10:29:16,115 INFO  L93              Difference]: Finished difference Result 14875 states and 33775 transitions.
[2019-12-27 10:29:16,115 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. 
[2019-12-27 10:29:16,115 INFO  L78                 Accepts]: Start accepts. Automaton has 10 states. Word has length 96
[2019-12-27 10:29:16,116 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-12-27 10:29:16,142 INFO  L225             Difference]: With dead ends: 14875
[2019-12-27 10:29:16,142 INFO  L226             Difference]: Without dead ends: 9691
[2019-12-27 10:29:16,145 INFO  L631         BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462
[2019-12-27 10:29:16,170 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 9691 states.
[2019-12-27 10:29:16,276 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 9691 to 4841.
[2019-12-27 10:29:16,277 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4841 states.
[2019-12-27 10:29:16,290 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4841 states to 4841 states and 10747 transitions.
[2019-12-27 10:29:16,290 INFO  L78                 Accepts]: Start accepts. Automaton has 4841 states and 10747 transitions. Word has length 96
[2019-12-27 10:29:16,291 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-12-27 10:29:16,291 INFO  L462      AbstractCegarLoop]: Abstraction has 4841 states and 10747 transitions.
[2019-12-27 10:29:16,291 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 10 states.
[2019-12-27 10:29:16,291 INFO  L276                IsEmpty]: Start isEmpty. Operand 4841 states and 10747 transitions.
[2019-12-27 10:29:16,300 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 97
[2019-12-27 10:29:16,300 INFO  L403         BasicCegarLoop]: Found error trace
[2019-12-27 10:29:16,301 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]
[2019-12-27 10:29:16,301 INFO  L410      AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-12-27 10:29:16,301 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-12-27 10:29:16,302 INFO  L82        PathProgramCache]: Analyzing trace with hash -393959572, now seen corresponding path program 2 times
[2019-12-27 10:29:16,302 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-12-27 10:29:16,302 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025246454]
[2019-12-27 10:29:16,302 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-12-27 10:29:16,330 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2019-12-27 10:29:16,381 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2019-12-27 10:29:16,472 INFO  L174   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2019-12-27 10:29:16,473 INFO  L476         BasicCegarLoop]: Counterexample might be feasible
[2019-12-27 10:29:16,675 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 10:29:16 BasicIcfg
[2019-12-27 10:29:16,675 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2019-12-27 10:29:16,678 INFO  L168              Benchmark]: Toolchain (without parser) took 51717.48 ms. Allocated memory was 135.8 MB in the beginning and 2.6 GB in the end (delta: 2.5 GB). Free memory was 99.5 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB.
[2019-12-27 10:29:16,678 INFO  L168              Benchmark]: CDTParser took 0.55 ms. Allocated memory is still 135.8 MB. Free memory was 119.0 MB in the beginning and 118.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB.
[2019-12-27 10:29:16,679 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 786.05 ms. Allocated memory was 135.8 MB in the beginning and 200.8 MB in the end (delta: 65.0 MB). Free memory was 99.1 MB in the beginning and 155.1 MB in the end (delta: -56.1 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB.
[2019-12-27 10:29:16,679 INFO  L168              Benchmark]: Boogie Procedure Inliner took 62.75 ms. Allocated memory is still 200.8 MB. Free memory was 155.1 MB in the beginning and 152.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 10:29:16,680 INFO  L168              Benchmark]: Boogie Preprocessor took 45.65 ms. Allocated memory is still 200.8 MB. Free memory was 152.2 MB in the beginning and 150.1 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB.
[2019-12-27 10:29:16,680 INFO  L168              Benchmark]: RCFGBuilder took 779.72 ms. Allocated memory is still 200.8 MB. Free memory was 150.1 MB in the beginning and 105.5 MB in the end (delta: 44.6 MB). Peak memory consumption was 44.6 MB. Max. memory is 7.1 GB.
[2019-12-27 10:29:16,681 INFO  L168              Benchmark]: TraceAbstraction took 50035.44 ms. Allocated memory was 200.8 MB in the beginning and 2.6 GB in the end (delta: 2.4 GB). Free memory was 105.5 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB.
[2019-12-27 10:29:16,684 INFO  L335   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.55 ms. Allocated memory is still 135.8 MB. Free memory was 119.0 MB in the beginning and 118.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB.
 * CACSL2BoogieTranslator took 786.05 ms. Allocated memory was 135.8 MB in the beginning and 200.8 MB in the end (delta: 65.0 MB). Free memory was 99.1 MB in the beginning and 155.1 MB in the end (delta: -56.1 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB.
 * Boogie Procedure Inliner took 62.75 ms. Allocated memory is still 200.8 MB. Free memory was 155.1 MB in the beginning and 152.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 45.65 ms. Allocated memory is still 200.8 MB. Free memory was 152.2 MB in the beginning and 150.1 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB.
 * RCFGBuilder took 779.72 ms. Allocated memory is still 200.8 MB. Free memory was 150.1 MB in the beginning and 105.5 MB in the end (delta: 44.6 MB). Peak memory consumption was 44.6 MB. Max. memory is 7.1 GB.
 * TraceAbstraction took 50035.44 ms. Allocated memory was 200.8 MB in the beginning and 2.6 GB in the end (delta: 2.4 GB). Free memory was 105.5 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable
    a call of __VERIFIER_error() is reachable
We found a FailurePath: 
[L694]               0  int __unbuffered_cnt = 0;
        VAL             [__unbuffered_cnt=0]
[L696]               0  int __unbuffered_p1_EAX = 0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0]
[L698]               0  int __unbuffered_p1_EBX = 0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0]
[L699]               0  _Bool main$tmp_guard0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0]
[L700]               0  _Bool main$tmp_guard1;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0]
[L702]               0  int x = 0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0]
[L704]               0  int y = 0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0]
[L705]               0  _Bool y$flush_delayed;
        VAL             [__unbuffered_cnt=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]
[L706]               0  int y$mem_tmp;
        VAL             [__unbuffered_cnt=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]
[L707]               0  _Bool y$r_buff0_thd0;
        VAL             [__unbuffered_cnt=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]
[L708]               0  _Bool y$r_buff0_thd1;
        VAL             [__unbuffered_cnt=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]
[L709]               0  _Bool y$r_buff0_thd2;
        VAL             [__unbuffered_cnt=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]
[L710]               0  _Bool y$r_buff1_thd0;
        VAL             [__unbuffered_cnt=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]
[L711]               0  _Bool y$r_buff1_thd1;
        VAL             [__unbuffered_cnt=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]
[L712]               0  _Bool y$r_buff1_thd2;
        VAL             [__unbuffered_cnt=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]
[L713]               0  _Bool y$read_delayed;
        VAL             [__unbuffered_cnt=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]
[L714]               0  int *y$read_delayed_var;
        VAL             [__unbuffered_cnt=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}]
[L715]               0  int y$w_buff0;
        VAL             [__unbuffered_cnt=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]
[L716]               0  _Bool y$w_buff0_used;
        VAL             [__unbuffered_cnt=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]
[L717]               0  int y$w_buff1;
        VAL             [__unbuffered_cnt=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]
[L718]               0  _Bool y$w_buff1_used;
        VAL             [__unbuffered_cnt=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]
[L719]               0  _Bool weak$$choice0;
        VAL             [__unbuffered_cnt=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]
[L720]               0  _Bool weak$$choice2;
        VAL             [__unbuffered_cnt=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]
[L796]               0  pthread_t t593;
        VAL             [__unbuffered_cnt=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]
[L797]  FCALL, FORK  0  pthread_create(&t593, ((void *)0), P0, ((void *)0))
        VAL             [__unbuffered_cnt=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]
[L724]               1  y$w_buff1 = y$w_buff0
[L725]               1  y$w_buff0 = 1
[L726]               1  y$w_buff1_used = y$w_buff0_used
[L727]               1  y$w_buff0_used = (_Bool)1
[L4]    COND FALSE   1  !(!expression)
        VAL             [__unbuffered_cnt=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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0]
[L729]               1  y$r_buff1_thd0 = y$r_buff0_thd0
[L730]               1  y$r_buff1_thd1 = y$r_buff0_thd1
[L731]               1  y$r_buff1_thd2 = y$r_buff0_thd2
[L732]               1  y$r_buff0_thd1 = (_Bool)1
[L735]               1  x = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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]
[L738]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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]
[L798]               0  pthread_t t594;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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]
[L799]  FCALL, FORK  0  pthread_create(&t594, ((void *)0), P1, ((void *)0))
        VAL             [__unbuffered_cnt=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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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]
[L752]               2  x = 2
[L755]               2  __unbuffered_p1_EAX = x
[L758]               2  weak$$choice0 = __VERIFIER_nondet_bool()
[L759]               2  weak$$choice2 = __VERIFIER_nondet_bool()
[L760]               2  y$flush_delayed = weak$$choice2
[L761]               2  y$mem_tmp = y
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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]
[L762]  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             [!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)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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]
[L738]               1  y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)
[L739]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used
        VAL             [!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)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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]
[L762]               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)
[L763]  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_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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]
[L763]               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))
[L764]  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_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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]
[L764]               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))
[L739]               1  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used
[L740]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=0, y$w_buff1=0, y$w_buff1_used=0]
[L740]               1  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used
[L741]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=0, y$w_buff1=0, y$w_buff1_used=0]
[L741]               1  y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1
[L742]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=0, y$w_buff1=0, y$w_buff1_used=0]
[L742]               1  y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1
[L745]               1  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=0, y$w_buff1=0, y$w_buff1_used=0]
[L765]  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=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=0, y$w_buff1=0, y$w_buff1_used=0]
[L765]               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))
[L766]  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=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=0, y$w_buff1=0, y$w_buff1_used=0]
[L766]               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))
[L767]  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=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=0, y$w_buff1=0, y$w_buff1_used=0]
[L767]               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))
[L768]  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=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=0, y$w_buff1=0, y$w_buff1_used=0]
[L768]               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))
[L769]               2  __unbuffered_p1_EBX = y
        VAL             [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=0, y$w_buff1=0, y$w_buff1_used=0]
[L770]  EXPR         2  y$flush_delayed ? y$mem_tmp : y
        VAL             [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, 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=1, 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=0, y$w_buff1=0, y$w_buff1_used=0]
[L770]               2  y = y$flush_delayed ? y$mem_tmp : y
[L771]               2  y$flush_delayed = (_Bool)0
        VAL             [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=0, y$w_buff1=0, y$w_buff1_used=0]
[L774]  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=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=0, y$w_buff1=0, y$w_buff1_used=0]
[L774]  EXPR         2  y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y
        VAL             [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0]
[L774]  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=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0]
[L774]               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)
[L775]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used
        VAL             [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L775]               2  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used
[L776]  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             [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L776]               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
[L777]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2
        VAL             [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0]
[L777]               2  y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2
[L778]  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             [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0]
[L778]               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
[L781]               2  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=0, y$w_buff1=0, y$w_buff1_used=0]
[L801]               0  main$tmp_guard0 = __unbuffered_cnt == 2
        VAL             [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=0, y$w_buff1=0, y$w_buff1_used=0]
[L805]  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_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=0, y$w_buff1=0, y$w_buff1_used=0]
[L805]  EXPR         0  y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y
        VAL             [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=0, y$w_buff1=0, y$w_buff1_used=0]
[L805]  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_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=0, y$w_buff1=0, y$w_buff1_used=0]
[L805]               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)
[L806]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used
        VAL             [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=0, y$w_buff1=0, y$w_buff1_used=0]
[L806]               0  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used
[L807]  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_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=0, y$w_buff1=0, y$w_buff1_used=0]
[L807]               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
[L808]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0
        VAL             [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=0, y$w_buff1=0, y$w_buff1_used=0]
[L808]               0  y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0
[L809]  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_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=0, y$w_buff1=0, y$w_buff1_used=0]
[L809]               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
[L812]               0  main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0)
        VAL             [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=0, y$w_buff1=0, y$w_buff1_used=0]
[L4]    COND TRUE    0  !expression
        VAL             [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=0, y$w_buff1=0, y$w_buff1_used=0]
[L4]                 0  __VERIFIER_error()
        VAL             [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=0, y$w_buff1=0, y$w_buff1_used=0]

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 49.6s, OverallIterations: 30, TraceHistogramMax: 1, AutomataDifference: 18.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7978 SDtfs, 8474 SDslu, 17262 SDs, 0 SdLazy, 6502 SolverSat, 414 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 269 GetRequests, 76 SyntacticMatches, 17 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71012occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 25.5s AutomataMinimizationTime, 29 MinimizatonAttempts, 89011 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 2050 NumberOfCodeBlocks, 2050 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 1925 ConstructedInterpolants, 0 QuantifiedInterpolants, 353119 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 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...