/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-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe000_power.opt.i


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


This is Ultimate 0.1.25-4336eb1
[2019-12-27 17:55:09,759 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2019-12-27 17:55:09,761 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2019-12-27 17:55:09,775 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2019-12-27 17:55:09,775 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2019-12-27 17:55:09,777 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2019-12-27 17:55:09,779 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2019-12-27 17:55:09,789 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2019-12-27 17:55:09,791 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2019-12-27 17:55:09,792 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2019-12-27 17:55:09,793 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2019-12-27 17:55:09,794 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2019-12-27 17:55:09,796 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2019-12-27 17:55:09,797 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2019-12-27 17:55:09,799 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2019-12-27 17:55:09,800 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2019-12-27 17:55:09,803 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2019-12-27 17:55:09,805 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2019-12-27 17:55:09,809 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2019-12-27 17:55:09,812 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2019-12-27 17:55:09,814 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2019-12-27 17:55:09,819 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2019-12-27 17:55:09,820 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2019-12-27 17:55:09,820 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2019-12-27 17:55:09,823 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2019-12-27 17:55:09,823 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2019-12-27 17:55:09,824 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2019-12-27 17:55:09,825 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2019-12-27 17:55:09,827 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2019-12-27 17:55:09,829 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2019-12-27 17:55:09,829 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2019-12-27 17:55:09,830 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2019-12-27 17:55:09,830 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2019-12-27 17:55:09,832 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2019-12-27 17:55:09,834 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2019-12-27 17:55:09,835 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2019-12-27 17:55:09,835 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2019-12-27 17:55:09,836 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2019-12-27 17:55:09,836 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2019-12-27 17:55:09,837 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2019-12-27 17:55:09,838 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2019-12-27 17:55:09,839 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-SemanticLbe-MCR.epf
[2019-12-27 17:55:09,872 INFO  L113        SettingsManager]: Loading preferences was successful
[2019-12-27 17:55:09,872 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2019-12-27 17:55:09,875 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2019-12-27 17:55:09,876 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2019-12-27 17:55:09,876 INFO  L138        SettingsManager]:  * Use SBE=true
[2019-12-27 17:55:09,876 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2019-12-27 17:55:09,876 INFO  L138        SettingsManager]:  * sizeof long=4
[2019-12-27 17:55:09,876 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2019-12-27 17:55:09,877 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2019-12-27 17:55:09,877 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2019-12-27 17:55:09,877 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2019-12-27 17:55:09,877 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2019-12-27 17:55:09,877 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2019-12-27 17:55:09,877 INFO  L138        SettingsManager]:  * sizeof long double=12
[2019-12-27 17:55:09,881 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2019-12-27 17:55:09,881 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2019-12-27 17:55:09,881 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2019-12-27 17:55:09,881 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2019-12-27 17:55:09,882 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2019-12-27 17:55:09,882 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2019-12-27 17:55:09,882 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2019-12-27 17:55:09,882 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2019-12-27 17:55:09,883 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2019-12-27 17:55:09,885 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2019-12-27 17:55:09,885 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2019-12-27 17:55:09,885 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2019-12-27 17:55:09,885 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2019-12-27 17:55:09,886 INFO  L138        SettingsManager]:  * Override the interpolant automaton setting of the refinement strategy=true
[2019-12-27 17:55:09,886 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2019-12-27 17:55:09,886 INFO  L138        SettingsManager]:  * Interpolant automaton=MCR
[2019-12-27 17:55:09,886 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2019-12-27 17:55:10,220 INFO  L81    nceAwareModelManager]: Repository-Root is: /tmp
[2019-12-27 17:55:10,233 INFO  L258   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2019-12-27 17:55:10,237 INFO  L214   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2019-12-27 17:55:10,238 INFO  L271        PluginConnector]: Initializing CDTParser...
[2019-12-27 17:55:10,239 INFO  L275        PluginConnector]: CDTParser initialized
[2019-12-27 17:55:10,239 INFO  L428   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe000_power.opt.i
[2019-12-27 17:55:10,302 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/965d0faec/7b4b5c9eedac4c71a340cd601bc13e82/FLAG2e729e658
[2019-12-27 17:55:10,858 INFO  L306              CDTParser]: Found 1 translation units.
[2019-12-27 17:55:10,859 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe000_power.opt.i
[2019-12-27 17:55:10,875 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/965d0faec/7b4b5c9eedac4c71a340cd601bc13e82/FLAG2e729e658
[2019-12-27 17:55:11,143 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/965d0faec/7b4b5c9eedac4c71a340cd601bc13e82
[2019-12-27 17:55:11,153 INFO  L296   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2019-12-27 17:55:11,154 INFO  L131        ToolchainWalker]: Walking toolchain with 5 elements.
[2019-12-27 17:55:11,155 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2019-12-27 17:55:11,155 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2019-12-27 17:55:11,159 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2019-12-27 17:55:11,160 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:55:11" (1/1) ...
[2019-12-27 17:55:11,162 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ef2d690 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:55:11, skipping insertion in model container
[2019-12-27 17:55:11,163 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:55:11" (1/1) ...
[2019-12-27 17:55:11,170 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2019-12-27 17:55:11,243 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2019-12-27 17:55:11,827 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2019-12-27 17:55:11,839 INFO  L203         MainTranslator]: Completed pre-run
[2019-12-27 17:55:11,917 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2019-12-27 17:55:12,008 INFO  L208         MainTranslator]: Completed translation
[2019-12-27 17:55:12,008 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:55:12 WrapperNode
[2019-12-27 17:55:12,008 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2019-12-27 17:55:12,009 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2019-12-27 17:55:12,009 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2019-12-27 17:55:12,009 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2019-12-27 17:55:12,018 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:55:12" (1/1) ...
[2019-12-27 17:55:12,040 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:55:12" (1/1) ...
[2019-12-27 17:55:12,073 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2019-12-27 17:55:12,074 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2019-12-27 17:55:12,074 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2019-12-27 17:55:12,074 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2019-12-27 17:55:12,086 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:55:12" (1/1) ...
[2019-12-27 17:55:12,087 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:55:12" (1/1) ...
[2019-12-27 17:55:12,099 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:55:12" (1/1) ...
[2019-12-27 17:55:12,099 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:55:12" (1/1) ...
[2019-12-27 17:55:12,114 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:55:12" (1/1) ...
[2019-12-27 17:55:12,120 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:55:12" (1/1) ...
[2019-12-27 17:55:12,125 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:55:12" (1/1) ...
[2019-12-27 17:55:12,132 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2019-12-27 17:55:12,133 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2019-12-27 17:55:12,133 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2019-12-27 17:55:12,133 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2019-12-27 17:55:12,134 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:55:12" (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 17:55:12,200 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2019-12-27 17:55:12,201 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2019-12-27 17:55:12,201 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2019-12-27 17:55:12,201 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2019-12-27 17:55:12,201 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2019-12-27 17:55:12,202 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2019-12-27 17:55:12,202 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2019-12-27 17:55:12,202 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2019-12-27 17:55:12,202 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2019-12-27 17:55:12,202 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2019-12-27 17:55:12,203 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2019-12-27 17:55:12,203 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2019-12-27 17:55:12,203 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2019-12-27 17:55:12,203 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2019-12-27 17:55:12,203 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2019-12-27 17:55:12,205 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 17:55:13,156 INFO  L282             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2019-12-27 17:55:13,156 INFO  L287             CfgBuilder]: Removed 8 assume(true) statements.
[2019-12-27 17:55:13,158 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:55:13 BoogieIcfgContainer
[2019-12-27 17:55:13,158 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2019-12-27 17:55:13,160 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2019-12-27 17:55:13,160 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2019-12-27 17:55:13,163 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2019-12-27 17:55:13,163 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 05:55:11" (1/3) ...
[2019-12-27 17:55:13,164 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38636191 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:55:13, skipping insertion in model container
[2019-12-27 17:55:13,164 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:55:12" (2/3) ...
[2019-12-27 17:55:13,165 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38636191 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:55:13, skipping insertion in model container
[2019-12-27 17:55:13,165 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:55:13" (3/3) ...
[2019-12-27 17:55:13,167 INFO  L109   eAbstractionObserver]: Analyzing ICFG safe000_power.opt.i
[2019-12-27 17:55:13,178 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2019-12-27 17:55:13,178 INFO  L156   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2019-12-27 17:55:13,186 INFO  L168   ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations.
[2019-12-27 17:55:13,187 INFO  L340   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2019-12-27 17:55:13,238 WARN  L315   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,238 WARN  L315   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,238 WARN  L315   ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,238 WARN  L315   ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,239 WARN  L315   ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,239 WARN  L315   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,239 WARN  L315   ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,240 WARN  L315   ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,240 WARN  L315   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,240 WARN  L315   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,241 WARN  L315   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,241 WARN  L315   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,241 WARN  L315   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,241 WARN  L315   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,241 WARN  L315   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,242 WARN  L315   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,242 WARN  L315   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,242 WARN  L315   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,242 WARN  L315   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,242 WARN  L315   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,243 WARN  L315   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,243 WARN  L315   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,243 WARN  L315   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,243 WARN  L315   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,243 WARN  L315   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,244 WARN  L315   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,244 WARN  L315   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,244 WARN  L315   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,244 WARN  L315   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,244 WARN  L315   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,245 WARN  L315   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,245 WARN  L315   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,245 WARN  L315   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,245 WARN  L315   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,245 WARN  L315   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,246 WARN  L315   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,247 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,247 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,247 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,248 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,248 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,248 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,248 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,248 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,249 WARN  L315   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,249 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,249 WARN  L315   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,249 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,249 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,250 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,250 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,250 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,250 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,250 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,250 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,251 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,251 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,251 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,251 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,251 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,251 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,252 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,252 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,252 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,252 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,253 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,253 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,253 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,253 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,253 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,253 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,254 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,254 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,254 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,254 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,255 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,255 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,255 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,255 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,255 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,256 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,256 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,256 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,256 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,257 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,257 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,257 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,257 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,257 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,258 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,258 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,258 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,258 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,258 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,259 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,259 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,259 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,259 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,259 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,260 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,260 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,260 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,260 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,260 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,261 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,261 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,261 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,261 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,261 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,262 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,262 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,262 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,262 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,263 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,263 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,263 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,263 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,263 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,264 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,264 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,264 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,264 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,264 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,265 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,265 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,265 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,265 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,265 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,266 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,266 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,266 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,266 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,266 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,266 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,267 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,267 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,267 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,267 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,267 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,268 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,268 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,268 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,268 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,268 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,268 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,269 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,269 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,269 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,269 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,270 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,270 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,270 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,270 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,270 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,271 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,271 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,271 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,271 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,271 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,271 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,272 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,272 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,272 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,272 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,272 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,273 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,273 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,273 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,273 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,273 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,274 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,274 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,274 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,274 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,274 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,275 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,275 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem56| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,275 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,275 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,275 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,276 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,276 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,276 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,276 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,276 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,277 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,277 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,277 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,277 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,277 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,278 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,278 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem57| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,278 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,278 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,278 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,279 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,279 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,279 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,279 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,279 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,280 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,280 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem57| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,280 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,280 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,280 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,281 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,281 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,281 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,281 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,281 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,281 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,282 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,282 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,282 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,282 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem59| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,282 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,283 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,283 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem59| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,283 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,283 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,283 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,284 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,284 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,284 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,284 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,284 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,285 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,285 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,285 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,285 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,285 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,286 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,286 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,286 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,286 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,286 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,286 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,287 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,287 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,287 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,287 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,287 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,288 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,288 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,288 WARN  L315   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,288 WARN  L315   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,289 WARN  L315   ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,289 WARN  L315   ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,289 WARN  L315   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,289 WARN  L315   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,289 WARN  L315   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,290 WARN  L315   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,290 WARN  L315   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem66| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,290 WARN  L315   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,290 WARN  L315   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,290 WARN  L315   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem66| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,291 WARN  L315   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,291 WARN  L315   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,291 WARN  L315   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,291 WARN  L315   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,291 WARN  L315   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,292 WARN  L315   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,292 WARN  L315   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,292 WARN  L315   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,292 WARN  L315   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,293 WARN  L315   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,293 WARN  L315   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,293 WARN  L315   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,293 WARN  L315   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,293 WARN  L315   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,294 WARN  L315   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,294 WARN  L315   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,294 WARN  L315   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,294 WARN  L315   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,294 WARN  L315   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,294 WARN  L315   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,298 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,298 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,298 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,298 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,299 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,299 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,299 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,299 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,299 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,299 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,300 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,300 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,300 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,300 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,300 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem56| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,301 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,301 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,301 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,301 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,301 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,302 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,302 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,302 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,302 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,302 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,302 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,303 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,303 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,303 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,303 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,303 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,304 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,304 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,304 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,304 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,304 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,304 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,305 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,305 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,305 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,305 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,305 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,306 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem57| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,306 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem59| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,306 WARN  L315   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,306 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,306 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,307 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,307 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,307 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,307 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,307 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,307 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,308 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,308 WARN  L315   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,308 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,308 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,308 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,309 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,309 WARN  L315   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,312 WARN  L315   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,313 WARN  L315   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,313 WARN  L315   ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,313 WARN  L315   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,313 WARN  L315   ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,313 WARN  L315   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,314 WARN  L315   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,314 WARN  L315   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem66| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,314 WARN  L315   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,314 WARN  L315   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,314 WARN  L315   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,317 WARN  L315   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,317 WARN  L315   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,318 WARN  L315   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,318 WARN  L315   ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,318 WARN  L315   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,318 WARN  L315   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,318 WARN  L315   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,319 WARN  L315   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,320 WARN  L315   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,320 WARN  L315   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,321 WARN  L315   ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,322 WARN  L315   ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,328 WARN  L315   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2019-12-27 17:55:13,345 INFO  L249      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2019-12-27 17:55:13,369 INFO  L373      AbstractCegarLoop]: Interprodecural is true
[2019-12-27 17:55:13,369 INFO  L374      AbstractCegarLoop]: Hoare is true
[2019-12-27 17:55:13,369 INFO  L375      AbstractCegarLoop]: Compute interpolants for FPandBP
[2019-12-27 17:55:13,369 INFO  L376      AbstractCegarLoop]: Backedges is MCR
[2019-12-27 17:55:13,370 INFO  L377      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2019-12-27 17:55:13,370 INFO  L378      AbstractCegarLoop]: Difference is false
[2019-12-27 17:55:13,370 INFO  L379      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2019-12-27 17:55:13,370 INFO  L383      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2019-12-27 17:55:13,394 INFO  L152   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 235 places, 293 transitions
[2019-12-27 17:55:13,396 INFO  L68            FinitePrefix]: Start finitePrefix. Operand has 235 places, 293 transitions
[2019-12-27 17:55:13,537 INFO  L132       PetriNetUnfolder]: 68/290 cut-off events.
[2019-12-27 17:55:13,538 INFO  L133       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2019-12-27 17:55:13,561 INFO  L76            FinitePrefix]: Finished finitePrefix Result has 300 conditions, 290 events. 68/290 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 783 event pairs. 0/220 useless extension candidates. Maximal degree in co-relation 242. Up to 2 conditions per place. 
[2019-12-27 17:55:13,611 INFO  L68            FinitePrefix]: Start finitePrefix. Operand has 235 places, 293 transitions
[2019-12-27 17:55:13,753 INFO  L132       PetriNetUnfolder]: 68/290 cut-off events.
[2019-12-27 17:55:13,754 INFO  L133       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2019-12-27 17:55:13,769 INFO  L76            FinitePrefix]: Finished finitePrefix Result has 300 conditions, 290 events. 68/290 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 783 event pairs. 0/220 useless extension candidates. Maximal degree in co-relation 242. Up to 2 conditions per place. 
[2019-12-27 17:55:13,802 INFO  L158   etLargeBlockEncoding]: Number of co-enabled transitions 31682
[2019-12-27 17:55:13,803 INFO  L170   etLargeBlockEncoding]: Semantic Check.
[2019-12-27 17:55:20,924 WARN  L192               SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 118
[2019-12-27 17:55:21,112 WARN  L192               SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 114
[2019-12-27 17:55:21,632 WARN  L192               SmtUtils]: Spent 497.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 132
[2019-12-27 17:55:21,910 WARN  L192               SmtUtils]: Spent 275.00 ms on a formula simplification that was a NOOP. DAG size: 130
[2019-12-27 17:55:21,958 INFO  L206   etLargeBlockEncoding]: Checked pairs total: 167703
[2019-12-27 17:55:21,958 INFO  L214   etLargeBlockEncoding]: Total number of compositions: 175
[2019-12-27 17:55:21,962 INFO  L100   iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 118 places, 145 transitions
[2019-12-27 17:56:08,432 INFO  L122   iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 215972 states.
[2019-12-27 17:56:08,434 INFO  L276                IsEmpty]: Start isEmpty. Operand 215972 states.
[2019-12-27 17:56:08,439 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 4
[2019-12-27 17:56:08,439 INFO  L403         BasicCegarLoop]: Found error trace
[2019-12-27 17:56:08,440 INFO  L411         BasicCegarLoop]: trace histogram [1, 1, 1]
[2019-12-27 17:56:08,440 INFO  L410      AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-12-27 17:56:08,445 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-12-27 17:56:08,445 INFO  L82        PathProgramCache]: Analyzing trace with hash 1275411, now seen corresponding path program 1 times
[2019-12-27 17:56:08,454 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-12-27 17:56:08,454 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220991723]
[2019-12-27 17:56:08,455 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-12-27 17:56:08,577 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-12-27 17:56:08,664 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 17:56:08,665 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220991723]
[2019-12-27 17:56:08,665 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-12-27 17:56:08,666 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2019-12-27 17:56:08,666 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1192346451]
[2019-12-27 17:56:08,667 INFO  L132   pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class.
[2019-12-27 17:56:08,671 INFO  L197   pAbStrategyModuleMcr]: Started intersection.
[2019-12-27 17:56:08,683 INFO  L208   pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions.
[2019-12-27 17:56:08,684 INFO  L219   pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton.
[2019-12-27 17:56:08,687 INFO  L288   pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times.
[2019-12-27 17:56:08,688 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-12-27 17:56:08,688 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-12-27 17:56:08,702 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-12-27 17:56:08,703 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-12-27 17:56:08,705 INFO  L87              Difference]: Start difference. First operand 215972 states. Second operand 3 states.
[2019-12-27 17:56:13,237 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-12-27 17:56:13,237 INFO  L93              Difference]: Finished difference Result 214184 states and 960653 transitions.
[2019-12-27 17:56:13,237 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-12-27 17:56:13,239 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 3
[2019-12-27 17:56:13,239 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-12-27 17:56:18,983 INFO  L225             Difference]: With dead ends: 214184
[2019-12-27 17:56:18,983 INFO  L226             Difference]: Without dead ends: 203875
[2019-12-27 17:56:18,985 INFO  L631         BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-12-27 17:56:27,876 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 203875 states.
[2019-12-27 17:56:31,998 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 203875 to 203875.
[2019-12-27 17:56:31,999 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 203875 states.
[2019-12-27 17:56:41,027 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 203875 states to 203875 states and 914061 transitions.
[2019-12-27 17:56:41,028 INFO  L78                 Accepts]: Start accepts. Automaton has 203875 states and 914061 transitions. Word has length 3
[2019-12-27 17:56:41,028 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-12-27 17:56:41,028 INFO  L462      AbstractCegarLoop]: Abstraction has 203875 states and 914061 transitions.
[2019-12-27 17:56:41,028 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-12-27 17:56:41,028 INFO  L276                IsEmpty]: Start isEmpty. Operand 203875 states and 914061 transitions.
[2019-12-27 17:56:41,048 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2019-12-27 17:56:41,049 INFO  L403         BasicCegarLoop]: Found error trace
[2019-12-27 17:56:41,049 INFO  L411         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-12-27 17:56:41,049 INFO  L410      AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-12-27 17:56:41,049 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-12-27 17:56:41,049 INFO  L82        PathProgramCache]: Analyzing trace with hash -290709070, now seen corresponding path program 1 times
[2019-12-27 17:56:41,050 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-12-27 17:56:41,050 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171239402]
[2019-12-27 17:56:41,050 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-12-27 17:56:41,086 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-12-27 17:56:41,202 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 17:56:41,202 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171239402]
[2019-12-27 17:56:41,202 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-12-27 17:56:41,203 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2019-12-27 17:56:41,203 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1456342719]
[2019-12-27 17:56:41,203 INFO  L132   pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class.
[2019-12-27 17:56:41,205 INFO  L197   pAbStrategyModuleMcr]: Started intersection.
[2019-12-27 17:56:41,210 INFO  L208   pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions.
[2019-12-27 17:56:41,210 INFO  L219   pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton.
[2019-12-27 17:56:41,210 INFO  L288   pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times.
[2019-12-27 17:56:41,212 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-12-27 17:56:41,212 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-12-27 17:56:41,212 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-12-27 17:56:41,212 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2019-12-27 17:56:41,212 INFO  L87              Difference]: Start difference. First operand 203875 states and 914061 transitions. Second operand 4 states.
[2019-12-27 17:56:51,741 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-12-27 17:56:51,741 INFO  L93              Difference]: Finished difference Result 324533 states and 1382292 transitions.
[2019-12-27 17:56:51,741 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2019-12-27 17:56:51,742 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 13
[2019-12-27 17:56:51,742 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-12-27 17:56:54,162 INFO  L225             Difference]: With dead ends: 324533
[2019-12-27 17:56:54,162 INFO  L226             Difference]: Without dead ends: 324484
[2019-12-27 17:56:54,163 INFO  L631         BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2019-12-27 17:57:10,781 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 324484 states.
[2019-12-27 17:57:16,459 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 324484 to 303600.
[2019-12-27 17:57:16,460 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 303600 states.
[2019-12-27 17:57:18,716 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 303600 states to 303600 states and 1306247 transitions.
[2019-12-27 17:57:18,716 INFO  L78                 Accepts]: Start accepts. Automaton has 303600 states and 1306247 transitions. Word has length 13
[2019-12-27 17:57:18,717 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-12-27 17:57:18,717 INFO  L462      AbstractCegarLoop]: Abstraction has 303600 states and 1306247 transitions.
[2019-12-27 17:57:18,717 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-12-27 17:57:18,718 INFO  L276                IsEmpty]: Start isEmpty. Operand 303600 states and 1306247 transitions.
[2019-12-27 17:57:18,721 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2019-12-27 17:57:18,721 INFO  L403         BasicCegarLoop]: Found error trace
[2019-12-27 17:57:18,721 INFO  L411         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-12-27 17:57:18,722 INFO  L410      AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-12-27 17:57:18,722 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-12-27 17:57:18,722 INFO  L82        PathProgramCache]: Analyzing trace with hash -1628230467, now seen corresponding path program 1 times
[2019-12-27 17:57:18,723 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-12-27 17:57:18,723 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138795540]
[2019-12-27 17:57:18,723 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-12-27 17:57:18,796 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-12-27 17:57:18,891 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 17:57:18,892 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138795540]
[2019-12-27 17:57:18,892 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-12-27 17:57:18,893 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-12-27 17:57:18,893 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [241921083]
[2019-12-27 17:57:18,893 INFO  L132   pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class.
[2019-12-27 17:57:18,896 INFO  L197   pAbStrategyModuleMcr]: Started intersection.
[2019-12-27 17:57:18,898 INFO  L208   pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions.
[2019-12-27 17:57:18,898 INFO  L219   pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton.
[2019-12-27 17:57:18,898 INFO  L288   pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times.
[2019-12-27 17:57:18,898 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-12-27 17:57:18,899 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-12-27 17:57:18,899 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-12-27 17:57:18,899 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2019-12-27 17:57:18,899 INFO  L87              Difference]: Start difference. First operand 303600 states and 1306247 transitions. Second operand 4 states.
[2019-12-27 17:57:27,601 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-12-27 17:57:27,601 INFO  L93              Difference]: Finished difference Result 76848 states and 273255 transitions.
[2019-12-27 17:57:27,601 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2019-12-27 17:57:27,602 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 13
[2019-12-27 17:57:27,602 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-12-27 17:57:27,731 INFO  L225             Difference]: With dead ends: 76848
[2019-12-27 17:57:27,731 INFO  L226             Difference]: Without dead ends: 60146
[2019-12-27 17:57:27,731 INFO  L631         BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2019-12-27 17:57:28,090 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 60146 states.
[2019-12-27 17:57:29,135 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 60146 to 60058.
[2019-12-27 17:57:29,135 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 60058 states.
[2019-12-27 17:57:29,272 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 60058 states to 60058 states and 204368 transitions.
[2019-12-27 17:57:29,272 INFO  L78                 Accepts]: Start accepts. Automaton has 60058 states and 204368 transitions. Word has length 13
[2019-12-27 17:57:29,272 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-12-27 17:57:29,272 INFO  L462      AbstractCegarLoop]: Abstraction has 60058 states and 204368 transitions.
[2019-12-27 17:57:29,273 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-12-27 17:57:29,273 INFO  L276                IsEmpty]: Start isEmpty. Operand 60058 states and 204368 transitions.
[2019-12-27 17:57:29,276 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2019-12-27 17:57:29,276 INFO  L403         BasicCegarLoop]: Found error trace
[2019-12-27 17:57:29,276 INFO  L411         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-12-27 17:57:29,276 INFO  L410      AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-12-27 17:57:29,277 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-12-27 17:57:29,277 INFO  L82        PathProgramCache]: Analyzing trace with hash 493639973, now seen corresponding path program 1 times
[2019-12-27 17:57:29,277 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-12-27 17:57:29,278 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545321570]
[2019-12-27 17:57:29,278 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-12-27 17:57:29,305 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-12-27 17:57:29,391 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 17:57:29,392 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545321570]
[2019-12-27 17:57:29,392 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-12-27 17:57:29,392 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2019-12-27 17:57:29,392 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1954235953]
[2019-12-27 17:57:29,392 INFO  L132   pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class.
[2019-12-27 17:57:29,394 INFO  L197   pAbStrategyModuleMcr]: Started intersection.
[2019-12-27 17:57:29,395 INFO  L208   pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions.
[2019-12-27 17:57:29,396 INFO  L219   pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton.
[2019-12-27 17:57:29,396 INFO  L288   pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times.
[2019-12-27 17:57:29,396 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 5 states
[2019-12-27 17:57:29,397 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-12-27 17:57:29,397 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2019-12-27 17:57:29,397 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2019-12-27 17:57:29,397 INFO  L87              Difference]: Start difference. First operand 60058 states and 204368 transitions. Second operand 5 states.
[2019-12-27 17:57:30,179 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-12-27 17:57:30,179 INFO  L93              Difference]: Finished difference Result 90882 states and 302492 transitions.
[2019-12-27 17:57:30,180 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2019-12-27 17:57:30,180 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 14
[2019-12-27 17:57:30,180 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-12-27 17:57:30,359 INFO  L225             Difference]: With dead ends: 90882
[2019-12-27 17:57:30,359 INFO  L226             Difference]: Without dead ends: 90882
[2019-12-27 17:57:30,360 INFO  L631         BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2019-12-27 17:57:30,785 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 90882 states.
[2019-12-27 17:57:32,270 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 90882 to 68374.
[2019-12-27 17:57:32,271 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 68374 states.
[2019-12-27 17:57:32,436 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 68374 states to 68374 states and 231353 transitions.
[2019-12-27 17:57:32,437 INFO  L78                 Accepts]: Start accepts. Automaton has 68374 states and 231353 transitions. Word has length 14
[2019-12-27 17:57:32,437 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-12-27 17:57:32,437 INFO  L462      AbstractCegarLoop]: Abstraction has 68374 states and 231353 transitions.
[2019-12-27 17:57:32,437 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2019-12-27 17:57:32,437 INFO  L276                IsEmpty]: Start isEmpty. Operand 68374 states and 231353 transitions.
[2019-12-27 17:57:32,440 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2019-12-27 17:57:32,440 INFO  L403         BasicCegarLoop]: Found error trace
[2019-12-27 17:57:32,440 INFO  L411         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-12-27 17:57:32,441 INFO  L410      AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-12-27 17:57:32,441 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-12-27 17:57:32,441 INFO  L82        PathProgramCache]: Analyzing trace with hash 493446192, now seen corresponding path program 1 times
[2019-12-27 17:57:32,442 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-12-27 17:57:32,442 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621174001]
[2019-12-27 17:57:32,442 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-12-27 17:57:32,458 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-12-27 17:57:32,498 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-12-27 17:57:32,498 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621174001]
[2019-12-27 17:57:32,499 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-12-27 17:57:32,499 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-12-27 17:57:32,499 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1199638303]
[2019-12-27 17:57:32,499 INFO  L132   pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class.
[2019-12-27 17:57:32,501 INFO  L197   pAbStrategyModuleMcr]: Started intersection.
[2019-12-27 17:57:32,503 INFO  L208   pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions.
[2019-12-27 17:57:32,503 INFO  L219   pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton.
[2019-12-27 17:57:32,503 INFO  L288   pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times.
[2019-12-27 17:57:32,503 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-12-27 17:57:32,504 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-12-27 17:57:32,504 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-12-27 17:57:32,504 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-12-27 17:57:32,504 INFO  L87              Difference]: Start difference. First operand 68374 states and 231353 transitions. Second operand 3 states.
[2019-12-27 17:57:32,877 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-12-27 17:57:32,878 INFO  L93              Difference]: Finished difference Result 88286 states and 296272 transitions.
[2019-12-27 17:57:32,878 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-12-27 17:57:32,878 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 14
[2019-12-27 17:57:32,878 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-12-27 17:57:33,063 INFO  L225             Difference]: With dead ends: 88286
[2019-12-27 17:57:33,064 INFO  L226             Difference]: Without dead ends: 88286
[2019-12-27 17:57:33,064 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 17:57:34,054 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 88286 states.
[2019-12-27 17:57:34,913 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 88286 to 72802.
[2019-12-27 17:57:34,913 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 72802 states.
[2019-12-27 17:57:39,380 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 72802 states to 72802 states and 247095 transitions.
[2019-12-27 17:57:39,381 INFO  L78                 Accepts]: Start accepts. Automaton has 72802 states and 247095 transitions. Word has length 14
[2019-12-27 17:57:39,381 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-12-27 17:57:39,381 INFO  L462      AbstractCegarLoop]: Abstraction has 72802 states and 247095 transitions.
[2019-12-27 17:57:39,381 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-12-27 17:57:39,381 INFO  L276                IsEmpty]: Start isEmpty. Operand 72802 states and 247095 transitions.
[2019-12-27 17:57:39,383 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2019-12-27 17:57:39,383 INFO  L403         BasicCegarLoop]: Found error trace
[2019-12-27 17:57:39,384 INFO  L411         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-12-27 17:57:39,384 INFO  L410      AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-12-27 17:57:39,384 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-12-27 17:57:39,384 INFO  L82        PathProgramCache]: Analyzing trace with hash 301502779, now seen corresponding path program 1 times
[2019-12-27 17:57:39,384 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-12-27 17:57:39,385 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297048408]
[2019-12-27 17:57:39,385 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-12-27 17:57:39,403 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-12-27 17:57:39,469 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 17:57:39,469 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297048408]
[2019-12-27 17:57:39,469 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-12-27 17:57:39,470 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2019-12-27 17:57:39,470 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1147053445]
[2019-12-27 17:57:39,470 INFO  L132   pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class.
[2019-12-27 17:57:39,472 INFO  L197   pAbStrategyModuleMcr]: Started intersection.
[2019-12-27 17:57:39,473 INFO  L208   pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions.
[2019-12-27 17:57:39,473 INFO  L219   pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton.
[2019-12-27 17:57:39,473 INFO  L288   pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times.
[2019-12-27 17:57:39,473 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 5 states
[2019-12-27 17:57:39,474 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-12-27 17:57:39,474 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2019-12-27 17:57:39,474 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2019-12-27 17:57:39,474 INFO  L87              Difference]: Start difference. First operand 72802 states and 247095 transitions. Second operand 5 states.
[2019-12-27 17:57:40,169 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-12-27 17:57:40,169 INFO  L93              Difference]: Finished difference Result 94484 states and 314683 transitions.
[2019-12-27 17:57:40,170 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2019-12-27 17:57:40,170 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 14
[2019-12-27 17:57:40,170 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-12-27 17:57:40,353 INFO  L225             Difference]: With dead ends: 94484
[2019-12-27 17:57:40,353 INFO  L226             Difference]: Without dead ends: 94484
[2019-12-27 17:57:40,354 INFO  L631         BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2019-12-27 17:57:40,784 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 94484 states.
[2019-12-27 17:57:42,035 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 94484 to 75797.
[2019-12-27 17:57:42,036 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 75797 states.
[2019-12-27 17:57:42,225 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 75797 states to 75797 states and 257185 transitions.
[2019-12-27 17:57:42,226 INFO  L78                 Accepts]: Start accepts. Automaton has 75797 states and 257185 transitions. Word has length 14
[2019-12-27 17:57:42,226 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-12-27 17:57:42,226 INFO  L462      AbstractCegarLoop]: Abstraction has 75797 states and 257185 transitions.
[2019-12-27 17:57:42,226 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2019-12-27 17:57:42,226 INFO  L276                IsEmpty]: Start isEmpty. Operand 75797 states and 257185 transitions.
[2019-12-27 17:57:42,245 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 23
[2019-12-27 17:57:42,245 INFO  L403         BasicCegarLoop]: Found error trace
[2019-12-27 17:57:42,245 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]
[2019-12-27 17:57:42,246 INFO  L410      AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-12-27 17:57:42,246 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-12-27 17:57:42,246 INFO  L82        PathProgramCache]: Analyzing trace with hash -1815258356, now seen corresponding path program 1 times
[2019-12-27 17:57:42,246 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-12-27 17:57:42,247 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392768039]
[2019-12-27 17:57:42,247 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-12-27 17:57:42,282 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-12-27 17:57:42,384 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 17:57:42,384 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392768039]
[2019-12-27 17:57:42,385 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-12-27 17:57:42,385 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-12-27 17:57:42,385 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1513045291]
[2019-12-27 17:57:42,385 INFO  L132   pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class.
[2019-12-27 17:57:42,388 INFO  L197   pAbStrategyModuleMcr]: Started intersection.
[2019-12-27 17:57:42,396 INFO  L208   pAbStrategyModuleMcr]: Finished intersection with 32 states and 40 transitions.
[2019-12-27 17:57:42,396 INFO  L219   pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton.
[2019-12-27 17:57:42,397 INFO  L288   pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times.
[2019-12-27 17:57:42,398 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 5 states
[2019-12-27 17:57:42,398 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-12-27 17:57:42,398 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2019-12-27 17:57:42,398 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2019-12-27 17:57:42,398 INFO  L87              Difference]: Start difference. First operand 75797 states and 257185 transitions. Second operand 5 states.
[2019-12-27 17:57:43,389 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-12-27 17:57:43,389 INFO  L93              Difference]: Finished difference Result 105721 states and 350222 transitions.
[2019-12-27 17:57:43,389 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2019-12-27 17:57:43,389 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 22
[2019-12-27 17:57:43,390 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-12-27 17:57:44,270 INFO  L225             Difference]: With dead ends: 105721
[2019-12-27 17:57:44,271 INFO  L226             Difference]: Without dead ends: 105665
[2019-12-27 17:57:44,272 INFO  L631         BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 3 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 17:57:44,752 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 105665 states.
[2019-12-27 17:57:49,835 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 105665 to 76774.
[2019-12-27 17:57:49,836 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 76774 states.
[2019-12-27 17:57:50,015 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 76774 states to 76774 states and 260096 transitions.
[2019-12-27 17:57:50,015 INFO  L78                 Accepts]: Start accepts. Automaton has 76774 states and 260096 transitions. Word has length 22
[2019-12-27 17:57:50,016 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-12-27 17:57:50,016 INFO  L462      AbstractCegarLoop]: Abstraction has 76774 states and 260096 transitions.
[2019-12-27 17:57:50,016 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2019-12-27 17:57:50,016 INFO  L276                IsEmpty]: Start isEmpty. Operand 76774 states and 260096 transitions.
[2019-12-27 17:57:50,029 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 23
[2019-12-27 17:57:50,029 INFO  L403         BasicCegarLoop]: Found error trace
[2019-12-27 17:57:50,029 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]
[2019-12-27 17:57:50,030 INFO  L410      AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-12-27 17:57:50,030 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-12-27 17:57:50,030 INFO  L82        PathProgramCache]: Analyzing trace with hash -1131197002, now seen corresponding path program 1 times
[2019-12-27 17:57:50,031 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-12-27 17:57:50,031 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721657213]
[2019-12-27 17:57:50,031 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-12-27 17:57:50,054 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-12-27 17:57:50,118 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 17:57:50,119 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721657213]
[2019-12-27 17:57:50,119 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-12-27 17:57:50,119 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2019-12-27 17:57:50,119 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2041291020]
[2019-12-27 17:57:50,119 INFO  L132   pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class.
[2019-12-27 17:57:50,122 INFO  L197   pAbStrategyModuleMcr]: Started intersection.
[2019-12-27 17:57:50,134 INFO  L208   pAbStrategyModuleMcr]: Finished intersection with 50 states and 76 transitions.
[2019-12-27 17:57:50,135 INFO  L219   pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton.
[2019-12-27 17:57:50,137 INFO  L288   pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times.
[2019-12-27 17:57:50,138 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 6 states
[2019-12-27 17:57:50,138 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-12-27 17:57:50,138 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2019-12-27 17:57:50,139 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2019-12-27 17:57:50,139 INFO  L87              Difference]: Start difference. First operand 76774 states and 260096 transitions. Second operand 6 states.
[2019-12-27 17:57:51,295 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-12-27 17:57:51,295 INFO  L93              Difference]: Finished difference Result 112565 states and 368867 transitions.
[2019-12-27 17:57:51,295 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2019-12-27 17:57:51,296 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 22
[2019-12-27 17:57:51,296 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-12-27 17:57:51,524 INFO  L225             Difference]: With dead ends: 112565
[2019-12-27 17:57:51,524 INFO  L226             Difference]: Without dead ends: 112509
[2019-12-27 17:57:51,524 INFO  L631         BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156
[2019-12-27 17:57:52,006 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 112509 states.
[2019-12-27 17:57:53,441 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 112509 to 75546.
[2019-12-27 17:57:53,441 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 75546 states.
[2019-12-27 17:57:53,625 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 75546 states to 75546 states and 256004 transitions.
[2019-12-27 17:57:53,625 INFO  L78                 Accepts]: Start accepts. Automaton has 75546 states and 256004 transitions. Word has length 22
[2019-12-27 17:57:53,626 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-12-27 17:57:53,626 INFO  L462      AbstractCegarLoop]: Abstraction has 75546 states and 256004 transitions.
[2019-12-27 17:57:53,626 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2019-12-27 17:57:53,626 INFO  L276                IsEmpty]: Start isEmpty. Operand 75546 states and 256004 transitions.
[2019-12-27 17:57:53,649 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 26
[2019-12-27 17:57:53,649 INFO  L403         BasicCegarLoop]: Found error trace
[2019-12-27 17:57:53,649 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]
[2019-12-27 17:57:53,649 INFO  L410      AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-12-27 17:57:53,649 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-12-27 17:57:53,650 INFO  L82        PathProgramCache]: Analyzing trace with hash 1046633016, now seen corresponding path program 1 times
[2019-12-27 17:57:53,650 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-12-27 17:57:53,650 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511127352]
[2019-12-27 17:57:53,650 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-12-27 17:57:53,672 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-12-27 17:57:53,729 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 17:57:53,730 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511127352]
[2019-12-27 17:57:53,730 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-12-27 17:57:53,730 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2019-12-27 17:57:53,730 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1810881501]
[2019-12-27 17:57:53,730 INFO  L132   pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class.
[2019-12-27 17:57:53,734 INFO  L197   pAbStrategyModuleMcr]: Started intersection.
[2019-12-27 17:57:53,741 INFO  L208   pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions.
[2019-12-27 17:57:53,741 INFO  L219   pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton.
[2019-12-27 17:57:53,742 INFO  L288   pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times.
[2019-12-27 17:57:53,742 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 5 states
[2019-12-27 17:57:53,742 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-12-27 17:57:53,742 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2019-12-27 17:57:53,743 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2019-12-27 17:57:53,743 INFO  L87              Difference]: Start difference. First operand 75546 states and 256004 transitions. Second operand 5 states.
[2019-12-27 17:57:54,425 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-12-27 17:57:54,426 INFO  L93              Difference]: Finished difference Result 31805 states and 101585 transitions.
[2019-12-27 17:57:54,426 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2019-12-27 17:57:54,427 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 25
[2019-12-27 17:57:54,427 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-12-27 17:57:54,472 INFO  L225             Difference]: With dead ends: 31805
[2019-12-27 17:57:54,473 INFO  L226             Difference]: Without dead ends: 28263
[2019-12-27 17:57:54,473 INFO  L631         BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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 17:57:54,592 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 28263 states.
[2019-12-27 17:57:54,865 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 28263 to 27685.
[2019-12-27 17:57:54,865 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 27685 states.
[2019-12-27 17:57:54,922 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 27685 states to 27685 states and 88555 transitions.
[2019-12-27 17:57:54,922 INFO  L78                 Accepts]: Start accepts. Automaton has 27685 states and 88555 transitions. Word has length 25
[2019-12-27 17:57:54,923 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-12-27 17:57:54,923 INFO  L462      AbstractCegarLoop]: Abstraction has 27685 states and 88555 transitions.
[2019-12-27 17:57:54,923 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2019-12-27 17:57:54,923 INFO  L276                IsEmpty]: Start isEmpty. Operand 27685 states and 88555 transitions.
[2019-12-27 17:57:54,945 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 26
[2019-12-27 17:57:54,945 INFO  L403         BasicCegarLoop]: Found error trace
[2019-12-27 17:57:54,945 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]
[2019-12-27 17:57:54,945 INFO  L410      AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-12-27 17:57:54,945 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-12-27 17:57:54,946 INFO  L82        PathProgramCache]: Analyzing trace with hash 1294927494, now seen corresponding path program 1 times
[2019-12-27 17:57:54,946 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-12-27 17:57:54,946 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14505519]
[2019-12-27 17:57:54,946 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-12-27 17:57:54,968 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-12-27 17:57:55,008 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 17:57:55,008 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14505519]
[2019-12-27 17:57:55,008 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-12-27 17:57:55,009 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-12-27 17:57:55,009 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [912318428]
[2019-12-27 17:57:55,009 INFO  L132   pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class.
[2019-12-27 17:57:55,013 INFO  L197   pAbStrategyModuleMcr]: Started intersection.
[2019-12-27 17:57:55,019 INFO  L208   pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions.
[2019-12-27 17:57:55,019 INFO  L219   pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton.
[2019-12-27 17:57:55,020 INFO  L288   pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times.
[2019-12-27 17:57:55,020 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-12-27 17:57:55,020 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-12-27 17:57:55,020 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-12-27 17:57:55,021 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-12-27 17:57:55,021 INFO  L87              Difference]: Start difference. First operand 27685 states and 88555 transitions. Second operand 3 states.
[2019-12-27 17:57:55,227 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-12-27 17:57:55,228 INFO  L93              Difference]: Finished difference Result 34408 states and 105180 transitions.
[2019-12-27 17:57:55,228 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-12-27 17:57:55,228 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 25
[2019-12-27 17:57:55,229 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-12-27 17:57:55,303 INFO  L225             Difference]: With dead ends: 34408
[2019-12-27 17:57:55,303 INFO  L226             Difference]: Without dead ends: 34408
[2019-12-27 17:57:55,304 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 17:57:55,499 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 34408 states.
[2019-12-27 17:57:55,820 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 34408 to 27685.
[2019-12-27 17:57:55,820 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 27685 states.
[2019-12-27 17:57:55,874 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 27685 states to 27685 states and 85482 transitions.
[2019-12-27 17:57:55,875 INFO  L78                 Accepts]: Start accepts. Automaton has 27685 states and 85482 transitions. Word has length 25
[2019-12-27 17:57:55,875 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-12-27 17:57:55,875 INFO  L462      AbstractCegarLoop]: Abstraction has 27685 states and 85482 transitions.
[2019-12-27 17:57:55,875 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-12-27 17:57:55,875 INFO  L276                IsEmpty]: Start isEmpty. Operand 27685 states and 85482 transitions.
[2019-12-27 17:57:55,895 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 26
[2019-12-27 17:57:55,895 INFO  L403         BasicCegarLoop]: Found error trace
[2019-12-27 17:57:55,895 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]
[2019-12-27 17:57:55,895 INFO  L410      AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-12-27 17:57:55,895 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-12-27 17:57:55,896 INFO  L82        PathProgramCache]: Analyzing trace with hash 162333435, now seen corresponding path program 1 times
[2019-12-27 17:57:55,896 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-12-27 17:57:55,896 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833436702]
[2019-12-27 17:57:55,896 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-12-27 17:57:55,918 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-12-27 17:57:56,038 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 17:57:56,038 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833436702]
[2019-12-27 17:57:56,039 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-12-27 17:57:56,039 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2019-12-27 17:57:56,039 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1668126593]
[2019-12-27 17:57:56,040 INFO  L132   pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class.
[2019-12-27 17:57:56,044 INFO  L197   pAbStrategyModuleMcr]: Started intersection.
[2019-12-27 17:57:56,049 INFO  L208   pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions.
[2019-12-27 17:57:56,049 INFO  L219   pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton.
[2019-12-27 17:57:56,050 INFO  L288   pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times.
[2019-12-27 17:57:56,050 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 6 states
[2019-12-27 17:57:56,050 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-12-27 17:57:56,050 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2019-12-27 17:57:56,050 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2019-12-27 17:57:56,051 INFO  L87              Difference]: Start difference. First operand 27685 states and 85482 transitions. Second operand 6 states.
[2019-12-27 17:57:56,878 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-12-27 17:57:56,879 INFO  L93              Difference]: Finished difference Result 35902 states and 108691 transitions.
[2019-12-27 17:57:56,879 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2019-12-27 17:57:56,879 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 25
[2019-12-27 17:57:56,880 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-12-27 17:57:56,960 INFO  L225             Difference]: With dead ends: 35902
[2019-12-27 17:57:56,960 INFO  L226             Difference]: Without dead ends: 35726
[2019-12-27 17:57:56,961 INFO  L631         BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72
[2019-12-27 17:57:57,136 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 35726 states.
[2019-12-27 17:57:57,488 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 35726 to 32087.
[2019-12-27 17:57:57,489 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 32087 states.
[2019-12-27 17:57:57,550 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 32087 states to 32087 states and 98416 transitions.
[2019-12-27 17:57:57,550 INFO  L78                 Accepts]: Start accepts. Automaton has 32087 states and 98416 transitions. Word has length 25
[2019-12-27 17:57:57,551 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-12-27 17:57:57,551 INFO  L462      AbstractCegarLoop]: Abstraction has 32087 states and 98416 transitions.
[2019-12-27 17:57:57,551 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2019-12-27 17:57:57,551 INFO  L276                IsEmpty]: Start isEmpty. Operand 32087 states and 98416 transitions.
[2019-12-27 17:57:57,573 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 27
[2019-12-27 17:57:57,573 INFO  L403         BasicCegarLoop]: Found error trace
[2019-12-27 17:57:57,573 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]
[2019-12-27 17:57:57,573 INFO  L410      AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-12-27 17:57:57,573 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-12-27 17:57:57,574 INFO  L82        PathProgramCache]: Analyzing trace with hash 864615985, now seen corresponding path program 1 times
[2019-12-27 17:57:57,574 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-12-27 17:57:57,574 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620761771]
[2019-12-27 17:57:57,574 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-12-27 17:57:57,588 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-12-27 17:57:57,653 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 17:57:57,654 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620761771]
[2019-12-27 17:57:57,654 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-12-27 17:57:57,654 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2019-12-27 17:57:57,654 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1617193077]
[2019-12-27 17:57:57,654 INFO  L132   pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class.
[2019-12-27 17:57:57,657 INFO  L197   pAbStrategyModuleMcr]: Started intersection.
[2019-12-27 17:57:57,662 INFO  L208   pAbStrategyModuleMcr]: Finished intersection with 27 states and 26 transitions.
[2019-12-27 17:57:57,662 INFO  L219   pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton.
[2019-12-27 17:57:57,663 INFO  L288   pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times.
[2019-12-27 17:57:57,663 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 5 states
[2019-12-27 17:57:57,663 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-12-27 17:57:57,663 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2019-12-27 17:57:57,664 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2019-12-27 17:57:57,664 INFO  L87              Difference]: Start difference. First operand 32087 states and 98416 transitions. Second operand 5 states.
[2019-12-27 17:57:58,261 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-12-27 17:57:58,262 INFO  L93              Difference]: Finished difference Result 45262 states and 137957 transitions.
[2019-12-27 17:57:58,262 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2019-12-27 17:57:58,262 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 26
[2019-12-27 17:57:58,263 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-12-27 17:57:58,335 INFO  L225             Difference]: With dead ends: 45262
[2019-12-27 17:57:58,336 INFO  L226             Difference]: Without dead ends: 45044
[2019-12-27 17:57:58,336 INFO  L631         BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 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 17:57:58,494 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 45044 states.
[2019-12-27 17:57:59,104 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 45044 to 33151.
[2019-12-27 17:57:59,104 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 33151 states.
[2019-12-27 17:57:59,169 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 33151 states to 33151 states and 101850 transitions.
[2019-12-27 17:57:59,169 INFO  L78                 Accepts]: Start accepts. Automaton has 33151 states and 101850 transitions. Word has length 26
[2019-12-27 17:57:59,169 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-12-27 17:57:59,169 INFO  L462      AbstractCegarLoop]: Abstraction has 33151 states and 101850 transitions.
[2019-12-27 17:57:59,169 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2019-12-27 17:57:59,169 INFO  L276                IsEmpty]: Start isEmpty. Operand 33151 states and 101850 transitions.
[2019-12-27 17:57:59,203 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 34
[2019-12-27 17:57:59,203 INFO  L403         BasicCegarLoop]: Found error trace
[2019-12-27 17:57:59,203 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]
[2019-12-27 17:57:59,203 INFO  L410      AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-12-27 17:57:59,203 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-12-27 17:57:59,204 INFO  L82        PathProgramCache]: Analyzing trace with hash -1640457078, now seen corresponding path program 1 times
[2019-12-27 17:57:59,204 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-12-27 17:57:59,204 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973222595]
[2019-12-27 17:57:59,205 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-12-27 17:57:59,239 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-12-27 17:57:59,373 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 17:57:59,374 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973222595]
[2019-12-27 17:57:59,374 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-12-27 17:57:59,374 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2019-12-27 17:57:59,374 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1577267561]
[2019-12-27 17:57:59,374 INFO  L132   pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class.
[2019-12-27 17:57:59,381 INFO  L197   pAbStrategyModuleMcr]: Started intersection.
[2019-12-27 17:57:59,395 INFO  L208   pAbStrategyModuleMcr]: Finished intersection with 43 states and 51 transitions.
[2019-12-27 17:57:59,395 INFO  L219   pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton.
[2019-12-27 17:57:59,395 INFO  L288   pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times.
[2019-12-27 17:57:59,396 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 6 states
[2019-12-27 17:57:59,396 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-12-27 17:57:59,396 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2019-12-27 17:57:59,399 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2019-12-27 17:57:59,399 INFO  L87              Difference]: Start difference. First operand 33151 states and 101850 transitions. Second operand 6 states.
[2019-12-27 17:58:00,222 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-12-27 17:58:00,222 INFO  L93              Difference]: Finished difference Result 43329 states and 130434 transitions.
[2019-12-27 17:58:00,223 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2019-12-27 17:58:00,223 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 33
[2019-12-27 17:58:00,223 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-12-27 17:58:00,289 INFO  L225             Difference]: With dead ends: 43329
[2019-12-27 17:58:00,289 INFO  L226             Difference]: Without dead ends: 42953
[2019-12-27 17:58:00,289 INFO  L631         BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 5 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156
[2019-12-27 17:58:00,444 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 42953 states.
[2019-12-27 17:58:00,842 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 42953 to 34655.
[2019-12-27 17:58:00,843 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 34655 states.
[2019-12-27 17:58:00,911 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 34655 states to 34655 states and 106370 transitions.
[2019-12-27 17:58:00,911 INFO  L78                 Accepts]: Start accepts. Automaton has 34655 states and 106370 transitions. Word has length 33
[2019-12-27 17:58:00,912 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-12-27 17:58:00,912 INFO  L462      AbstractCegarLoop]: Abstraction has 34655 states and 106370 transitions.
[2019-12-27 17:58:00,912 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2019-12-27 17:58:00,912 INFO  L276                IsEmpty]: Start isEmpty. Operand 34655 states and 106370 transitions.
[2019-12-27 17:58:01,117 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 35
[2019-12-27 17:58:01,118 INFO  L403         BasicCegarLoop]: Found error trace
[2019-12-27 17:58:01,118 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 17:58:01,118 INFO  L410      AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-12-27 17:58:01,119 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-12-27 17:58:01,119 INFO  L82        PathProgramCache]: Analyzing trace with hash 1142464834, now seen corresponding path program 1 times
[2019-12-27 17:58:01,119 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-12-27 17:58:01,122 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394590121]
[2019-12-27 17:58:01,122 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-12-27 17:58:01,140 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-12-27 17:58:01,222 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 17:58:01,222 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394590121]
[2019-12-27 17:58:01,222 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-12-27 17:58:01,222 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2019-12-27 17:58:01,223 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [750023289]
[2019-12-27 17:58:01,223 INFO  L132   pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class.
[2019-12-27 17:58:01,231 INFO  L197   pAbStrategyModuleMcr]: Started intersection.
[2019-12-27 17:58:01,255 INFO  L208   pAbStrategyModuleMcr]: Finished intersection with 62 states and 88 transitions.
[2019-12-27 17:58:01,255 INFO  L219   pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton.
[2019-12-27 17:58:01,257 INFO  L288   pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times.
[2019-12-27 17:58:01,257 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 6 states
[2019-12-27 17:58:01,257 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-12-27 17:58:01,257 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2019-12-27 17:58:01,258 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2019-12-27 17:58:01,258 INFO  L87              Difference]: Start difference. First operand 34655 states and 106370 transitions. Second operand 6 states.
[2019-12-27 17:58:02,373 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-12-27 17:58:02,374 INFO  L93              Difference]: Finished difference Result 50648 states and 152168 transitions.
[2019-12-27 17:58:02,374 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2019-12-27 17:58:02,374 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 34
[2019-12-27 17:58:02,375 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-12-27 17:58:02,453 INFO  L225             Difference]: With dead ends: 50648
[2019-12-27 17:58:02,454 INFO  L226             Difference]: Without dead ends: 50480
[2019-12-27 17:58:02,454 INFO  L631         BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156
[2019-12-27 17:58:02,620 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 50480 states.
[2019-12-27 17:58:03,047 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 50480 to 33596.
[2019-12-27 17:58:03,047 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 33596 states.
[2019-12-27 17:58:03,111 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 33596 states to 33596 states and 103212 transitions.
[2019-12-27 17:58:03,111 INFO  L78                 Accepts]: Start accepts. Automaton has 33596 states and 103212 transitions. Word has length 34
[2019-12-27 17:58:03,111 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-12-27 17:58:03,112 INFO  L462      AbstractCegarLoop]: Abstraction has 33596 states and 103212 transitions.
[2019-12-27 17:58:03,112 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2019-12-27 17:58:03,112 INFO  L276                IsEmpty]: Start isEmpty. Operand 33596 states and 103212 transitions.
[2019-12-27 17:58:03,141 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 35
[2019-12-27 17:58:03,141 INFO  L403         BasicCegarLoop]: Found error trace
[2019-12-27 17:58:03,141 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 17:58:03,141 INFO  L410      AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-12-27 17:58:03,141 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-12-27 17:58:03,141 INFO  L82        PathProgramCache]: Analyzing trace with hash 1793840738, now seen corresponding path program 2 times
[2019-12-27 17:58:03,142 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-12-27 17:58:03,142 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70466388]
[2019-12-27 17:58:03,142 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-12-27 17:58:03,161 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-12-27 17:58:03,217 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-12-27 17:58:03,218 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70466388]
[2019-12-27 17:58:03,218 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-12-27 17:58:03,218 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2019-12-27 17:58:03,218 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1859585120]
[2019-12-27 17:58:03,218 INFO  L132   pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class.
[2019-12-27 17:58:03,226 INFO  L197   pAbStrategyModuleMcr]: Started intersection.
[2019-12-27 17:58:03,257 INFO  L208   pAbStrategyModuleMcr]: Finished intersection with 79 states and 122 transitions.
[2019-12-27 17:58:03,257 INFO  L219   pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton.
[2019-12-27 17:58:03,283 INFO  L288   pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times.
[2019-12-27 17:58:03,284 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 6 states
[2019-12-27 17:58:03,285 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-12-27 17:58:03,285 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2019-12-27 17:58:03,286 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2019-12-27 17:58:03,286 INFO  L87              Difference]: Start difference. First operand 33596 states and 103212 transitions. Second operand 6 states.
[2019-12-27 17:58:04,142 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-12-27 17:58:04,143 INFO  L93              Difference]: Finished difference Result 36183 states and 111050 transitions.
[2019-12-27 17:58:04,143 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2019-12-27 17:58:04,143 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 34
[2019-12-27 17:58:04,143 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-12-27 17:58:04,216 INFO  L225             Difference]: With dead ends: 36183
[2019-12-27 17:58:04,217 INFO  L226             Difference]: Without dead ends: 36183
[2019-12-27 17:58:04,219 INFO  L631         BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56
[2019-12-27 17:58:04,358 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 36183 states.
[2019-12-27 17:58:04,685 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 36183 to 34640.
[2019-12-27 17:58:04,685 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 34640 states.
[2019-12-27 17:58:04,752 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 34640 states to 34640 states and 106053 transitions.
[2019-12-27 17:58:04,753 INFO  L78                 Accepts]: Start accepts. Automaton has 34640 states and 106053 transitions. Word has length 34
[2019-12-27 17:58:04,753 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-12-27 17:58:04,753 INFO  L462      AbstractCegarLoop]: Abstraction has 34640 states and 106053 transitions.
[2019-12-27 17:58:04,753 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2019-12-27 17:58:04,753 INFO  L276                IsEmpty]: Start isEmpty. Operand 34640 states and 106053 transitions.
[2019-12-27 17:58:04,786 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 36
[2019-12-27 17:58:04,786 INFO  L403         BasicCegarLoop]: Found error trace
[2019-12-27 17:58:04,787 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]
[2019-12-27 17:58:04,787 INFO  L410      AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-12-27 17:58:04,787 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-12-27 17:58:04,787 INFO  L82        PathProgramCache]: Analyzing trace with hash 1603903418, now seen corresponding path program 1 times
[2019-12-27 17:58:04,788 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-12-27 17:58:04,788 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803653148]
[2019-12-27 17:58:04,788 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-12-27 17:58:04,804 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-12-27 17:58:04,904 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 17:58:04,904 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803653148]
[2019-12-27 17:58:04,905 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-12-27 17:58:04,905 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2019-12-27 17:58:04,905 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [390698991]
[2019-12-27 17:58:04,905 INFO  L132   pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class.
[2019-12-27 17:58:04,915 INFO  L197   pAbStrategyModuleMcr]: Started intersection.
[2019-12-27 17:58:04,946 INFO  L208   pAbStrategyModuleMcr]: Finished intersection with 79 states and 121 transitions.
[2019-12-27 17:58:04,946 INFO  L219   pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton.
[2019-12-27 17:58:04,950 INFO  L319       QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-12-27 17:58:04,962 INFO  L319       QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-12-27 17:58:04,977 INFO  L288   pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times.
[2019-12-27 17:58:04,978 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 9 states
[2019-12-27 17:58:04,978 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-12-27 17:58:04,978 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2019-12-27 17:58:04,978 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2019-12-27 17:58:04,979 INFO  L87              Difference]: Start difference. First operand 34640 states and 106053 transitions. Second operand 9 states.
[2019-12-27 17:58:08,594 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-12-27 17:58:08,594 INFO  L93              Difference]: Finished difference Result 99754 states and 301295 transitions.
[2019-12-27 17:58:08,595 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. 
[2019-12-27 17:58:08,595 INFO  L78                 Accepts]: Start accepts. Automaton has 9 states. Word has length 35
[2019-12-27 17:58:08,595 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-12-27 17:58:08,769 INFO  L225             Difference]: With dead ends: 99754
[2019-12-27 17:58:08,769 INFO  L226             Difference]: Without dead ends: 99485
[2019-12-27 17:58:08,770 INFO  L631         BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=191, Invalid=511, Unknown=0, NotChecked=0, Total=702
[2019-12-27 17:58:09,046 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 99485 states.
[2019-12-27 17:58:09,702 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 99485 to 35935.
[2019-12-27 17:58:09,703 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 35935 states.
[2019-12-27 17:58:09,770 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 35935 states to 35935 states and 110626 transitions.
[2019-12-27 17:58:09,771 INFO  L78                 Accepts]: Start accepts. Automaton has 35935 states and 110626 transitions. Word has length 35
[2019-12-27 17:58:09,771 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-12-27 17:58:09,771 INFO  L462      AbstractCegarLoop]: Abstraction has 35935 states and 110626 transitions.
[2019-12-27 17:58:09,771 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 9 states.
[2019-12-27 17:58:09,771 INFO  L276                IsEmpty]: Start isEmpty. Operand 35935 states and 110626 transitions.
[2019-12-27 17:58:09,808 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 42
[2019-12-27 17:58:09,808 INFO  L403         BasicCegarLoop]: Found error trace
[2019-12-27 17:58:09,808 INFO  L411         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-12-27 17:58:09,808 INFO  L410      AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-12-27 17:58:09,808 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-12-27 17:58:09,808 INFO  L82        PathProgramCache]: Analyzing trace with hash -968285852, now seen corresponding path program 1 times
[2019-12-27 17:58:09,809 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-12-27 17:58:09,809 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951221133]
[2019-12-27 17:58:09,809 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-12-27 17:58:09,827 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-12-27 17:58:09,896 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 17:58:09,897 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951221133]
[2019-12-27 17:58:09,897 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-12-27 17:58:09,897 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2019-12-27 17:58:09,897 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2006439236]
[2019-12-27 17:58:09,898 INFO  L132   pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class.
[2019-12-27 17:58:09,906 INFO  L197   pAbStrategyModuleMcr]: Started intersection.
[2019-12-27 17:58:09,930 INFO  L208   pAbStrategyModuleMcr]: Finished intersection with 62 states and 81 transitions.
[2019-12-27 17:58:09,931 INFO  L219   pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton.
[2019-12-27 17:58:09,947 INFO  L288   pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times.
[2019-12-27 17:58:09,948 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 6 states
[2019-12-27 17:58:09,948 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-12-27 17:58:09,948 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2019-12-27 17:58:09,948 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2019-12-27 17:58:09,948 INFO  L87              Difference]: Start difference. First operand 35935 states and 110626 transitions. Second operand 6 states.
[2019-12-27 17:58:12,026 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-12-27 17:58:12,027 INFO  L93              Difference]: Finished difference Result 58879 states and 176735 transitions.
[2019-12-27 17:58:12,027 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2019-12-27 17:58:12,027 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 41
[2019-12-27 17:58:12,027 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-12-27 17:58:12,120 INFO  L225             Difference]: With dead ends: 58879
[2019-12-27 17:58:12,120 INFO  L226             Difference]: Without dead ends: 58879
[2019-12-27 17:58:12,120 INFO  L631         BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132
[2019-12-27 17:58:12,308 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 58879 states.
[2019-12-27 17:58:12,864 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 58879 to 47819.
[2019-12-27 17:58:12,864 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 47819 states.
[2019-12-27 17:58:12,967 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 47819 states to 47819 states and 146373 transitions.
[2019-12-27 17:58:12,967 INFO  L78                 Accepts]: Start accepts. Automaton has 47819 states and 146373 transitions. Word has length 41
[2019-12-27 17:58:12,968 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-12-27 17:58:12,968 INFO  L462      AbstractCegarLoop]: Abstraction has 47819 states and 146373 transitions.
[2019-12-27 17:58:12,968 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2019-12-27 17:58:12,968 INFO  L276                IsEmpty]: Start isEmpty. Operand 47819 states and 146373 transitions.
[2019-12-27 17:58:13,024 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 42
[2019-12-27 17:58:13,024 INFO  L403         BasicCegarLoop]: Found error trace
[2019-12-27 17:58:13,024 INFO  L411         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-12-27 17:58:13,024 INFO  L410      AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-12-27 17:58:13,024 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-12-27 17:58:13,025 INFO  L82        PathProgramCache]: Analyzing trace with hash 664495638, now seen corresponding path program 2 times
[2019-12-27 17:58:13,025 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-12-27 17:58:13,025 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535870052]
[2019-12-27 17:58:13,025 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-12-27 17:58:13,041 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-12-27 17:58:13,126 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 17:58:13,127 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535870052]
[2019-12-27 17:58:13,127 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-12-27 17:58:13,127 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2019-12-27 17:58:13,127 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [637312078]
[2019-12-27 17:58:13,128 INFO  L132   pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class.
[2019-12-27 17:58:13,139 INFO  L197   pAbStrategyModuleMcr]: Started intersection.
[2019-12-27 17:58:13,159 INFO  L208   pAbStrategyModuleMcr]: Finished intersection with 49 states and 55 transitions.
[2019-12-27 17:58:13,159 INFO  L219   pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton.
[2019-12-27 17:58:13,160 INFO  L288   pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times.
[2019-12-27 17:58:13,160 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 7 states
[2019-12-27 17:58:13,160 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-12-27 17:58:13,161 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2019-12-27 17:58:13,162 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2019-12-27 17:58:13,162 INFO  L87              Difference]: Start difference. First operand 47819 states and 146373 transitions. Second operand 7 states.
[2019-12-27 17:58:15,124 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-12-27 17:58:15,125 INFO  L93              Difference]: Finished difference Result 72778 states and 218790 transitions.
[2019-12-27 17:58:15,125 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2019-12-27 17:58:15,126 INFO  L78                 Accepts]: Start accepts. Automaton has 7 states. Word has length 41
[2019-12-27 17:58:15,126 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-12-27 17:58:15,246 INFO  L225             Difference]: With dead ends: 72778
[2019-12-27 17:58:15,246 INFO  L226             Difference]: Without dead ends: 72778
[2019-12-27 17:58:15,246 INFO  L631         BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132
[2019-12-27 17:58:15,473 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 72778 states.
[2019-12-27 17:58:16,120 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 72778 to 50068.
[2019-12-27 17:58:16,121 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 50068 states.
[2019-12-27 17:58:16,222 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 50068 states to 50068 states and 153261 transitions.
[2019-12-27 17:58:16,222 INFO  L78                 Accepts]: Start accepts. Automaton has 50068 states and 153261 transitions. Word has length 41
[2019-12-27 17:58:16,222 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-12-27 17:58:16,222 INFO  L462      AbstractCegarLoop]: Abstraction has 50068 states and 153261 transitions.
[2019-12-27 17:58:16,222 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 7 states.
[2019-12-27 17:58:16,222 INFO  L276                IsEmpty]: Start isEmpty. Operand 50068 states and 153261 transitions.
[2019-12-27 17:58:16,276 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 43
[2019-12-27 17:58:16,276 INFO  L403         BasicCegarLoop]: Found error trace
[2019-12-27 17:58:16,276 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]
[2019-12-27 17:58:16,276 INFO  L410      AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-12-27 17:58:16,276 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-12-27 17:58:16,277 INFO  L82        PathProgramCache]: Analyzing trace with hash 2092327832, now seen corresponding path program 1 times
[2019-12-27 17:58:16,277 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-12-27 17:58:16,277 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456507127]
[2019-12-27 17:58:16,277 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-12-27 17:58:16,304 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-12-27 17:58:16,342 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 17:58:16,343 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456507127]
[2019-12-27 17:58:16,343 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-12-27 17:58:16,343 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2019-12-27 17:58:16,343 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1706801541]
[2019-12-27 17:58:16,343 INFO  L132   pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class.
[2019-12-27 17:58:16,353 INFO  L197   pAbStrategyModuleMcr]: Started intersection.
[2019-12-27 17:58:16,378 INFO  L208   pAbStrategyModuleMcr]: Finished intersection with 63 states and 82 transitions.
[2019-12-27 17:58:16,379 INFO  L219   pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton.
[2019-12-27 17:58:16,380 INFO  L288   pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times.
[2019-12-27 17:58:16,381 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-12-27 17:58:16,381 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-12-27 17:58:16,381 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-12-27 17:58:16,381 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-12-27 17:58:16,381 INFO  L87              Difference]: Start difference. First operand 50068 states and 153261 transitions. Second operand 3 states.
[2019-12-27 17:58:16,544 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-12-27 17:58:16,544 INFO  L93              Difference]: Finished difference Result 46884 states and 141748 transitions.
[2019-12-27 17:58:16,544 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-12-27 17:58:16,545 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 42
[2019-12-27 17:58:16,545 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-12-27 17:58:16,613 INFO  L225             Difference]: With dead ends: 46884
[2019-12-27 17:58:16,613 INFO  L226             Difference]: Without dead ends: 46884
[2019-12-27 17:58:16,614 INFO  L631         BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 2 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 17:58:16,776 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 46884 states.
[2019-12-27 17:58:17,517 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 46884 to 46756.
[2019-12-27 17:58:17,517 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 46756 states.
[2019-12-27 17:58:17,608 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 46756 states to 46756 states and 141392 transitions.
[2019-12-27 17:58:17,608 INFO  L78                 Accepts]: Start accepts. Automaton has 46756 states and 141392 transitions. Word has length 42
[2019-12-27 17:58:17,608 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-12-27 17:58:17,609 INFO  L462      AbstractCegarLoop]: Abstraction has 46756 states and 141392 transitions.
[2019-12-27 17:58:17,609 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-12-27 17:58:17,609 INFO  L276                IsEmpty]: Start isEmpty. Operand 46756 states and 141392 transitions.
[2019-12-27 17:58:17,657 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 43
[2019-12-27 17:58:17,658 INFO  L403         BasicCegarLoop]: Found error trace
[2019-12-27 17:58:17,658 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]
[2019-12-27 17:58:17,658 INFO  L410      AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-12-27 17:58:17,658 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-12-27 17:58:17,658 INFO  L82        PathProgramCache]: Analyzing trace with hash 1433408589, now seen corresponding path program 1 times
[2019-12-27 17:58:17,659 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-12-27 17:58:17,659 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884372742]
[2019-12-27 17:58:17,659 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-12-27 17:58:17,684 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-12-27 17:58:17,760 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 17:58:17,760 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884372742]
[2019-12-27 17:58:17,760 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-12-27 17:58:17,761 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2019-12-27 17:58:17,761 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1294998226]
[2019-12-27 17:58:17,761 INFO  L132   pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class.
[2019-12-27 17:58:17,771 INFO  L197   pAbStrategyModuleMcr]: Started intersection.
[2019-12-27 17:58:17,798 INFO  L208   pAbStrategyModuleMcr]: Finished intersection with 61 states and 77 transitions.
[2019-12-27 17:58:17,798 INFO  L219   pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton.
[2019-12-27 17:58:17,799 INFO  L288   pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times.
[2019-12-27 17:58:17,799 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 6 states
[2019-12-27 17:58:17,800 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-12-27 17:58:17,800 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2019-12-27 17:58:17,800 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2019-12-27 17:58:17,800 INFO  L87              Difference]: Start difference. First operand 46756 states and 141392 transitions. Second operand 6 states.
[2019-12-27 17:58:18,061 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-12-27 17:58:18,061 INFO  L93              Difference]: Finished difference Result 44363 states and 135574 transitions.
[2019-12-27 17:58:18,062 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2019-12-27 17:58:18,062 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 42
[2019-12-27 17:58:18,062 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-12-27 17:58:18,157 INFO  L225             Difference]: With dead ends: 44363
[2019-12-27 17:58:18,157 INFO  L226             Difference]: Without dead ends: 44075
[2019-12-27 17:58:18,157 INFO  L631         BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72
[2019-12-27 17:58:18,312 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 44075 states.
[2019-12-27 17:58:18,768 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 44075 to 42801.
[2019-12-27 17:58:18,769 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 42801 states.
[2019-12-27 17:58:18,850 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 42801 states to 42801 states and 131518 transitions.
[2019-12-27 17:58:18,850 INFO  L78                 Accepts]: Start accepts. Automaton has 42801 states and 131518 transitions. Word has length 42
[2019-12-27 17:58:18,851 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-12-27 17:58:18,851 INFO  L462      AbstractCegarLoop]: Abstraction has 42801 states and 131518 transitions.
[2019-12-27 17:58:18,851 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2019-12-27 17:58:18,851 INFO  L276                IsEmpty]: Start isEmpty. Operand 42801 states and 131518 transitions.
[2019-12-27 17:58:19,077 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 68
[2019-12-27 17:58:19,077 INFO  L403         BasicCegarLoop]: Found error trace
[2019-12-27 17:58:19,077 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 17:58:19,078 INFO  L410      AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-12-27 17:58:19,078 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-12-27 17:58:19,078 INFO  L82        PathProgramCache]: Analyzing trace with hash 1662004193, now seen corresponding path program 1 times
[2019-12-27 17:58:19,079 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-12-27 17:58:19,080 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775338479]
[2019-12-27 17:58:19,080 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-12-27 17:58:19,101 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-12-27 17:58:19,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 17:58:19,146 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775338479]
[2019-12-27 17:58:19,147 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-12-27 17:58:19,147 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2019-12-27 17:58:19,147 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1919998503]
[2019-12-27 17:58:19,147 INFO  L132   pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class.
[2019-12-27 17:58:19,172 INFO  L197   pAbStrategyModuleMcr]: Started intersection.
[2019-12-27 17:58:19,556 INFO  L208   pAbStrategyModuleMcr]: Finished intersection with 290 states and 585 transitions.
[2019-12-27 17:58:19,557 INFO  L219   pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton.
[2019-12-27 17:58:19,560 INFO  L288   pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times.
[2019-12-27 17:58:19,561 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-12-27 17:58:19,561 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-12-27 17:58:19,561 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-12-27 17:58:19,561 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-12-27 17:58:19,561 INFO  L87              Difference]: Start difference. First operand 42801 states and 131518 transitions. Second operand 3 states.
[2019-12-27 17:58:19,758 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-12-27 17:58:19,758 INFO  L93              Difference]: Finished difference Result 48240 states and 144807 transitions.
[2019-12-27 17:58:19,758 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-12-27 17:58:19,758 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 67
[2019-12-27 17:58:19,758 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-12-27 17:58:19,823 INFO  L225             Difference]: With dead ends: 48240
[2019-12-27 17:58:19,824 INFO  L226             Difference]: Without dead ends: 48240
[2019-12-27 17:58:19,824 INFO  L631         BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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 17:58:19,988 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 48240 states.
[2019-12-27 17:58:20,446 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 48240 to 42727.
[2019-12-27 17:58:20,446 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 42727 states.
[2019-12-27 17:58:20,525 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 42727 states to 42727 states and 128865 transitions.
[2019-12-27 17:58:20,525 INFO  L78                 Accepts]: Start accepts. Automaton has 42727 states and 128865 transitions. Word has length 67
[2019-12-27 17:58:20,526 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-12-27 17:58:20,526 INFO  L462      AbstractCegarLoop]: Abstraction has 42727 states and 128865 transitions.
[2019-12-27 17:58:20,526 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-12-27 17:58:20,526 INFO  L276                IsEmpty]: Start isEmpty. Operand 42727 states and 128865 transitions.
[2019-12-27 17:58:20,735 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 69
[2019-12-27 17:58:20,735 INFO  L403         BasicCegarLoop]: Found error trace
[2019-12-27 17:58:20,735 INFO  L411         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-12-27 17:58:20,735 INFO  L410      AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-12-27 17:58:20,735 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-12-27 17:58:20,736 INFO  L82        PathProgramCache]: Analyzing trace with hash -1290150675, now seen corresponding path program 1 times
[2019-12-27 17:58:20,736 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-12-27 17:58:20,736 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153105585]
[2019-12-27 17:58:20,736 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-12-27 17:58:20,757 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-12-27 17:58:20,793 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 17:58:20,794 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153105585]
[2019-12-27 17:58:20,794 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-12-27 17:58:20,794 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-12-27 17:58:20,794 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1314271961]
[2019-12-27 17:58:20,795 INFO  L132   pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class.
[2019-12-27 17:58:20,824 INFO  L197   pAbStrategyModuleMcr]: Started intersection.
[2019-12-27 17:58:21,185 INFO  L208   pAbStrategyModuleMcr]: Finished intersection with 293 states and 590 transitions.
[2019-12-27 17:58:21,186 INFO  L219   pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton.
[2019-12-27 17:58:21,188 INFO  L288   pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times.
[2019-12-27 17:58:21,188 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-12-27 17:58:21,189 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-12-27 17:58:21,189 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-12-27 17:58:21,189 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-12-27 17:58:21,189 INFO  L87              Difference]: Start difference. First operand 42727 states and 128865 transitions. Second operand 3 states.
[2019-12-27 17:58:21,317 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-12-27 17:58:21,317 INFO  L93              Difference]: Finished difference Result 42726 states and 128863 transitions.
[2019-12-27 17:58:21,318 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-12-27 17:58:21,318 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 68
[2019-12-27 17:58:21,318 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-12-27 17:58:21,377 INFO  L225             Difference]: With dead ends: 42726
[2019-12-27 17:58:21,378 INFO  L226             Difference]: Without dead ends: 42726
[2019-12-27 17:58:21,378 INFO  L631         BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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 17:58:21,533 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 42726 states.
[2019-12-27 17:58:21,947 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 42726 to 42726.
[2019-12-27 17:58:21,947 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 42726 states.
[2019-12-27 17:58:22,029 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 42726 states to 42726 states and 128863 transitions.
[2019-12-27 17:58:22,029 INFO  L78                 Accepts]: Start accepts. Automaton has 42726 states and 128863 transitions. Word has length 68
[2019-12-27 17:58:22,029 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-12-27 17:58:22,029 INFO  L462      AbstractCegarLoop]: Abstraction has 42726 states and 128863 transitions.
[2019-12-27 17:58:22,029 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-12-27 17:58:22,029 INFO  L276                IsEmpty]: Start isEmpty. Operand 42726 states and 128863 transitions.
[2019-12-27 17:58:22,074 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 70
[2019-12-27 17:58:22,074 INFO  L403         BasicCegarLoop]: Found error trace
[2019-12-27 17:58:22,074 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]
[2019-12-27 17:58:22,074 INFO  L410      AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-12-27 17:58:22,075 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-12-27 17:58:22,075 INFO  L82        PathProgramCache]: Analyzing trace with hash -1352798507, now seen corresponding path program 1 times
[2019-12-27 17:58:22,075 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-12-27 17:58:22,076 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360495239]
[2019-12-27 17:58:22,076 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-12-27 17:58:22,105 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-12-27 17:58:22,154 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 17:58:22,154 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360495239]
[2019-12-27 17:58:22,155 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-12-27 17:58:22,155 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2019-12-27 17:58:22,155 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1610126201]
[2019-12-27 17:58:22,155 INFO  L132   pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class.
[2019-12-27 17:58:22,378 INFO  L197   pAbStrategyModuleMcr]: Started intersection.
[2019-12-27 17:58:22,845 INFO  L208   pAbStrategyModuleMcr]: Finished intersection with 294 states and 591 transitions.
[2019-12-27 17:58:22,846 INFO  L219   pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton.
[2019-12-27 17:58:22,847 INFO  L288   pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times.
[2019-12-27 17:58:22,848 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-12-27 17:58:22,848 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-12-27 17:58:22,848 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-12-27 17:58:22,848 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-12-27 17:58:22,849 INFO  L87              Difference]: Start difference. First operand 42726 states and 128863 transitions. Second operand 3 states.
[2019-12-27 17:58:23,057 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-12-27 17:58:23,058 INFO  L93              Difference]: Finished difference Result 42726 states and 128862 transitions.
[2019-12-27 17:58:23,058 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-12-27 17:58:23,058 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 69
[2019-12-27 17:58:23,058 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-12-27 17:58:23,143 INFO  L225             Difference]: With dead ends: 42726
[2019-12-27 17:58:23,144 INFO  L226             Difference]: Without dead ends: 42726
[2019-12-27 17:58:23,144 INFO  L631         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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 17:58:23,353 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 42726 states.
[2019-12-27 17:58:23,740 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 42726 to 31441.
[2019-12-27 17:58:23,740 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 31441 states.
[2019-12-27 17:58:23,801 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 31441 states to 31441 states and 96258 transitions.
[2019-12-27 17:58:23,801 INFO  L78                 Accepts]: Start accepts. Automaton has 31441 states and 96258 transitions. Word has length 69
[2019-12-27 17:58:23,801 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-12-27 17:58:23,801 INFO  L462      AbstractCegarLoop]: Abstraction has 31441 states and 96258 transitions.
[2019-12-27 17:58:23,801 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-12-27 17:58:23,801 INFO  L276                IsEmpty]: Start isEmpty. Operand 31441 states and 96258 transitions.
[2019-12-27 17:58:23,834 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 71
[2019-12-27 17:58:23,834 INFO  L403         BasicCegarLoop]: Found error trace
[2019-12-27 17:58:23,834 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]
[2019-12-27 17:58:23,834 INFO  L410      AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-12-27 17:58:23,834 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-12-27 17:58:23,835 INFO  L82        PathProgramCache]: Analyzing trace with hash 350370515, now seen corresponding path program 1 times
[2019-12-27 17:58:23,835 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-12-27 17:58:23,835 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777260975]
[2019-12-27 17:58:23,835 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-12-27 17:58:23,875 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-12-27 17:58:23,919 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 17:58:23,920 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777260975]
[2019-12-27 17:58:23,921 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-12-27 17:58:23,921 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-12-27 17:58:23,921 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [8098128]
[2019-12-27 17:58:23,921 INFO  L132   pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class.
[2019-12-27 17:58:23,946 INFO  L197   pAbStrategyModuleMcr]: Started intersection.
[2019-12-27 17:58:24,461 INFO  L208   pAbStrategyModuleMcr]: Finished intersection with 295 states and 592 transitions.
[2019-12-27 17:58:24,461 INFO  L219   pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton.
[2019-12-27 17:58:24,463 INFO  L288   pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times.
[2019-12-27 17:58:24,463 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-12-27 17:58:24,464 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-12-27 17:58:24,464 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-12-27 17:58:24,464 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2019-12-27 17:58:24,464 INFO  L87              Difference]: Start difference. First operand 31441 states and 96258 transitions. Second operand 4 states.
[2019-12-27 17:58:24,583 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-12-27 17:58:24,584 INFO  L93              Difference]: Finished difference Result 34170 states and 104228 transitions.
[2019-12-27 17:58:24,584 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2019-12-27 17:58:24,584 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 70
[2019-12-27 17:58:24,585 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-12-27 17:58:24,596 INFO  L225             Difference]: With dead ends: 34170
[2019-12-27 17:58:24,596 INFO  L226             Difference]: Without dead ends: 7897
[2019-12-27 17:58:24,596 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 17:58:24,621 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 7897 states.
[2019-12-27 17:58:24,690 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 7897 to 7717.
[2019-12-27 17:58:24,690 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7717 states.
[2019-12-27 17:58:24,703 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7717 states to 7717 states and 22050 transitions.
[2019-12-27 17:58:24,703 INFO  L78                 Accepts]: Start accepts. Automaton has 7717 states and 22050 transitions. Word has length 70
[2019-12-27 17:58:24,703 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-12-27 17:58:24,703 INFO  L462      AbstractCegarLoop]: Abstraction has 7717 states and 22050 transitions.
[2019-12-27 17:58:24,703 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-12-27 17:58:24,704 INFO  L276                IsEmpty]: Start isEmpty. Operand 7717 states and 22050 transitions.
[2019-12-27 17:58:24,711 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 71
[2019-12-27 17:58:24,711 INFO  L403         BasicCegarLoop]: Found error trace
[2019-12-27 17:58:24,712 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]
[2019-12-27 17:58:24,712 INFO  L410      AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-12-27 17:58:24,712 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-12-27 17:58:24,712 INFO  L82        PathProgramCache]: Analyzing trace with hash -1038631405, now seen corresponding path program 2 times
[2019-12-27 17:58:24,713 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-12-27 17:58:24,713 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541209986]
[2019-12-27 17:58:24,713 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-12-27 17:58:24,748 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-12-27 17:58:24,809 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 17:58:24,810 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541209986]
[2019-12-27 17:58:24,810 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-12-27 17:58:24,810 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-12-27 17:58:24,810 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [721201707]
[2019-12-27 17:58:24,810 INFO  L132   pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class.
[2019-12-27 17:58:24,836 INFO  L197   pAbStrategyModuleMcr]: Started intersection.
[2019-12-27 17:58:25,096 INFO  L208   pAbStrategyModuleMcr]: Finished intersection with 264 states and 518 transitions.
[2019-12-27 17:58:25,096 INFO  L219   pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton.
[2019-12-27 17:58:25,097 INFO  L288   pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times.
[2019-12-27 17:58:25,098 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 5 states
[2019-12-27 17:58:25,098 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-12-27 17:58:25,098 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2019-12-27 17:58:25,098 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2019-12-27 17:58:25,098 INFO  L87              Difference]: Start difference. First operand 7717 states and 22050 transitions. Second operand 5 states.
[2019-12-27 17:58:25,148 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-12-27 17:58:25,148 INFO  L93              Difference]: Finished difference Result 10644 states and 30611 transitions.
[2019-12-27 17:58:25,148 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2019-12-27 17:58:25,148 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 70
[2019-12-27 17:58:25,149 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-12-27 17:58:25,153 INFO  L225             Difference]: With dead ends: 10644
[2019-12-27 17:58:25,153 INFO  L226             Difference]: Without dead ends: 3301
[2019-12-27 17:58:25,154 INFO  L631         BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2019-12-27 17:58:25,170 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3301 states.
[2019-12-27 17:58:25,195 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3301 to 3301.
[2019-12-27 17:58:25,196 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3301 states.
[2019-12-27 17:58:25,201 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3301 states to 3301 states and 9573 transitions.
[2019-12-27 17:58:25,201 INFO  L78                 Accepts]: Start accepts. Automaton has 3301 states and 9573 transitions. Word has length 70
[2019-12-27 17:58:25,201 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-12-27 17:58:25,201 INFO  L462      AbstractCegarLoop]: Abstraction has 3301 states and 9573 transitions.
[2019-12-27 17:58:25,201 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2019-12-27 17:58:25,202 INFO  L276                IsEmpty]: Start isEmpty. Operand 3301 states and 9573 transitions.
[2019-12-27 17:58:25,205 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 71
[2019-12-27 17:58:25,205 INFO  L403         BasicCegarLoop]: Found error trace
[2019-12-27 17:58:25,205 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]
[2019-12-27 17:58:25,205 INFO  L410      AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-12-27 17:58:25,205 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-12-27 17:58:25,205 INFO  L82        PathProgramCache]: Analyzing trace with hash 1353113997, now seen corresponding path program 3 times
[2019-12-27 17:58:25,206 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-12-27 17:58:25,206 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306565082]
[2019-12-27 17:58:25,206 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-12-27 17:58:25,248 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2019-12-27 17:58:25,291 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2019-12-27 17:58:25,354 INFO  L174   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2019-12-27 17:58:25,354 INFO  L476         BasicCegarLoop]: Counterexample might be feasible
[2019-12-27 17:58:25,358 WARN  L123   codingBacktranslator]: Skipped backtranslation of ATE [1261] [1261] ULTIMATE.startENTRY-->L840: Formula: (let ((.cse1 (store |v_#valid_75| 0 0))) (let ((.cse0 (store .cse1 |v_~#x~0.base_154| 1))) (and (= 0 v_~__unbuffered_p1_EAX$mem_tmp~0_6) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1780~0.base_24|)) (= v_~x$r_buff1_thd0~0_273 0) (= |v_#NULL.offset_6| 0) (= v_~__unbuffered_p1_EAX$r_buff0_thd3~0_8 0) (= v_~x$mem_tmp~0_19 0) (= |v_#memory_int_284| (store |v_#memory_int_285| |v_ULTIMATE.start_main_~#t1780~0.base_24| (store (select |v_#memory_int_285| |v_ULTIMATE.start_main_~#t1780~0.base_24|) |v_ULTIMATE.start_main_~#t1780~0.offset_19| 0))) (= 0 v_~x$w_buff1~0_258) (= v_~__unbuffered_p1_EAX$r_buff0_thd1~0_4 0) (= v_~__unbuffered_p1_EAX$r_buff1_thd0~0_7 0) (= v_~x$r_buff0_thd1~0_292 0) (= 0 v_~weak$$choice1~0_85) (= v_~__unbuffered_p1_EAX$r_buff1_thd3~0_8 0) (= v_~__unbuffered_p1_EAX$read_delayed~0_56 0) (= v_~x$r_buff1_thd1~0_239 0) (= 0 v_~x$w_buff1_used~0_675) (= 0 v_~x$r_buff0_thd2~0_541) (= 0 v_~x$read_delayed~0_8) (= v_~x$flush_delayed~0_31 0) (= 0 v_~x$read_delayed_var~0.offset_8) (= v_~__unbuffered_p1_EAX$w_buff0_used~0_8 0) (= 0 v_~x$w_buff0~0_331) (= 0 v_~weak$$choice0~0_164) (= v_~main$tmp_guard1~0_23 0) (= 0 v_~x$r_buff1_thd3~0_256) (= v_~__unbuffered_p1_EAX$read_delayed_var~0.offset_45 0) (= v_~__unbuffered_p1_EAX$w_buff0~0_8 0) (= 0 |v_~#x~0.offset_154|) (= v_~x$r_buff0_thd0~0_123 0) (= 0 v_~__unbuffered_p1_EAX~0_65) (= 0 v_~x$r_buff0_thd3~0_137) (= (select .cse1 |v_~#x~0.base_154|) 0) (= v_~main$tmp_guard0~0_31 0) (= 0 v_~weak$$choice2~0_80) (< |v_#StackHeapBarrier_22| |v_~#x~0.base_154|) (< 0 |v_#StackHeapBarrier_22|) (= v_~__unbuffered_p1_EAX$read_delayed_var~0.base_45 0) (= |v_#length_34| (store (store |v_#length_35| |v_~#x~0.base_154| 4) |v_ULTIMATE.start_main_~#t1780~0.base_24| 4)) (= v_~__unbuffered_p1_EAX$r_buff0_thd0~0_6 0) (= v_~__unbuffered_p1_EAX$w_buff1~0_6 0) (= v_~__unbuffered_p1_EAX$r_buff0_thd2~0_8 0) (= v_~__unbuffered_p1_EAX$w_buff1_used~0_7 0) (= 0 v_~x$read_delayed_var~0.base_8) (= v_~__unbuffered_p1_EAX$r_buff1_thd2~0_8 0) (= v_~__unbuffered_p1_EAX$r_buff1_thd1~0_8 0) (= v_~x$w_buff0_used~0_1111 0) (= 0 v_~__unbuffered_p0_EAX~0_122) (= 0 |v_#NULL.base_6|) (= v_~__unbuffered_cnt~0_123 0) (= v_~__unbuffered_p1_EAX$flush_delayed~0_5 0) (= |v_#valid_73| (store .cse0 |v_ULTIMATE.start_main_~#t1780~0.base_24| 1)) (= v_~y~0_133 0) (= 0 v_~x$r_buff1_thd2~0_595) (= 0 v_~__unbuffered_p2_EAX~0_37) (= |v_ULTIMATE.start_main_~#t1780~0.offset_19| 0) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t1780~0.base_24|) (= (select (select |v_#memory_int_285| |v_~#x~0.base_154|) |v_~#x~0.offset_154|) 0))))  InVars {#StackHeapBarrier=|v_#StackHeapBarrier_22|, #valid=|v_#valid_75|, #memory_int=|v_#memory_int_285|, #length=|v_#length_35|}  OutVars{~x$w_buff0~0=v_~x$w_buff0~0_331, ULTIMATE.start_main_#t~nondet74=|v_ULTIMATE.start_main_#t~nondet74_9|, ~__unbuffered_p1_EAX$r_buff0_thd0~0=v_~__unbuffered_p1_EAX$r_buff0_thd0~0_6, ~__unbuffered_p1_EAX$r_buff1_thd2~0=v_~__unbuffered_p1_EAX$r_buff1_thd2~0_8, ~x$flush_delayed~0=v_~x$flush_delayed~0_31, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_239, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_137, ~weak$$choice1~0=v_~weak$$choice1~0_85, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_122, ULTIMATE.start_main_~#t1782~0.base=|v_ULTIMATE.start_main_~#t1782~0.base_21|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_65, ~__unbuffered_p1_EAX$w_buff0~0=v_~__unbuffered_p1_EAX$w_buff0~0_8, ~__unbuffered_p1_EAX$read_delayed_var~0.base=v_~__unbuffered_p1_EAX$read_delayed_var~0.base_45, #length=|v_#length_34|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_37, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_123, ~__unbuffered_p1_EAX$r_buff0_thd1~0=v_~__unbuffered_p1_EAX$r_buff0_thd1~0_4, ~#x~0.offset=|v_~#x~0.offset_154|, ~x$w_buff1~0=v_~x$w_buff1~0_258, ~__unbuffered_p1_EAX$r_buff1_thd3~0=v_~__unbuffered_p1_EAX$r_buff1_thd3~0_8, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_675, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_595, ULTIMATE.start_main_#t~ite79=|v_ULTIMATE.start_main_#t~ite79_73|, ULTIMATE.start_main_#t~ite77=|v_ULTIMATE.start_main_#t~ite77_29|, ULTIMATE.start_main_#t~nondet83=|v_ULTIMATE.start_main_#t~nondet83_91|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_8, ~weak$$choice0~0=v_~weak$$choice0~0_164, #StackHeapBarrier=|v_#StackHeapBarrier_22|, ULTIMATE.start_main_#t~ite82=|v_ULTIMATE.start_main_#t~ite82_105|, ~__unbuffered_p1_EAX$w_buff1_used~0=v_~__unbuffered_p1_EAX$w_buff1_used~0_7, ULTIMATE.start_main_#t~ite80=|v_ULTIMATE.start_main_#t~ite80_71|, ~__unbuffered_p1_EAX$w_buff1~0=v_~__unbuffered_p1_EAX$w_buff1~0_6, ULTIMATE.start_main_~#t1780~0.base=|v_ULTIMATE.start_main_~#t1780~0.base_24|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_123, ULTIMATE.start_main_~#t1780~0.offset=|v_ULTIMATE.start_main_~#t1780~0.offset_19|, ~__unbuffered_p1_EAX$r_buff0_thd2~0=v_~__unbuffered_p1_EAX$r_buff0_thd2~0_8, ULTIMATE.start_main_#t~nondet75=|v_ULTIMATE.start_main_#t~nondet75_20|, ~__unbuffered_p1_EAX$r_buff1_thd0~0=v_~__unbuffered_p1_EAX$r_buff1_thd0~0_7, ~__unbuffered_p1_EAX$flush_delayed~0=v_~__unbuffered_p1_EAX$flush_delayed~0_5, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_292, ULTIMATE.start_main_#t~nondet73=|v_ULTIMATE.start_main_#t~nondet73_10|, ULTIMATE.start_main_~#t1781~0.base=|v_ULTIMATE.start_main_~#t1781~0.base_22|, ~__unbuffered_p1_EAX$read_delayed~0=v_~__unbuffered_p1_EAX$read_delayed~0_56, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_256, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~x$mem_tmp~0=v_~x$mem_tmp~0_19, ULTIMATE.start_main_#t~ite86=|v_ULTIMATE.start_main_#t~ite86_47|, ~__unbuffered_p1_EAX$mem_tmp~0=v_~__unbuffered_p1_EAX$mem_tmp~0_6, ~y~0=v_~y~0_133, ~__unbuffered_p1_EAX$r_buff0_thd3~0=v_~__unbuffered_p1_EAX$r_buff0_thd3~0_8, ULTIMATE.start_main_#t~mem76=|v_ULTIMATE.start_main_#t~mem76_28|, ~__unbuffered_p1_EAX$r_buff1_thd1~0=v_~__unbuffered_p1_EAX$r_buff1_thd1~0_8, ~__unbuffered_p1_EAX$read_delayed_var~0.offset=v_~__unbuffered_p1_EAX$read_delayed_var~0.offset_45, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_31, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_273, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_541, ULTIMATE.start_main_#t~ite78=|v_ULTIMATE.start_main_#t~ite78_28|, ULTIMATE.start_main_~#t1782~0.offset=|v_ULTIMATE.start_main_~#t1782~0.offset_17|, #NULL.base=|v_#NULL.base_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_1111, ULTIMATE.start_main_#t~ite85=|v_ULTIMATE.start_main_#t~ite85_40|, ~__unbuffered_p1_EAX$w_buff0_used~0=v_~__unbuffered_p1_EAX$w_buff0_used~0_8, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_8, ULTIMATE.start_main_#t~ite81=|v_ULTIMATE.start_main_#t~ite81_27|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, #valid=|v_#valid_73|, #memory_int=|v_#memory_int_284|, ~#x~0.base=|v_~#x~0.base_154|, ULTIMATE.start_main_#t~mem84=|v_ULTIMATE.start_main_#t~mem84_37|, ~weak$$choice2~0=v_~weak$$choice2~0_80, ULTIMATE.start_main_~#t1781~0.offset=|v_ULTIMATE.start_main_~#t1781~0.offset_17|, ~x$read_delayed~0=v_~x$read_delayed~0_8}  AuxVars[]  AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~nondet74, ~__unbuffered_p1_EAX$r_buff0_thd0~0, ~__unbuffered_p1_EAX$r_buff1_thd2~0, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ~weak$$choice1~0, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t1782~0.base, ~__unbuffered_p1_EAX~0, ~__unbuffered_p1_EAX$w_buff0~0, ~__unbuffered_p1_EAX$read_delayed_var~0.base, #length, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~0, ~__unbuffered_p1_EAX$r_buff0_thd1~0, ~#x~0.offset, ~x$w_buff1~0, ~__unbuffered_p1_EAX$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite79, ULTIMATE.start_main_#t~ite77, ULTIMATE.start_main_#t~nondet83, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite82, ~__unbuffered_p1_EAX$w_buff1_used~0, ULTIMATE.start_main_#t~ite80, ~__unbuffered_p1_EAX$w_buff1~0, ULTIMATE.start_main_~#t1780~0.base, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t1780~0.offset, ~__unbuffered_p1_EAX$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet75, ~__unbuffered_p1_EAX$r_buff1_thd0~0, ~__unbuffered_p1_EAX$flush_delayed~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet73, ULTIMATE.start_main_~#t1781~0.base, ~__unbuffered_p1_EAX$read_delayed~0, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite86, ~__unbuffered_p1_EAX$mem_tmp~0, ~y~0, ~__unbuffered_p1_EAX$r_buff0_thd3~0, ULTIMATE.start_main_#t~mem76, ~__unbuffered_p1_EAX$r_buff1_thd1~0, ~__unbuffered_p1_EAX$read_delayed_var~0.offset, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite78, ULTIMATE.start_main_~#t1782~0.offset, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite85, ~__unbuffered_p1_EAX$w_buff0_used~0, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite81, ULTIMATE.start_main_#res, #valid, #memory_int, ~#x~0.base, ULTIMATE.start_main_#t~mem84, ~weak$$choice2~0, ULTIMATE.start_main_~#t1781~0.offset, ~x$read_delayed~0] because there is no mapped edge
[2019-12-27 17:58:25,360 WARN  L123   codingBacktranslator]: Skipped backtranslation of ATE [1199] [1199] L840-1-->L842: Formula: (and (= (store |v_#memory_int_155| |v_ULTIMATE.start_main_~#t1781~0.base_10| (store (select |v_#memory_int_155| |v_ULTIMATE.start_main_~#t1781~0.base_10|) |v_ULTIMATE.start_main_~#t1781~0.offset_9| 1)) |v_#memory_int_154|) (= 0 (select |v_#valid_40| |v_ULTIMATE.start_main_~#t1781~0.base_10|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1781~0.base_10|) (not (= 0 |v_ULTIMATE.start_main_~#t1781~0.base_10|)) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t1781~0.base_10| 4) |v_#length_17|) (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t1781~0.base_10| 1)) (= 0 |v_ULTIMATE.start_main_~#t1781~0.offset_9|))  InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_155|, #length=|v_#length_18|}  OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t1781~0.base=|v_ULTIMATE.start_main_~#t1781~0.base_10|, ULTIMATE.start_main_#t~nondet73=|v_ULTIMATE.start_main_#t~nondet73_4|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_154|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1781~0.offset=|v_ULTIMATE.start_main_~#t1781~0.offset_9|}  AuxVars[]  AssignedVars[ULTIMATE.start_main_~#t1781~0.base, ULTIMATE.start_main_#t~nondet73, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1781~0.offset] because there is no mapped edge
[2019-12-27 17:58:25,362 WARN  L123   codingBacktranslator]: Skipped backtranslation of ATE [1201] [1201] L842-1-->L844: Formula: (and (= 0 (select |v_#valid_42| |v_ULTIMATE.start_main_~#t1782~0.base_11|)) (not (= |v_ULTIMATE.start_main_~#t1782~0.base_11| 0)) (= (store |v_#valid_42| |v_ULTIMATE.start_main_~#t1782~0.base_11| 1) |v_#valid_41|) (= 0 |v_ULTIMATE.start_main_~#t1782~0.offset_9|) (= |v_#memory_int_156| (store |v_#memory_int_157| |v_ULTIMATE.start_main_~#t1782~0.base_11| (store (select |v_#memory_int_157| |v_ULTIMATE.start_main_~#t1782~0.base_11|) |v_ULTIMATE.start_main_~#t1782~0.offset_9| 2))) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t1782~0.base_11| 4) |v_#length_19|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1782~0.base_11|))  InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_157|, #length=|v_#length_20|}  OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~nondet74=|v_ULTIMATE.start_main_#t~nondet74_3|, ULTIMATE.start_main_~#t1782~0.base=|v_ULTIMATE.start_main_~#t1782~0.base_11|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_156|, #length=|v_#length_19|, ULTIMATE.start_main_~#t1782~0.offset=|v_ULTIMATE.start_main_~#t1782~0.offset_9|}  AuxVars[]  AssignedVars[ULTIMATE.start_main_#t~nondet74, ULTIMATE.start_main_~#t1782~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1782~0.offset] because there is no mapped edge
[2019-12-27 17:58:25,368 WARN  L123   codingBacktranslator]: Skipped backtranslation of ATE [1228] [1228] L781-->L781-14: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In560282735 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork0_#t~ite28_In560282735| |P1Thread1of1ForFork0_#t~ite28_Out560282735|) (= |P1Thread1of1ForFork0_#t~ite29_Out560282735| ~x$w_buff0~0_In560282735)) (and (= |P1Thread1of1ForFork0_#t~ite28_Out560282735| ~x$w_buff0~0_In560282735) .cse0 (= (mod ~x$w_buff0_used~0_In560282735 256) 0) (= |P1Thread1of1ForFork0_#t~ite29_Out560282735| |P1Thread1of1ForFork0_#t~ite28_Out560282735|))))  InVars {~x$w_buff0~0=~x$w_buff0~0_In560282735, ~weak$$choice2~0=~weak$$choice2~0_In560282735, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_In560282735|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In560282735}  OutVars{~x$w_buff0~0=~x$w_buff0~0_In560282735, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out560282735|, ~weak$$choice2~0=~weak$$choice2~0_In560282735, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out560282735|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In560282735}  AuxVars[]  AssignedVars[P1Thread1of1ForFork0_#t~ite28, P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge
[2019-12-27 17:58:25,379 WARN  L123   codingBacktranslator]: Skipped backtranslation of ATE [1095] [1095] L785-->L786: Formula: (and (= v_~x$r_buff0_thd2~0_109 v_~x$r_buff0_thd2~0_108) (not (= (mod v_~weak$$choice2~0_23 256) 0)))  InVars {~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_109, ~weak$$choice2~0=v_~weak$$choice2~0_23}  OutVars{P1Thread1of1ForFork0_#t~ite47=|v_P1Thread1of1ForFork0_#t~ite47_10|, P1Thread1of1ForFork0_#t~ite46=|v_P1Thread1of1ForFork0_#t~ite46_8|, P1Thread1of1ForFork0_#t~ite45=|v_P1Thread1of1ForFork0_#t~ite45_8|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_108, ~weak$$choice2~0=v_~weak$$choice2~0_23, P1Thread1of1ForFork0_#t~ite49=|v_P1Thread1of1ForFork0_#t~ite49_9|, P1Thread1of1ForFork0_#t~ite48=|v_P1Thread1of1ForFork0_#t~ite48_9|}  AuxVars[]  AssignedVars[P1Thread1of1ForFork0_#t~ite47, P1Thread1of1ForFork0_#t~ite46, P1Thread1of1ForFork0_#t~ite45, ~x$r_buff0_thd2~0, P1Thread1of1ForFork0_#t~ite49, P1Thread1of1ForFork0_#t~ite48] because there is no mapped edge
[2019-12-27 17:58:25,382 WARN  L123   codingBacktranslator]: Skipped backtranslation of ATE [1063] [1063] L790-->L797: Formula: (and (= 0 v_~x$flush_delayed~0_6) (= (store |v_#memory_int_40| |v_~#x~0.base_24| (store (select |v_#memory_int_40| |v_~#x~0.base_24|) |v_~#x~0.offset_24| v_~x$mem_tmp~0_4)) |v_#memory_int_39|) (= 1 v_~y~0_8) (not (= 0 (mod v_~x$flush_delayed~0_7 256))))  InVars {~#x~0.offset=|v_~#x~0.offset_24|, ~x$flush_delayed~0=v_~x$flush_delayed~0_7, #memory_int=|v_#memory_int_40|, ~#x~0.base=|v_~#x~0.base_24|, ~x$mem_tmp~0=v_~x$mem_tmp~0_4}  OutVars{P1Thread1of1ForFork0_#t~mem57=|v_P1Thread1of1ForFork0_#t~mem57_5|, ~x$flush_delayed~0=v_~x$flush_delayed~0_6, ~#x~0.offset=|v_~#x~0.offset_24|, P1Thread1of1ForFork0_#t~ite58=|v_P1Thread1of1ForFork0_#t~ite58_7|, #memory_int=|v_#memory_int_39|, ~#x~0.base=|v_~#x~0.base_24|, ~x$mem_tmp~0=v_~x$mem_tmp~0_4, ~y~0=v_~y~0_8}  AuxVars[]  AssignedVars[P1Thread1of1ForFork0_#t~mem57, ~x$flush_delayed~0, P1Thread1of1ForFork0_#t~ite58, #memory_int, ~y~0] because there is no mapped edge
[2019-12-27 17:58:25,386 WARN  L123   codingBacktranslator]: Skipped backtranslation of ATE [1091] [1091] P0ENTRY-->L4-3: Formula: (and (= |v_P0Thread1of1ForFork2_#in~arg.offset_17| v_P0Thread1of1ForFork2_~arg.offset_17) (= v_P0Thread1of1ForFork2___VERIFIER_assert_~expression_19 |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression_17|) (= v_~x$w_buff0~0_59 v_~x$w_buff1~0_46) (= 1 v_~x$w_buff0_used~0_228) (= 1 v_~x$w_buff0~0_58) (= 1 |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression_17|) (= v_~y~0_34 v_~__unbuffered_p0_EAX~0_20) (= v_~x$w_buff0_used~0_229 v_~x$w_buff1_used~0_124) (= v_P0Thread1of1ForFork2_~arg.base_17 |v_P0Thread1of1ForFork2_#in~arg.base_17|) (= (mod v_~x$w_buff1_used~0_124 256) 0))  InVars {~x$w_buff0~0=v_~x$w_buff0~0_59, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_17|, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_17|, ~y~0=v_~y~0_34, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_229}  OutVars{~x$w_buff0~0=v_~x$w_buff0~0_58, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_20, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_17|, ~x$w_buff1~0=v_~x$w_buff1~0_46, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_124, P0Thread1of1ForFork2___VERIFIER_assert_~expression=v_P0Thread1of1ForFork2___VERIFIER_assert_~expression_19, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_17|, ~y~0=v_~y~0_34, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_17, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_228, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression_17|}  AuxVars[]  AssignedVars[~x$w_buff0~0, ~__unbuffered_p0_EAX~0, ~x$w_buff1~0, P0Thread1of1ForFork2_~arg.offset, ~x$w_buff1_used~0, P0Thread1of1ForFork2___VERIFIER_assert_~expression, P0Thread1of1ForFork2_~arg.base, ~x$w_buff0_used~0, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression] because there is no mapped edge
[2019-12-27 17:58:25,386 WARN  L123   codingBacktranslator]: Skipped backtranslation of ATE [1174] [1174] L817-2-->L817-5: Formula: (let ((.cse0 (= |P2Thread1of1ForFork1_#t~ite68_Out327304179| |P2Thread1of1ForFork1_#t~ite67_Out327304179|)) (.cse1 (= (mod ~x$w_buff1_used~0_In327304179 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd3~0_In327304179 256)))) (or (and .cse0 (= |P2Thread1of1ForFork1_#t~mem66_In327304179| |P2Thread1of1ForFork1_#t~mem66_Out327304179|) (not .cse1) (= |P2Thread1of1ForFork1_#t~ite67_Out327304179| ~x$w_buff1~0_In327304179) (not .cse2)) (and (= (select (select |#memory_int_In327304179| |~#x~0.base_In327304179|) |~#x~0.offset_In327304179|) |P2Thread1of1ForFork1_#t~mem66_Out327304179|) .cse0 (or .cse1 .cse2) (= |P2Thread1of1ForFork1_#t~ite67_Out327304179| |P2Thread1of1ForFork1_#t~mem66_Out327304179|))))  InVars {~#x~0.offset=|~#x~0.offset_In327304179|, ~x$w_buff1~0=~x$w_buff1~0_In327304179, ~#x~0.base=|~#x~0.base_In327304179|, #memory_int=|#memory_int_In327304179|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In327304179, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In327304179, P2Thread1of1ForFork1_#t~mem66=|P2Thread1of1ForFork1_#t~mem66_In327304179|}  OutVars{P2Thread1of1ForFork1_#t~ite68=|P2Thread1of1ForFork1_#t~ite68_Out327304179|, P2Thread1of1ForFork1_#t~ite67=|P2Thread1of1ForFork1_#t~ite67_Out327304179|, ~#x~0.offset=|~#x~0.offset_In327304179|, ~x$w_buff1~0=~x$w_buff1~0_In327304179, ~#x~0.base=|~#x~0.base_In327304179|, #memory_int=|#memory_int_In327304179|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In327304179, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In327304179, P2Thread1of1ForFork1_#t~mem66=|P2Thread1of1ForFork1_#t~mem66_Out327304179|}  AuxVars[]  AssignedVars[P2Thread1of1ForFork1_#t~ite68, P2Thread1of1ForFork1_#t~ite67, P2Thread1of1ForFork1_#t~mem66] because there is no mapped edge
[2019-12-27 17:58:25,390 WARN  L123   codingBacktranslator]: Skipped backtranslation of ATE [1159] [1159] L797-2-->L797-5: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd2~0_In-2099590510 256) 0)) (.cse2 (= |P1Thread1of1ForFork0_#t~ite61_Out-2099590510| |P1Thread1of1ForFork0_#t~ite60_Out-2099590510|)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-2099590510 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite60_Out-2099590510| |P1Thread1of1ForFork0_#t~mem59_Out-2099590510|) (= (select (select |#memory_int_In-2099590510| |~#x~0.base_In-2099590510|) |~#x~0.offset_In-2099590510|) |P1Thread1of1ForFork0_#t~mem59_Out-2099590510|) .cse2) (and (not .cse1) (= |P1Thread1of1ForFork0_#t~ite60_Out-2099590510| ~x$w_buff1~0_In-2099590510) .cse2 (not .cse0) (= |P1Thread1of1ForFork0_#t~mem59_In-2099590510| |P1Thread1of1ForFork0_#t~mem59_Out-2099590510|))))  InVars {P1Thread1of1ForFork0_#t~mem59=|P1Thread1of1ForFork0_#t~mem59_In-2099590510|, ~#x~0.offset=|~#x~0.offset_In-2099590510|, ~x$w_buff1~0=~x$w_buff1~0_In-2099590510, ~#x~0.base=|~#x~0.base_In-2099590510|, #memory_int=|#memory_int_In-2099590510|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2099590510, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-2099590510}  OutVars{P1Thread1of1ForFork0_#t~mem59=|P1Thread1of1ForFork0_#t~mem59_Out-2099590510|, ~#x~0.offset=|~#x~0.offset_In-2099590510|, P1Thread1of1ForFork0_#t~ite60=|P1Thread1of1ForFork0_#t~ite60_Out-2099590510|, P1Thread1of1ForFork0_#t~ite61=|P1Thread1of1ForFork0_#t~ite61_Out-2099590510|, ~x$w_buff1~0=~x$w_buff1~0_In-2099590510, ~#x~0.base=|~#x~0.base_In-2099590510|, #memory_int=|#memory_int_In-2099590510|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2099590510, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-2099590510}  AuxVars[]  AssignedVars[P1Thread1of1ForFork0_#t~mem59, P1Thread1of1ForFork0_#t~ite60, P1Thread1of1ForFork0_#t~ite61] because there is no mapped edge
[2019-12-27 17:58:25,390 WARN  L123   codingBacktranslator]: Skipped backtranslation of ATE [1161] [1161] L818-->L818-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-2147282723 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd3~0_In-2147282723 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite69_Out-2147282723| ~x$w_buff0_used~0_In-2147282723)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork1_#t~ite69_Out-2147282723| 0))))  InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-2147282723, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2147282723}  OutVars{P2Thread1of1ForFork1_#t~ite69=|P2Thread1of1ForFork1_#t~ite69_Out-2147282723|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-2147282723, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2147282723}  AuxVars[]  AssignedVars[P2Thread1of1ForFork1_#t~ite69] because there is no mapped edge
[2019-12-27 17:58:25,393 WARN  L123   codingBacktranslator]: Skipped backtranslation of ATE [1171] [1171] L798-->L798-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In36731859 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd2~0_In36731859 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite62_Out36731859| ~x$w_buff0_used~0_In36731859)) (and (not .cse1) (= |P1Thread1of1ForFork0_#t~ite62_Out36731859| 0) (not .cse0))))  InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In36731859, ~x$w_buff0_used~0=~x$w_buff0_used~0_In36731859}  OutVars{P1Thread1of1ForFork0_#t~ite62=|P1Thread1of1ForFork0_#t~ite62_Out36731859|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In36731859, ~x$w_buff0_used~0=~x$w_buff0_used~0_In36731859}  AuxVars[]  AssignedVars[P1Thread1of1ForFork0_#t~ite62] because there is no mapped edge
[2019-12-27 17:58:25,395 WARN  L123   codingBacktranslator]: Skipped backtranslation of ATE [1164] [1164] L819-->L819-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff1_thd3~0_In1450934532 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In1450934532 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1450934532 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In1450934532 256)))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite70_Out1450934532|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~x$w_buff1_used~0_In1450934532 |P2Thread1of1ForFork1_#t~ite70_Out1450934532|))))  InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1450934532, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1450934532, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1450934532, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1450934532}  OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1450934532, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1450934532, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1450934532, P2Thread1of1ForFork1_#t~ite70=|P2Thread1of1ForFork1_#t~ite70_Out1450934532|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1450934532}  AuxVars[]  AssignedVars[P2Thread1of1ForFork1_#t~ite70] because there is no mapped edge
[2019-12-27 17:58:25,397 WARN  L123   codingBacktranslator]: Skipped backtranslation of ATE [1178] [1178] L820-->L820-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd3~0_In1698915066 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1698915066 256)))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork1_#t~ite71_Out1698915066|) (not .cse1)) (and (or .cse0 .cse1) (= ~x$r_buff0_thd3~0_In1698915066 |P2Thread1of1ForFork1_#t~ite71_Out1698915066|))))  InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1698915066, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1698915066}  OutVars{P2Thread1of1ForFork1_#t~ite71=|P2Thread1of1ForFork1_#t~ite71_Out1698915066|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1698915066, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1698915066}  AuxVars[]  AssignedVars[P2Thread1of1ForFork1_#t~ite71] because there is no mapped edge
[2019-12-27 17:58:25,399 WARN  L123   codingBacktranslator]: Skipped backtranslation of ATE [1166] [1166] L821-->L821-2: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd3~0_In261956566 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In261956566 256))) (.cse3 (= (mod ~x$r_buff0_thd3~0_In261956566 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In261956566 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork1_#t~ite72_Out261956566| 0)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork1_#t~ite72_Out261956566| ~x$r_buff1_thd3~0_In261956566) (or .cse3 .cse2))))  InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In261956566, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In261956566, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In261956566, ~x$w_buff0_used~0=~x$w_buff0_used~0_In261956566}  OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In261956566, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In261956566, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In261956566, P2Thread1of1ForFork1_#t~ite72=|P2Thread1of1ForFork1_#t~ite72_Out261956566|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In261956566}  AuxVars[]  AssignedVars[P2Thread1of1ForFork1_#t~ite72] because there is no mapped edge
[2019-12-27 17:58:25,400 WARN  L123   codingBacktranslator]: Skipped backtranslation of ATE [1227] [1227] L821-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= v_~__unbuffered_cnt~0_75 (+ v_~__unbuffered_cnt~0_76 1)) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= |v_P2Thread1of1ForFork1_#t~ite72_50| v_~x$r_buff1_thd3~0_207))  InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_76, P2Thread1of1ForFork1_#t~ite72=|v_P2Thread1of1ForFork1_#t~ite72_50|}  OutVars{P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_207, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75, P2Thread1of1ForFork1_#t~ite72=|v_P2Thread1of1ForFork1_#t~ite72_49|, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|}  AuxVars[]  AssignedVars[P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#t~ite72, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge
[2019-12-27 17:58:25,400 WARN  L123   codingBacktranslator]: Skipped backtranslation of ATE [1167] [1167] L799-->L799-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In556893425 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In556893425 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In556893425 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In556893425 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite63_Out556893425| ~x$w_buff1_used~0_In556893425) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork0_#t~ite63_Out556893425| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))))))  InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In556893425, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In556893425, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In556893425, ~x$w_buff0_used~0=~x$w_buff0_used~0_In556893425}  OutVars{P1Thread1of1ForFork0_#t~ite63=|P1Thread1of1ForFork0_#t~ite63_Out556893425|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In556893425, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In556893425, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In556893425, ~x$w_buff0_used~0=~x$w_buff0_used~0_In556893425}  AuxVars[]  AssignedVars[P1Thread1of1ForFork0_#t~ite63] because there is no mapped edge
[2019-12-27 17:58:25,402 WARN  L123   codingBacktranslator]: Skipped backtranslation of ATE [1165] [1165] L800-->L800-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In919975981 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In919975981 256)))) (or (and (= ~x$r_buff0_thd2~0_In919975981 |P1Thread1of1ForFork0_#t~ite64_Out919975981|) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork0_#t~ite64_Out919975981| 0) (not .cse1) (not .cse0))))  InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In919975981, ~x$w_buff0_used~0=~x$w_buff0_used~0_In919975981}  OutVars{P1Thread1of1ForFork0_#t~ite64=|P1Thread1of1ForFork0_#t~ite64_Out919975981|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In919975981, ~x$w_buff0_used~0=~x$w_buff0_used~0_In919975981}  AuxVars[]  AssignedVars[P1Thread1of1ForFork0_#t~ite64] because there is no mapped edge
[2019-12-27 17:58:25,403 WARN  L123   codingBacktranslator]: Skipped backtranslation of ATE [1160] [1160] L801-->L801-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-524024173 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-524024173 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In-524024173 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd2~0_In-524024173 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite65_Out-524024173| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite65_Out-524024173| ~x$r_buff1_thd2~0_In-524024173))))  InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-524024173, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-524024173, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-524024173, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-524024173}  OutVars{P1Thread1of1ForFork0_#t~ite65=|P1Thread1of1ForFork0_#t~ite65_Out-524024173|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-524024173, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-524024173, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-524024173, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-524024173}  AuxVars[]  AssignedVars[P1Thread1of1ForFork0_#t~ite65] because there is no mapped edge
[2019-12-27 17:58:25,404 WARN  L123   codingBacktranslator]: Skipped backtranslation of ATE [1207] [1207] L801-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_311 |v_P1Thread1of1ForFork0_#t~ite65_32|) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= v_~__unbuffered_cnt~0_49 (+ v_~__unbuffered_cnt~0_50 1)) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|))  InVars {P1Thread1of1ForFork0_#t~ite65=|v_P1Thread1of1ForFork0_#t~ite65_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_50}  OutVars{P1Thread1of1ForFork0_#t~ite65=|v_P1Thread1of1ForFork0_#t~ite65_31|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_311, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|}  AuxVars[]  AssignedVars[P1Thread1of1ForFork0_#t~ite65, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge
[2019-12-27 17:58:25,409 WARN  L123   codingBacktranslator]: Skipped backtranslation of ATE [1163] [1163] L762-->L762-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-1658096941 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd1~0_In-1658096941 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-1658096941 |P0Thread1of1ForFork2_#t~ite6_Out-1658096941|)) (and (not .cse1) (not .cse0) (= |P0Thread1of1ForFork2_#t~ite6_Out-1658096941| 0))))  InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1658096941, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1658096941}  OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1658096941, P0Thread1of1ForFork2_#t~ite6=|P0Thread1of1ForFork2_#t~ite6_Out-1658096941|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1658096941}  AuxVars[]  AssignedVars[P0Thread1of1ForFork2_#t~ite6] because there is no mapped edge
[2019-12-27 17:58:25,411 WARN  L123   codingBacktranslator]: Skipped backtranslation of ATE [1169] [1169] L763-->L763-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff1_thd1~0_In-1303563992 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-1303563992 256))) (.cse0 (= (mod ~x$r_buff0_thd1~0_In-1303563992 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1303563992 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork2_#t~ite7_Out-1303563992| ~x$w_buff1_used~0_In-1303563992)) (and (= |P0Thread1of1ForFork2_#t~ite7_Out-1303563992| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))))))  InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1303563992, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1303563992, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1303563992, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1303563992}  OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1303563992, P0Thread1of1ForFork2_#t~ite7=|P0Thread1of1ForFork2_#t~ite7_Out-1303563992|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1303563992, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1303563992, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1303563992}  AuxVars[]  AssignedVars[P0Thread1of1ForFork2_#t~ite7] because there is no mapped edge
[2019-12-27 17:58:25,413 WARN  L123   codingBacktranslator]: Skipped backtranslation of ATE [1179] [1179] L764-->L765: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1953582552 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-1953582552 256)))) (or (and (= 0 ~x$r_buff0_thd1~0_Out-1953582552) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~x$r_buff0_thd1~0_In-1953582552 ~x$r_buff0_thd1~0_Out-1953582552))))  InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1953582552, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1953582552}  OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out-1953582552, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out-1953582552|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1953582552}  AuxVars[]  AssignedVars[~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite8] because there is no mapped edge
[2019-12-27 17:58:25,413 WARN  L123   codingBacktranslator]: Skipped backtranslation of ATE [1176] [1176] L765-->L765-2: Formula: (let ((.cse2 (= (mod ~x$r_buff1_thd1~0_In1011786321 256) 0)) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In1011786321 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In1011786321 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In1011786321 256) 0))) (or (and (= |P0Thread1of1ForFork2_#t~ite9_Out1011786321| ~x$r_buff1_thd1~0_In1011786321) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork2_#t~ite9_Out1011786321| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))))))  InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1011786321, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1011786321, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1011786321, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1011786321}  OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1011786321, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1011786321, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1011786321, P0Thread1of1ForFork2_#t~ite9=|P0Thread1of1ForFork2_#t~ite9_Out1011786321|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1011786321}  AuxVars[]  AssignedVars[P0Thread1of1ForFork2_#t~ite9] because there is no mapped edge
[2019-12-27 17:58:25,413 WARN  L123   codingBacktranslator]: Skipped backtranslation of ATE [1225] [1225] L765-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.offset_5| 0) (= 0 |v_P0Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_70 1) v_~__unbuffered_cnt~0_69) (= |v_P0Thread1of1ForFork2_#t~ite9_32| v_~x$r_buff1_thd1~0_182))  InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70, P0Thread1of1ForFork2_#t~ite9=|v_P0Thread1of1ForFork2_#t~ite9_32|}  OutVars{P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_182, P0Thread1of1ForFork2_#t~ite9=|v_P0Thread1of1ForFork2_#t~ite9_31|, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_5|}  AuxVars[]  AssignedVars[P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0, P0Thread1of1ForFork2_#t~ite9, P0Thread1of1ForFork2_#res.base] because there is no mapped edge
[2019-12-27 17:58:25,415 WARN  L123   codingBacktranslator]: Skipped backtranslation of ATE [1145] [1145] L848-->L850-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_5 256))) (or (= (mod v_~x$w_buff0_used~0_415 256) 0) (= (mod v_~x$r_buff0_thd0~0_51 256) 0)))  InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_51, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_415}  OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_51, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_415}  AuxVars[]  AssignedVars[] because there is no mapped edge
[2019-12-27 17:58:25,415 WARN  L123   codingBacktranslator]: Skipped backtranslation of ATE [1183] [1183] L850-2-->L850-5: Formula: (let ((.cse2 (= |ULTIMATE.start_main_#t~ite78_Out1139461872| |ULTIMATE.start_main_#t~ite77_Out1139461872|)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In1139461872 256))) (.cse0 (= (mod ~x$r_buff1_thd0~0_In1139461872 256) 0))) (or (and (not .cse0) (not .cse1) .cse2 (= ~x$w_buff1~0_In1139461872 |ULTIMATE.start_main_#t~ite77_Out1139461872|) (= |ULTIMATE.start_main_#t~mem76_In1139461872| |ULTIMATE.start_main_#t~mem76_Out1139461872|)) (and (= (select (select |#memory_int_In1139461872| |~#x~0.base_In1139461872|) |~#x~0.offset_In1139461872|) |ULTIMATE.start_main_#t~mem76_Out1139461872|) (= |ULTIMATE.start_main_#t~mem76_Out1139461872| |ULTIMATE.start_main_#t~ite77_Out1139461872|) .cse2 (or .cse1 .cse0))))  InVars {ULTIMATE.start_main_#t~mem76=|ULTIMATE.start_main_#t~mem76_In1139461872|, ~#x~0.offset=|~#x~0.offset_In1139461872|, ~x$w_buff1~0=~x$w_buff1~0_In1139461872, ~#x~0.base=|~#x~0.base_In1139461872|, #memory_int=|#memory_int_In1139461872|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1139461872, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1139461872}  OutVars{ULTIMATE.start_main_#t~mem76=|ULTIMATE.start_main_#t~mem76_Out1139461872|, ~#x~0.offset=|~#x~0.offset_In1139461872|, ~x$w_buff1~0=~x$w_buff1~0_In1139461872, ~#x~0.base=|~#x~0.base_In1139461872|, #memory_int=|#memory_int_In1139461872|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1139461872, ULTIMATE.start_main_#t~ite77=|ULTIMATE.start_main_#t~ite77_Out1139461872|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1139461872, ULTIMATE.start_main_#t~ite78=|ULTIMATE.start_main_#t~ite78_Out1139461872|}  AuxVars[]  AssignedVars[ULTIMATE.start_main_#t~mem76, ULTIMATE.start_main_#t~ite77, ULTIMATE.start_main_#t~ite78] because there is no mapped edge
[2019-12-27 17:58:25,417 WARN  L123   codingBacktranslator]: Skipped backtranslation of ATE [1156] [1156] L851-->L851-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In1134047863 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In1134047863 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In1134047863 |ULTIMATE.start_main_#t~ite79_Out1134047863|)) (and (= 0 |ULTIMATE.start_main_#t~ite79_Out1134047863|) (not .cse1) (not .cse0))))  InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1134047863, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1134047863}  OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1134047863, ULTIMATE.start_main_#t~ite79=|ULTIMATE.start_main_#t~ite79_Out1134047863|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1134047863}  AuxVars[]  AssignedVars[ULTIMATE.start_main_#t~ite79] because there is no mapped edge
[2019-12-27 17:58:25,419 WARN  L123   codingBacktranslator]: Skipped backtranslation of ATE [1181] [1181] L852-->L852-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In-312735595 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-312735595 256))) (.cse0 (= (mod ~x$r_buff1_thd0~0_In-312735595 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-312735595 256)))) (or (and (= ~x$w_buff1_used~0_In-312735595 |ULTIMATE.start_main_#t~ite80_Out-312735595|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite80_Out-312735595| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))))))  InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-312735595, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-312735595, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-312735595, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-312735595}  OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-312735595, ULTIMATE.start_main_#t~ite80=|ULTIMATE.start_main_#t~ite80_Out-312735595|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-312735595, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-312735595, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-312735595}  AuxVars[]  AssignedVars[ULTIMATE.start_main_#t~ite80] because there is no mapped edge
[2019-12-27 17:58:25,421 WARN  L123   codingBacktranslator]: Skipped backtranslation of ATE [1170] [1170] L853-->L853-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-2147211783 256))) (.cse0 (= (mod ~x$r_buff0_thd0~0_In-2147211783 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite81_Out-2147211783| ~x$r_buff0_thd0~0_In-2147211783) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite81_Out-2147211783| 0))))  InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2147211783, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2147211783}  OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2147211783, ULTIMATE.start_main_#t~ite81=|ULTIMATE.start_main_#t~ite81_Out-2147211783|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2147211783}  AuxVars[]  AssignedVars[ULTIMATE.start_main_#t~ite81] because there is no mapped edge
[2019-12-27 17:58:25,423 WARN  L123   codingBacktranslator]: Skipped backtranslation of ATE [1155] [1155] L854-->L854-2: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd0~0_In-880048648 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-880048648 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In-880048648 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In-880048648 256) 0))) (or (and (or .cse0 .cse1) (= ~x$r_buff1_thd0~0_In-880048648 |ULTIMATE.start_main_#t~ite82_Out-880048648|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite82_Out-880048648| 0))))  InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-880048648, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-880048648, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-880048648, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-880048648}  OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-880048648, ULTIMATE.start_main_#t~ite82=|ULTIMATE.start_main_#t~ite82_Out-880048648|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-880048648, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-880048648, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-880048648}  AuxVars[]  AssignedVars[ULTIMATE.start_main_#t~ite82] because there is no mapped edge
[2019-12-27 17:58:25,425 WARN  L123   codingBacktranslator]: Skipped backtranslation of ATE [1154] [1154] L858-->L858-3: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice1~0_In-1960967694 256))) (.cse0 (not (= (mod ~__unbuffered_p1_EAX$read_delayed~0_In-1960967694 256) 0)))) (or (and .cse0 (not .cse1) (= |ULTIMATE.start_main_#t~mem84_Out-1960967694| |ULTIMATE.start_main_#t~ite85_Out-1960967694|) (= (select (select |#memory_int_In-1960967694| ~__unbuffered_p1_EAX$read_delayed_var~0.base_In-1960967694) ~__unbuffered_p1_EAX$read_delayed_var~0.offset_In-1960967694) |ULTIMATE.start_main_#t~mem84_Out-1960967694|)) (and .cse1 (= ~__unbuffered_p1_EAX~0_In-1960967694 |ULTIMATE.start_main_#t~ite85_Out-1960967694|) (= |ULTIMATE.start_main_#t~mem84_In-1960967694| |ULTIMATE.start_main_#t~mem84_Out-1960967694|) .cse0)))  InVars {~weak$$choice1~0=~weak$$choice1~0_In-1960967694, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_In-1960967694, ~__unbuffered_p1_EAX$read_delayed~0=~__unbuffered_p1_EAX$read_delayed~0_In-1960967694, ~__unbuffered_p1_EAX$read_delayed_var~0.base=~__unbuffered_p1_EAX$read_delayed_var~0.base_In-1960967694, #memory_int=|#memory_int_In-1960967694|, ~__unbuffered_p1_EAX$read_delayed_var~0.offset=~__unbuffered_p1_EAX$read_delayed_var~0.offset_In-1960967694, ULTIMATE.start_main_#t~mem84=|ULTIMATE.start_main_#t~mem84_In-1960967694|}  OutVars{ULTIMATE.start_main_#t~ite85=|ULTIMATE.start_main_#t~ite85_Out-1960967694|, ~weak$$choice1~0=~weak$$choice1~0_In-1960967694, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_In-1960967694, ~__unbuffered_p1_EAX$read_delayed~0=~__unbuffered_p1_EAX$read_delayed~0_In-1960967694, ~__unbuffered_p1_EAX$read_delayed_var~0.base=~__unbuffered_p1_EAX$read_delayed_var~0.base_In-1960967694, #memory_int=|#memory_int_In-1960967694|, ULTIMATE.start_main_#t~mem84=|ULTIMATE.start_main_#t~mem84_Out-1960967694|, ~__unbuffered_p1_EAX$read_delayed_var~0.offset=~__unbuffered_p1_EAX$read_delayed_var~0.offset_In-1960967694}  AuxVars[]  AssignedVars[ULTIMATE.start_main_#t~ite85, ULTIMATE.start_main_#t~mem84] because there is no mapped edge
[2019-12-27 17:58:25,425 WARN  L123   codingBacktranslator]: Skipped backtranslation of ATE [1209] [1209] L858-3-->L4: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6| (mod v_~main$tmp_guard1~0_12 256)) (let ((.cse3 (= v_~y~0_70 2)) (.cse1 (= 1 v_~__unbuffered_p1_EAX~0_33)) (.cse2 (= 2 v_~__unbuffered_p0_EAX~0_50)) (.cse0 (= 1 v_~__unbuffered_p2_EAX~0_19))) (or (and .cse0 .cse1 .cse2 .cse3 (= v_~main$tmp_guard1~0_12 0)) (and (or (not .cse3) (not .cse1) (not .cse2) (not .cse0)) (= v_~main$tmp_guard1~0_12 1)))) (= |v_ULTIMATE.start_main_#t~ite85_21| v_~__unbuffered_p1_EAX~0_33))  InVars {ULTIMATE.start_main_#t~ite85=|v_ULTIMATE.start_main_#t~ite85_21|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_50, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_19, ~y~0=v_~y~0_70}  OutVars{ULTIMATE.start_main_#t~ite85=|v_ULTIMATE.start_main_#t~ite85_20|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_50, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_33, ULTIMATE.start_main_#t~mem84=|v_ULTIMATE.start_main_#t~mem84_16|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_19, ~y~0=v_~y~0_70, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|, ULTIMATE.start_main_#t~ite86=|v_ULTIMATE.start_main_#t~ite86_23|}  AuxVars[]  AssignedVars[ULTIMATE.start_main_#t~ite85, ULTIMATE.start___VERIFIER_assert_~expression, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_#t~mem84, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression, ULTIMATE.start_main_#t~ite86] because there is no mapped edge
[2019-12-27 17:58:25,425 WARN  L123   codingBacktranslator]: Skipped backtranslation of ATE [1219] [1219] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0))  InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|}  OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|}  AuxVars[]  AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge
[2019-12-27 17:58:25,528 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 05:58:25 BasicIcfg
[2019-12-27 17:58:25,528 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2019-12-27 17:58:25,530 INFO  L168              Benchmark]: Toolchain (without parser) took 194375.90 ms. Allocated memory was 146.3 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 103.0 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB.
[2019-12-27 17:58:25,531 INFO  L168              Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 146.3 MB. Free memory was 122.7 MB in the beginning and 122.5 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB.
[2019-12-27 17:58:25,531 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 853.64 ms. Allocated memory was 146.3 MB in the beginning and 203.4 MB in the end (delta: 57.1 MB). Free memory was 102.6 MB in the beginning and 154.9 MB in the end (delta: -52.2 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB.
[2019-12-27 17:58:25,535 INFO  L168              Benchmark]: Boogie Procedure Inliner took 64.20 ms. Allocated memory is still 203.4 MB. Free memory was 154.9 MB in the beginning and 152.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB.
[2019-12-27 17:58:25,536 INFO  L168              Benchmark]: Boogie Preprocessor took 58.99 ms. Allocated memory is still 203.4 MB. Free memory was 152.2 MB in the beginning and 149.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB.
[2019-12-27 17:58:25,536 INFO  L168              Benchmark]: RCFGBuilder took 1025.85 ms. Allocated memory was 203.4 MB in the beginning and 235.9 MB in the end (delta: 32.5 MB). Free memory was 149.5 MB in the beginning and 197.5 MB in the end (delta: -48.0 MB). Peak memory consumption was 64.8 MB. Max. memory is 7.1 GB.
[2019-12-27 17:58:25,537 INFO  L168              Benchmark]: TraceAbstraction took 192368.65 ms. Allocated memory was 235.9 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 197.5 MB in the beginning and 1.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB.
[2019-12-27 17:58:25,544 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.17 ms. Allocated memory is still 146.3 MB. Free memory was 122.7 MB in the beginning and 122.5 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB.
 * CACSL2BoogieTranslator took 853.64 ms. Allocated memory was 146.3 MB in the beginning and 203.4 MB in the end (delta: 57.1 MB). Free memory was 102.6 MB in the beginning and 154.9 MB in the end (delta: -52.2 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB.
 * Boogie Procedure Inliner took 64.20 ms. Allocated memory is still 203.4 MB. Free memory was 154.9 MB in the beginning and 152.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB.
 * Boogie Preprocessor took 58.99 ms. Allocated memory is still 203.4 MB. Free memory was 152.2 MB in the beginning and 149.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB.
 * RCFGBuilder took 1025.85 ms. Allocated memory was 203.4 MB in the beginning and 235.9 MB in the end (delta: 32.5 MB). Free memory was 149.5 MB in the beginning and 197.5 MB in the end (delta: -48.0 MB). Peak memory consumption was 64.8 MB. Max. memory is 7.1 GB.
 * TraceAbstraction took 192368.65 ms. Allocated memory was 235.9 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 197.5 MB in the beginning and 1.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    LbeTime: 8.5s, 235 ProgramPointsBefore, 118 ProgramPointsAfterwards, 293 TransitionsBefore, 145 TransitionsAfterwards, 31682 CoEnabledTransitionPairs, 8 FixpointIterations, 50 TrivialSequentialCompositions, 55 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 70 ConcurrentYvCompositions, 35 ChoiceCompositions, 11910 VarBasedMoverChecksPositive, 338 VarBasedMoverChecksNegative, 121 SemBasedMoverChecksPositive, 341 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.4s, 0 MoverChecksTotal, 167703 CheckedPairsTotal, 175 TotalNumberOfCompositions
  - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable
    a call of __VERIFIER_error() is reachable
We found a FailurePath: 
[L840]  FCALL, FORK  0  pthread_create(&t1780, ((void *)0), P0, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={6:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0]
[L842]  FCALL, FORK  0  pthread_create(&t1781, ((void *)0), P1, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={6:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0]
[L775]               2  weak$$choice0 = __VERIFIER_nondet_bool()
[L776]               2  weak$$choice2 = __VERIFIER_nondet_bool()
[L777]               2  x$flush_delayed = weak$$choice2
[L778]  EXPR         2  \read(x)
[L778]               2  x$mem_tmp = x
[L779]               2  weak$$choice1 = __VERIFIER_nondet_bool()
[L780]  EXPR         2  !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x))))
[L780]  EXPR         2  \read(x)
[L780]  EXPR         2  !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x))))
        VAL             [!x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x))))=0, \read(x)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=4, weak$$choice2=1, x={6:0}, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0]
[L780]               2  x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x))))
[L844]  FCALL, FORK  0  pthread_create(&t1782, ((void *)0), P2, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=4, weak$$choice2=1, x={6:0}, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0]
[L781]               2  x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0))))
[L782]  EXPR         2  weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1))))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=4, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1))))=0, x={6:0}, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0]
[L782]               2  x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1))))
[L783]  EXPR         2  weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : weak$$choice0))))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=4, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : weak$$choice0))))=0, x={6:0}, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0]
[L783]               2  x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : weak$$choice0))))
[L784]  EXPR         2  weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=4, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))))=0, x={6:0}, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0]
[L784]               2  x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))))
[L786]  EXPR         2  weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$r_buff1_thd2 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=4, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$r_buff1_thd2 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))))=0, x={6:0}, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0]
[L786]               2  x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$r_buff1_thd2 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))))
[L787]               2  __unbuffered_p1_EAX$read_delayed = (_Bool)1
[L788]               2  __unbuffered_p1_EAX$read_delayed_var = &x
[L789]  EXPR         2  \read(x)
[L789]               2  __unbuffered_p1_EAX = x
[L811]               3  __unbuffered_p2_EAX = y
[L814]               3  y = 2
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={6:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=4, weak$$choice2=1, x={6:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2]
[L817]  EXPR         3  x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x)
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={6:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=4, weak$$choice2=1, x={6:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2]
[L817]               3  x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x)
[L797]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={6:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=4, weak$$choice2=1, x={6:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2]
[L818]               3  x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used
[L797]               2  x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)
[L798]               2  x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used
[L819]               3  x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used
[L820]               3  x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3
[L799]               2  x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used
[L800]               2  x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2
[L754]               1  x$r_buff1_thd0 = x$r_buff0_thd0
[L755]               1  x$r_buff1_thd1 = x$r_buff0_thd1
[L756]               1  x$r_buff1_thd2 = x$r_buff0_thd2
[L757]               1  x$r_buff1_thd3 = x$r_buff0_thd3
[L758]               1  x$r_buff0_thd1 = (_Bool)1
        VAL             [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={6:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=4, weak$$choice2=1, x={6:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2]
[L761]  EXPR         1  x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x)
        VAL             [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={6:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=4, weak$$choice2=1, x={6:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2]
[L761]               1  x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x)
[L762]               1  x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used
[L763]               1  x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used
[L846]               0  main$tmp_guard0 = __unbuffered_cnt == 3
        VAL             [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={6:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=4, weak$$choice2=1, x={6:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2]
[L850]               0  x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x)
[L851]               0  x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used
[L852]               0  x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used
[L853]               0  x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0
[L854]               0  x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0
[L857]               0  weak$$choice1 = __VERIFIER_nondet_bool()

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 4 procedures, 226 locations, 2 error locations. Result: UNSAFE, OverallTime: 191.9s, OverallIterations: 26, TraceHistogramMax: 1, AutomataDifference: 52.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6020 SDtfs, 8196 SDslu, 12066 SDs, 0 SdLazy, 9200 SolverSat, 558 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 17.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 252 GetRequests, 78 SyntacticMatches, 28 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=303600occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 77.1s AutomataMinimizationTime, 25 MinimizatonAttempts, 308763 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 932 NumberOfCodeBlocks, 932 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 837 ConstructedInterpolants, 0 QuantifiedInterpolants, 98199 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 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...