./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/safe010_power.oepc.i --full-output --architecture 32bit


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


Checking for ERROR reachability
Using default analysis
Version 20ed64ec
Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/safe010_power.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) )

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 694d01efff9811934ae2b04ec37f037c09606df5
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
Execution finished normally
Writing output log to file Ultimate.log
Writing human readable error path to file UltimateCounterExample.errorpath
Result:
FALSE
--- Real Ultimate output ---
This is Ultimate 0.2.1-dev-20ed64e
[2021-08-26 14:37:51,225 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2021-08-26 14:37:51,227 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2021-08-26 14:37:51,254 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2021-08-26 14:37:51,254 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2021-08-26 14:37:51,255 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2021-08-26 14:37:51,256 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2021-08-26 14:37:51,257 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2021-08-26 14:37:51,259 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2021-08-26 14:37:51,259 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2021-08-26 14:37:51,260 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2021-08-26 14:37:51,261 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2021-08-26 14:37:51,261 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2021-08-26 14:37:51,262 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2021-08-26 14:37:51,263 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2021-08-26 14:37:51,263 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2021-08-26 14:37:51,264 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2021-08-26 14:37:51,265 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2021-08-26 14:37:51,266 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2021-08-26 14:37:51,267 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2021-08-26 14:37:51,268 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2021-08-26 14:37:51,269 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2021-08-26 14:37:51,270 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2021-08-26 14:37:51,270 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2021-08-26 14:37:51,272 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2021-08-26 14:37:51,272 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2021-08-26 14:37:51,276 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2021-08-26 14:37:51,277 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2021-08-26 14:37:51,277 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2021-08-26 14:37:51,278 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2021-08-26 14:37:51,278 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2021-08-26 14:37:51,279 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2021-08-26 14:37:51,280 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2021-08-26 14:37:51,281 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2021-08-26 14:37:51,282 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2021-08-26 14:37:51,282 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2021-08-26 14:37:51,283 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2021-08-26 14:37:51,284 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2021-08-26 14:37:51,284 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2021-08-26 14:37:51,284 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2021-08-26 14:37:51,285 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2021-08-26 14:37:51,285 INFO  L101        SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2021-08-26 14:37:51,315 INFO  L113        SettingsManager]: Loading preferences was successful
[2021-08-26 14:37:51,315 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2021-08-26 14:37:51,316 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2021-08-26 14:37:51,316 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2021-08-26 14:37:51,317 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2021-08-26 14:37:51,318 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2021-08-26 14:37:51,318 INFO  L138        SettingsManager]:  * Use SBE=true
[2021-08-26 14:37:51,318 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2021-08-26 14:37:51,318 INFO  L138        SettingsManager]:  * sizeof long=4
[2021-08-26 14:37:51,318 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2021-08-26 14:37:51,319 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2021-08-26 14:37:51,319 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2021-08-26 14:37:51,319 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2021-08-26 14:37:51,319 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2021-08-26 14:37:51,319 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2021-08-26 14:37:51,326 INFO  L138        SettingsManager]:  * sizeof long double=12
[2021-08-26 14:37:51,326 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2021-08-26 14:37:51,326 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2021-08-26 14:37:51,326 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2021-08-26 14:37:51,326 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2021-08-26 14:37:51,326 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2021-08-26 14:37:51,326 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2021-08-26 14:37:51,327 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2021-08-26 14:37:51,327 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2021-08-26 14:37:51,327 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2021-08-26 14:37:51,327 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2021-08-26 14:37:51,327 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2021-08-26 14:37:51,327 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2021-08-26 14:37:51,327 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2021-08-26 14:37:51,328 INFO  L138        SettingsManager]:  * Trace refinement exception blacklist=NONE
[2021-08-26 14:37:51,328 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) )


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 694d01efff9811934ae2b04ec37f037c09606df5
[2021-08-26 14:37:51,574 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2021-08-26 14:37:51,587 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2021-08-26 14:37:51,588 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2021-08-26 14:37:51,589 INFO  L271        PluginConnector]: Initializing CDTParser...
[2021-08-26 14:37:51,590 INFO  L275        PluginConnector]: CDTParser initialized
[2021-08-26 14:37:51,590 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe010_power.oepc.i
[2021-08-26 14:37:51,642 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3047b7f03/a6347420bd99403fa8f3a2bbf07e182d/FLAGf529a8c3c
[2021-08-26 14:37:52,087 INFO  L306              CDTParser]: Found 1 translation units.
[2021-08-26 14:37:52,088 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe010_power.oepc.i
[2021-08-26 14:37:52,100 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3047b7f03/a6347420bd99403fa8f3a2bbf07e182d/FLAGf529a8c3c
[2021-08-26 14:37:52,109 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3047b7f03/a6347420bd99403fa8f3a2bbf07e182d
[2021-08-26 14:37:52,113 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2021-08-26 14:37:52,114 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2021-08-26 14:37:52,116 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2021-08-26 14:37:52,116 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2021-08-26 14:37:52,119 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2021-08-26 14:37:52,119 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 02:37:52" (1/1) ...
[2021-08-26 14:37:52,120 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10a8bfc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:37:52, skipping insertion in model container
[2021-08-26 14:37:52,120 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 02:37:52" (1/1) ...
[2021-08-26 14:37:52,124 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2021-08-26 14:37:52,166 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2021-08-26 14:37:52,329 WARN  L228   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe010_power.oepc.i[952,965]
[2021-08-26 14:37:52,493 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2021-08-26 14:37:52,502 INFO  L203         MainTranslator]: Completed pre-run
[2021-08-26 14:37:52,512 WARN  L228   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe010_power.oepc.i[952,965]
[2021-08-26 14:37:52,550 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2021-08-26 14:37:52,582 INFO  L208         MainTranslator]: Completed translation
[2021-08-26 14:37:52,583 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:37:52 WrapperNode
[2021-08-26 14:37:52,584 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2021-08-26 14:37:52,585 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2021-08-26 14:37:52,585 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2021-08-26 14:37:52,585 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2021-08-26 14:37:52,590 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:37:52" (1/1) ...
[2021-08-26 14:37:52,616 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:37:52" (1/1) ...
[2021-08-26 14:37:52,652 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2021-08-26 14:37:52,653 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2021-08-26 14:37:52,653 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2021-08-26 14:37:52,653 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2021-08-26 14:37:52,660 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:37:52" (1/1) ...
[2021-08-26 14:37:52,660 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:37:52" (1/1) ...
[2021-08-26 14:37:52,675 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:37:52" (1/1) ...
[2021-08-26 14:37:52,676 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:37:52" (1/1) ...
[2021-08-26 14:37:52,681 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:37:52" (1/1) ...
[2021-08-26 14:37:52,683 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:37:52" (1/1) ...
[2021-08-26 14:37:52,690 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:37:52" (1/1) ...
[2021-08-26 14:37:52,693 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2021-08-26 14:37:52,694 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2021-08-26 14:37:52,694 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2021-08-26 14:37:52,694 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2021-08-26 14:37:52,694 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:37:52" (1/1) ...
[2021-08-26 14:37:52,700 INFO  L170          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2021-08-26 14:37:52,706 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2021-08-26 14:37:52,717 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2021-08-26 14:37:52,719 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2021-08-26 14:37:52,743 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2021-08-26 14:37:52,744 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2021-08-26 14:37:52,744 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2021-08-26 14:37:52,744 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2021-08-26 14:37:52,744 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2021-08-26 14:37:52,744 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2021-08-26 14:37:52,744 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2021-08-26 14:37:52,745 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2021-08-26 14:37:52,745 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2021-08-26 14:37:52,745 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2021-08-26 14:37:52,745 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2021-08-26 14:37:52,745 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2021-08-26 14:37:52,746 WARN  L209             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2021-08-26 14:37:53,982 INFO  L294             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2021-08-26 14:37:53,982 INFO  L299             CfgBuilder]: Removed 10 assume(true) statements.
[2021-08-26 14:37:53,984 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 02:37:53 BoogieIcfgContainer
[2021-08-26 14:37:53,984 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2021-08-26 14:37:53,985 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2021-08-26 14:37:53,985 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2021-08-26 14:37:53,987 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2021-08-26 14:37:53,987 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 02:37:52" (1/3) ...
[2021-08-26 14:37:53,988 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@636d27e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 02:37:53, skipping insertion in model container
[2021-08-26 14:37:53,988 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:37:52" (2/3) ...
[2021-08-26 14:37:53,988 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@636d27e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 02:37:53, skipping insertion in model container
[2021-08-26 14:37:53,988 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 02:37:53" (3/3) ...
[2021-08-26 14:37:53,989 INFO  L111   eAbstractionObserver]: Analyzing ICFG safe010_power.oepc.i
[2021-08-26 14:37:53,992 WARN  L149   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2021-08-26 14:37:53,992 INFO  L204   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2021-08-26 14:37:53,992 INFO  L163   ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations.
[2021-08-26 14:37:53,992 INFO  L516   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2021-08-26 14:37:54,012 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-26 14:37:54,012 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-26 14:37:54,012 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-26 14:37:54,013 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-26 14:37:54,013 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-26 14:37:54,013 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-26 14:37:54,013 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-26 14:37:54,013 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-26 14:37:54,013 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-26 14:37:54,013 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-26 14:37:54,014 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-26 14:37:54,014 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-26 14:37:54,014 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-26 14:37:54,014 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-26 14:37:54,014 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-26 14:37:54,014 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-26 14:37:54,015 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-26 14:37:54,015 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-26 14:37:54,015 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-26 14:37:54,015 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-26 14:37:54,015 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-26 14:37:54,015 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-26 14:37:54,015 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-26 14:37:54,016 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-26 14:37:54,016 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-26 14:37:54,016 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-26 14:37:54,016 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-26 14:37:54,016 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-26 14:37:54,016 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-26 14:37:54,016 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-26 14:37:54,017 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-26 14:37:54,017 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-26 14:37:54,017 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-26 14:37:54,017 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-26 14:37:54,018 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-26 14:37:54,018 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-26 14:37:54,018 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-26 14:37:54,018 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-26 14:37:54,018 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-26 14:37:54,018 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-26 14:37:54,018 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-26 14:37:54,018 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-26 14:37:54,019 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-26 14:37:54,019 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-26 14:37:54,019 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-26 14:37:54,019 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-26 14:37:54,019 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-26 14:37:54,019 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-26 14:37:54,019 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-26 14:37:54,020 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-26 14:37:54,020 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-26 14:37:54,020 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-26 14:37:54,020 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-26 14:37:54,020 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-26 14:37:54,020 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-26 14:37:54,020 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-26 14:37:54,021 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-26 14:37:54,021 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-26 14:37:54,021 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-26 14:37:54,021 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-26 14:37:54,023 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-26 14:37:54,023 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-26 14:37:54,024 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-26 14:37:54,024 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-26 14:37:54,024 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-26 14:37:54,024 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-26 14:37:54,024 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-26 14:37:54,024 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-26 14:37:54,024 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-26 14:37:54,024 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-26 14:37:54,026 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-26 14:37:54,026 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-26 14:37:54,026 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-26 14:37:54,026 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-26 14:37:54,027 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-26 14:37:54,027 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-26 14:37:54,027 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-26 14:37:54,027 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-26 14:37:54,027 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-26 14:37:54,027 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-26 14:37:54,027 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-26 14:37:54,028 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-26 14:37:54,029 INFO  L148    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2021-08-26 14:37:54,054 INFO  L338      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2021-08-26 14:37:54,058 INFO  L339      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR
[2021-08-26 14:37:54,058 INFO  L340      AbstractCegarLoop]: Starting to check reachability of 5 error locations.
[2021-08-26 14:37:54,066 INFO  L118   etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2021-08-26 14:37:54,071 INFO  L133   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 91 places, 86 transitions, 182 flow
[2021-08-26 14:37:54,073 INFO  L110        LiptonReduction]: Starting Lipton reduction on Petri net that has 91 places, 86 transitions, 182 flow
[2021-08-26 14:37:54,074 INFO  L74            FinitePrefix]: Start finitePrefix. Operand has 91 places, 86 transitions, 182 flow
[2021-08-26 14:37:54,094 INFO  L129       PetriNetUnfolder]: 2/84 cut-off events.
[2021-08-26 14:37:54,095 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2021-08-26 14:37:54,097 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 91 conditions, 84 events. 2/84 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 46 event pairs, 0 based on Foata normal form. 0/80 useless extension candidates. Maximal degree in co-relation 50. Up to 2 conditions per place. 
[2021-08-26 14:37:54,098 INFO  L116        LiptonReduction]: Number of co-enabled transitions 1004
[2021-08-26 14:38:09,411 INFO  L131        LiptonReduction]: Checked pairs total: 2567
[2021-08-26 14:38:09,411 INFO  L133        LiptonReduction]: Total number of compositions: 79
[2021-08-26 14:38:09,416 INFO  L111   iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 26 places, 19 transitions, 48 flow
[2021-08-26 14:38:09,427 INFO  L133   iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result  has 144 states, 141 states have (on average 2.3617021276595747) internal successors, (333), 143 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-08-26 14:38:09,429 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 144 states, 141 states have (on average 2.3617021276595747) internal successors, (333), 143 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-08-26 14:38:09,432 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 4
[2021-08-26 14:38:09,432 INFO  L504         BasicCegarLoop]: Found error trace
[2021-08-26 14:38:09,433 INFO  L512         BasicCegarLoop]: trace histogram [1, 1, 1]
[2021-08-26 14:38:09,433 INFO  L402      AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] ===
[2021-08-26 14:38:09,436 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-08-26 14:38:09,436 INFO  L82        PathProgramCache]: Analyzing trace with hash 933929, now seen corresponding path program 1 times
[2021-08-26 14:38:09,441 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-08-26 14:38:09,442 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114823081]
[2021-08-26 14:38:09,442 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-08-26 14:38:09,442 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-08-26 14:38:09,539 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-08-26 14:38:09,616 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-08-26 14:38:09,616 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-08-26 14:38:09,617 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114823081]
[2021-08-26 14:38:09,617 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114823081] provided 1 perfect and 0 imperfect interpolant sequences
[2021-08-26 14:38:09,617 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-08-26 14:38:09,618 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2021-08-26 14:38:09,619 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332894345]
[2021-08-26 14:38:09,623 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-08-26 14:38:09,623 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-08-26 14:38:09,633 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-08-26 14:38:09,634 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-08-26 14:38:09,637 INFO  L87              Difference]: Start difference. First operand  has 144 states, 141 states have (on average 2.3617021276595747) internal successors, (333), 143 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand  has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-08-26 14:38:09,681 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-08-26 14:38:09,681 INFO  L93              Difference]: Finished difference Result 117 states and 264 transitions.
[2021-08-26 14:38:09,682 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-08-26 14:38:09,683 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3
[2021-08-26 14:38:09,683 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-08-26 14:38:09,690 INFO  L225             Difference]: With dead ends: 117
[2021-08-26 14:38:09,691 INFO  L226             Difference]: Without dead ends: 112
[2021-08-26 14:38:09,691 INFO  L781         BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-08-26 14:38:09,702 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 112 states.
[2021-08-26 14:38:09,719 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112.
[2021-08-26 14:38:09,721 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 112 states, 111 states have (on average 2.2972972972972974) internal successors, (255), 111 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-08-26 14:38:09,722 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 255 transitions.
[2021-08-26 14:38:09,723 INFO  L78                 Accepts]: Start accepts. Automaton has 112 states and 255 transitions. Word has length 3
[2021-08-26 14:38:09,723 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-08-26 14:38:09,724 INFO  L470      AbstractCegarLoop]: Abstraction has 112 states and 255 transitions.
[2021-08-26 14:38:09,724 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-08-26 14:38:09,724 INFO  L276                IsEmpty]: Start isEmpty. Operand 112 states and 255 transitions.
[2021-08-26 14:38:09,724 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 8
[2021-08-26 14:38:09,725 INFO  L504         BasicCegarLoop]: Found error trace
[2021-08-26 14:38:09,725 INFO  L512         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2021-08-26 14:38:09,725 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2021-08-26 14:38:09,725 INFO  L402      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] ===
[2021-08-26 14:38:09,726 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-08-26 14:38:09,726 INFO  L82        PathProgramCache]: Analyzing trace with hash -717208214, now seen corresponding path program 1 times
[2021-08-26 14:38:09,726 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-08-26 14:38:09,727 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107998308]
[2021-08-26 14:38:09,727 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-08-26 14:38:09,727 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-08-26 14:38:09,785 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-08-26 14:38:09,842 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-08-26 14:38:09,842 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-08-26 14:38:09,843 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107998308]
[2021-08-26 14:38:09,843 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107998308] provided 1 perfect and 0 imperfect interpolant sequences
[2021-08-26 14:38:09,843 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-08-26 14:38:09,843 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2021-08-26 14:38:09,843 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043361642]
[2021-08-26 14:38:09,844 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-08-26 14:38:09,844 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-08-26 14:38:09,845 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-08-26 14:38:09,846 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-08-26 14:38:09,846 INFO  L87              Difference]: Start difference. First operand 112 states and 255 transitions. Second operand  has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-08-26 14:38:09,853 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-08-26 14:38:09,856 INFO  L93              Difference]: Finished difference Result 107 states and 241 transitions.
[2021-08-26 14:38:09,856 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-08-26 14:38:09,856 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7
[2021-08-26 14:38:09,857 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-08-26 14:38:09,857 INFO  L225             Difference]: With dead ends: 107
[2021-08-26 14:38:09,858 INFO  L226             Difference]: Without dead ends: 107
[2021-08-26 14:38:09,858 INFO  L781         BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-08-26 14:38:09,859 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 107 states.
[2021-08-26 14:38:09,863 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107.
[2021-08-26 14:38:09,865 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 107 states, 106 states have (on average 2.2735849056603774) internal successors, (241), 106 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-08-26 14:38:09,867 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 241 transitions.
[2021-08-26 14:38:09,867 INFO  L78                 Accepts]: Start accepts. Automaton has 107 states and 241 transitions. Word has length 7
[2021-08-26 14:38:09,868 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-08-26 14:38:09,868 INFO  L470      AbstractCegarLoop]: Abstraction has 107 states and 241 transitions.
[2021-08-26 14:38:09,868 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-08-26 14:38:09,868 INFO  L276                IsEmpty]: Start isEmpty. Operand 107 states and 241 transitions.
[2021-08-26 14:38:09,868 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 9
[2021-08-26 14:38:09,869 INFO  L504         BasicCegarLoop]: Found error trace
[2021-08-26 14:38:09,869 INFO  L512         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2021-08-26 14:38:09,869 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2021-08-26 14:38:09,885 INFO  L402      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] ===
[2021-08-26 14:38:09,885 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-08-26 14:38:09,885 INFO  L82        PathProgramCache]: Analyzing trace with hash -758649027, now seen corresponding path program 1 times
[2021-08-26 14:38:09,885 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-08-26 14:38:09,885 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597000141]
[2021-08-26 14:38:09,885 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-08-26 14:38:09,885 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-08-26 14:38:09,915 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-08-26 14:38:09,958 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-08-26 14:38:09,958 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-08-26 14:38:09,958 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597000141]
[2021-08-26 14:38:09,958 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597000141] provided 1 perfect and 0 imperfect interpolant sequences
[2021-08-26 14:38:09,959 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-08-26 14:38:09,959 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2021-08-26 14:38:09,959 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184793612]
[2021-08-26 14:38:09,959 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2021-08-26 14:38:09,959 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-08-26 14:38:09,960 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2021-08-26 14:38:09,962 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2021-08-26 14:38:09,963 INFO  L87              Difference]: Start difference. First operand 107 states and 241 transitions. Second operand  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-08-26 14:38:09,985 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-08-26 14:38:09,986 INFO  L93              Difference]: Finished difference Result 135 states and 294 transitions.
[2021-08-26 14:38:09,986 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2021-08-26 14:38:09,986 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8
[2021-08-26 14:38:09,986 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-08-26 14:38:09,987 INFO  L225             Difference]: With dead ends: 135
[2021-08-26 14:38:09,987 INFO  L226             Difference]: Without dead ends: 75
[2021-08-26 14:38:09,987 INFO  L781         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2021-08-26 14:38:09,987 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 75 states.
[2021-08-26 14:38:09,990 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75.
[2021-08-26 14:38:09,990 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 75 states, 74 states have (on average 2.0945945945945947) internal successors, (155), 74 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-08-26 14:38:09,990 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 155 transitions.
[2021-08-26 14:38:09,990 INFO  L78                 Accepts]: Start accepts. Automaton has 75 states and 155 transitions. Word has length 8
[2021-08-26 14:38:09,990 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-08-26 14:38:09,990 INFO  L470      AbstractCegarLoop]: Abstraction has 75 states and 155 transitions.
[2021-08-26 14:38:09,991 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-08-26 14:38:09,991 INFO  L276                IsEmpty]: Start isEmpty. Operand 75 states and 155 transitions.
[2021-08-26 14:38:09,991 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 11
[2021-08-26 14:38:09,991 INFO  L504         BasicCegarLoop]: Found error trace
[2021-08-26 14:38:09,991 INFO  L512         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-08-26 14:38:09,991 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2021-08-26 14:38:09,992 INFO  L402      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] ===
[2021-08-26 14:38:09,992 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-08-26 14:38:09,992 INFO  L82        PathProgramCache]: Analyzing trace with hash 1111988694, now seen corresponding path program 1 times
[2021-08-26 14:38:09,992 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-08-26 14:38:09,992 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644919355]
[2021-08-26 14:38:09,992 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-08-26 14:38:09,993 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-08-26 14:38:10,017 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-08-26 14:38:10,149 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-08-26 14:38:10,150 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-08-26 14:38:10,150 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644919355]
[2021-08-26 14:38:10,150 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644919355] provided 1 perfect and 0 imperfect interpolant sequences
[2021-08-26 14:38:10,150 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-08-26 14:38:10,150 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-08-26 14:38:10,150 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066540795]
[2021-08-26 14:38:10,151 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2021-08-26 14:38:10,151 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-08-26 14:38:10,151 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2021-08-26 14:38:10,151 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2021-08-26 14:38:10,151 INFO  L87              Difference]: Start difference. First operand 75 states and 155 transitions. Second operand  has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-08-26 14:38:10,180 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-08-26 14:38:10,181 INFO  L93              Difference]: Finished difference Result 74 states and 152 transitions.
[2021-08-26 14:38:10,181 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2021-08-26 14:38:10,181 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10
[2021-08-26 14:38:10,181 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-08-26 14:38:10,182 INFO  L225             Difference]: With dead ends: 74
[2021-08-26 14:38:10,182 INFO  L226             Difference]: Without dead ends: 74
[2021-08-26 14:38:10,182 INFO  L781         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 22.9ms TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2021-08-26 14:38:10,182 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 74 states.
[2021-08-26 14:38:10,189 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74.
[2021-08-26 14:38:10,189 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 74 states, 73 states have (on average 2.0821917808219177) internal successors, (152), 73 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-08-26 14:38:10,189 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 152 transitions.
[2021-08-26 14:38:10,190 INFO  L78                 Accepts]: Start accepts. Automaton has 74 states and 152 transitions. Word has length 10
[2021-08-26 14:38:10,190 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-08-26 14:38:10,190 INFO  L470      AbstractCegarLoop]: Abstraction has 74 states and 152 transitions.
[2021-08-26 14:38:10,190 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-08-26 14:38:10,190 INFO  L276                IsEmpty]: Start isEmpty. Operand 74 states and 152 transitions.
[2021-08-26 14:38:10,191 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2021-08-26 14:38:10,191 INFO  L504         BasicCegarLoop]: Found error trace
[2021-08-26 14:38:10,191 INFO  L512         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-08-26 14:38:10,191 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2021-08-26 14:38:10,192 INFO  L402      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] ===
[2021-08-26 14:38:10,192 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-08-26 14:38:10,192 INFO  L82        PathProgramCache]: Analyzing trace with hash 111909537, now seen corresponding path program 1 times
[2021-08-26 14:38:10,192 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-08-26 14:38:10,193 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13708369]
[2021-08-26 14:38:10,193 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-08-26 14:38:10,193 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-08-26 14:38:10,249 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-08-26 14:38:10,269 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-08-26 14:38:10,269 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-08-26 14:38:10,269 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13708369]
[2021-08-26 14:38:10,270 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13708369] provided 1 perfect and 0 imperfect interpolant sequences
[2021-08-26 14:38:10,270 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-08-26 14:38:10,270 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-08-26 14:38:10,270 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710686354]
[2021-08-26 14:38:10,270 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2021-08-26 14:38:10,270 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-08-26 14:38:10,271 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2021-08-26 14:38:10,271 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2021-08-26 14:38:10,271 INFO  L87              Difference]: Start difference. First operand 74 states and 152 transitions. Second operand  has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-08-26 14:38:10,285 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-08-26 14:38:10,285 INFO  L93              Difference]: Finished difference Result 66 states and 115 transitions.
[2021-08-26 14:38:10,286 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2021-08-26 14:38:10,286 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11
[2021-08-26 14:38:10,286 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-08-26 14:38:10,286 INFO  L225             Difference]: With dead ends: 66
[2021-08-26 14:38:10,286 INFO  L226             Difference]: Without dead ends: 49
[2021-08-26 14:38:10,287 INFO  L781         BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2021-08-26 14:38:10,287 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 49 states.
[2021-08-26 14:38:10,288 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49.
[2021-08-26 14:38:10,288 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 49 states, 48 states have (on average 1.6875) internal successors, (81), 48 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-08-26 14:38:10,288 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 81 transitions.
[2021-08-26 14:38:10,288 INFO  L78                 Accepts]: Start accepts. Automaton has 49 states and 81 transitions. Word has length 11
[2021-08-26 14:38:10,289 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-08-26 14:38:10,289 INFO  L470      AbstractCegarLoop]: Abstraction has 49 states and 81 transitions.
[2021-08-26 14:38:10,289 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-08-26 14:38:10,289 INFO  L276                IsEmpty]: Start isEmpty. Operand 49 states and 81 transitions.
[2021-08-26 14:38:10,289 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2021-08-26 14:38:10,289 INFO  L504         BasicCegarLoop]: Found error trace
[2021-08-26 14:38:10,289 INFO  L512         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-08-26 14:38:10,290 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2021-08-26 14:38:10,290 INFO  L402      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] ===
[2021-08-26 14:38:10,290 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-08-26 14:38:10,290 INFO  L82        PathProgramCache]: Analyzing trace with hash -877993921, now seen corresponding path program 1 times
[2021-08-26 14:38:10,290 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-08-26 14:38:10,290 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122471100]
[2021-08-26 14:38:10,290 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-08-26 14:38:10,291 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-08-26 14:38:10,329 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-08-26 14:38:10,367 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-08-26 14:38:10,367 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-08-26 14:38:10,370 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122471100]
[2021-08-26 14:38:10,370 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122471100] provided 1 perfect and 0 imperfect interpolant sequences
[2021-08-26 14:38:10,371 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-08-26 14:38:10,371 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2021-08-26 14:38:10,371 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789399812]
[2021-08-26 14:38:10,371 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2021-08-26 14:38:10,371 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-08-26 14:38:10,372 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2021-08-26 14:38:10,372 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2021-08-26 14:38:10,372 INFO  L87              Difference]: Start difference. First operand 49 states and 81 transitions. Second operand  has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-08-26 14:38:10,393 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-08-26 14:38:10,393 INFO  L93              Difference]: Finished difference Result 39 states and 59 transitions.
[2021-08-26 14:38:10,393 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2021-08-26 14:38:10,394 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12
[2021-08-26 14:38:10,394 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-08-26 14:38:10,394 INFO  L225             Difference]: With dead ends: 39
[2021-08-26 14:38:10,394 INFO  L226             Difference]: Without dead ends: 32
[2021-08-26 14:38:10,394 INFO  L781         BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 11.8ms TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2021-08-26 14:38:10,394 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 32 states.
[2021-08-26 14:38:10,395 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32.
[2021-08-26 14:38:10,395 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 32 states, 31 states have (on average 1.5161290322580645) internal successors, (47), 31 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-08-26 14:38:10,396 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 47 transitions.
[2021-08-26 14:38:10,396 INFO  L78                 Accepts]: Start accepts. Automaton has 32 states and 47 transitions. Word has length 12
[2021-08-26 14:38:10,396 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-08-26 14:38:10,396 INFO  L470      AbstractCegarLoop]: Abstraction has 32 states and 47 transitions.
[2021-08-26 14:38:10,396 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-08-26 14:38:10,396 INFO  L276                IsEmpty]: Start isEmpty. Operand 32 states and 47 transitions.
[2021-08-26 14:38:10,397 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2021-08-26 14:38:10,397 INFO  L504         BasicCegarLoop]: Found error trace
[2021-08-26 14:38:10,397 INFO  L512         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-08-26 14:38:10,399 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2021-08-26 14:38:10,399 INFO  L402      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] ===
[2021-08-26 14:38:10,399 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-08-26 14:38:10,399 INFO  L82        PathProgramCache]: Analyzing trace with hash -1607062850, now seen corresponding path program 1 times
[2021-08-26 14:38:10,400 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-08-26 14:38:10,400 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097186471]
[2021-08-26 14:38:10,400 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-08-26 14:38:10,401 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-08-26 14:38:10,443 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-08-26 14:38:10,771 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-08-26 14:38:10,771 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-08-26 14:38:10,771 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097186471]
[2021-08-26 14:38:10,771 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097186471] provided 1 perfect and 0 imperfect interpolant sequences
[2021-08-26 14:38:10,771 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-08-26 14:38:10,772 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2021-08-26 14:38:10,772 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899926106]
[2021-08-26 14:38:10,772 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2021-08-26 14:38:10,772 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-08-26 14:38:10,772 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2021-08-26 14:38:10,772 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2021-08-26 14:38:10,772 INFO  L87              Difference]: Start difference. First operand 32 states and 47 transitions. Second operand  has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-08-26 14:38:10,834 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-08-26 14:38:10,835 INFO  L93              Difference]: Finished difference Result 40 states and 56 transitions.
[2021-08-26 14:38:10,835 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2021-08-26 14:38:10,835 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15
[2021-08-26 14:38:10,835 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-08-26 14:38:10,835 INFO  L225             Difference]: With dead ends: 40
[2021-08-26 14:38:10,836 INFO  L226             Difference]: Without dead ends: 24
[2021-08-26 14:38:10,836 INFO  L781         BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 100.4ms TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2021-08-26 14:38:10,836 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 24 states.
[2021-08-26 14:38:10,837 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24.
[2021-08-26 14:38:10,837 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 24 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 23 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-08-26 14:38:10,837 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions.
[2021-08-26 14:38:10,837 INFO  L78                 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 15
[2021-08-26 14:38:10,837 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-08-26 14:38:10,837 INFO  L470      AbstractCegarLoop]: Abstraction has 24 states and 31 transitions.
[2021-08-26 14:38:10,837 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-08-26 14:38:10,837 INFO  L276                IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions.
[2021-08-26 14:38:10,838 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2021-08-26 14:38:10,838 INFO  L504         BasicCegarLoop]: Found error trace
[2021-08-26 14:38:10,838 INFO  L512         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-08-26 14:38:10,838 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2021-08-26 14:38:10,838 INFO  L402      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] ===
[2021-08-26 14:38:10,839 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-08-26 14:38:10,839 INFO  L82        PathProgramCache]: Analyzing trace with hash -764838408, now seen corresponding path program 2 times
[2021-08-26 14:38:10,839 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-08-26 14:38:10,839 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714906710]
[2021-08-26 14:38:10,839 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-08-26 14:38:10,839 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-08-26 14:38:10,882 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-08-26 14:38:10,882 INFO  L354             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-08-26 14:38:10,918 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-08-26 14:38:10,945 INFO  L133   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2021-08-26 14:38:10,945 INFO  L626         BasicCegarLoop]: Counterexample is feasible
[2021-08-26 14:38:10,946 INFO  L764   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION
[2021-08-26 14:38:10,947 INFO  L764   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION
[2021-08-26 14:38:10,948 INFO  L764   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION
[2021-08-26 14:38:10,948 INFO  L764   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION
[2021-08-26 14:38:10,948 INFO  L764   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION
[2021-08-26 14:38:10,948 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2021-08-26 14:38:10,951 INFO  L229   ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2021-08-26 14:38:10,952 INFO  L179   ceAbstractionStarter]: Computing trace abstraction results
[2021-08-26 14:38:10,995 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 02:38:10 BasicIcfg
[2021-08-26 14:38:10,996 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2021-08-26 14:38:10,996 INFO  L113        PluginConnector]: ------------------------Witness Printer----------------------------
[2021-08-26 14:38:10,996 INFO  L271        PluginConnector]: Initializing Witness Printer...
[2021-08-26 14:38:10,996 INFO  L275        PluginConnector]: Witness Printer initialized
[2021-08-26 14:38:10,997 INFO  L185        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 02:37:53" (3/4) ...
[2021-08-26 14:38:10,998 INFO  L131         WitnessPrinter]: Generating witness for reachability counterexample
[2021-08-26 14:38:11,045 INFO  L141         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml
[2021-08-26 14:38:11,045 INFO  L132        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2021-08-26 14:38:11,046 INFO  L168              Benchmark]: Toolchain (without parser) took 18931.64 ms. Allocated memory was 56.6 MB in the beginning and 195.0 MB in the end (delta: 138.4 MB). Free memory was 33.2 MB in the beginning and 60.5 MB in the end (delta: -27.3 MB). Peak memory consumption was 111.1 MB. Max. memory is 16.1 GB.
[2021-08-26 14:38:11,046 INFO  L168              Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 56.6 MB. Free memory was 38.1 MB in the beginning and 38.1 MB in the end (delta: 44.1 kB). There was no memory consumed. Max. memory is 16.1 GB.
[2021-08-26 14:38:11,047 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 468.23 ms. Allocated memory is still 56.6 MB. Free memory was 33.0 MB in the beginning and 26.8 MB in the end (delta: 6.2 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB.
[2021-08-26 14:38:11,047 INFO  L168              Benchmark]: Boogie Procedure Inliner took 67.52 ms. Allocated memory was 56.6 MB in the beginning and 75.5 MB in the end (delta: 18.9 MB). Free memory was 26.8 MB in the beginning and 56.5 MB in the end (delta: -29.7 MB). Peak memory consumption was 5.3 MB. Max. memory is 16.1 GB.
[2021-08-26 14:38:11,047 INFO  L168              Benchmark]: Boogie Preprocessor took 39.82 ms. Allocated memory is still 75.5 MB. Free memory was 56.5 MB in the beginning and 54.2 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB.
[2021-08-26 14:38:11,047 INFO  L168              Benchmark]: RCFGBuilder took 1290.50 ms. Allocated memory was 75.5 MB in the beginning and 92.3 MB in the end (delta: 16.8 MB). Free memory was 54.2 MB in the beginning and 56.2 MB in the end (delta: -2.1 MB). Peak memory consumption was 39.4 MB. Max. memory is 16.1 GB.
[2021-08-26 14:38:11,048 INFO  L168              Benchmark]: TraceAbstraction took 17010.71 ms. Allocated memory was 92.3 MB in the beginning and 195.0 MB in the end (delta: 102.8 MB). Free memory was 55.5 MB in the beginning and 68.9 MB in the end (delta: -13.4 MB). Peak memory consumption was 88.0 MB. Max. memory is 16.1 GB.
[2021-08-26 14:38:11,048 INFO  L168              Benchmark]: Witness Printer took 49.27 ms. Allocated memory is still 195.0 MB. Free memory was 68.9 MB in the beginning and 60.5 MB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB.
[2021-08-26 14:38:11,049 INFO  L339   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.14 ms. Allocated memory is still 56.6 MB. Free memory was 38.1 MB in the beginning and 38.1 MB in the end (delta: 44.1 kB). There was no memory consumed. Max. memory is 16.1 GB.
 * CACSL2BoogieTranslator took 468.23 ms. Allocated memory is still 56.6 MB. Free memory was 33.0 MB in the beginning and 26.8 MB in the end (delta: 6.2 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB.
 * Boogie Procedure Inliner took 67.52 ms. Allocated memory was 56.6 MB in the beginning and 75.5 MB in the end (delta: 18.9 MB). Free memory was 26.8 MB in the beginning and 56.5 MB in the end (delta: -29.7 MB). Peak memory consumption was 5.3 MB. Max. memory is 16.1 GB.
 * Boogie Preprocessor took 39.82 ms. Allocated memory is still 75.5 MB. Free memory was 56.5 MB in the beginning and 54.2 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB.
 * RCFGBuilder took 1290.50 ms. Allocated memory was 75.5 MB in the beginning and 92.3 MB in the end (delta: 16.8 MB). Free memory was 54.2 MB in the beginning and 56.2 MB in the end (delta: -2.1 MB). Peak memory consumption was 39.4 MB. Max. memory is 16.1 GB.
 * TraceAbstraction took 17010.71 ms. Allocated memory was 92.3 MB in the beginning and 195.0 MB in the end (delta: 102.8 MB). Free memory was 55.5 MB in the beginning and 68.9 MB in the end (delta: -13.4 MB). Peak memory consumption was 88.0 MB. Max. memory is 16.1 GB.
 * Witness Printer took 49.27 ms. Allocated memory is still 195.0 MB. Free memory was 68.9 MB in the beginning and 60.5 MB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    Lipton Reduction Statistics: ReductionTime: 15338.1ms, 91 PlacesBefore, 26 PlacesAfterwards, 86 TransitionsBefore, 19 TransitionsAfterwards, 1004 CoEnabledTransitionPairs, 6 FixpointIterations, 34 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 2 ChoiceCompositions, 79 TotalNumberOfCompositions, 2567 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1370, positive: 1255, positive conditional: 0, positive unconditional: 1255, negative: 115, negative conditional: 0, negative unconditional: 115, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 709, positive: 672, positive conditional: 0, positive unconditional: 672, negative: 37, negative conditional: 0, negative unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 709, positive: 664, positive conditional: 0, positive unconditional: 664, negative: 45, negative conditional: 0, negative unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 45, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 37, negative conditional: 0, negative unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 320, positive: 13, positive conditional: 0, positive unconditional: 13, negative: 308, negative conditional: 0, negative unconditional: 308, unknown: 0, unknown conditional: 0, unknown unconditional: 0]  ], Cache Queries: [ total: 1370, positive: 583, positive conditional: 0, positive unconditional: 583, negative: 78, negative conditional: 0, negative unconditional: 78, unknown: 709, unknown conditional: 0, unknown unconditional: 709] , Statistics on independence cache: Total cache size (in pairs): 53, Positive cache size: 40, Positive conditional cache size: 0, Positive unconditional cache size: 40, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13
  - StatisticsResult: ErrorAutomatonStatistics
    NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
  - CounterExampleResult [Line: 18]: a call to reach_error is reachable
    a call to reach_error is reachable
We found a FailurePath: 
[L708]               0  int __unbuffered_cnt = 0;
[L710]               0  int __unbuffered_p1_EAX = 0;
[L711]               0  _Bool main$tmp_guard0;
[L712]               0  _Bool main$tmp_guard1;
[L714]               0  int x = 0;
[L716]               0  int y = 0;
[L717]               0  _Bool y$flush_delayed;
[L718]               0  int y$mem_tmp;
[L719]               0  _Bool y$r_buff0_thd0;
[L720]               0  _Bool y$r_buff0_thd1;
[L721]               0  _Bool y$r_buff0_thd2;
[L722]               0  _Bool y$r_buff1_thd0;
[L723]               0  _Bool y$r_buff1_thd1;
[L724]               0  _Bool y$r_buff1_thd2;
[L725]               0  _Bool y$read_delayed;
[L726]               0  int *y$read_delayed_var;
[L727]               0  int y$w_buff0;
[L728]               0  _Bool y$w_buff0_used;
[L729]               0  int y$w_buff1;
[L730]               0  _Bool y$w_buff1_used;
[L731]               0  _Bool weak$$choice0;
[L732]               0  _Bool weak$$choice2;
[L792]               0  pthread_t t2009;
[L793]  FCALL, FORK  0  pthread_create(&t2009, ((void *)0), P0, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L794]               0  pthread_t t2010;
[L795]  FCALL, FORK  0  pthread_create(&t2010, ((void *)0), P1, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L736]               1  y$w_buff1 = y$w_buff0
[L737]               1  y$w_buff0 = 2
[L738]               1  y$w_buff1_used = y$w_buff0_used
[L739]               1  y$w_buff0_used = (_Bool)1
[L18]   COND FALSE   1  !(!expression)
[L741]               1  y$r_buff1_thd0 = y$r_buff0_thd0
[L742]               1  y$r_buff1_thd1 = y$r_buff0_thd1
[L743]               1  y$r_buff1_thd2 = y$r_buff0_thd2
[L744]               1  y$r_buff0_thd1 = (_Bool)1
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0]
[L747]               1  x = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0]
[L764]               2  __unbuffered_p1_EAX = x
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0]
[L767]               2  y = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0]
[L750]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)
[L750]               1  y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)
[L751]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used
[L751]               1  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used
[L752]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used
[L752]               1  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used
[L753]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1
[L753]               1  y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1
[L754]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1
[L754]               1  y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1
[L757]               1  __unbuffered_cnt = __unbuffered_cnt + 1
[L759]               1  return 0;
[L770]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)
[L770]  EXPR         2  y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y
[L770]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)
[L770]               2  y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)
[L771]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used
[L771]               2  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used
[L772]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used
[L772]               2  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used
[L773]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2
[L773]               2  y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2
[L774]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2
[L774]               2  y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2
[L777]               2  __unbuffered_cnt = __unbuffered_cnt + 1
[L779]               2  return 0;
[L797]               0  main$tmp_guard0 = __unbuffered_cnt == 2
[L3]    COND FALSE   0  !(!cond)
[L801]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y)
[L801]  EXPR         0  y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y
[L801]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y)
[L801]               0  y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y)
[L802]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used
[L802]               0  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used
[L803]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used
[L803]               0  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used
[L804]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0
[L804]               0  y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0
[L805]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0
[L805]               0  y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0
[L808]               0  weak$$choice0 = __VERIFIER_nondet_bool()
[L809]               0  weak$$choice2 = __VERIFIER_nondet_bool()
[L810]               0  y$flush_delayed = weak$$choice2
[L811]               0  y$mem_tmp = y
[L812]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1)
[L812]               0  y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1)
[L813]  EXPR         0  weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0))
[L813]               0  y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0))
[L814]  EXPR         0  weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1))
[L814]               0  y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1))
[L815]  EXPR         0  weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used))
[L815]               0  y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used))
[L816]  EXPR         0  weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L816]               0  y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L817]  EXPR         0  weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0))
[L817]               0  y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0))
[L818]  EXPR         0  weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L818]               0  y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L819]               0  main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1)
[L820]  EXPR         0  y$flush_delayed ? y$mem_tmp : y
[L820]               0  y = y$flush_delayed ? y$mem_tmp : y
[L821]               0  y$flush_delayed = (_Bool)0
[L18]   COND TRUE    0  !expression
[L18]                0  reach_error()
        VAL             [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]

  - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable
    Unable to prove that call to reach_error is unreachable
 Reason: Not analyzed. 
  - UnprovableResult [Line: 795]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
    Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
 Reason: Not analyzed. 
  - UnprovableResult [Line: 793]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
    Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
 Reason: Not analyzed. 
  - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
    CFG has 5 procedures, 104 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 16897.0ms, OverallIterations: 8, TraceHistogramMax: 1, EmptinessCheckTime: 8.9ms, AutomataDifference: 244.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 15368.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 107 SDtfs, 93 SDslu, 177 SDs, 0 SdLazy, 114 SolverSat, 22 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 114.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 156.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=144occurred in iteration=0, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 46.9ms AutomataMinimizationTime, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 22.9ms SsaConstructionTime, 282.2ms SatisfiabilityAnalysisTime, 680.3ms InterpolantComputationTime, 81 NumberOfCodeBlocks, 81 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 59 ConstructedInterpolants, 0 QuantifiedInterpolants, 684 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
[2021-08-26 14:38:11,078 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0
Received shutdown request...