/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe011_pso.opt.i


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


This is Ultimate 0.1.25-b09bf87
[2020-10-16 12:08:42,993 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2020-10-16 12:08:42,995 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2020-10-16 12:08:43,020 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2020-10-16 12:08:43,021 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2020-10-16 12:08:43,022 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2020-10-16 12:08:43,023 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2020-10-16 12:08:43,025 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2020-10-16 12:08:43,027 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2020-10-16 12:08:43,028 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2020-10-16 12:08:43,029 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2020-10-16 12:08:43,030 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2020-10-16 12:08:43,030 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2020-10-16 12:08:43,031 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2020-10-16 12:08:43,033 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2020-10-16 12:08:43,034 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2020-10-16 12:08:43,035 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2020-10-16 12:08:43,036 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2020-10-16 12:08:43,038 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2020-10-16 12:08:43,040 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2020-10-16 12:08:43,042 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2020-10-16 12:08:43,043 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2020-10-16 12:08:43,045 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2020-10-16 12:08:43,046 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2020-10-16 12:08:43,049 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2020-10-16 12:08:43,050 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2020-10-16 12:08:43,050 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2020-10-16 12:08:43,051 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2020-10-16 12:08:43,052 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2020-10-16 12:08:43,053 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2020-10-16 12:08:43,053 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2020-10-16 12:08:43,054 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2020-10-16 12:08:43,055 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2020-10-16 12:08:43,056 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2020-10-16 12:08:43,057 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2020-10-16 12:08:43,057 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2020-10-16 12:08:43,058 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2020-10-16 12:08:43,058 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2020-10-16 12:08:43,059 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2020-10-16 12:08:43,060 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2020-10-16 12:08:43,061 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2020-10-16 12:08:43,062 INFO  L101        SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf
[2020-10-16 12:08:43,100 INFO  L113        SettingsManager]: Loading preferences was successful
[2020-10-16 12:08:43,100 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2020-10-16 12:08:43,102 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2020-10-16 12:08:43,102 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2020-10-16 12:08:43,103 INFO  L138        SettingsManager]:  * Use SBE=true
[2020-10-16 12:08:43,103 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2020-10-16 12:08:43,103 INFO  L138        SettingsManager]:  * sizeof long=4
[2020-10-16 12:08:43,103 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2020-10-16 12:08:43,103 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2020-10-16 12:08:43,104 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2020-10-16 12:08:43,104 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2020-10-16 12:08:43,104 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2020-10-16 12:08:43,104 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2020-10-16 12:08:43,104 INFO  L138        SettingsManager]:  * sizeof long double=12
[2020-10-16 12:08:43,105 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2020-10-16 12:08:43,105 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2020-10-16 12:08:43,105 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2020-10-16 12:08:43,106 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2020-10-16 12:08:43,107 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2020-10-16 12:08:43,107 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2020-10-16 12:08:43,107 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2020-10-16 12:08:43,108 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-10-16 12:08:43,108 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2020-10-16 12:08:43,108 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=Craig_NestedInterpolation
[2020-10-16 12:08:43,108 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2020-10-16 12:08:43,108 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2020-10-16 12:08:43,109 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2020-10-16 12:08:43,109 INFO  L138        SettingsManager]:  * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK
[2020-10-16 12:08:43,109 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2020-10-16 12:08:43,411 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2020-10-16 12:08:43,426 INFO  L258   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2020-10-16 12:08:43,431 INFO  L214   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2020-10-16 12:08:43,434 INFO  L271        PluginConnector]: Initializing CDTParser...
[2020-10-16 12:08:43,435 INFO  L275        PluginConnector]: CDTParser initialized
[2020-10-16 12:08:43,436 INFO  L429   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe011_pso.opt.i
[2020-10-16 12:08:43,512 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/d57a09d2d/486b5bda40ed437aa6c609a331e82d92/FLAG2853769a8
[2020-10-16 12:08:44,109 INFO  L306              CDTParser]: Found 1 translation units.
[2020-10-16 12:08:44,111 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/pthread-wmm/safe011_pso.opt.i
[2020-10-16 12:08:44,134 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/d57a09d2d/486b5bda40ed437aa6c609a331e82d92/FLAG2853769a8
[2020-10-16 12:08:44,370 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/d57a09d2d/486b5bda40ed437aa6c609a331e82d92
[2020-10-16 12:08:44,378 INFO  L296   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2020-10-16 12:08:44,381 INFO  L131        ToolchainWalker]: Walking toolchain with 5 elements.
[2020-10-16 12:08:44,382 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2020-10-16 12:08:44,382 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2020-10-16 12:08:44,386 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2020-10-16 12:08:44,387 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:08:44" (1/1) ...
[2020-10-16 12:08:44,390 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@478d0378 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:08:44, skipping insertion in model container
[2020-10-16 12:08:44,390 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:08:44" (1/1) ...
[2020-10-16 12:08:44,398 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2020-10-16 12:08:44,468 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2020-10-16 12:08:44,916 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-10-16 12:08:44,931 INFO  L203         MainTranslator]: Completed pre-run
[2020-10-16 12:08:45,038 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-10-16 12:08:45,117 INFO  L208         MainTranslator]: Completed translation
[2020-10-16 12:08:45,117 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:08:45 WrapperNode
[2020-10-16 12:08:45,117 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2020-10-16 12:08:45,119 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2020-10-16 12:08:45,119 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2020-10-16 12:08:45,119 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2020-10-16 12:08:45,129 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:08:45" (1/1) ...
[2020-10-16 12:08:45,150 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:08:45" (1/1) ...
[2020-10-16 12:08:45,195 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2020-10-16 12:08:45,196 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2020-10-16 12:08:45,196 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2020-10-16 12:08:45,196 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2020-10-16 12:08:45,206 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:08:45" (1/1) ...
[2020-10-16 12:08:45,207 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:08:45" (1/1) ...
[2020-10-16 12:08:45,212 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:08:45" (1/1) ...
[2020-10-16 12:08:45,213 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:08:45" (1/1) ...
[2020-10-16 12:08:45,224 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:08:45" (1/1) ...
[2020-10-16 12:08:45,229 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:08:45" (1/1) ...
[2020-10-16 12:08:45,234 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:08:45" (1/1) ...
[2020-10-16 12:08:45,240 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2020-10-16 12:08:45,240 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2020-10-16 12:08:45,241 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2020-10-16 12:08:45,241 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2020-10-16 12:08:45,242 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:08:45" (1/1) ...
No working directory specified, using /storage/repos/ultimate-2/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-16 12:08:45,317 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2020-10-16 12:08:45,317 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2020-10-16 12:08:45,317 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2020-10-16 12:08:45,317 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2020-10-16 12:08:45,318 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2020-10-16 12:08:45,318 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2020-10-16 12:08:45,318 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2020-10-16 12:08:45,318 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2020-10-16 12:08:45,319 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2020-10-16 12:08:45,319 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2020-10-16 12:08:45,319 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2020-10-16 12:08:45,319 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2020-10-16 12:08:45,319 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2020-10-16 12:08:45,322 WARN  L208             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2020-10-16 12:08:47,547 INFO  L293             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2020-10-16 12:08:47,547 INFO  L298             CfgBuilder]: Removed 10 assume(true) statements.
[2020-10-16 12:08:47,551 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:08:47 BoogieIcfgContainer
[2020-10-16 12:08:47,551 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2020-10-16 12:08:47,554 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2020-10-16 12:08:47,555 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2020-10-16 12:08:47,559 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2020-10-16 12:08:47,559 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 12:08:44" (1/3) ...
[2020-10-16 12:08:47,560 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4675c87e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:08:47, skipping insertion in model container
[2020-10-16 12:08:47,562 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:08:45" (2/3) ...
[2020-10-16 12:08:47,562 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4675c87e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:08:47, skipping insertion in model container
[2020-10-16 12:08:47,562 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:08:47" (3/3) ...
[2020-10-16 12:08:47,565 INFO  L111   eAbstractionObserver]: Analyzing ICFG safe011_pso.opt.i
[2020-10-16 12:08:47,576 WARN  L153   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2020-10-16 12:08:47,577 INFO  L164   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION
[2020-10-16 12:08:47,587 INFO  L176   ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations.
[2020-10-16 12:08:47,588 INFO  L348   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2020-10-16 12:08:47,619 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:47,620 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:47,620 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:47,620 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:47,621 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:47,621 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:47,621 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:47,621 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:47,622 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:47,622 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:47,622 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:47,623 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:47,623 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:47,624 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:47,624 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:47,624 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:47,624 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:47,625 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:47,625 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:47,625 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:47,625 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:47,626 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:47,626 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:47,626 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:47,626 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:47,626 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:47,627 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:47,627 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:47,627 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:47,627 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:47,628 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:47,628 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:47,628 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:47,628 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:47,629 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:47,629 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:47,629 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:47,629 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:47,629 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:47,630 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:47,630 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:47,630 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:47,631 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:47,635 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:47,635 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:47,636 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:47,636 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:47,636 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:47,636 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:47,636 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:47,637 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:47,637 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:47,637 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:47,640 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:47,640 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:47,640 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:47,640 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:47,641 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:47,641 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:47,641 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:47,641 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:47,641 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:47,642 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:47,643 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:47,644 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:47,644 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:47,644 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:47,644 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:47,645 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:47,645 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:47,645 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:47,645 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:47,646 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:47,646 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:47,646 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 12:08:47,648 INFO  L149    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2020-10-16 12:08:47,664 INFO  L253      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2020-10-16 12:08:47,686 INFO  L377      AbstractCegarLoop]: Interprodecural is true
[2020-10-16 12:08:47,686 INFO  L378      AbstractCegarLoop]: Hoare is true
[2020-10-16 12:08:47,687 INFO  L379      AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation
[2020-10-16 12:08:47,687 INFO  L380      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2020-10-16 12:08:47,687 INFO  L381      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2020-10-16 12:08:47,687 INFO  L382      AbstractCegarLoop]: Difference is false
[2020-10-16 12:08:47,687 INFO  L383      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2020-10-16 12:08:47,687 INFO  L387      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2020-10-16 12:08:47,701 INFO  L137   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2020-10-16 12:08:47,702 INFO  L144   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 199 flow
[2020-10-16 12:08:47,705 INFO  L111        LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 199 flow
[2020-10-16 12:08:47,707 INFO  L71            FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 199 flow
[2020-10-16 12:08:47,752 INFO  L129       PetriNetUnfolder]: 2/89 cut-off events.
[2020-10-16 12:08:47,752 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2020-10-16 12:08:47,757 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 99 conditions, 89 events. 2/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 66 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. 
[2020-10-16 12:08:47,760 INFO  L117        LiptonReduction]: Number of co-enabled transitions 1642
[2020-10-16 12:08:48,991 WARN  L193               SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 63
[2020-10-16 12:08:49,126 WARN  L193               SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 58
[2020-10-16 12:08:49,855 WARN  L193               SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85
[2020-10-16 12:08:49,966 INFO  L132        LiptonReduction]: Checked pairs total: 4589
[2020-10-16 12:08:49,966 INFO  L134        LiptonReduction]: Total number of compositions: 74
[2020-10-16 12:08:49,973 INFO  L100   iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 38 places, 29 transitions, 73 flow
[2020-10-16 12:08:50,051 INFO  L122   iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 1122 states.
[2020-10-16 12:08:50,054 INFO  L276                IsEmpty]: Start isEmpty. Operand 1122 states.
[2020-10-16 12:08:50,061 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 6
[2020-10-16 12:08:50,061 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 12:08:50,063 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1]
[2020-10-16 12:08:50,063 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-16 12:08:50,072 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 12:08:50,072 INFO  L82        PathProgramCache]: Analyzing trace with hash 998769705, now seen corresponding path program 1 times
[2020-10-16 12:08:50,085 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 12:08:50,086 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837397990]
[2020-10-16 12:08:50,086 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 12:08:50,300 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 12:08:50,396 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-16 12:08:50,397 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837397990]
[2020-10-16 12:08:50,399 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 12:08:50,399 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-16 12:08:50,399 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128015180]
[2020-10-16 12:08:50,404 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 12:08:50,405 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 12:08:50,419 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 12:08:50,420 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 12:08:50,422 INFO  L87              Difference]: Start difference. First operand 1122 states. Second operand 3 states.
[2020-10-16 12:08:50,576 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 12:08:50,576 INFO  L93              Difference]: Finished difference Result 937 states and 3000 transitions.
[2020-10-16 12:08:50,578 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-16 12:08:50,580 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 5
[2020-10-16 12:08:50,581 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 12:08:50,622 INFO  L225             Difference]: With dead ends: 937
[2020-10-16 12:08:50,622 INFO  L226             Difference]: Without dead ends: 687
[2020-10-16 12:08:50,624 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-16 12:08:50,654 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 687 states.
[2020-10-16 12:08:50,771 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 687.
[2020-10-16 12:08:50,774 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 687 states.
[2020-10-16 12:08:50,780 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 2150 transitions.
[2020-10-16 12:08:50,782 INFO  L78                 Accepts]: Start accepts. Automaton has 687 states and 2150 transitions. Word has length 5
[2020-10-16 12:08:50,782 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 12:08:50,782 INFO  L481      AbstractCegarLoop]: Abstraction has 687 states and 2150 transitions.
[2020-10-16 12:08:50,782 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 12:08:50,782 INFO  L276                IsEmpty]: Start isEmpty. Operand 687 states and 2150 transitions.
[2020-10-16 12:08:50,784 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 11
[2020-10-16 12:08:50,785 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 12:08:50,785 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 12:08:50,785 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2020-10-16 12:08:50,786 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-16 12:08:50,786 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 12:08:50,786 INFO  L82        PathProgramCache]: Analyzing trace with hash 483864509, now seen corresponding path program 1 times
[2020-10-16 12:08:50,786 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 12:08:50,787 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728015617]
[2020-10-16 12:08:50,787 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 12:08:50,928 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 12:08:51,104 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-16 12:08:51,104 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728015617]
[2020-10-16 12:08:51,105 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 12:08:51,105 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-16 12:08:51,105 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119824467]
[2020-10-16 12:08:51,106 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-16 12:08:51,107 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 12:08:51,107 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-16 12:08:51,107 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2020-10-16 12:08:51,107 INFO  L87              Difference]: Start difference. First operand 687 states and 2150 transitions. Second operand 5 states.
[2020-10-16 12:08:51,251 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 12:08:51,251 INFO  L93              Difference]: Finished difference Result 792 states and 2384 transitions.
[2020-10-16 12:08:51,252 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-16 12:08:51,252 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 10
[2020-10-16 12:08:51,253 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 12:08:51,262 INFO  L225             Difference]: With dead ends: 792
[2020-10-16 12:08:51,263 INFO  L226             Difference]: Without dead ends: 667
[2020-10-16 12:08:51,264 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2020-10-16 12:08:51,268 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 667 states.
[2020-10-16 12:08:51,290 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 667.
[2020-10-16 12:08:51,291 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 667 states.
[2020-10-16 12:08:51,294 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 2074 transitions.
[2020-10-16 12:08:51,295 INFO  L78                 Accepts]: Start accepts. Automaton has 667 states and 2074 transitions. Word has length 10
[2020-10-16 12:08:51,296 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 12:08:51,296 INFO  L481      AbstractCegarLoop]: Abstraction has 667 states and 2074 transitions.
[2020-10-16 12:08:51,296 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-16 12:08:51,296 INFO  L276                IsEmpty]: Start isEmpty. Operand 667 states and 2074 transitions.
[2020-10-16 12:08:51,298 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2020-10-16 12:08:51,299 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 12:08:51,299 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 12:08:51,299 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2020-10-16 12:08:51,299 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-16 12:08:51,299 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 12:08:51,300 INFO  L82        PathProgramCache]: Analyzing trace with hash 588034171, now seen corresponding path program 1 times
[2020-10-16 12:08:51,300 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 12:08:51,300 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262609186]
[2020-10-16 12:08:51,300 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 12:08:51,345 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 12:08:51,403 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-16 12:08:51,404 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262609186]
[2020-10-16 12:08:51,404 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 12:08:51,404 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-16 12:08:51,404 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838487846]
[2020-10-16 12:08:51,405 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-16 12:08:51,405 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 12:08:51,405 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-16 12:08:51,405 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2020-10-16 12:08:51,406 INFO  L87              Difference]: Start difference. First operand 667 states and 2074 transitions. Second operand 5 states.
[2020-10-16 12:08:51,523 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 12:08:51,524 INFO  L93              Difference]: Finished difference Result 736 states and 2205 transitions.
[2020-10-16 12:08:51,524 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-10-16 12:08:51,525 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 11
[2020-10-16 12:08:51,525 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 12:08:51,530 INFO  L225             Difference]: With dead ends: 736
[2020-10-16 12:08:51,530 INFO  L226             Difference]: Without dead ends: 621
[2020-10-16 12:08:51,531 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2020-10-16 12:08:51,534 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 621 states.
[2020-10-16 12:08:51,549 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 621.
[2020-10-16 12:08:51,550 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 621 states.
[2020-10-16 12:08:51,553 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 1910 transitions.
[2020-10-16 12:08:51,553 INFO  L78                 Accepts]: Start accepts. Automaton has 621 states and 1910 transitions. Word has length 11
[2020-10-16 12:08:51,553 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 12:08:51,554 INFO  L481      AbstractCegarLoop]: Abstraction has 621 states and 1910 transitions.
[2020-10-16 12:08:51,554 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-16 12:08:51,554 INFO  L276                IsEmpty]: Start isEmpty. Operand 621 states and 1910 transitions.
[2020-10-16 12:08:51,562 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2020-10-16 12:08:51,562 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 12:08:51,563 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 12:08:51,563 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2020-10-16 12:08:51,563 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-16 12:08:51,563 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 12:08:51,563 INFO  L82        PathProgramCache]: Analyzing trace with hash 1048372720, now seen corresponding path program 1 times
[2020-10-16 12:08:51,564 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 12:08:51,565 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721340300]
[2020-10-16 12:08:51,565 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 12:08:51,640 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 12:08:51,702 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-16 12:08:51,703 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721340300]
[2020-10-16 12:08:51,703 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 12:08:51,703 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-16 12:08:51,704 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558972494]
[2020-10-16 12:08:51,704 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-16 12:08:51,704 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 12:08:51,705 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-16 12:08:51,705 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2020-10-16 12:08:51,705 INFO  L87              Difference]: Start difference. First operand 621 states and 1910 transitions. Second operand 6 states.
[2020-10-16 12:08:51,828 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 12:08:51,829 INFO  L93              Difference]: Finished difference Result 829 states and 2510 transitions.
[2020-10-16 12:08:51,829 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2020-10-16 12:08:51,829 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 12
[2020-10-16 12:08:51,829 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 12:08:51,832 INFO  L225             Difference]: With dead ends: 829
[2020-10-16 12:08:51,833 INFO  L226             Difference]: Without dead ends: 437
[2020-10-16 12:08:51,833 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110
[2020-10-16 12:08:51,836 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 437 states.
[2020-10-16 12:08:51,845 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 437.
[2020-10-16 12:08:51,845 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 437 states.
[2020-10-16 12:08:51,847 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 1270 transitions.
[2020-10-16 12:08:51,847 INFO  L78                 Accepts]: Start accepts. Automaton has 437 states and 1270 transitions. Word has length 12
[2020-10-16 12:08:51,848 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 12:08:51,848 INFO  L481      AbstractCegarLoop]: Abstraction has 437 states and 1270 transitions.
[2020-10-16 12:08:51,848 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-16 12:08:51,848 INFO  L276                IsEmpty]: Start isEmpty. Operand 437 states and 1270 transitions.
[2020-10-16 12:08:51,849 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2020-10-16 12:08:51,849 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 12:08:51,849 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 12:08:51,849 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2020-10-16 12:08:51,849 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-16 12:08:51,850 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 12:08:51,850 INFO  L82        PathProgramCache]: Analyzing trace with hash 1129999264, now seen corresponding path program 1 times
[2020-10-16 12:08:51,850 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 12:08:51,850 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714890830]
[2020-10-16 12:08:51,851 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 12:08:51,878 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 12:08:51,930 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-16 12:08:51,930 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714890830]
[2020-10-16 12:08:51,931 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 12:08:51,931 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-10-16 12:08:51,931 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174651497]
[2020-10-16 12:08:51,931 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-16 12:08:51,932 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 12:08:51,932 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-16 12:08:51,932 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-16 12:08:51,932 INFO  L87              Difference]: Start difference. First operand 437 states and 1270 transitions. Second operand 4 states.
[2020-10-16 12:08:51,969 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 12:08:51,969 INFO  L93              Difference]: Finished difference Result 491 states and 1384 transitions.
[2020-10-16 12:08:51,970 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-16 12:08:51,970 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 13
[2020-10-16 12:08:51,971 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 12:08:51,973 INFO  L225             Difference]: With dead ends: 491
[2020-10-16 12:08:51,974 INFO  L226             Difference]: Without dead ends: 431
[2020-10-16 12:08:51,974 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-16 12:08:51,976 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 431 states.
[2020-10-16 12:08:51,985 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 431.
[2020-10-16 12:08:51,986 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 431 states.
[2020-10-16 12:08:51,988 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 1248 transitions.
[2020-10-16 12:08:51,988 INFO  L78                 Accepts]: Start accepts. Automaton has 431 states and 1248 transitions. Word has length 13
[2020-10-16 12:08:51,988 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 12:08:51,988 INFO  L481      AbstractCegarLoop]: Abstraction has 431 states and 1248 transitions.
[2020-10-16 12:08:51,988 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-16 12:08:51,989 INFO  L276                IsEmpty]: Start isEmpty. Operand 431 states and 1248 transitions.
[2020-10-16 12:08:51,990 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2020-10-16 12:08:51,990 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 12:08:51,990 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 12:08:51,990 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2020-10-16 12:08:51,990 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-16 12:08:51,991 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 12:08:51,991 INFO  L82        PathProgramCache]: Analyzing trace with hash 420101975, now seen corresponding path program 1 times
[2020-10-16 12:08:51,991 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 12:08:51,991 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333911244]
[2020-10-16 12:08:51,991 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 12:08:52,023 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 12:08:52,132 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-16 12:08:52,132 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333911244]
[2020-10-16 12:08:52,133 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 12:08:52,133 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-16 12:08:52,133 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614734166]
[2020-10-16 12:08:52,134 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-16 12:08:52,134 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 12:08:52,134 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-16 12:08:52,135 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2020-10-16 12:08:52,135 INFO  L87              Difference]: Start difference. First operand 431 states and 1248 transitions. Second operand 6 states.
[2020-10-16 12:08:52,267 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 12:08:52,267 INFO  L93              Difference]: Finished difference Result 482 states and 1352 transitions.
[2020-10-16 12:08:52,268 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-16 12:08:52,268 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 14
[2020-10-16 12:08:52,268 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 12:08:52,272 INFO  L225             Difference]: With dead ends: 482
[2020-10-16 12:08:52,272 INFO  L226             Difference]: Without dead ends: 425
[2020-10-16 12:08:52,273 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2020-10-16 12:08:52,275 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 425 states.
[2020-10-16 12:08:52,285 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 425.
[2020-10-16 12:08:52,285 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 425 states.
[2020-10-16 12:08:52,287 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 1224 transitions.
[2020-10-16 12:08:52,288 INFO  L78                 Accepts]: Start accepts. Automaton has 425 states and 1224 transitions. Word has length 14
[2020-10-16 12:08:52,288 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 12:08:52,288 INFO  L481      AbstractCegarLoop]: Abstraction has 425 states and 1224 transitions.
[2020-10-16 12:08:52,288 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-16 12:08:52,288 INFO  L276                IsEmpty]: Start isEmpty. Operand 425 states and 1224 transitions.
[2020-10-16 12:08:52,290 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2020-10-16 12:08:52,290 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 12:08:52,290 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 12:08:52,290 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2020-10-16 12:08:52,290 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-16 12:08:52,291 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 12:08:52,291 INFO  L82        PathProgramCache]: Analyzing trace with hash 697856379, now seen corresponding path program 1 times
[2020-10-16 12:08:52,291 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 12:08:52,291 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340227290]
[2020-10-16 12:08:52,292 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 12:08:52,368 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 12:08:52,489 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-16 12:08:52,490 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340227290]
[2020-10-16 12:08:52,490 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 12:08:52,490 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-16 12:08:52,491 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538771171]
[2020-10-16 12:08:52,491 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-10-16 12:08:52,491 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 12:08:52,491 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-10-16 12:08:52,492 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2020-10-16 12:08:52,492 INFO  L87              Difference]: Start difference. First operand 425 states and 1224 transitions. Second operand 7 states.
[2020-10-16 12:08:52,645 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 12:08:52,645 INFO  L93              Difference]: Finished difference Result 542 states and 1553 transitions.
[2020-10-16 12:08:52,646 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-10-16 12:08:52,646 INFO  L78                 Accepts]: Start accepts. Automaton has 7 states. Word has length 15
[2020-10-16 12:08:52,646 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 12:08:52,651 INFO  L225             Difference]: With dead ends: 542
[2020-10-16 12:08:52,651 INFO  L226             Difference]: Without dead ends: 506
[2020-10-16 12:08:52,652 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72
[2020-10-16 12:08:52,655 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 506 states.
[2020-10-16 12:08:52,669 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 442.
[2020-10-16 12:08:52,669 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 442 states.
[2020-10-16 12:08:52,672 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 1279 transitions.
[2020-10-16 12:08:52,672 INFO  L78                 Accepts]: Start accepts. Automaton has 442 states and 1279 transitions. Word has length 15
[2020-10-16 12:08:52,672 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 12:08:52,672 INFO  L481      AbstractCegarLoop]: Abstraction has 442 states and 1279 transitions.
[2020-10-16 12:08:52,673 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-10-16 12:08:52,673 INFO  L276                IsEmpty]: Start isEmpty. Operand 442 states and 1279 transitions.
[2020-10-16 12:08:52,674 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2020-10-16 12:08:52,674 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 12:08:52,674 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 12:08:52,674 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2020-10-16 12:08:52,675 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-16 12:08:52,675 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 12:08:52,675 INFO  L82        PathProgramCache]: Analyzing trace with hash 572903227, now seen corresponding path program 2 times
[2020-10-16 12:08:52,675 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 12:08:52,675 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248180834]
[2020-10-16 12:08:52,676 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 12:08:52,707 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 12:08:52,810 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-16 12:08:52,810 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248180834]
[2020-10-16 12:08:52,811 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 12:08:52,811 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-16 12:08:52,811 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940565839]
[2020-10-16 12:08:52,811 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-10-16 12:08:52,812 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 12:08:52,812 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-10-16 12:08:52,812 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2020-10-16 12:08:52,812 INFO  L87              Difference]: Start difference. First operand 442 states and 1279 transitions. Second operand 7 states.
[2020-10-16 12:08:52,961 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 12:08:52,961 INFO  L93              Difference]: Finished difference Result 518 states and 1471 transitions.
[2020-10-16 12:08:52,962 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-10-16 12:08:52,962 INFO  L78                 Accepts]: Start accepts. Automaton has 7 states. Word has length 15
[2020-10-16 12:08:52,962 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 12:08:52,966 INFO  L225             Difference]: With dead ends: 518
[2020-10-16 12:08:52,966 INFO  L226             Difference]: Without dead ends: 478
[2020-10-16 12:08:52,966 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2020-10-16 12:08:52,969 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 478 states.
[2020-10-16 12:08:52,979 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 473.
[2020-10-16 12:08:52,980 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 473 states.
[2020-10-16 12:08:52,982 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 1367 transitions.
[2020-10-16 12:08:52,982 INFO  L78                 Accepts]: Start accepts. Automaton has 473 states and 1367 transitions. Word has length 15
[2020-10-16 12:08:52,983 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 12:08:52,983 INFO  L481      AbstractCegarLoop]: Abstraction has 473 states and 1367 transitions.
[2020-10-16 12:08:52,983 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-10-16 12:08:52,983 INFO  L276                IsEmpty]: Start isEmpty. Operand 473 states and 1367 transitions.
[2020-10-16 12:08:52,984 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2020-10-16 12:08:52,984 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 12:08:52,985 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 12:08:52,985 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2020-10-16 12:08:52,985 INFO  L429      AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 12:08:52,985 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 12:08:52,985 INFO  L82        PathProgramCache]: Analyzing trace with hash 576285688, now seen corresponding path program 1 times
[2020-10-16 12:08:52,986 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 12:08:52,986 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330652199]
[2020-10-16 12:08:52,986 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 12:08:53,032 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 12:08:53,060 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-16 12:08:53,061 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330652199]
[2020-10-16 12:08:53,061 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 12:08:53,061 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-16 12:08:53,062 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545471017]
[2020-10-16 12:08:53,062 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-16 12:08:53,062 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 12:08:53,062 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-16 12:08:53,063 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-16 12:08:53,063 INFO  L87              Difference]: Start difference. First operand 473 states and 1367 transitions. Second operand 4 states.
[2020-10-16 12:08:53,089 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 12:08:53,089 INFO  L93              Difference]: Finished difference Result 436 states and 1116 transitions.
[2020-10-16 12:08:53,089 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-10-16 12:08:53,090 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 15
[2020-10-16 12:08:53,090 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 12:08:53,092 INFO  L225             Difference]: With dead ends: 436
[2020-10-16 12:08:53,092 INFO  L226             Difference]: Without dead ends: 339
[2020-10-16 12:08:53,093 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-16 12:08:53,095 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 339 states.
[2020-10-16 12:08:53,101 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 331.
[2020-10-16 12:08:53,102 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 331 states.
[2020-10-16 12:08:53,103 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 828 transitions.
[2020-10-16 12:08:53,103 INFO  L78                 Accepts]: Start accepts. Automaton has 331 states and 828 transitions. Word has length 15
[2020-10-16 12:08:53,103 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 12:08:53,103 INFO  L481      AbstractCegarLoop]: Abstraction has 331 states and 828 transitions.
[2020-10-16 12:08:53,104 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-16 12:08:53,104 INFO  L276                IsEmpty]: Start isEmpty. Operand 331 states and 828 transitions.
[2020-10-16 12:08:53,105 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2020-10-16 12:08:53,105 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 12:08:53,105 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 12:08:53,105 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2020-10-16 12:08:53,105 INFO  L429      AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 12:08:53,105 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 12:08:53,106 INFO  L82        PathProgramCache]: Analyzing trace with hash 1927188948, now seen corresponding path program 1 times
[2020-10-16 12:08:53,106 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 12:08:53,106 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397733591]
[2020-10-16 12:08:53,106 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 12:08:53,160 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 12:08:53,223 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-16 12:08:53,224 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397733591]
[2020-10-16 12:08:53,224 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 12:08:53,225 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-16 12:08:53,225 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784028630]
[2020-10-16 12:08:53,225 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-16 12:08:53,225 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 12:08:53,226 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-16 12:08:53,226 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2020-10-16 12:08:53,226 INFO  L87              Difference]: Start difference. First operand 331 states and 828 transitions. Second operand 5 states.
[2020-10-16 12:08:53,264 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 12:08:53,264 INFO  L93              Difference]: Finished difference Result 254 states and 577 transitions.
[2020-10-16 12:08:53,265 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-16 12:08:53,265 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 16
[2020-10-16 12:08:53,266 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 12:08:53,267 INFO  L225             Difference]: With dead ends: 254
[2020-10-16 12:08:53,267 INFO  L226             Difference]: Without dead ends: 205
[2020-10-16 12:08:53,268 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2020-10-16 12:08:53,269 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 205 states.
[2020-10-16 12:08:53,273 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 189.
[2020-10-16 12:08:53,273 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 189 states.
[2020-10-16 12:08:53,274 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 418 transitions.
[2020-10-16 12:08:53,274 INFO  L78                 Accepts]: Start accepts. Automaton has 189 states and 418 transitions. Word has length 16
[2020-10-16 12:08:53,274 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 12:08:53,274 INFO  L481      AbstractCegarLoop]: Abstraction has 189 states and 418 transitions.
[2020-10-16 12:08:53,274 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-16 12:08:53,275 INFO  L276                IsEmpty]: Start isEmpty. Operand 189 states and 418 transitions.
[2020-10-16 12:08:53,275 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 19
[2020-10-16 12:08:53,275 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 12:08:53,276 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-16 12:08:53,276 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2020-10-16 12:08:53,276 INFO  L429      AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 12:08:53,276 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 12:08:53,276 INFO  L82        PathProgramCache]: Analyzing trace with hash 2032673958, now seen corresponding path program 1 times
[2020-10-16 12:08:53,278 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 12:08:53,278 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600290683]
[2020-10-16 12:08:53,278 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 12:08:53,365 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 12:08:53,423 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-16 12:08:53,423 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600290683]
[2020-10-16 12:08:53,423 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 12:08:53,423 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-16 12:08:53,424 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351810407]
[2020-10-16 12:08:53,426 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-16 12:08:53,426 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 12:08:53,426 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-16 12:08:53,427 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-16 12:08:53,427 INFO  L87              Difference]: Start difference. First operand 189 states and 418 transitions. Second operand 4 states.
[2020-10-16 12:08:53,462 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 12:08:53,463 INFO  L93              Difference]: Finished difference Result 258 states and 546 transitions.
[2020-10-16 12:08:53,463 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-16 12:08:53,463 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 18
[2020-10-16 12:08:53,464 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 12:08:53,467 INFO  L225             Difference]: With dead ends: 258
[2020-10-16 12:08:53,467 INFO  L226             Difference]: Without dead ends: 193
[2020-10-16 12:08:53,467 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2020-10-16 12:08:53,468 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 193 states.
[2020-10-16 12:08:53,472 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 187.
[2020-10-16 12:08:53,473 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 187 states.
[2020-10-16 12:08:53,473 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 400 transitions.
[2020-10-16 12:08:53,474 INFO  L78                 Accepts]: Start accepts. Automaton has 187 states and 400 transitions. Word has length 18
[2020-10-16 12:08:53,474 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 12:08:53,474 INFO  L481      AbstractCegarLoop]: Abstraction has 187 states and 400 transitions.
[2020-10-16 12:08:53,474 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-16 12:08:53,474 INFO  L276                IsEmpty]: Start isEmpty. Operand 187 states and 400 transitions.
[2020-10-16 12:08:53,475 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2020-10-16 12:08:53,475 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 12:08:53,475 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 12:08:53,475 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2020-10-16 12:08:53,476 INFO  L429      AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 12:08:53,476 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 12:08:53,476 INFO  L82        PathProgramCache]: Analyzing trace with hash -1405228881, now seen corresponding path program 1 times
[2020-10-16 12:08:53,476 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 12:08:53,477 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001114142]
[2020-10-16 12:08:53,477 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 12:08:53,538 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 12:08:53,591 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-16 12:08:53,592 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001114142]
[2020-10-16 12:08:53,592 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 12:08:53,593 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-16 12:08:53,593 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143752995]
[2020-10-16 12:08:53,593 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-16 12:08:53,593 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 12:08:53,594 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-16 12:08:53,594 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2020-10-16 12:08:53,594 INFO  L87              Difference]: Start difference. First operand 187 states and 400 transitions. Second operand 6 states.
[2020-10-16 12:08:53,643 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 12:08:53,643 INFO  L93              Difference]: Finished difference Result 162 states and 349 transitions.
[2020-10-16 12:08:53,644 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-10-16 12:08:53,644 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 19
[2020-10-16 12:08:53,644 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 12:08:53,645 INFO  L225             Difference]: With dead ends: 162
[2020-10-16 12:08:53,645 INFO  L226             Difference]: Without dead ends: 71
[2020-10-16 12:08:53,646 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72
[2020-10-16 12:08:53,646 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 71 states.
[2020-10-16 12:08:53,648 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71.
[2020-10-16 12:08:53,648 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 71 states.
[2020-10-16 12:08:53,648 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 134 transitions.
[2020-10-16 12:08:53,648 INFO  L78                 Accepts]: Start accepts. Automaton has 71 states and 134 transitions. Word has length 19
[2020-10-16 12:08:53,649 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 12:08:53,649 INFO  L481      AbstractCegarLoop]: Abstraction has 71 states and 134 transitions.
[2020-10-16 12:08:53,649 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-16 12:08:53,649 INFO  L276                IsEmpty]: Start isEmpty. Operand 71 states and 134 transitions.
[2020-10-16 12:08:53,650 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 23
[2020-10-16 12:08:53,650 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 12:08:53,650 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-16 12:08:53,650 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2020-10-16 12:08:53,650 INFO  L429      AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 12:08:53,650 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 12:08:53,651 INFO  L82        PathProgramCache]: Analyzing trace with hash -591238188, now seen corresponding path program 1 times
[2020-10-16 12:08:53,651 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 12:08:53,651 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445920902]
[2020-10-16 12:08:53,651 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 12:08:53,717 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 12:08:54,216 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-16 12:08:54,216 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445920902]
[2020-10-16 12:08:54,217 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 12:08:54,217 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2020-10-16 12:08:54,217 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15840464]
[2020-10-16 12:08:54,218 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 10 states
[2020-10-16 12:08:54,218 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 12:08:54,218 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2020-10-16 12:08:54,219 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2020-10-16 12:08:54,219 INFO  L87              Difference]: Start difference. First operand 71 states and 134 transitions. Second operand 10 states.
[2020-10-16 12:08:54,549 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 12:08:54,550 INFO  L93              Difference]: Finished difference Result 108 states and 194 transitions.
[2020-10-16 12:08:54,550 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-10-16 12:08:54,550 INFO  L78                 Accepts]: Start accepts. Automaton has 10 states. Word has length 22
[2020-10-16 12:08:54,551 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 12:08:54,552 INFO  L225             Difference]: With dead ends: 108
[2020-10-16 12:08:54,552 INFO  L226             Difference]: Without dead ends: 67
[2020-10-16 12:08:54,552 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156
[2020-10-16 12:08:54,553 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 67 states.
[2020-10-16 12:08:54,555 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 51.
[2020-10-16 12:08:54,555 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 51 states.
[2020-10-16 12:08:54,555 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 86 transitions.
[2020-10-16 12:08:54,555 INFO  L78                 Accepts]: Start accepts. Automaton has 51 states and 86 transitions. Word has length 22
[2020-10-16 12:08:54,556 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 12:08:54,556 INFO  L481      AbstractCegarLoop]: Abstraction has 51 states and 86 transitions.
[2020-10-16 12:08:54,556 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 10 states.
[2020-10-16 12:08:54,556 INFO  L276                IsEmpty]: Start isEmpty. Operand 51 states and 86 transitions.
[2020-10-16 12:08:54,556 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 23
[2020-10-16 12:08:54,557 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 12:08:54,557 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-16 12:08:54,557 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2020-10-16 12:08:54,557 INFO  L429      AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 12:08:54,557 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 12:08:54,557 INFO  L82        PathProgramCache]: Analyzing trace with hash 217955028, now seen corresponding path program 2 times
[2020-10-16 12:08:54,558 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 12:08:54,558 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091423194]
[2020-10-16 12:08:54,558 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 12:08:54,624 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-16 12:08:54,624 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-16 12:08:54,688 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-16 12:08:54,688 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-16 12:08:54,730 INFO  L173   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2020-10-16 12:08:54,730 INFO  L523         BasicCegarLoop]: Counterexample might be feasible
[2020-10-16 12:08:54,730 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2020-10-16 12:08:54,760 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-16 12:08:54,760 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:08:54,762 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-16 12:08:54,762 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:08:54,762 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-16 12:08:54,763 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:08:54,763 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-16 12:08:54,763 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:08:54,763 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-16 12:08:54,763 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:08:54,763 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-16 12:08:54,764 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:08:54,764 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-16 12:08:54,764 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:08:54,765 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-16 12:08:54,765 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:08:54,765 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-16 12:08:54,765 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:08:54,766 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-16 12:08:54,766 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:08:54,766 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-16 12:08:54,766 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:08:54,766 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-16 12:08:54,767 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:08:54,767 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-16 12:08:54,767 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:08:54,767 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-16 12:08:54,767 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:08:54,768 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-16 12:08:54,768 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:08:54,768 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-16 12:08:54,768 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:08:54,768 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-16 12:08:54,768 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:08:54,769 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-16 12:08:54,769 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:08:54,769 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-16 12:08:54,770 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:08:54,770 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-16 12:08:54,770 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:08:54,770 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-16 12:08:54,770 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:08:54,770 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-16 12:08:54,771 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:08:54,771 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-16 12:08:54,771 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:08:54,771 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-16 12:08:54,772 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:08:54,772 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-16 12:08:54,772 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:08:54,772 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-16 12:08:54,772 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:08:54,772 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-16 12:08:54,772 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:08:54,773 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-16 12:08:54,773 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:08:54,773 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-16 12:08:54,773 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:08:54,773 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-16 12:08:54,773 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:08:54,774 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-16 12:08:54,774 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:08:54,774 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-16 12:08:54,774 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:08:54,775 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-16 12:08:54,775 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:08:54,775 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-16 12:08:54,775 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:08:54,775 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-16 12:08:54,775 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:08:54,776 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-16 12:08:54,776 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:08:54,776 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-16 12:08:54,776 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:08:54,776 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-16 12:08:54,776 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 12:08:54,848 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 12:08:54 BasicIcfg
[2020-10-16 12:08:54,848 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2020-10-16 12:08:54,852 INFO  L168              Benchmark]: Toolchain (without parser) took 10470.00 ms. Allocated memory was 140.0 MB in the beginning and 341.8 MB in the end (delta: 201.9 MB). Free memory was 100.9 MB in the beginning and 195.6 MB in the end (delta: -94.7 MB). Peak memory consumption was 107.2 MB. Max. memory is 7.1 GB.
[2020-10-16 12:08:54,853 INFO  L168              Benchmark]: CDTParser took 0.55 ms. Allocated memory is still 140.0 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB.
[2020-10-16 12:08:54,854 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 736.27 ms. Allocated memory was 140.0 MB in the beginning and 202.4 MB in the end (delta: 62.4 MB). Free memory was 100.7 MB in the beginning and 155.6 MB in the end (delta: -54.9 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB.
[2020-10-16 12:08:54,856 INFO  L168              Benchmark]: Boogie Procedure Inliner took 76.78 ms. Allocated memory is still 202.4 MB. Free memory was 155.6 MB in the beginning and 152.3 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB.
[2020-10-16 12:08:54,857 INFO  L168              Benchmark]: Boogie Preprocessor took 44.47 ms. Allocated memory is still 202.4 MB. Free memory was 152.3 MB in the beginning and 150.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB.
[2020-10-16 12:08:54,860 INFO  L168              Benchmark]: RCFGBuilder took 2310.62 ms. Allocated memory was 202.4 MB in the beginning and 247.5 MB in the end (delta: 45.1 MB). Free memory was 149.7 MB in the beginning and 165.4 MB in the end (delta: -15.7 MB). Peak memory consumption was 103.8 MB. Max. memory is 7.1 GB.
[2020-10-16 12:08:54,861 INFO  L168              Benchmark]: TraceAbstraction took 7294.50 ms. Allocated memory was 247.5 MB in the beginning and 341.8 MB in the end (delta: 94.4 MB). Free memory was 165.4 MB in the beginning and 195.6 MB in the end (delta: -30.2 MB). Peak memory consumption was 64.2 MB. Max. memory is 7.1 GB.
[2020-10-16 12:08:54,869 INFO  L336   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.55 ms. Allocated memory is still 140.0 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB.
 * CACSL2BoogieTranslator took 736.27 ms. Allocated memory was 140.0 MB in the beginning and 202.4 MB in the end (delta: 62.4 MB). Free memory was 100.7 MB in the beginning and 155.6 MB in the end (delta: -54.9 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB.
 * Boogie Procedure Inliner took 76.78 ms. Allocated memory is still 202.4 MB. Free memory was 155.6 MB in the beginning and 152.3 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB.
 * Boogie Preprocessor took 44.47 ms. Allocated memory is still 202.4 MB. Free memory was 152.3 MB in the beginning and 150.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB.
 * RCFGBuilder took 2310.62 ms. Allocated memory was 202.4 MB in the beginning and 247.5 MB in the end (delta: 45.1 MB). Free memory was 149.7 MB in the beginning and 165.4 MB in the end (delta: -15.7 MB). Peak memory consumption was 103.8 MB. Max. memory is 7.1 GB.
 * TraceAbstraction took 7294.50 ms. Allocated memory was 247.5 MB in the beginning and 341.8 MB in the end (delta: 94.4 MB). Free memory was 165.4 MB in the beginning and 195.6 MB in the end (delta: -30.2 MB). Peak memory consumption was 64.2 MB. Max. memory is 7.1 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    813 VarBasedMoverChecksPositive, 24 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 91 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 2.2s, 100 PlacesBefore, 38 PlacesAfterwards, 92 TransitionsBefore, 29 TransitionsAfterwards, 1642 CoEnabledTransitionPairs, 6 FixpointIterations, 31 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 1 ChoiceCompositions, 74 TotalNumberOfCompositions, 4589 MoverChecksTotal
  - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable
    a call of __VERIFIER_error() is reachable
We found a FailurePath: 
[L698]               0  int __unbuffered_cnt = 0;
[L700]               0  int __unbuffered_p2_EAX = 0;
[L701]               0  _Bool main$tmp_guard0;
[L702]               0  _Bool main$tmp_guard1;
[L704]               0  int x = 0;
[L705]               0  _Bool x$flush_delayed;
[L706]               0  int x$mem_tmp;
[L707]               0  _Bool x$r_buff0_thd0;
[L708]               0  _Bool x$r_buff0_thd1;
[L709]               0  _Bool x$r_buff0_thd2;
[L710]               0  _Bool x$r_buff0_thd3;
[L711]               0  _Bool x$r_buff1_thd0;
[L712]               0  _Bool x$r_buff1_thd1;
[L713]               0  _Bool x$r_buff1_thd2;
[L714]               0  _Bool x$r_buff1_thd3;
[L715]               0  _Bool x$read_delayed;
[L716]               0  int *x$read_delayed_var;
[L717]               0  int x$w_buff0;
[L718]               0  _Bool x$w_buff0_used;
[L719]               0  int x$w_buff1;
[L720]               0  _Bool x$w_buff1_used;
[L722]               0  int y = 0;
[L724]               0  int z = 0;
[L725]               0  _Bool weak$$choice0;
[L726]               0  _Bool weak$$choice2;
[L807]               0  pthread_t t2034;
[L808]  FCALL, FORK  0  pthread_create(&t2034, ((void *)0), P0, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=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]
[L809]               0  pthread_t t2035;
[L810]  FCALL, FORK  0  pthread_create(&t2035, ((void *)0), P1, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=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]
[L750]               2  x$w_buff1 = x$w_buff0
[L751]               2  x$w_buff0 = 2
[L752]               2  x$w_buff1_used = x$w_buff0_used
[L753]               2  x$w_buff0_used = (_Bool)1
[L7]    COND TRUE    2  !expression
[L7]                 2  __VERIFIER_error()
[L755]               2  x$r_buff1_thd0 = x$r_buff0_thd0
[L756]               2  x$r_buff1_thd1 = x$r_buff0_thd1
[L757]               2  x$r_buff1_thd2 = x$r_buff0_thd2
[L758]               2  x$r_buff1_thd3 = x$r_buff0_thd3
[L759]               2  x$r_buff0_thd2 = (_Bool)1
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L762]               2  y = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0]
[L811]               0  pthread_t t2036;
[L812]  FCALL, FORK  0  pthread_create(&t2036, ((void *)0), P2, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0]
[L779]               3  __unbuffered_p2_EAX = y
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0]
[L782]               3  z = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1]
[L730]               1  z = 2
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2]
[L733]               1  x = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2]
[L765]  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)
[L765]  EXPR         2  x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x
[L765]  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)
[L765]               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)
[L766]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used
[L766]               2  x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used
[L767]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used
[L767]               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
[L768]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2
[L768]               2  x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2
[L769]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2
[L769]               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
[L772]               2  __unbuffered_cnt = __unbuffered_cnt + 1
[L774]               2  return 0;
[L785]  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)
[L785]               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)
[L786]  EXPR         3  x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used
[L786]               3  x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used
[L787]  EXPR         3  x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used
[L787]               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
[L788]  EXPR         3  x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3
[L788]               3  x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3
[L789]  EXPR         3  x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3
[L789]               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
[L792]               3  __unbuffered_cnt = __unbuffered_cnt + 1
[L794]               3  return 0;
[L736]  EXPR         1  x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x)
[L736]               1  x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x)
[L737]  EXPR         1  x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used
[L737]               1  x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used
[L738]  EXPR         1  x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used
[L738]               1  x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used
[L739]  EXPR         1  x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1
[L739]               1  x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1
[L740]  EXPR         1  x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1
[L740]               1  x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1
[L743]               1  __unbuffered_cnt = __unbuffered_cnt + 1
[L745]               1  return 0;
[L814]               0  main$tmp_guard0 = __unbuffered_cnt == 3
        VAL             [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2]
[L3]    COND FALSE   0  !(!cond)
[L818]  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)
[L818]  EXPR         0  x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x
[L818]  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)
[L818]               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)
[L819]  EXPR         0  x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used
[L819]               0  x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used
[L820]  EXPR         0  x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used
[L820]               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
[L821]  EXPR         0  x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0
[L821]               0  x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0
[L822]  EXPR         0  x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0
[L822]               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
[L825]               0  weak$$choice0 = __VERIFIER_nondet_bool()
[L826]               0  weak$$choice2 = __VERIFIER_nondet_bool()
[L827]               0  x$flush_delayed = weak$$choice2
[L828]               0  x$mem_tmp = x
[L829]  EXPR         0  !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1)
[L829]  EXPR         0  x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1
[L829]  EXPR         0  !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1)
[L829]               0  x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1)
[L830]  EXPR         0  weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0))
[L830]  EXPR         0  !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)
[L830]  EXPR         0  weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0))
[L830]               0  x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0))
[L831]  EXPR         0  weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1))
[L831]  EXPR         0  !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)
[L831]  EXPR         0  x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1
[L831]  EXPR         0  !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)
[L831]  EXPR         0  weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1))
[L831]               0  x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1))
[L832]  EXPR         0  weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used))
[L832]  EXPR         0  !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)
[L832]  EXPR         0  x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used
[L832]  EXPR         0  !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)
[L832]  EXPR         0  weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used))
[L832]               0  x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used))
[L833]  EXPR         0  weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L833]               0  x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L834]  EXPR         0  weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0))
[L834]               0  x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0))
[L835]  EXPR         0  weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L835]  EXPR         0  !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)
[L835]  EXPR         0  weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L835]               0  x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L836]               0  main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1)
[L837]  EXPR         0  x$flush_delayed ? x$mem_tmp : x
[L837]               0  x = x$flush_delayed ? x$mem_tmp : x
[L838]               0  x$flush_delayed = (_Bool)0
        VAL             [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2]
[L7]    COND TRUE    0  !expression
[L7]                 0  __VERIFIER_error()
        VAL             [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2]

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 4 procedures, 91 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 7.0s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.3s, HoareTripleCheckerStatistics: 339 SDtfs, 531 SDslu, 684 SDs, 0 SdLazy, 337 SolverSat, 120 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1122occurred 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.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 115 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 207 NumberOfCodeBlocks, 207 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 172 ConstructedInterpolants, 0 QuantifiedInterpolants, 22580 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...