/usr/bin/java -Xmx16000000000 -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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix035_rmo.opt.i


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


This is Ultimate 0.1.25-7bb8cbd
[2020-10-15 18:18:25,064 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2020-10-15 18:18:25,067 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2020-10-15 18:18:25,089 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2020-10-15 18:18:25,089 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2020-10-15 18:18:25,091 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2020-10-15 18:18:25,092 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2020-10-15 18:18:25,093 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2020-10-15 18:18:25,095 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2020-10-15 18:18:25,096 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2020-10-15 18:18:25,097 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2020-10-15 18:18:25,098 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2020-10-15 18:18:25,098 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2020-10-15 18:18:25,099 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2020-10-15 18:18:25,100 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2020-10-15 18:18:25,101 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2020-10-15 18:18:25,102 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2020-10-15 18:18:25,103 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2020-10-15 18:18:25,104 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2020-10-15 18:18:25,106 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2020-10-15 18:18:25,107 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2020-10-15 18:18:25,108 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2020-10-15 18:18:25,110 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2020-10-15 18:18:25,110 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2020-10-15 18:18:25,113 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2020-10-15 18:18:25,113 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2020-10-15 18:18:25,113 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2020-10-15 18:18:25,114 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2020-10-15 18:18:25,115 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2020-10-15 18:18:25,115 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2020-10-15 18:18:25,116 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2020-10-15 18:18:25,116 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2020-10-15 18:18:25,117 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2020-10-15 18:18:25,118 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2020-10-15 18:18:25,119 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2020-10-15 18:18:25,119 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2020-10-15 18:18:25,119 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2020-10-15 18:18:25,120 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2020-10-15 18:18:25,120 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2020-10-15 18:18:25,121 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2020-10-15 18:18:25,121 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2020-10-15 18:18:25,122 INFO  L101        SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf
[2020-10-15 18:18:25,144 INFO  L113        SettingsManager]: Loading preferences was successful
[2020-10-15 18:18:25,145 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2020-10-15 18:18:25,146 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2020-10-15 18:18:25,146 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2020-10-15 18:18:25,146 INFO  L138        SettingsManager]:  * Use SBE=true
[2020-10-15 18:18:25,146 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2020-10-15 18:18:25,147 INFO  L138        SettingsManager]:  * sizeof long=4
[2020-10-15 18:18:25,147 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2020-10-15 18:18:25,147 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2020-10-15 18:18:25,147 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2020-10-15 18:18:25,147 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2020-10-15 18:18:25,148 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2020-10-15 18:18:25,148 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2020-10-15 18:18:25,148 INFO  L138        SettingsManager]:  * sizeof long double=12
[2020-10-15 18:18:25,148 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2020-10-15 18:18:25,148 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2020-10-15 18:18:25,148 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2020-10-15 18:18:25,149 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2020-10-15 18:18:25,149 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2020-10-15 18:18:25,149 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2020-10-15 18:18:25,149 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2020-10-15 18:18:25,149 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-10-15 18:18:25,150 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2020-10-15 18:18:25,150 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2020-10-15 18:18:25,150 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2020-10-15 18:18:25,150 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2020-10-15 18:18:25,150 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2020-10-15 18:18:25,151 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2020-10-15 18:18:25,151 INFO  L138        SettingsManager]:  * Trace refinement exception blacklist=NONE
[2020-10-15 18:18:25,151 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2020-10-15 18:18:25,429 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2020-10-15 18:18:25,446 INFO  L258   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2020-10-15 18:18:25,451 INFO  L214   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2020-10-15 18:18:25,452 INFO  L271        PluginConnector]: Initializing CDTParser...
[2020-10-15 18:18:25,454 INFO  L275        PluginConnector]: CDTParser initialized
[2020-10-15 18:18:25,455 INFO  L429   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix035_rmo.opt.i
[2020-10-15 18:18:25,523 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56a943c8f/56307c9ad406409fb384f0387608f52d/FLAG030c49b48
[2020-10-15 18:18:25,991 INFO  L306              CDTParser]: Found 1 translation units.
[2020-10-15 18:18:25,992 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix035_rmo.opt.i
[2020-10-15 18:18:26,008 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56a943c8f/56307c9ad406409fb384f0387608f52d/FLAG030c49b48
[2020-10-15 18:18:26,289 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56a943c8f/56307c9ad406409fb384f0387608f52d
[2020-10-15 18:18:26,297 INFO  L296   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2020-10-15 18:18:26,300 INFO  L131        ToolchainWalker]: Walking toolchain with 5 elements.
[2020-10-15 18:18:26,301 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2020-10-15 18:18:26,301 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2020-10-15 18:18:26,305 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2020-10-15 18:18:26,306 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 06:18:26" (1/1) ...
[2020-10-15 18:18:26,309 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e9d8adc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:18:26, skipping insertion in model container
[2020-10-15 18:18:26,310 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 06:18:26" (1/1) ...
[2020-10-15 18:18:26,318 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2020-10-15 18:18:26,366 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2020-10-15 18:18:26,970 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-10-15 18:18:26,987 INFO  L203         MainTranslator]: Completed pre-run
[2020-10-15 18:18:27,073 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-10-15 18:18:27,151 INFO  L208         MainTranslator]: Completed translation
[2020-10-15 18:18:27,151 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:18:27 WrapperNode
[2020-10-15 18:18:27,151 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2020-10-15 18:18:27,152 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2020-10-15 18:18:27,153 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2020-10-15 18:18:27,153 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2020-10-15 18:18:27,162 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:18:27" (1/1) ...
[2020-10-15 18:18:27,182 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:18:27" (1/1) ...
[2020-10-15 18:18:27,215 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2020-10-15 18:18:27,215 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2020-10-15 18:18:27,216 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2020-10-15 18:18:27,216 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2020-10-15 18:18:27,228 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:18:27" (1/1) ...
[2020-10-15 18:18:27,228 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:18:27" (1/1) ...
[2020-10-15 18:18:27,234 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:18:27" (1/1) ...
[2020-10-15 18:18:27,234 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:18:27" (1/1) ...
[2020-10-15 18:18:27,247 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:18:27" (1/1) ...
[2020-10-15 18:18:27,252 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:18:27" (1/1) ...
[2020-10-15 18:18:27,256 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:18:27" (1/1) ...
[2020-10-15 18:18:27,261 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2020-10-15 18:18:27,262 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2020-10-15 18:18:27,262 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2020-10-15 18:18:27,262 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2020-10-15 18:18:27,263 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:18:27" (1/1) ...
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-10-15 18:18:27,346 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2020-10-15 18:18:27,346 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2020-10-15 18:18:27,346 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2020-10-15 18:18:27,346 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2020-10-15 18:18:27,346 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2020-10-15 18:18:27,347 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2020-10-15 18:18:27,347 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2020-10-15 18:18:27,347 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2020-10-15 18:18:27,347 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2020-10-15 18:18:27,347 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2020-10-15 18:18:27,347 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2020-10-15 18:18:27,348 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2020-10-15 18:18:27,348 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2020-10-15 18:18:27,350 WARN  L208             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2020-10-15 18:18:29,389 INFO  L293             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2020-10-15 18:18:29,389 INFO  L298             CfgBuilder]: Removed 10 assume(true) statements.
[2020-10-15 18:18:29,392 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 06:18:29 BoogieIcfgContainer
[2020-10-15 18:18:29,392 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2020-10-15 18:18:29,393 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2020-10-15 18:18:29,393 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2020-10-15 18:18:29,397 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2020-10-15 18:18:29,397 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 06:18:26" (1/3) ...
[2020-10-15 18:18:29,398 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a6b4731 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 06:18:29, skipping insertion in model container
[2020-10-15 18:18:29,399 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:18:27" (2/3) ...
[2020-10-15 18:18:29,399 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a6b4731 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 06:18:29, skipping insertion in model container
[2020-10-15 18:18:29,399 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 06:18:29" (3/3) ...
[2020-10-15 18:18:29,401 INFO  L111   eAbstractionObserver]: Analyzing ICFG mix035_rmo.opt.i
[2020-10-15 18:18:29,413 WARN  L153   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2020-10-15 18:18:29,414 INFO  L164   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2020-10-15 18:18:29,422 INFO  L176   ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations.
[2020-10-15 18:18:29,423 INFO  L348   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2020-10-15 18:18:29,453 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,454 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,454 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,454 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,455 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,455 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,455 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,455 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,456 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,456 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,456 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,456 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,456 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,456 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,457 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,457 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,457 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,457 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,457 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,457 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,458 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,458 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,458 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,458 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,459 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,459 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,459 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,459 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,459 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,459 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,459 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,460 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,460 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,460 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,460 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,460 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,460 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,461 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,461 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,461 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,461 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,461 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,463 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,463 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,464 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,464 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,464 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,465 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,465 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,465 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,465 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,465 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,466 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,466 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,466 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,466 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,466 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,467 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,467 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,467 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,467 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,468 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,468 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,468 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,468 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,469 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,469 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,469 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,469 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,469 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,470 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,470 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,470 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,471 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,474 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,475 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,475 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,475 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,475 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,476 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,476 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,476 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,476 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,476 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,477 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,477 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,477 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,477 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,477 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,478 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,478 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,478 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,478 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,478 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,479 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,479 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,479 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,479 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,479 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,480 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,480 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,486 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,486 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,486 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,487 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,487 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,487 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,487 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,487 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,488 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,488 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,488 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,488 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,490 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,490 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,490 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,490 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,491 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,491 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,491 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,491 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,491 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,491 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:18:29,507 INFO  L253      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2020-10-15 18:18:29,529 INFO  L377      AbstractCegarLoop]: Interprodecural is true
[2020-10-15 18:18:29,529 INFO  L378      AbstractCegarLoop]: Hoare is true
[2020-10-15 18:18:29,529 INFO  L379      AbstractCegarLoop]: Compute interpolants for FPandBP
[2020-10-15 18:18:29,529 INFO  L380      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2020-10-15 18:18:29,530 INFO  L381      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2020-10-15 18:18:29,530 INFO  L382      AbstractCegarLoop]: Difference is false
[2020-10-15 18:18:29,530 INFO  L383      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2020-10-15 18:18:29,530 INFO  L387      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2020-10-15 18:18:29,544 INFO  L129   etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2020-10-15 18:18:29,547 INFO  L144   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 105 places, 97 transitions, 209 flow
[2020-10-15 18:18:29,550 INFO  L111        LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 97 transitions, 209 flow
[2020-10-15 18:18:29,552 INFO  L71            FinitePrefix]: Start finitePrefix. Operand has 105 places, 97 transitions, 209 flow
[2020-10-15 18:18:29,601 INFO  L129       PetriNetUnfolder]: 2/94 cut-off events.
[2020-10-15 18:18:29,601 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2020-10-15 18:18:29,606 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 104 conditions, 94 events. 2/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 68 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. 
[2020-10-15 18:18:29,609 INFO  L117        LiptonReduction]: Number of co-enabled transitions 1704
[2020-10-15 18:18:30,066 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-15 18:18:30,067 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:18:30,074 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-15 18:18:30,075 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-15 18:18:30,078 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-15 18:18:30,079 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-15 18:18:30,080 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-15 18:18:30,081 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-15 18:18:30,083 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-10-15 18:18:30,084 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:18:30,086 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-15 18:18:30,086 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:18:30,089 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-15 18:18:30,089 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:18:30,133 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-15 18:18:30,134 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-15 18:18:30,137 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-15 18:18:30,137 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:18:30,219 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-15 18:18:30,219 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:18:30,222 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-15 18:18:30,222 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-15 18:18:30,224 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-15 18:18:30,224 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-15 18:18:30,226 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-15 18:18:30,226 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-15 18:18:30,228 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-10-15 18:18:30,228 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:18:30,230 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-15 18:18:30,231 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:18:30,232 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-15 18:18:30,232 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:18:30,271 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-15 18:18:30,272 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-15 18:18:30,275 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-15 18:18:30,275 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:18:30,334 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-15 18:18:30,334 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-15 18:18:30,337 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-15 18:18:30,337 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:18:30,376 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-15 18:18:30,377 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:18:30,381 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-15 18:18:30,381 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-15 18:18:30,382 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-15 18:18:30,383 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-15 18:18:30,384 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-15 18:18:30,385 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-15 18:18:30,386 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-10-15 18:18:30,387 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:18:30,388 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-15 18:18:30,388 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:18:30,389 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-15 18:18:30,389 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:18:30,476 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-15 18:18:30,476 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-15 18:18:30,478 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-15 18:18:30,479 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:18:30,509 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-15 18:18:30,509 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:18:30,515 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-15 18:18:30,515 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-15 18:18:30,516 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-15 18:18:30,517 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-15 18:18:30,518 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-15 18:18:30,518 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-15 18:18:30,520 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-10-15 18:18:30,520 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:18:30,521 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-15 18:18:30,522 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:18:30,523 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-15 18:18:30,523 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:18:31,080 WARN  L193               SmtUtils]: Spent 444.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58
[2020-10-15 18:18:31,652 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-15 18:18:31,652 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts
[2020-10-15 18:18:31,655 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-15 18:18:31,656 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:18:31,675 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-15 18:18:31,675 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:18:31,690 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-15 18:18:31,690 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-15 18:18:31,691 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-15 18:18:31,692 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-15 18:18:31,693 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-15 18:18:31,693 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-15 18:18:31,695 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-10-15 18:18:31,695 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:18:31,697 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-15 18:18:31,698 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:18:31,699 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-15 18:18:31,699 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:18:31,858 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-10-15 18:18:31,858 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:18:31,859 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term
[2020-10-15 18:18:31,860 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:18:31,860 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term
[2020-10-15 18:18:31,861 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:18:32,230 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-15 18:18:32,230 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:18:32,245 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-15 18:18:32,245 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-15 18:18:32,247 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-15 18:18:32,247 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-15 18:18:32,249 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-15 18:18:32,249 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-15 18:18:32,251 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-10-15 18:18:32,251 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:18:32,252 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-15 18:18:32,253 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:18:32,255 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-15 18:18:32,255 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:18:32,287 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-15 18:18:32,287 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts
[2020-10-15 18:18:32,289 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-15 18:18:32,290 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:18:33,010 WARN  L193               SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93
[2020-10-15 18:18:33,133 WARN  L193               SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 91
[2020-10-15 18:18:33,141 INFO  L132        LiptonReduction]: Checked pairs total: 4800
[2020-10-15 18:18:33,141 INFO  L134        LiptonReduction]: Total number of compositions: 81
[2020-10-15 18:18:33,148 INFO  L100   iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 37 places, 28 transitions, 71 flow
[2020-10-15 18:18:33,200 INFO  L122   iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 922 states.
[2020-10-15 18:18:33,203 INFO  L276                IsEmpty]: Start isEmpty. Operand 922 states.
[2020-10-15 18:18:33,209 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 6
[2020-10-15 18:18:33,209 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-15 18:18:33,210 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1]
[2020-10-15 18:18:33,210 INFO  L429      AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-15 18:18:33,216 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-15 18:18:33,216 INFO  L82        PathProgramCache]: Analyzing trace with hash 927881738, now seen corresponding path program 1 times
[2020-10-15 18:18:33,226 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-15 18:18:33,227 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361525193]
[2020-10-15 18:18:33,227 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-15 18:18:33,364 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-15 18:18:33,441 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-15 18:18:33,442 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361525193]
[2020-10-15 18:18:33,443 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-15 18:18:33,443 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-15 18:18:33,444 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541434077]
[2020-10-15 18:18:33,448 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-15 18:18:33,449 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-15 18:18:33,463 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-15 18:18:33,464 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-15 18:18:33,466 INFO  L87              Difference]: Start difference. First operand 922 states. Second operand 3 states.
[2020-10-15 18:18:33,563 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-15 18:18:33,563 INFO  L93              Difference]: Finished difference Result 770 states and 2434 transitions.
[2020-10-15 18:18:33,564 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-15 18:18:33,565 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 5
[2020-10-15 18:18:33,566 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-15 18:18:33,590 INFO  L225             Difference]: With dead ends: 770
[2020-10-15 18:18:33,591 INFO  L226             Difference]: Without dead ends: 650
[2020-10-15 18:18:33,592 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-15 18:18:33,619 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 650 states.
[2020-10-15 18:18:33,688 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 650.
[2020-10-15 18:18:33,690 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 650 states.
[2020-10-15 18:18:33,703 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 2028 transitions.
[2020-10-15 18:18:33,704 INFO  L78                 Accepts]: Start accepts. Automaton has 650 states and 2028 transitions. Word has length 5
[2020-10-15 18:18:33,705 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-15 18:18:33,705 INFO  L481      AbstractCegarLoop]: Abstraction has 650 states and 2028 transitions.
[2020-10-15 18:18:33,705 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-15 18:18:33,705 INFO  L276                IsEmpty]: Start isEmpty. Operand 650 states and 2028 transitions.
[2020-10-15 18:18:33,707 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 11
[2020-10-15 18:18:33,707 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-15 18:18:33,707 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-15 18:18:33,708 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2020-10-15 18:18:33,710 INFO  L429      AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-15 18:18:33,711 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-15 18:18:33,711 INFO  L82        PathProgramCache]: Analyzing trace with hash 1143917507, now seen corresponding path program 1 times
[2020-10-15 18:18:33,711 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-15 18:18:33,712 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750082267]
[2020-10-15 18:18:33,712 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-15 18:18:33,779 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-15 18:18:33,847 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-15 18:18:33,848 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750082267]
[2020-10-15 18:18:33,848 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-15 18:18:33,848 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-10-15 18:18:33,849 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184756117]
[2020-10-15 18:18:33,850 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-15 18:18:33,850 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-15 18:18:33,851 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-15 18:18:33,851 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-15 18:18:33,851 INFO  L87              Difference]: Start difference. First operand 650 states and 2028 transitions. Second operand 4 states.
[2020-10-15 18:18:33,929 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-15 18:18:33,931 INFO  L93              Difference]: Finished difference Result 690 states and 2070 transitions.
[2020-10-15 18:18:33,931 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-15 18:18:33,932 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 10
[2020-10-15 18:18:33,932 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-15 18:18:33,941 INFO  L225             Difference]: With dead ends: 690
[2020-10-15 18:18:33,941 INFO  L226             Difference]: Without dead ends: 570
[2020-10-15 18:18:33,942 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2020-10-15 18:18:33,945 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 570 states.
[2020-10-15 18:18:33,981 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 570.
[2020-10-15 18:18:33,982 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 570 states.
[2020-10-15 18:18:33,985 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 1744 transitions.
[2020-10-15 18:18:33,986 INFO  L78                 Accepts]: Start accepts. Automaton has 570 states and 1744 transitions. Word has length 10
[2020-10-15 18:18:33,987 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-15 18:18:33,987 INFO  L481      AbstractCegarLoop]: Abstraction has 570 states and 1744 transitions.
[2020-10-15 18:18:33,987 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-15 18:18:33,987 INFO  L276                IsEmpty]: Start isEmpty. Operand 570 states and 1744 transitions.
[2020-10-15 18:18:33,996 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2020-10-15 18:18:33,996 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-15 18:18:33,996 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-15 18:18:33,997 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2020-10-15 18:18:33,997 INFO  L429      AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-15 18:18:33,997 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-15 18:18:33,997 INFO  L82        PathProgramCache]: Analyzing trace with hash -178798109, now seen corresponding path program 1 times
[2020-10-15 18:18:33,997 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-15 18:18:33,998 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990387166]
[2020-10-15 18:18:33,998 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-15 18:18:34,084 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-15 18:18:34,144 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-15 18:18:34,145 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990387166]
[2020-10-15 18:18:34,145 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-15 18:18:34,145 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-15 18:18:34,146 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803052594]
[2020-10-15 18:18:34,146 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-15 18:18:34,146 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-15 18:18:34,146 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-15 18:18:34,147 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-15 18:18:34,147 INFO  L87              Difference]: Start difference. First operand 570 states and 1744 transitions. Second operand 4 states.
[2020-10-15 18:18:34,187 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-15 18:18:34,187 INFO  L93              Difference]: Finished difference Result 498 states and 1322 transitions.
[2020-10-15 18:18:34,188 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-15 18:18:34,188 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 12
[2020-10-15 18:18:34,188 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-15 18:18:34,191 INFO  L225             Difference]: With dead ends: 498
[2020-10-15 18:18:34,191 INFO  L226             Difference]: Without dead ends: 378
[2020-10-15 18:18:34,192 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2020-10-15 18:18:34,194 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 378 states.
[2020-10-15 18:18:34,201 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 378.
[2020-10-15 18:18:34,201 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 378 states.
[2020-10-15 18:18:34,203 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 976 transitions.
[2020-10-15 18:18:34,203 INFO  L78                 Accepts]: Start accepts. Automaton has 378 states and 976 transitions. Word has length 12
[2020-10-15 18:18:34,203 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-15 18:18:34,204 INFO  L481      AbstractCegarLoop]: Abstraction has 378 states and 976 transitions.
[2020-10-15 18:18:34,204 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-15 18:18:34,204 INFO  L276                IsEmpty]: Start isEmpty. Operand 378 states and 976 transitions.
[2020-10-15 18:18:34,205 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2020-10-15 18:18:34,205 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-15 18:18:34,205 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-15 18:18:34,205 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2020-10-15 18:18:34,205 INFO  L429      AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-15 18:18:34,206 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-15 18:18:34,206 INFO  L82        PathProgramCache]: Analyzing trace with hash 1622210123, now seen corresponding path program 1 times
[2020-10-15 18:18:34,206 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-15 18:18:34,206 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169286356]
[2020-10-15 18:18:34,207 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-15 18:18:34,295 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-15 18:18:34,425 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-15 18:18:34,426 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169286356]
[2020-10-15 18:18:34,426 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-15 18:18:34,426 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-15 18:18:34,426 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757075563]
[2020-10-15 18:18:34,427 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-15 18:18:34,431 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-15 18:18:34,431 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-15 18:18:34,431 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2020-10-15 18:18:34,432 INFO  L87              Difference]: Start difference. First operand 378 states and 976 transitions. Second operand 5 states.
[2020-10-15 18:18:34,491 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-15 18:18:34,491 INFO  L93              Difference]: Finished difference Result 278 states and 649 transitions.
[2020-10-15 18:18:34,492 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-10-15 18:18:34,492 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 15
[2020-10-15 18:18:34,492 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-15 18:18:34,494 INFO  L225             Difference]: With dead ends: 278
[2020-10-15 18:18:34,494 INFO  L226             Difference]: Without dead ends: 218
[2020-10-15 18:18:34,495 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2020-10-15 18:18:34,496 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 218 states.
[2020-10-15 18:18:34,500 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218.
[2020-10-15 18:18:34,500 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 218 states.
[2020-10-15 18:18:34,501 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 496 transitions.
[2020-10-15 18:18:34,501 INFO  L78                 Accepts]: Start accepts. Automaton has 218 states and 496 transitions. Word has length 15
[2020-10-15 18:18:34,502 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-15 18:18:34,502 INFO  L481      AbstractCegarLoop]: Abstraction has 218 states and 496 transitions.
[2020-10-15 18:18:34,502 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-15 18:18:34,502 INFO  L276                IsEmpty]: Start isEmpty. Operand 218 states and 496 transitions.
[2020-10-15 18:18:34,503 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 19
[2020-10-15 18:18:34,503 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-15 18:18:34,503 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-15 18:18:34,503 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2020-10-15 18:18:34,503 INFO  L429      AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-15 18:18:34,503 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-15 18:18:34,504 INFO  L82        PathProgramCache]: Analyzing trace with hash -1126882986, now seen corresponding path program 1 times
[2020-10-15 18:18:34,504 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-15 18:18:34,504 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725654646]
[2020-10-15 18:18:34,504 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-15 18:18:34,572 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-15 18:18:34,654 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-15 18:18:34,655 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725654646]
[2020-10-15 18:18:34,655 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-15 18:18:34,655 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-15 18:18:34,656 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361353815]
[2020-10-15 18:18:34,656 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-15 18:18:34,656 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-15 18:18:34,657 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-15 18:18:34,657 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2020-10-15 18:18:34,657 INFO  L87              Difference]: Start difference. First operand 218 states and 496 transitions. Second operand 5 states.
[2020-10-15 18:18:34,686 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-15 18:18:34,686 INFO  L93              Difference]: Finished difference Result 296 states and 650 transitions.
[2020-10-15 18:18:34,687 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-15 18:18:34,687 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 18
[2020-10-15 18:18:34,687 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-15 18:18:34,689 INFO  L225             Difference]: With dead ends: 296
[2020-10-15 18:18:34,689 INFO  L226             Difference]: Without dead ends: 224
[2020-10-15 18:18:34,689 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2020-10-15 18:18:34,690 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 224 states.
[2020-10-15 18:18:34,695 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 218.
[2020-10-15 18:18:34,696 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 218 states.
[2020-10-15 18:18:34,696 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 479 transitions.
[2020-10-15 18:18:34,697 INFO  L78                 Accepts]: Start accepts. Automaton has 218 states and 479 transitions. Word has length 18
[2020-10-15 18:18:34,697 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-15 18:18:34,697 INFO  L481      AbstractCegarLoop]: Abstraction has 218 states and 479 transitions.
[2020-10-15 18:18:34,697 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-15 18:18:34,697 INFO  L276                IsEmpty]: Start isEmpty. Operand 218 states and 479 transitions.
[2020-10-15 18:18:34,698 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 19
[2020-10-15 18:18:34,698 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-15 18:18:34,699 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-15 18:18:34,699 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2020-10-15 18:18:34,699 INFO  L429      AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-15 18:18:34,699 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-15 18:18:34,699 INFO  L82        PathProgramCache]: Analyzing trace with hash 256378480, now seen corresponding path program 2 times
[2020-10-15 18:18:34,700 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-15 18:18:34,700 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072460301]
[2020-10-15 18:18:34,700 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-15 18:18:34,741 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-15 18:18:34,798 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-15 18:18:34,798 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072460301]
[2020-10-15 18:18:34,799 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-15 18:18:34,799 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-15 18:18:34,799 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437304140]
[2020-10-15 18:18:34,799 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-15 18:18:34,800 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-15 18:18:34,800 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-15 18:18:34,800 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2020-10-15 18:18:34,800 INFO  L87              Difference]: Start difference. First operand 218 states and 479 transitions. Second operand 6 states.
[2020-10-15 18:18:34,858 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-15 18:18:34,858 INFO  L93              Difference]: Finished difference Result 187 states and 416 transitions.
[2020-10-15 18:18:34,859 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-10-15 18:18:34,859 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 18
[2020-10-15 18:18:34,859 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-15 18:18:34,860 INFO  L225             Difference]: With dead ends: 187
[2020-10-15 18:18:34,860 INFO  L226             Difference]: Without dead ends: 93
[2020-10-15 18:18:34,861 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42
[2020-10-15 18:18:34,861 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 93 states.
[2020-10-15 18:18:34,863 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93.
[2020-10-15 18:18:34,863 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 93 states.
[2020-10-15 18:18:34,864 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 186 transitions.
[2020-10-15 18:18:34,864 INFO  L78                 Accepts]: Start accepts. Automaton has 93 states and 186 transitions. Word has length 18
[2020-10-15 18:18:34,864 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-15 18:18:34,864 INFO  L481      AbstractCegarLoop]: Abstraction has 93 states and 186 transitions.
[2020-10-15 18:18:34,864 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-15 18:18:34,865 INFO  L276                IsEmpty]: Start isEmpty. Operand 93 states and 186 transitions.
[2020-10-15 18:18:34,865 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 23
[2020-10-15 18:18:34,865 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-15 18:18:34,865 INFO  L422         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]
[2020-10-15 18:18:34,866 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2020-10-15 18:18:34,866 INFO  L429      AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-15 18:18:34,866 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-15 18:18:34,866 INFO  L82        PathProgramCache]: Analyzing trace with hash -1508156128, now seen corresponding path program 1 times
[2020-10-15 18:18:34,866 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-15 18:18:34,867 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950107767]
[2020-10-15 18:18:34,867 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-15 18:18:34,895 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-15 18:18:34,943 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-15 18:18:34,944 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950107767]
[2020-10-15 18:18:34,944 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-15 18:18:34,944 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-15 18:18:34,944 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042222599]
[2020-10-15 18:18:34,945 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-15 18:18:34,945 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-15 18:18:34,945 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-15 18:18:34,946 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2020-10-15 18:18:34,946 INFO  L87              Difference]: Start difference. First operand 93 states and 186 transitions. Second operand 5 states.
[2020-10-15 18:18:34,972 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-15 18:18:34,972 INFO  L93              Difference]: Finished difference Result 138 states and 274 transitions.
[2020-10-15 18:18:34,973 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-15 18:18:34,973 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 22
[2020-10-15 18:18:34,973 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-15 18:18:34,973 INFO  L225             Difference]: With dead ends: 138
[2020-10-15 18:18:34,974 INFO  L226             Difference]: Without dead ends: 65
[2020-10-15 18:18:34,974 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2020-10-15 18:18:34,975 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 65 states.
[2020-10-15 18:18:34,976 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65.
[2020-10-15 18:18:34,976 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 65 states.
[2020-10-15 18:18:34,976 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 118 transitions.
[2020-10-15 18:18:34,977 INFO  L78                 Accepts]: Start accepts. Automaton has 65 states and 118 transitions. Word has length 22
[2020-10-15 18:18:34,977 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-15 18:18:34,977 INFO  L481      AbstractCegarLoop]: Abstraction has 65 states and 118 transitions.
[2020-10-15 18:18:34,977 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-15 18:18:34,977 INFO  L276                IsEmpty]: Start isEmpty. Operand 65 states and 118 transitions.
[2020-10-15 18:18:34,978 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 23
[2020-10-15 18:18:34,978 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-15 18:18:34,978 INFO  L422         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]
[2020-10-15 18:18:34,978 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2020-10-15 18:18:34,978 INFO  L429      AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-15 18:18:34,979 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-15 18:18:34,979 INFO  L82        PathProgramCache]: Analyzing trace with hash -1357286054, now seen corresponding path program 2 times
[2020-10-15 18:18:34,979 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-15 18:18:34,979 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32978663]
[2020-10-15 18:18:34,979 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-15 18:18:35,048 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-15 18:18:35,048 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-15 18:18:35,113 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-15 18:18:35,113 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-15 18:18:35,157 INFO  L173   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2020-10-15 18:18:35,157 INFO  L523         BasicCegarLoop]: Counterexample might be feasible
[2020-10-15 18:18:35,158 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2020-10-15 18:18:35,188 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-15 18:18:35,188 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 18:18:35,191 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-15 18:18:35,191 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 18:18:35,191 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-15 18:18:35,191 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 18:18:35,192 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-15 18:18:35,192 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 18:18:35,192 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-15 18:18:35,192 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 18:18:35,192 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-15 18:18:35,193 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 18:18:35,193 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-15 18:18:35,193 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 18:18:35,193 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-15 18:18:35,193 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 18:18:35,193 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-15 18:18:35,194 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 18:18:35,194 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-15 18:18:35,194 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 18:18:35,194 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-15 18:18:35,194 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 18:18:35,195 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-15 18:18:35,195 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 18:18:35,195 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-15 18:18:35,195 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 18:18:35,196 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-15 18:18:35,196 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 18:18:35,196 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-15 18:18:35,196 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 18:18:35,197 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-15 18:18:35,197 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 18:18:35,197 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-15 18:18:35,197 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 18:18:35,197 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-15 18:18:35,198 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 18:18:35,198 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-15 18:18:35,198 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 18:18:35,198 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-15 18:18:35,199 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 18:18:35,199 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-15 18:18:35,199 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 18:18:35,199 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-15 18:18:35,199 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 18:18:35,200 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-15 18:18:35,200 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 18:18:35,200 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-15 18:18:35,201 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 18:18:35,201 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-15 18:18:35,201 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 18:18:35,201 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-15 18:18:35,201 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 18:18:35,202 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-15 18:18:35,205 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 18:18:35,205 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-15 18:18:35,205 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 18:18:35,270 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 06:18:35 BasicIcfg
[2020-10-15 18:18:35,270 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2020-10-15 18:18:35,272 INFO  L168              Benchmark]: Toolchain (without parser) took 8972.96 ms. Allocated memory was 250.1 MB in the beginning and 510.1 MB in the end (delta: 260.0 MB). Free memory was 205.2 MB in the beginning and 337.3 MB in the end (delta: -132.1 MB). Peak memory consumption was 127.9 MB. Max. memory is 14.2 GB.
[2020-10-15 18:18:35,273 INFO  L168              Benchmark]: CDTParser took 1.44 ms. Allocated memory is still 250.1 MB. Free memory is still 226.5 MB. There was no memory consumed. Max. memory is 14.2 GB.
[2020-10-15 18:18:35,274 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 850.90 ms. Allocated memory was 250.1 MB in the beginning and 310.4 MB in the end (delta: 60.3 MB). Free memory was 205.2 MB in the beginning and 262.9 MB in the end (delta: -57.7 MB). Peak memory consumption was 35.9 MB. Max. memory is 14.2 GB.
[2020-10-15 18:18:35,275 INFO  L168              Benchmark]: Boogie Procedure Inliner took 62.86 ms. Allocated memory is still 310.4 MB. Free memory was 262.9 MB in the beginning and 260.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB.
[2020-10-15 18:18:35,275 INFO  L168              Benchmark]: Boogie Preprocessor took 45.82 ms. Allocated memory is still 310.4 MB. Free memory was 260.4 MB in the beginning and 257.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB.
[2020-10-15 18:18:35,276 INFO  L168              Benchmark]: RCFGBuilder took 2130.33 ms. Allocated memory was 310.4 MB in the beginning and 357.0 MB in the end (delta: 46.7 MB). Free memory was 257.9 MB in the beginning and 212.9 MB in the end (delta: 45.0 MB). Peak memory consumption was 101.5 MB. Max. memory is 14.2 GB.
[2020-10-15 18:18:35,277 INFO  L168              Benchmark]: TraceAbstraction took 5877.01 ms. Allocated memory was 357.0 MB in the beginning and 510.1 MB in the end (delta: 153.1 MB). Free memory was 212.9 MB in the beginning and 337.3 MB in the end (delta: -124.4 MB). Peak memory consumption was 28.7 MB. Max. memory is 14.2 GB.
[2020-10-15 18:18:35,281 INFO  L336   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 1.44 ms. Allocated memory is still 250.1 MB. Free memory is still 226.5 MB. There was no memory consumed. Max. memory is 14.2 GB.
 * CACSL2BoogieTranslator took 850.90 ms. Allocated memory was 250.1 MB in the beginning and 310.4 MB in the end (delta: 60.3 MB). Free memory was 205.2 MB in the beginning and 262.9 MB in the end (delta: -57.7 MB). Peak memory consumption was 35.9 MB. Max. memory is 14.2 GB.
 * Boogie Procedure Inliner took 62.86 ms. Allocated memory is still 310.4 MB. Free memory was 262.9 MB in the beginning and 260.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB.
 * Boogie Preprocessor took 45.82 ms. Allocated memory is still 310.4 MB. Free memory was 260.4 MB in the beginning and 257.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB.
 * RCFGBuilder took 2130.33 ms. Allocated memory was 310.4 MB in the beginning and 357.0 MB in the end (delta: 46.7 MB). Free memory was 257.9 MB in the beginning and 212.9 MB in the end (delta: 45.0 MB). Peak memory consumption was 101.5 MB. Max. memory is 14.2 GB.
 * TraceAbstraction took 5877.01 ms. Allocated memory was 357.0 MB in the beginning and 510.1 MB in the end (delta: 153.1 MB). Free memory was 212.9 MB in the beginning and 337.3 MB in the end (delta: -124.4 MB). Peak memory consumption was 28.7 MB. Max. memory is 14.2 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    1223 VarBasedMoverChecksPositive, 60 VarBasedMoverChecksNegative, 20 SemBasedMoverChecksPositive, 40 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.0s, 171 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 3.5s, 105 PlacesBefore, 37 PlacesAfterwards, 97 TransitionsBefore, 28 TransitionsAfterwards, 1704 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 81 TotalNumberOfCompositions, 4800 MoverChecksTotal
  - CounterExampleResult [Line: 8]: a call of __VERIFIER_error() is reachable
    a call of __VERIFIER_error() is reachable
We found a FailurePath: 
[L699]               0  int __unbuffered_cnt = 0;
[L701]               0  int __unbuffered_p0_EAX = 0;
[L703]               0  int __unbuffered_p1_EAX = 0;
[L705]               0  int __unbuffered_p2_EAX = 0;
[L707]               0  int __unbuffered_p2_EBX = 0;
[L709]               0  int a = 0;
[L710]               0  _Bool main$tmp_guard0;
[L711]               0  _Bool main$tmp_guard1;
[L713]               0  int x = 0;
[L714]               0  _Bool x$flush_delayed;
[L715]               0  int x$mem_tmp;
[L716]               0  _Bool x$r_buff0_thd0;
[L717]               0  _Bool x$r_buff0_thd1;
[L718]               0  _Bool x$r_buff0_thd2;
[L719]               0  _Bool x$r_buff0_thd3;
[L720]               0  _Bool x$r_buff1_thd0;
[L721]               0  _Bool x$r_buff1_thd1;
[L722]               0  _Bool x$r_buff1_thd2;
[L723]               0  _Bool x$r_buff1_thd3;
[L724]               0  _Bool x$read_delayed;
[L725]               0  int *x$read_delayed_var;
[L726]               0  int x$w_buff0;
[L727]               0  _Bool x$w_buff0_used;
[L728]               0  int x$w_buff1;
[L729]               0  _Bool x$w_buff1_used;
[L731]               0  int y = 0;
[L733]               0  int z = 0;
[L734]               0  _Bool weak$$choice0;
[L735]               0  _Bool weak$$choice2;
[L830]               0  pthread_t t928;
[L831]  FCALL, FORK  0  pthread_create(&t928, ((void *)0), P0, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_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, z=0]
[L832]               0  pthread_t t929;
[L833]  FCALL, FORK  0  pthread_create(&t929, ((void *)0), P1, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_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, z=0]
[L767]               2  x$w_buff1 = x$w_buff0
[L768]               2  x$w_buff0 = 1
[L769]               2  x$w_buff1_used = x$w_buff0_used
[L770]               2  x$w_buff0_used = (_Bool)1
[L8]    COND TRUE    2  !expression
[L8]                 2  __VERIFIER_error()
[L772]               2  x$r_buff1_thd0 = x$r_buff0_thd0
[L773]               2  x$r_buff1_thd1 = x$r_buff0_thd1
[L774]               2  x$r_buff1_thd2 = x$r_buff0_thd2
[L775]               2  x$r_buff1_thd3 = x$r_buff0_thd3
[L776]               2  x$r_buff0_thd2 = (_Bool)1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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=0, z=0]
[L834]               0  pthread_t t930;
[L835]  FCALL, FORK  0  pthread_create(&t930, ((void *)0), P2, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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=0, z=0]
[L779]               2  __unbuffered_p1_EAX = y
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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=0, z=0]
[L796]               3  y = 1
[L799]               3  z = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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=1, z=1]
[L802]               3  __unbuffered_p2_EAX = z
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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=1, z=1]
[L805]               3  __unbuffered_p2_EBX = a
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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=1, z=1]
[L739]               1  a = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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=1, z=1]
[L742]               1  weak$$choice0 = __VERIFIER_nondet_bool()
[L743]               1  weak$$choice2 = __VERIFIER_nondet_bool()
[L744]               1  x$flush_delayed = weak$$choice2
[L745]               1  x$mem_tmp = x
[L746]  EXPR         1  !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)
[L746]               1  x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)
[L747]  EXPR         1  weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))
[L747]  EXPR         1  !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)
[L747]  EXPR         1  weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))
[L747]               1  x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))
[L748]  EXPR         1  weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))
[L748]  EXPR         1  !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)
[L748]  EXPR         1  x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1
[L748]  EXPR         1  !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)
[L748]  EXPR         1  weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))
[L748]               1  x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))
[L749]  EXPR         1  weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))
[L749]               1  x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))
[L750]  EXPR         1  weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L750]               1  x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L751]  EXPR         1  weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))
[L751]  EXPR         1  !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)
[L751]  EXPR         1  weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))
[L751]               1  x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))
[L752]  EXPR         1  weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L752]               1  x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L753]               1  __unbuffered_p0_EAX = x
[L754]  EXPR         1  x$flush_delayed ? x$mem_tmp : x
[L754]               1  x = x$flush_delayed ? x$mem_tmp : x
[L755]               1  x$flush_delayed = (_Bool)0
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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=1, z=1]
[L760]               1  __unbuffered_cnt = __unbuffered_cnt + 1
[L762]               1  return 0;
[L808]  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)
[L808]               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)
[L809]  EXPR         3  x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used
[L809]               3  x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used
[L810]  EXPR         3  x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used
[L810]               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
[L811]  EXPR         3  x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3
[L811]               3  x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3
[L812]  EXPR         3  x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3
[L812]               3  x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3
[L815]               3  __unbuffered_cnt = __unbuffered_cnt + 1
[L817]               3  return 0;
[L782]  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)
[L782]               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)
[L783]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used
[L783]               2  x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used
[L784]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used
[L784]               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
[L785]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2
[L785]               2  x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2
[L786]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2
[L786]               2  x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2
[L789]               2  __unbuffered_cnt = __unbuffered_cnt + 1
[L791]               2  return 0;
[L837]               0  main$tmp_guard0 = __unbuffered_cnt == 3
[L4]    COND FALSE   0  !(!cond)
[L841]  EXPR         0  x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x)
[L841]               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)
[L842]  EXPR         0  x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used
[L842]               0  x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used
[L843]  EXPR         0  x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used
[L843]               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
[L844]  EXPR         0  x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0
[L844]               0  x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0
[L845]  EXPR         0  x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0
[L845]               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
[L848]               0  main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0)
[L8]    COND TRUE    0  !expression
[L8]                 0  __VERIFIER_error()
        VAL             [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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=1, z=1]

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 4 procedures, 96 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 5.6s, OverallIterations: 8, TraceHistogramMax: 1, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.6s, HoareTripleCheckerStatistics: 213 SDtfs, 207 SDslu, 377 SDs, 0 SdLazy, 114 SolverSat, 21 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=922occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 6 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 122 NumberOfCodeBlocks, 122 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 93 ConstructedInterpolants, 0 QuantifiedInterpolants, 4214 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
Received shutdown request...