/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i


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


This is Ultimate 0.2.2-wip.dk.mcr-reduction-44898dd
[2022-02-08 23:58:56,071 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2022-02-08 23:58:56,073 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2022-02-08 23:58:56,139 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2022-02-08 23:58:56,140 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2022-02-08 23:58:56,142 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2022-02-08 23:58:56,143 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2022-02-08 23:58:56,146 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2022-02-08 23:58:56,147 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2022-02-08 23:58:56,151 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2022-02-08 23:58:56,151 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2022-02-08 23:58:56,152 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2022-02-08 23:58:56,153 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2022-02-08 23:58:56,154 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2022-02-08 23:58:56,155 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2022-02-08 23:58:56,157 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2022-02-08 23:58:56,158 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2022-02-08 23:58:56,158 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2022-02-08 23:58:56,160 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2022-02-08 23:58:56,164 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2022-02-08 23:58:56,165 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2022-02-08 23:58:56,166 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2022-02-08 23:58:56,167 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2022-02-08 23:58:56,168 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2022-02-08 23:58:56,173 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2022-02-08 23:58:56,173 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2022-02-08 23:58:56,173 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2022-02-08 23:58:56,174 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2022-02-08 23:58:56,174 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2022-02-08 23:58:56,175 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2022-02-08 23:58:56,175 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2022-02-08 23:58:56,176 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2022-02-08 23:58:56,177 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2022-02-08 23:58:56,177 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2022-02-08 23:58:56,178 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2022-02-08 23:58:56,178 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2022-02-08 23:58:56,179 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2022-02-08 23:58:56,179 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2022-02-08 23:58:56,179 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2022-02-08 23:58:56,180 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2022-02-08 23:58:56,180 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2022-02-08 23:58:56,181 INFO  L101        SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf
[2022-02-08 23:58:56,204 INFO  L113        SettingsManager]: Loading preferences was successful
[2022-02-08 23:58:56,204 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2022-02-08 23:58:56,204 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2022-02-08 23:58:56,204 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2022-02-08 23:58:56,205 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2022-02-08 23:58:56,205 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2022-02-08 23:58:56,205 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2022-02-08 23:58:56,205 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2022-02-08 23:58:56,206 INFO  L138        SettingsManager]:  * Use SBE=true
[2022-02-08 23:58:56,206 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2022-02-08 23:58:56,206 INFO  L138        SettingsManager]:  * sizeof long=4
[2022-02-08 23:58:56,206 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2022-02-08 23:58:56,206 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2022-02-08 23:58:56,206 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2022-02-08 23:58:56,206 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2022-02-08 23:58:56,206 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2022-02-08 23:58:56,206 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2022-02-08 23:58:56,206 INFO  L138        SettingsManager]:  * sizeof long double=12
[2022-02-08 23:58:56,206 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2022-02-08 23:58:56,206 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2022-02-08 23:58:56,207 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2022-02-08 23:58:56,207 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2022-02-08 23:58:56,207 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2022-02-08 23:58:56,207 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2022-02-08 23:58:56,207 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2022-02-08 23:58:56,207 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-02-08 23:58:56,207 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2022-02-08 23:58:56,209 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2022-02-08 23:58:56,210 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2022-02-08 23:58:56,210 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2022-02-08 23:58:56,210 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2022-02-08 23:58:56,210 INFO  L138        SettingsManager]:  * Large block encoding in concurrent analysis=OFF
[2022-02-08 23:58:56,210 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2022-02-08 23:58:56,210 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
[2022-02-08 23:58:56,398 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2022-02-08 23:58:56,414 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2022-02-08 23:58:56,416 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2022-02-08 23:58:56,416 INFO  L271        PluginConnector]: Initializing CDTParser...
[2022-02-08 23:58:56,431 INFO  L275        PluginConnector]: CDTParser initialized
[2022-02-08 23:58:56,432 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i
[2022-02-08 23:58:56,483 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7fbfa07d/da0e8d1dc9fc4a4bb434df77aebb008b/FLAG57205a86d
[2022-02-08 23:58:56,929 INFO  L306              CDTParser]: Found 1 translation units.
[2022-02-08 23:58:56,930 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i
[2022-02-08 23:58:56,960 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7fbfa07d/da0e8d1dc9fc4a4bb434df77aebb008b/FLAG57205a86d
[2022-02-08 23:58:57,465 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7fbfa07d/da0e8d1dc9fc4a4bb434df77aebb008b
[2022-02-08 23:58:57,467 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2022-02-08 23:58:57,468 INFO  L131        ToolchainWalker]: Walking toolchain with 5 elements.
[2022-02-08 23:58:57,469 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2022-02-08 23:58:57,469 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2022-02-08 23:58:57,471 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2022-02-08 23:58:57,472 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 11:58:57" (1/1) ...
[2022-02-08 23:58:57,473 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10fd0f9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:58:57, skipping insertion in model container
[2022-02-08 23:58:57,476 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 11:58:57" (1/1) ...
[2022-02-08 23:58:57,483 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2022-02-08 23:58:57,531 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2022-02-08 23:58:57,657 WARN  L230   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i[967,980]
[2022-02-08 23:58:57,819 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2022-02-08 23:58:57,827 INFO  L203         MainTranslator]: Completed pre-run
[2022-02-08 23:58:57,836 WARN  L230   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i[967,980]
[2022-02-08 23:58:57,890 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2022-02-08 23:58:57,921 INFO  L208         MainTranslator]: Completed translation
[2022-02-08 23:58:57,922 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:58:57 WrapperNode
[2022-02-08 23:58:57,923 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2022-02-08 23:58:57,924 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2022-02-08 23:58:57,924 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2022-02-08 23:58:57,924 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2022-02-08 23:58:57,929 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:58:57" (1/1) ...
[2022-02-08 23:58:57,955 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:58:57" (1/1) ...
[2022-02-08 23:58:57,999 INFO  L137                Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 273
[2022-02-08 23:58:57,999 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2022-02-08 23:58:58,000 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2022-02-08 23:58:58,000 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2022-02-08 23:58:58,000 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2022-02-08 23:58:58,007 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:58:57" (1/1) ...
[2022-02-08 23:58:58,007 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:58:57" (1/1) ...
[2022-02-08 23:58:58,023 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:58:57" (1/1) ...
[2022-02-08 23:58:58,023 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:58:57" (1/1) ...
[2022-02-08 23:58:58,029 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:58:57" (1/1) ...
[2022-02-08 23:58:58,031 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:58:57" (1/1) ...
[2022-02-08 23:58:58,033 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:58:57" (1/1) ...
[2022-02-08 23:58:58,053 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2022-02-08 23:58:58,054 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2022-02-08 23:58:58,054 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2022-02-08 23:58:58,054 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2022-02-08 23:58:58,055 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:58:57" (1/1) ...
[2022-02-08 23:58:58,075 INFO  L168          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-02-08 23:58:58,096 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-02-08 23:58:58,106 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)
[2022-02-08 23:58:58,112 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
[2022-02-08 23:58:58,149 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2022-02-08 23:58:58,149 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2022-02-08 23:58:58,149 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2022-02-08 23:58:58,150 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2022-02-08 23:58:58,150 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2022-02-08 23:58:58,150 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2022-02-08 23:58:58,150 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2022-02-08 23:58:58,152 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2022-02-08 23:58:58,152 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2022-02-08 23:58:58,153 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2022-02-08 23:58:58,153 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2022-02-08 23:58:58,153 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2022-02-08 23:58:58,162 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2022-02-08 23:58:58,162 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2022-02-08 23:58:58,162 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2022-02-08 23:58:58,164 WARN  L208             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2022-02-08 23:58:58,270 INFO  L234             CfgBuilder]: Building ICFG
[2022-02-08 23:58:58,271 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2022-02-08 23:58:58,597 INFO  L275             CfgBuilder]: Performing block encoding
[2022-02-08 23:58:58,783 INFO  L294             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2022-02-08 23:58:58,783 INFO  L299             CfgBuilder]: Removed 0 assume(true) statements.
[2022-02-08 23:58:58,785 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.02 11:58:58 BoogieIcfgContainer
[2022-02-08 23:58:58,785 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2022-02-08 23:58:58,787 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2022-02-08 23:58:58,787 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2022-02-08 23:58:58,789 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2022-02-08 23:58:58,789 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 11:58:57" (1/3) ...
[2022-02-08 23:58:58,790 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@216a54a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 11:58:58, skipping insertion in model container
[2022-02-08 23:58:58,790 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:58:57" (2/3) ...
[2022-02-08 23:58:58,790 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@216a54a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 11:58:58, skipping insertion in model container
[2022-02-08 23:58:58,790 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.02 11:58:58" (3/3) ...
[2022-02-08 23:58:58,791 INFO  L111   eAbstractionObserver]: Analyzing ICFG safe030_power.opt_pso.opt_rmo.opt.i
[2022-02-08 23:58:58,795 WARN  L150   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2022-02-08 23:58:58,795 INFO  L205   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2022-02-08 23:58:58,795 INFO  L164   ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations.
[2022-02-08 23:58:58,795 INFO  L534   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2022-02-08 23:58:58,827 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:58,827 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:58,827 WARN  L322   ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:58,827 WARN  L322   ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:58,827 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:58,827 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:58,827 WARN  L322   ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:58,828 WARN  L322   ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:58,828 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:58,828 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:58,828 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:58,829 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:58,829 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:58,829 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:58,829 WARN  L322   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:58,829 WARN  L322   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:58,829 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:58,829 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:58,830 WARN  L322   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:58,830 WARN  L322   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:58,830 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:58,830 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:58,830 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:58,831 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:58,831 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:58,831 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:58,831 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:58,832 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:58,832 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:58,832 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:58,832 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:58,832 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:58,832 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:58,832 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:58,832 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:58,833 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:58,833 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:58,833 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:58,833 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:58,833 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:58,833 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:58,833 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:58,833 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:58,833 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:58,833 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:58,834 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:58,834 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:58,834 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:58,834 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:58,834 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:58,834 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:58,834 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:58,835 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:58,835 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:58,835 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:58,835 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:58,835 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:58,835 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:58,835 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:58,835 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:58,835 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:58,836 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:58,836 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:58,836 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:58,837 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:58,837 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:58,837 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:58,837 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:58,837 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:58,838 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:58,838 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:58,838 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:58,840 WARN  L322   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:58,840 WARN  L322   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:58,840 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:58,840 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:58,840 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:58,841 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:58,841 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:58,841 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:58,841 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:58,841 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:58,842 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:58,843 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:58,843 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:58,843 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:58,843 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:58,844 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:58,844 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:58,846 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:58,848 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:58,848 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:58,849 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:58,849 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:58,849 WARN  L322   ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:58,849 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:58,849 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:58,849 WARN  L322   ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-02-08 23:58:58,850 INFO  L148    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2022-02-08 23:58:58,890 INFO  L338      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2022-02-08 23:58:58,898 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, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, 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
[2022-02-08 23:58:58,899 INFO  L340      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2022-02-08 23:58:58,908 INFO  L111   iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 120 places, 112 transitions, 239 flow
[2022-02-08 23:58:59,293 INFO  L133   iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result  has 12242 states, 12239 states have (on average 3.55167905874663) internal successors, (43469), 12241 states have internal predecessors, (43469), 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)
[2022-02-08 23:58:59,336 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 12242 states, 12239 states have (on average 3.55167905874663) internal successors, (43469), 12241 states have internal predecessors, (43469), 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)
[2022-02-08 23:58:59,352 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 58
[2022-02-08 23:58:59,352 INFO  L506         BasicCegarLoop]: Found error trace
[2022-02-08 23:58:59,352 INFO  L514         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-08 23:58:59,353 INFO  L402      AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2022-02-08 23:58:59,358 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-08 23:58:59,359 INFO  L85        PathProgramCache]: Analyzing trace with hash -2040665683, now seen corresponding path program 1 times
[2022-02-08 23:58:59,364 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-08 23:58:59,365 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914894877]
[2022-02-08 23:58:59,365 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-08 23:58:59,365 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-08 23:58:59,492 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-08 23:58:59,671 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-08 23:58:59,671 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-08 23:58:59,671 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914894877]
[2022-02-08 23:58:59,672 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914894877] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-08 23:58:59,672 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-08 23:58:59,672 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2022-02-08 23:58:59,674 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531391982]
[2022-02-08 23:58:59,674 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-08 23:58:59,677 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-02-08 23:58:59,677 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-08 23:58:59,698 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-02-08 23:58:59,699 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-02-08 23:58:59,725 INFO  L87              Difference]: Start difference. First operand  has 12242 states, 12239 states have (on average 3.55167905874663) internal successors, (43469), 12241 states have internal predecessors, (43469), 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 28.5) internal successors, (57), 3 states have internal predecessors, (57), 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)
[2022-02-08 23:58:59,979 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-08 23:58:59,979 INFO  L93              Difference]: Finished difference Result 10338 states and 35803 transitions.
[2022-02-08 23:58:59,980 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2022-02-08 23:58:59,981 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 2 states have (on average 28.5) internal successors, (57), 3 states have internal predecessors, (57), 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 57
[2022-02-08 23:58:59,982 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-08 23:59:00,102 INFO  L225             Difference]: With dead ends: 10338
[2022-02-08 23:59:00,103 INFO  L226             Difference]: Without dead ends: 8546
[2022-02-08 23:59:00,104 INFO  L932         BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-02-08 23:59:00,106 INFO  L933         BasicCegarLoop]: 97 mSDtfsCounter, 40 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-02-08 23:59:00,106 INFO  L934         BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 155 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-02-08 23:59:00,162 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 8546 states.
[2022-02-08 23:59:00,474 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 8546 to 8546.
[2022-02-08 23:59:00,507 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 8546 states, 8545 states have (on average 3.4924517261556467) internal successors, (29843), 8545 states have internal predecessors, (29843), 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)
[2022-02-08 23:59:00,602 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8546 states to 8546 states and 29843 transitions.
[2022-02-08 23:59:00,603 INFO  L78                 Accepts]: Start accepts. Automaton has 8546 states and 29843 transitions. Word has length 57
[2022-02-08 23:59:00,604 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-08 23:59:00,604 INFO  L470      AbstractCegarLoop]: Abstraction has 8546 states and 29843 transitions.
[2022-02-08 23:59:00,605 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 2 states have (on average 28.5) internal successors, (57), 3 states have internal predecessors, (57), 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)
[2022-02-08 23:59:00,605 INFO  L276                IsEmpty]: Start isEmpty. Operand 8546 states and 29843 transitions.
[2022-02-08 23:59:00,619 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 73
[2022-02-08 23:59:00,619 INFO  L506         BasicCegarLoop]: Found error trace
[2022-02-08 23:59:00,619 INFO  L514         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-08 23:59:00,619 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2022-02-08 23:59:00,620 INFO  L402      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2022-02-08 23:59:00,620 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-08 23:59:00,621 INFO  L85        PathProgramCache]: Analyzing trace with hash -690634123, now seen corresponding path program 1 times
[2022-02-08 23:59:00,621 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-08 23:59:00,621 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620775245]
[2022-02-08 23:59:00,621 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-08 23:59:00,621 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-08 23:59:00,682 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-08 23:59:00,787 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-08 23:59:00,787 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-08 23:59:00,787 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620775245]
[2022-02-08 23:59:00,788 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620775245] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-08 23:59:00,788 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-08 23:59:00,788 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2022-02-08 23:59:00,788 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178098816]
[2022-02-08 23:59:00,788 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-08 23:59:00,790 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2022-02-08 23:59:00,790 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-08 23:59:00,790 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2022-02-08 23:59:00,790 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2022-02-08 23:59:00,790 INFO  L87              Difference]: Start difference. First operand 8546 states and 29843 transitions. Second operand  has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 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)
[2022-02-08 23:59:01,058 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-08 23:59:01,058 INFO  L93              Difference]: Finished difference Result 10450 states and 36221 transitions.
[2022-02-08 23:59:01,059 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2022-02-08 23:59:01,059 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 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 72
[2022-02-08 23:59:01,059 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-08 23:59:01,101 INFO  L225             Difference]: With dead ends: 10450
[2022-02-08 23:59:01,101 INFO  L226             Difference]: Without dead ends: 8210
[2022-02-08 23:59:01,101 INFO  L932         BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110
[2022-02-08 23:59:01,102 INFO  L933         BasicCegarLoop]: 133 mSDtfsCounter, 119 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-02-08 23:59:01,102 INFO  L934         BasicCegarLoop]: SdHoareTripleChecker [119 Valid, 546 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-02-08 23:59:01,119 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 8210 states.
[2022-02-08 23:59:01,315 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 8210 to 8210.
[2022-02-08 23:59:01,332 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 8210 states, 8209 states have (on average 3.476793762943111) internal successors, (28541), 8209 states have internal predecessors, (28541), 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)
[2022-02-08 23:59:01,385 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8210 states to 8210 states and 28541 transitions.
[2022-02-08 23:59:01,386 INFO  L78                 Accepts]: Start accepts. Automaton has 8210 states and 28541 transitions. Word has length 72
[2022-02-08 23:59:01,386 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-08 23:59:01,386 INFO  L470      AbstractCegarLoop]: Abstraction has 8210 states and 28541 transitions.
[2022-02-08 23:59:01,386 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 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)
[2022-02-08 23:59:01,386 INFO  L276                IsEmpty]: Start isEmpty. Operand 8210 states and 28541 transitions.
[2022-02-08 23:59:01,400 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 75
[2022-02-08 23:59:01,401 INFO  L506         BasicCegarLoop]: Found error trace
[2022-02-08 23:59:01,401 INFO  L514         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-08 23:59:01,401 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2022-02-08 23:59:01,401 INFO  L402      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2022-02-08 23:59:01,401 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-08 23:59:01,402 INFO  L85        PathProgramCache]: Analyzing trace with hash 1458795636, now seen corresponding path program 1 times
[2022-02-08 23:59:01,402 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-08 23:59:01,402 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000414119]
[2022-02-08 23:59:01,402 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-08 23:59:01,402 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-08 23:59:01,442 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-08 23:59:01,503 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-08 23:59:01,503 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-08 23:59:01,503 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000414119]
[2022-02-08 23:59:01,503 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000414119] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-08 23:59:01,503 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-08 23:59:01,504 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2022-02-08 23:59:01,504 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696812469]
[2022-02-08 23:59:01,504 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-08 23:59:01,504 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2022-02-08 23:59:01,504 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-08 23:59:01,504 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2022-02-08 23:59:01,505 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2022-02-08 23:59:01,505 INFO  L87              Difference]: Start difference. First operand 8210 states and 28541 transitions. Second operand  has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 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)
[2022-02-08 23:59:01,778 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-08 23:59:01,779 INFO  L93              Difference]: Finished difference Result 9958 states and 34361 transitions.
[2022-02-08 23:59:01,779 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2022-02-08 23:59:01,780 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 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 74
[2022-02-08 23:59:01,780 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-08 23:59:01,814 INFO  L225             Difference]: With dead ends: 9958
[2022-02-08 23:59:01,814 INFO  L226             Difference]: Without dead ends: 7958
[2022-02-08 23:59:01,816 INFO  L932         BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110
[2022-02-08 23:59:01,820 INFO  L933         BasicCegarLoop]: 133 mSDtfsCounter, 117 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-02-08 23:59:01,821 INFO  L934         BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 528 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-02-08 23:59:01,839 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 7958 states.
[2022-02-08 23:59:02,032 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 7958 to 7958.
[2022-02-08 23:59:02,048 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 7958 states, 7957 states have (on average 3.4655020736458466) internal successors, (27575), 7957 states have internal predecessors, (27575), 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)
[2022-02-08 23:59:02,082 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7958 states to 7958 states and 27575 transitions.
[2022-02-08 23:59:02,082 INFO  L78                 Accepts]: Start accepts. Automaton has 7958 states and 27575 transitions. Word has length 74
[2022-02-08 23:59:02,083 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-08 23:59:02,084 INFO  L470      AbstractCegarLoop]: Abstraction has 7958 states and 27575 transitions.
[2022-02-08 23:59:02,084 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 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)
[2022-02-08 23:59:02,084 INFO  L276                IsEmpty]: Start isEmpty. Operand 7958 states and 27575 transitions.
[2022-02-08 23:59:02,097 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 76
[2022-02-08 23:59:02,098 INFO  L506         BasicCegarLoop]: Found error trace
[2022-02-08 23:59:02,098 INFO  L514         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-08 23:59:02,098 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2022-02-08 23:59:02,099 INFO  L402      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2022-02-08 23:59:02,099 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-08 23:59:02,099 INFO  L85        PathProgramCache]: Analyzing trace with hash 42875813, now seen corresponding path program 1 times
[2022-02-08 23:59:02,099 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-08 23:59:02,099 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553043960]
[2022-02-08 23:59:02,100 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-08 23:59:02,100 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-08 23:59:02,166 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-08 23:59:02,266 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-08 23:59:02,266 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-08 23:59:02,266 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553043960]
[2022-02-08 23:59:02,266 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553043960] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-08 23:59:02,266 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-08 23:59:02,267 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2022-02-08 23:59:02,267 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173409554]
[2022-02-08 23:59:02,267 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-08 23:59:02,267 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2022-02-08 23:59:02,267 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-08 23:59:02,267 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2022-02-08 23:59:02,268 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2022-02-08 23:59:02,268 INFO  L87              Difference]: Start difference. First operand 7958 states and 27575 transitions. Second operand  has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 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)
[2022-02-08 23:59:02,613 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-08 23:59:02,613 INFO  L93              Difference]: Finished difference Result 13374 states and 45561 transitions.
[2022-02-08 23:59:02,614 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2022-02-08 23:59:02,614 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 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 75
[2022-02-08 23:59:02,615 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-08 23:59:02,648 INFO  L225             Difference]: With dead ends: 13374
[2022-02-08 23:59:02,649 INFO  L226             Difference]: Without dead ends: 8854
[2022-02-08 23:59:02,649 INFO  L932         BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110
[2022-02-08 23:59:02,655 INFO  L933         BasicCegarLoop]: 170 mSDtfsCounter, 116 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-02-08 23:59:02,656 INFO  L934         BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 692 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-02-08 23:59:02,674 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 8854 states.
[2022-02-08 23:59:02,894 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 8854 to 7510.
[2022-02-08 23:59:02,906 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 7510 states, 7509 states have (on average 3.38007724064456) internal successors, (25381), 7509 states have internal predecessors, (25381), 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)
[2022-02-08 23:59:02,923 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7510 states to 7510 states and 25381 transitions.
[2022-02-08 23:59:02,924 INFO  L78                 Accepts]: Start accepts. Automaton has 7510 states and 25381 transitions. Word has length 75
[2022-02-08 23:59:02,925 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-08 23:59:02,925 INFO  L470      AbstractCegarLoop]: Abstraction has 7510 states and 25381 transitions.
[2022-02-08 23:59:02,925 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 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)
[2022-02-08 23:59:02,925 INFO  L276                IsEmpty]: Start isEmpty. Operand 7510 states and 25381 transitions.
[2022-02-08 23:59:02,937 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 77
[2022-02-08 23:59:02,937 INFO  L506         BasicCegarLoop]: Found error trace
[2022-02-08 23:59:02,938 INFO  L514         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-08 23:59:02,938 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2022-02-08 23:59:02,938 INFO  L402      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2022-02-08 23:59:02,938 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-08 23:59:02,938 INFO  L85        PathProgramCache]: Analyzing trace with hash -1187014733, now seen corresponding path program 1 times
[2022-02-08 23:59:02,938 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-08 23:59:02,938 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139109824]
[2022-02-08 23:59:02,939 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-08 23:59:02,939 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-08 23:59:02,988 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-08 23:59:03,105 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-08 23:59:03,105 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-08 23:59:03,105 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139109824]
[2022-02-08 23:59:03,105 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139109824] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-08 23:59:03,106 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-08 23:59:03,106 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2022-02-08 23:59:03,106 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407726660]
[2022-02-08 23:59:03,106 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-08 23:59:03,106 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2022-02-08 23:59:03,106 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-08 23:59:03,106 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2022-02-08 23:59:03,106 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90
[2022-02-08 23:59:03,107 INFO  L87              Difference]: Start difference. First operand 7510 states and 25381 transitions. Second operand  has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 states have internal predecessors, (76), 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)
[2022-02-08 23:59:03,326 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-08 23:59:03,327 INFO  L93              Difference]: Finished difference Result 8682 states and 29225 transitions.
[2022-02-08 23:59:03,327 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2022-02-08 23:59:03,328 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 states have internal predecessors, (76), 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 76
[2022-02-08 23:59:03,328 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-08 23:59:03,353 INFO  L225             Difference]: With dead ends: 8682
[2022-02-08 23:59:03,354 INFO  L226             Difference]: Without dead ends: 7482
[2022-02-08 23:59:03,354 INFO  L932         BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306
[2022-02-08 23:59:03,356 INFO  L933         BasicCegarLoop]: 121 mSDtfsCounter, 276 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-02-08 23:59:03,356 INFO  L934         BasicCegarLoop]: SdHoareTripleChecker [276 Valid, 588 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-02-08 23:59:03,370 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 7482 states.
[2022-02-08 23:59:03,589 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 7482 to 7440.
[2022-02-08 23:59:03,599 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 7440 states, 7439 states have (on average 3.3761258233633553) internal successors, (25115), 7439 states have internal predecessors, (25115), 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)
[2022-02-08 23:59:03,621 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7440 states to 7440 states and 25115 transitions.
[2022-02-08 23:59:03,622 INFO  L78                 Accepts]: Start accepts. Automaton has 7440 states and 25115 transitions. Word has length 76
[2022-02-08 23:59:03,622 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-08 23:59:03,622 INFO  L470      AbstractCegarLoop]: Abstraction has 7440 states and 25115 transitions.
[2022-02-08 23:59:03,622 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 states have internal predecessors, (76), 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)
[2022-02-08 23:59:03,622 INFO  L276                IsEmpty]: Start isEmpty. Operand 7440 states and 25115 transitions.
[2022-02-08 23:59:03,635 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 78
[2022-02-08 23:59:03,635 INFO  L506         BasicCegarLoop]: Found error trace
[2022-02-08 23:59:03,635 INFO  L514         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-08 23:59:03,635 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2022-02-08 23:59:03,636 INFO  L402      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2022-02-08 23:59:03,636 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-08 23:59:03,636 INFO  L85        PathProgramCache]: Analyzing trace with hash 633432710, now seen corresponding path program 1 times
[2022-02-08 23:59:03,636 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-08 23:59:03,636 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321206049]
[2022-02-08 23:59:03,636 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-08 23:59:03,637 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-08 23:59:03,660 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-08 23:59:03,835 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-08 23:59:03,835 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-08 23:59:03,835 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321206049]
[2022-02-08 23:59:03,835 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321206049] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-08 23:59:03,835 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-08 23:59:03,835 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2022-02-08 23:59:03,835 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36128086]
[2022-02-08 23:59:03,836 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-08 23:59:03,836 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2022-02-08 23:59:03,836 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-08 23:59:03,836 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2022-02-08 23:59:03,836 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2022-02-08 23:59:03,836 INFO  L87              Difference]: Start difference. First operand 7440 states and 25115 transitions. Second operand  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 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)
[2022-02-08 23:59:04,192 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-08 23:59:04,192 INFO  L93              Difference]: Finished difference Result 8454 states and 28438 transitions.
[2022-02-08 23:59:04,207 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2022-02-08 23:59:04,208 INFO  L78                 Accepts]: Start accepts. Automaton has  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 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 77
[2022-02-08 23:59:04,208 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-08 23:59:04,249 INFO  L225             Difference]: With dead ends: 8454
[2022-02-08 23:59:04,249 INFO  L226             Difference]: Without dead ends: 7454
[2022-02-08 23:59:04,249 INFO  L932         BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=228, Unknown=0, NotChecked=0, Total=342
[2022-02-08 23:59:04,250 INFO  L933         BasicCegarLoop]: 139 mSDtfsCounter, 250 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 758 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-02-08 23:59:04,250 INFO  L934         BasicCegarLoop]: SdHoareTripleChecker [250 Valid, 758 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-02-08 23:59:04,262 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 7454 states.
[2022-02-08 23:59:04,371 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 7454 to 7454.
[2022-02-08 23:59:04,382 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 7454 states, 7453 states have (on average 3.3748825976117) internal successors, (25153), 7453 states have internal predecessors, (25153), 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)
[2022-02-08 23:59:04,403 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7454 states to 7454 states and 25153 transitions.
[2022-02-08 23:59:04,403 INFO  L78                 Accepts]: Start accepts. Automaton has 7454 states and 25153 transitions. Word has length 77
[2022-02-08 23:59:04,403 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-08 23:59:04,404 INFO  L470      AbstractCegarLoop]: Abstraction has 7454 states and 25153 transitions.
[2022-02-08 23:59:04,404 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 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)
[2022-02-08 23:59:04,404 INFO  L276                IsEmpty]: Start isEmpty. Operand 7454 states and 25153 transitions.
[2022-02-08 23:59:04,419 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 78
[2022-02-08 23:59:04,419 INFO  L506         BasicCegarLoop]: Found error trace
[2022-02-08 23:59:04,419 INFO  L514         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-08 23:59:04,420 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2022-02-08 23:59:04,420 INFO  L402      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2022-02-08 23:59:04,420 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-08 23:59:04,420 INFO  L85        PathProgramCache]: Analyzing trace with hash -607595286, now seen corresponding path program 2 times
[2022-02-08 23:59:04,420 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-08 23:59:04,420 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944769147]
[2022-02-08 23:59:04,420 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-08 23:59:04,421 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-08 23:59:04,509 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-08 23:59:04,642 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-08 23:59:04,642 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-08 23:59:04,642 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944769147]
[2022-02-08 23:59:04,643 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944769147] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-08 23:59:04,643 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-08 23:59:04,643 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2022-02-08 23:59:04,643 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086862939]
[2022-02-08 23:59:04,643 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-08 23:59:04,643 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2022-02-08 23:59:04,643 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-08 23:59:04,643 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2022-02-08 23:59:04,644 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2022-02-08 23:59:04,644 INFO  L87              Difference]: Start difference. First operand 7454 states and 25153 transitions. Second operand  has 10 states, 10 states have (on average 7.7) internal successors, (77), 10 states have internal predecessors, (77), 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)
[2022-02-08 23:59:04,961 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-08 23:59:04,962 INFO  L93              Difference]: Finished difference Result 8384 states and 28172 transitions.
[2022-02-08 23:59:04,962 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2022-02-08 23:59:04,962 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 10 states have (on average 7.7) internal successors, (77), 10 states have internal predecessors, (77), 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 77
[2022-02-08 23:59:04,962 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-08 23:59:04,978 INFO  L225             Difference]: With dead ends: 8384
[2022-02-08 23:59:04,978 INFO  L226             Difference]: Without dead ends: 7384
[2022-02-08 23:59:04,979 INFO  L932         BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=225, Unknown=0, NotChecked=0, Total=342
[2022-02-08 23:59:04,979 INFO  L933         BasicCegarLoop]: 141 mSDtfsCounter, 254 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 723 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2022-02-08 23:59:04,979 INFO  L934         BasicCegarLoop]: SdHoareTripleChecker [254 Valid, 723 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2022-02-08 23:59:04,989 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 7384 states.
[2022-02-08 23:59:05,082 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 7384 to 7370.
[2022-02-08 23:59:05,090 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 7370 states, 7369 states have (on average 3.372099335052246) internal successors, (24849), 7369 states have internal predecessors, (24849), 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)
[2022-02-08 23:59:05,106 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7370 states to 7370 states and 24849 transitions.
[2022-02-08 23:59:05,106 INFO  L78                 Accepts]: Start accepts. Automaton has 7370 states and 24849 transitions. Word has length 77
[2022-02-08 23:59:05,106 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-08 23:59:05,106 INFO  L470      AbstractCegarLoop]: Abstraction has 7370 states and 24849 transitions.
[2022-02-08 23:59:05,107 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 7.7) internal successors, (77), 10 states have internal predecessors, (77), 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)
[2022-02-08 23:59:05,107 INFO  L276                IsEmpty]: Start isEmpty. Operand 7370 states and 24849 transitions.
[2022-02-08 23:59:05,117 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 78
[2022-02-08 23:59:05,117 INFO  L506         BasicCegarLoop]: Found error trace
[2022-02-08 23:59:05,118 INFO  L514         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-08 23:59:05,118 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2022-02-08 23:59:05,118 INFO  L402      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2022-02-08 23:59:05,118 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-08 23:59:05,118 INFO  L85        PathProgramCache]: Analyzing trace with hash -1936988811, now seen corresponding path program 1 times
[2022-02-08 23:59:05,118 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-08 23:59:05,119 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227311893]
[2022-02-08 23:59:05,119 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-08 23:59:05,119 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-08 23:59:05,139 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-08 23:59:05,261 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-08 23:59:05,262 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-08 23:59:05,262 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227311893]
[2022-02-08 23:59:05,262 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227311893] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-08 23:59:05,262 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-08 23:59:05,262 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2022-02-08 23:59:05,262 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544293922]
[2022-02-08 23:59:05,262 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-08 23:59:05,263 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2022-02-08 23:59:05,263 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-08 23:59:05,264 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2022-02-08 23:59:05,264 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2022-02-08 23:59:05,264 INFO  L87              Difference]: Start difference. First operand 7370 states and 24849 transitions. Second operand  has 10 states, 10 states have (on average 7.7) internal successors, (77), 10 states have internal predecessors, (77), 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)
[2022-02-08 23:59:05,600 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-08 23:59:05,600 INFO  L93              Difference]: Finished difference Result 8766 states and 29519 transitions.
[2022-02-08 23:59:05,600 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. 
[2022-02-08 23:59:05,601 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 10 states have (on average 7.7) internal successors, (77), 10 states have internal predecessors, (77), 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 77
[2022-02-08 23:59:05,601 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-08 23:59:05,619 INFO  L225             Difference]: With dead ends: 8766
[2022-02-08 23:59:05,620 INFO  L226             Difference]: Without dead ends: 7566
[2022-02-08 23:59:05,620 INFO  L932         BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=242, Unknown=0, NotChecked=0, Total=342
[2022-02-08 23:59:05,620 INFO  L933         BasicCegarLoop]: 142 mSDtfsCounter, 244 mSDsluCounter, 861 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 982 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-02-08 23:59:05,621 INFO  L934         BasicCegarLoop]: SdHoareTripleChecker [244 Valid, 982 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-02-08 23:59:05,634 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 7566 states.
[2022-02-08 23:59:05,762 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 7566 to 7566.
[2022-02-08 23:59:05,772 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 7566 states, 7565 states have (on average 3.374091209517515) internal successors, (25525), 7565 states have internal predecessors, (25525), 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)
[2022-02-08 23:59:05,797 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7566 states to 7566 states and 25525 transitions.
[2022-02-08 23:59:05,798 INFO  L78                 Accepts]: Start accepts. Automaton has 7566 states and 25525 transitions. Word has length 77
[2022-02-08 23:59:05,798 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-08 23:59:05,798 INFO  L470      AbstractCegarLoop]: Abstraction has 7566 states and 25525 transitions.
[2022-02-08 23:59:05,798 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 7.7) internal successors, (77), 10 states have internal predecessors, (77), 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)
[2022-02-08 23:59:05,798 INFO  L276                IsEmpty]: Start isEmpty. Operand 7566 states and 25525 transitions.
[2022-02-08 23:59:05,813 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 78
[2022-02-08 23:59:05,813 INFO  L506         BasicCegarLoop]: Found error trace
[2022-02-08 23:59:05,813 INFO  L514         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-08 23:59:05,813 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2022-02-08 23:59:05,813 INFO  L402      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2022-02-08 23:59:05,814 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-08 23:59:05,814 INFO  L85        PathProgramCache]: Analyzing trace with hash 480074037, now seen corresponding path program 2 times
[2022-02-08 23:59:05,814 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-08 23:59:05,814 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306572543]
[2022-02-08 23:59:05,814 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-08 23:59:05,815 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-08 23:59:05,853 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-08 23:59:05,903 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-08 23:59:05,903 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-08 23:59:05,903 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306572543]
[2022-02-08 23:59:05,903 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306572543] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-08 23:59:05,903 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-08 23:59:05,904 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2022-02-08 23:59:05,904 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425464910]
[2022-02-08 23:59:05,904 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-08 23:59:05,904 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2022-02-08 23:59:05,904 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-08 23:59:05,904 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2022-02-08 23:59:05,905 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2022-02-08 23:59:05,905 INFO  L87              Difference]: Start difference. First operand 7566 states and 25525 transitions. Second operand  has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 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)
[2022-02-08 23:59:06,085 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-08 23:59:06,085 INFO  L93              Difference]: Finished difference Result 12226 states and 40743 transitions.
[2022-02-08 23:59:06,086 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2022-02-08 23:59:06,086 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 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 77
[2022-02-08 23:59:06,086 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-08 23:59:06,108 INFO  L225             Difference]: With dead ends: 12226
[2022-02-08 23:59:06,108 INFO  L226             Difference]: Without dead ends: 8156
[2022-02-08 23:59:06,108 INFO  L932         BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110
[2022-02-08 23:59:06,109 INFO  L933         BasicCegarLoop]: 144 mSDtfsCounter, 127 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-02-08 23:59:06,109 INFO  L934         BasicCegarLoop]: SdHoareTripleChecker [127 Valid, 615 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-02-08 23:59:06,127 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 8156 states.
[2022-02-08 23:59:06,282 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 8156 to 7106.
[2022-02-08 23:59:06,295 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 7106 states, 7105 states have (on average 3.2848698099929625) internal successors, (23339), 7105 states have internal predecessors, (23339), 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)
[2022-02-08 23:59:06,324 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7106 states to 7106 states and 23339 transitions.
[2022-02-08 23:59:06,324 INFO  L78                 Accepts]: Start accepts. Automaton has 7106 states and 23339 transitions. Word has length 77
[2022-02-08 23:59:06,324 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-08 23:59:06,324 INFO  L470      AbstractCegarLoop]: Abstraction has 7106 states and 23339 transitions.
[2022-02-08 23:59:06,325 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 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)
[2022-02-08 23:59:06,325 INFO  L276                IsEmpty]: Start isEmpty. Operand 7106 states and 23339 transitions.
[2022-02-08 23:59:06,340 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 79
[2022-02-08 23:59:06,340 INFO  L506         BasicCegarLoop]: Found error trace
[2022-02-08 23:59:06,340 INFO  L514         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-08 23:59:06,340 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2022-02-08 23:59:06,341 INFO  L402      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2022-02-08 23:59:06,341 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-08 23:59:06,341 INFO  L85        PathProgramCache]: Analyzing trace with hash 1055212473, now seen corresponding path program 1 times
[2022-02-08 23:59:06,341 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-08 23:59:06,341 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973799799]
[2022-02-08 23:59:06,342 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-08 23:59:06,342 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-08 23:59:06,371 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-08 23:59:06,571 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-08 23:59:06,571 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-08 23:59:06,571 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973799799]
[2022-02-08 23:59:06,571 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973799799] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-08 23:59:06,571 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-08 23:59:06,572 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2022-02-08 23:59:06,572 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017796001]
[2022-02-08 23:59:06,572 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-08 23:59:06,572 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2022-02-08 23:59:06,572 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-08 23:59:06,572 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2022-02-08 23:59:06,572 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132
[2022-02-08 23:59:06,573 INFO  L87              Difference]: Start difference. First operand 7106 states and 23339 transitions. Second operand  has 12 states, 12 states have (on average 6.5) internal successors, (78), 12 states have internal predecessors, (78), 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)
[2022-02-08 23:59:06,860 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-08 23:59:06,861 INFO  L93              Difference]: Finished difference Result 7936 states and 26023 transitions.
[2022-02-08 23:59:06,861 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2022-02-08 23:59:06,861 INFO  L78                 Accepts]: Start accepts. Automaton has  has 12 states, 12 states have (on average 6.5) internal successors, (78), 12 states have internal predecessors, (78), 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 78
[2022-02-08 23:59:06,861 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-08 23:59:06,878 INFO  L225             Difference]: With dead ends: 7936
[2022-02-08 23:59:06,879 INFO  L226             Difference]: Without dead ends: 7036
[2022-02-08 23:59:06,879 INFO  L932         BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306
[2022-02-08 23:59:06,879 INFO  L933         BasicCegarLoop]: 136 mSDtfsCounter, 290 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-02-08 23:59:06,880 INFO  L934         BasicCegarLoop]: SdHoareTripleChecker [290 Valid, 782 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-02-08 23:59:06,892 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 7036 states.
[2022-02-08 23:59:07,010 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 7036 to 7036.
[2022-02-08 23:59:07,022 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 7036 states, 7035 states have (on average 3.2797441364605544) internal successors, (23073), 7035 states have internal predecessors, (23073), 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)
[2022-02-08 23:59:07,045 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7036 states to 7036 states and 23073 transitions.
[2022-02-08 23:59:07,045 INFO  L78                 Accepts]: Start accepts. Automaton has 7036 states and 23073 transitions. Word has length 78
[2022-02-08 23:59:07,046 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-08 23:59:07,046 INFO  L470      AbstractCegarLoop]: Abstraction has 7036 states and 23073 transitions.
[2022-02-08 23:59:07,046 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 12 states have (on average 6.5) internal successors, (78), 12 states have internal predecessors, (78), 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)
[2022-02-08 23:59:07,046 INFO  L276                IsEmpty]: Start isEmpty. Operand 7036 states and 23073 transitions.
[2022-02-08 23:59:07,057 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 79
[2022-02-08 23:59:07,057 INFO  L506         BasicCegarLoop]: Found error trace
[2022-02-08 23:59:07,057 INFO  L514         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-08 23:59:07,057 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2022-02-08 23:59:07,057 INFO  L402      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2022-02-08 23:59:07,058 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-08 23:59:07,058 INFO  L85        PathProgramCache]: Analyzing trace with hash -1319428366, now seen corresponding path program 1 times
[2022-02-08 23:59:07,058 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-08 23:59:07,058 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428113704]
[2022-02-08 23:59:07,058 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-08 23:59:07,058 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-08 23:59:07,083 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-08 23:59:07,172 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-08 23:59:07,172 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-08 23:59:07,172 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428113704]
[2022-02-08 23:59:07,172 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428113704] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-08 23:59:07,172 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-08 23:59:07,172 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2022-02-08 23:59:07,172 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293078187]
[2022-02-08 23:59:07,173 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-08 23:59:07,173 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2022-02-08 23:59:07,173 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-08 23:59:07,173 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2022-02-08 23:59:07,173 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2022-02-08 23:59:07,174 INFO  L87              Difference]: Start difference. First operand 7036 states and 23073 transitions. Second operand  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 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)
[2022-02-08 23:59:07,359 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-08 23:59:07,359 INFO  L93              Difference]: Finished difference Result 7570 states and 24737 transitions.
[2022-02-08 23:59:07,360 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2022-02-08 23:59:07,360 INFO  L78                 Accepts]: Start accepts. Automaton has  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 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 78
[2022-02-08 23:59:07,360 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-08 23:59:07,377 INFO  L225             Difference]: With dead ends: 7570
[2022-02-08 23:59:07,377 INFO  L226             Difference]: Without dead ends: 6770
[2022-02-08 23:59:07,377 INFO  L932         BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182
[2022-02-08 23:59:07,378 INFO  L933         BasicCegarLoop]: 139 mSDtfsCounter, 210 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-02-08 23:59:07,378 INFO  L934         BasicCegarLoop]: SdHoareTripleChecker [210 Valid, 666 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-02-08 23:59:07,390 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 6770 states.
[2022-02-08 23:59:07,472 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 6770 to 6756.
[2022-02-08 23:59:07,480 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6756 states, 6755 states have (on average 3.268541820873427) internal successors, (22079), 6755 states have internal predecessors, (22079), 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)
[2022-02-08 23:59:07,601 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6756 states to 6756 states and 22079 transitions.
[2022-02-08 23:59:07,601 INFO  L78                 Accepts]: Start accepts. Automaton has 6756 states and 22079 transitions. Word has length 78
[2022-02-08 23:59:07,601 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-08 23:59:07,601 INFO  L470      AbstractCegarLoop]: Abstraction has 6756 states and 22079 transitions.
[2022-02-08 23:59:07,602 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 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)
[2022-02-08 23:59:07,602 INFO  L276                IsEmpty]: Start isEmpty. Operand 6756 states and 22079 transitions.
[2022-02-08 23:59:07,613 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 80
[2022-02-08 23:59:07,613 INFO  L506         BasicCegarLoop]: Found error trace
[2022-02-08 23:59:07,613 INFO  L514         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-08 23:59:07,613 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2022-02-08 23:59:07,613 INFO  L402      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2022-02-08 23:59:07,614 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-08 23:59:07,614 INFO  L85        PathProgramCache]: Analyzing trace with hash 1422999360, now seen corresponding path program 1 times
[2022-02-08 23:59:07,614 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-08 23:59:07,614 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693716522]
[2022-02-08 23:59:07,614 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-08 23:59:07,614 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-08 23:59:07,635 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-08 23:59:07,751 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-08 23:59:07,751 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-08 23:59:07,751 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693716522]
[2022-02-08 23:59:07,751 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693716522] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-08 23:59:07,751 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-08 23:59:07,751 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2022-02-08 23:59:07,751 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342631411]
[2022-02-08 23:59:07,751 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-08 23:59:07,751 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2022-02-08 23:59:07,751 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-08 23:59:07,752 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2022-02-08 23:59:07,752 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2022-02-08 23:59:07,752 INFO  L87              Difference]: Start difference. First operand 6756 states and 22079 transitions. Second operand  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 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)
[2022-02-08 23:59:07,936 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-08 23:59:07,936 INFO  L93              Difference]: Finished difference Result 7978 states and 26101 transitions.
[2022-02-08 23:59:07,937 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2022-02-08 23:59:07,937 INFO  L78                 Accepts]: Start accepts. Automaton has  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 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 79
[2022-02-08 23:59:07,937 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-08 23:59:07,955 INFO  L225             Difference]: With dead ends: 7978
[2022-02-08 23:59:07,955 INFO  L226             Difference]: Without dead ends: 7228
[2022-02-08 23:59:07,955 INFO  L932         BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132
[2022-02-08 23:59:07,956 INFO  L933         BasicCegarLoop]: 161 mSDtfsCounter, 204 mSDsluCounter, 707 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 853 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-02-08 23:59:07,956 INFO  L934         BasicCegarLoop]: SdHoareTripleChecker [204 Valid, 853 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-02-08 23:59:07,968 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 7228 states.
[2022-02-08 23:59:08,058 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 7228 to 6738.
[2022-02-08 23:59:08,066 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6738 states, 6737 states have (on average 3.2700014843402108) internal successors, (22030), 6737 states have internal predecessors, (22030), 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)
[2022-02-08 23:59:08,084 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6738 states to 6738 states and 22030 transitions.
[2022-02-08 23:59:08,084 INFO  L78                 Accepts]: Start accepts. Automaton has 6738 states and 22030 transitions. Word has length 79
[2022-02-08 23:59:08,084 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-08 23:59:08,085 INFO  L470      AbstractCegarLoop]: Abstraction has 6738 states and 22030 transitions.
[2022-02-08 23:59:08,085 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 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)
[2022-02-08 23:59:08,085 INFO  L276                IsEmpty]: Start isEmpty. Operand 6738 states and 22030 transitions.
[2022-02-08 23:59:08,095 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 80
[2022-02-08 23:59:08,095 INFO  L506         BasicCegarLoop]: Found error trace
[2022-02-08 23:59:08,095 INFO  L514         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-08 23:59:08,096 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2022-02-08 23:59:08,096 INFO  L402      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2022-02-08 23:59:08,096 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-08 23:59:08,096 INFO  L85        PathProgramCache]: Analyzing trace with hash 2021462192, now seen corresponding path program 2 times
[2022-02-08 23:59:08,096 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-08 23:59:08,096 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246534354]
[2022-02-08 23:59:08,096 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-08 23:59:08,096 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-08 23:59:08,118 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-08 23:59:08,331 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-08 23:59:08,331 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-08 23:59:08,331 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246534354]
[2022-02-08 23:59:08,331 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246534354] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-08 23:59:08,331 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-08 23:59:08,331 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2022-02-08 23:59:08,332 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637330046]
[2022-02-08 23:59:08,332 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-08 23:59:08,332 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2022-02-08 23:59:08,332 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-08 23:59:08,332 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2022-02-08 23:59:08,332 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2022-02-08 23:59:08,332 INFO  L87              Difference]: Start difference. First operand 6738 states and 22030 transitions. Second operand  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 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)
[2022-02-08 23:59:08,543 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-08 23:59:08,543 INFO  L93              Difference]: Finished difference Result 7512 states and 24521 transitions.
[2022-02-08 23:59:08,544 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2022-02-08 23:59:08,544 INFO  L78                 Accepts]: Start accepts. Automaton has  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 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 79
[2022-02-08 23:59:08,544 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-08 23:59:08,559 INFO  L225             Difference]: With dead ends: 7512
[2022-02-08 23:59:08,559 INFO  L226             Difference]: Without dead ends: 6762
[2022-02-08 23:59:08,560 INFO  L932         BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210
[2022-02-08 23:59:08,560 INFO  L933         BasicCegarLoop]: 151 mSDtfsCounter, 192 mSDsluCounter, 692 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 821 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-02-08 23:59:08,560 INFO  L934         BasicCegarLoop]: SdHoareTripleChecker [192 Valid, 821 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-02-08 23:59:08,570 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 6762 states.
[2022-02-08 23:59:08,672 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 6762 to 6652.
[2022-02-08 23:59:08,682 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6652 states, 6651 states have (on average 3.269884227935649) internal successors, (21748), 6651 states have internal predecessors, (21748), 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)
[2022-02-08 23:59:08,702 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6652 states to 6652 states and 21748 transitions.
[2022-02-08 23:59:08,702 INFO  L78                 Accepts]: Start accepts. Automaton has 6652 states and 21748 transitions. Word has length 79
[2022-02-08 23:59:08,702 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-08 23:59:08,703 INFO  L470      AbstractCegarLoop]: Abstraction has 6652 states and 21748 transitions.
[2022-02-08 23:59:08,703 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 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)
[2022-02-08 23:59:08,703 INFO  L276                IsEmpty]: Start isEmpty. Operand 6652 states and 21748 transitions.
[2022-02-08 23:59:08,714 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 80
[2022-02-08 23:59:08,714 INFO  L506         BasicCegarLoop]: Found error trace
[2022-02-08 23:59:08,714 INFO  L514         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-08 23:59:08,714 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2022-02-08 23:59:08,714 INFO  L402      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2022-02-08 23:59:08,715 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-08 23:59:08,715 INFO  L85        PathProgramCache]: Analyzing trace with hash -2090667316, now seen corresponding path program 3 times
[2022-02-08 23:59:08,715 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-08 23:59:08,715 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027321318]
[2022-02-08 23:59:08,715 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-08 23:59:08,715 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-08 23:59:08,744 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-08 23:59:08,873 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-08 23:59:08,873 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-08 23:59:08,873 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027321318]
[2022-02-08 23:59:08,874 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027321318] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-08 23:59:08,874 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-08 23:59:08,874 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2022-02-08 23:59:08,874 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074411214]
[2022-02-08 23:59:08,874 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-08 23:59:08,874 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2022-02-08 23:59:08,874 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-08 23:59:08,875 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2022-02-08 23:59:08,875 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110
[2022-02-08 23:59:08,875 INFO  L87              Difference]: Start difference. First operand 6652 states and 21748 transitions. Second operand  has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 11 states have internal predecessors, (79), 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)
[2022-02-08 23:59:09,086 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-08 23:59:09,086 INFO  L93              Difference]: Finished difference Result 8082 states and 26211 transitions.
[2022-02-08 23:59:09,087 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2022-02-08 23:59:09,087 INFO  L78                 Accepts]: Start accepts. Automaton has  has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 11 states have internal predecessors, (79), 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 79
[2022-02-08 23:59:09,087 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-08 23:59:09,101 INFO  L225             Difference]: With dead ends: 8082
[2022-02-08 23:59:09,101 INFO  L226             Difference]: Without dead ends: 6332
[2022-02-08 23:59:09,101 INFO  L932         BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272
[2022-02-08 23:59:09,102 INFO  L933         BasicCegarLoop]: 137 mSDtfsCounter, 212 mSDsluCounter, 674 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-02-08 23:59:09,102 INFO  L934         BasicCegarLoop]: SdHoareTripleChecker [212 Valid, 787 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-02-08 23:59:09,112 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 6332 states.
[2022-02-08 23:59:09,207 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 6332 to 6198.
[2022-02-08 23:59:09,214 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6198 states, 6197 states have (on average 3.2465709214135874) internal successors, (20119), 6197 states have internal predecessors, (20119), 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)
[2022-02-08 23:59:09,232 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6198 states to 6198 states and 20119 transitions.
[2022-02-08 23:59:09,232 INFO  L78                 Accepts]: Start accepts. Automaton has 6198 states and 20119 transitions. Word has length 79
[2022-02-08 23:59:09,232 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-08 23:59:09,232 INFO  L470      AbstractCegarLoop]: Abstraction has 6198 states and 20119 transitions.
[2022-02-08 23:59:09,232 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 11 states have internal predecessors, (79), 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)
[2022-02-08 23:59:09,232 INFO  L276                IsEmpty]: Start isEmpty. Operand 6198 states and 20119 transitions.
[2022-02-08 23:59:09,241 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 81
[2022-02-08 23:59:09,241 INFO  L506         BasicCegarLoop]: Found error trace
[2022-02-08 23:59:09,242 INFO  L514         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-08 23:59:09,242 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2022-02-08 23:59:09,242 INFO  L402      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2022-02-08 23:59:09,242 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-08 23:59:09,242 INFO  L85        PathProgramCache]: Analyzing trace with hash -1178393424, now seen corresponding path program 1 times
[2022-02-08 23:59:09,242 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-08 23:59:09,242 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874431843]
[2022-02-08 23:59:09,242 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-08 23:59:09,243 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-08 23:59:09,264 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-08 23:59:09,409 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-08 23:59:09,409 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-08 23:59:09,409 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874431843]
[2022-02-08 23:59:09,409 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874431843] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-08 23:59:09,409 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-08 23:59:09,410 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2022-02-08 23:59:09,410 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635179340]
[2022-02-08 23:59:09,410 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-08 23:59:09,410 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2022-02-08 23:59:09,410 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-08 23:59:09,410 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2022-02-08 23:59:09,410 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110
[2022-02-08 23:59:09,411 INFO  L87              Difference]: Start difference. First operand 6198 states and 20119 transitions. Second operand  has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 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)
[2022-02-08 23:59:09,646 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-08 23:59:09,646 INFO  L93              Difference]: Finished difference Result 10088 states and 32460 transitions.
[2022-02-08 23:59:09,647 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2022-02-08 23:59:09,647 INFO  L78                 Accepts]: Start accepts. Automaton has  has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 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 80
[2022-02-08 23:59:09,647 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-08 23:59:09,665 INFO  L225             Difference]: With dead ends: 10088
[2022-02-08 23:59:09,665 INFO  L226             Difference]: Without dead ends: 6980
[2022-02-08 23:59:09,666 INFO  L932         BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272
[2022-02-08 23:59:09,666 INFO  L933         BasicCegarLoop]: 156 mSDtfsCounter, 254 mSDsluCounter, 742 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 883 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-02-08 23:59:09,666 INFO  L934         BasicCegarLoop]: SdHoareTripleChecker [254 Valid, 883 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-02-08 23:59:09,678 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 6980 states.
[2022-02-08 23:59:09,773 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 6980 to 6060.
[2022-02-08 23:59:09,781 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6060 states, 6059 states have (on average 3.1828684601419375) internal successors, (19285), 6059 states have internal predecessors, (19285), 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)
[2022-02-08 23:59:09,797 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6060 states to 6060 states and 19285 transitions.
[2022-02-08 23:59:09,797 INFO  L78                 Accepts]: Start accepts. Automaton has 6060 states and 19285 transitions. Word has length 80
[2022-02-08 23:59:09,797 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-08 23:59:09,797 INFO  L470      AbstractCegarLoop]: Abstraction has 6060 states and 19285 transitions.
[2022-02-08 23:59:09,797 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 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)
[2022-02-08 23:59:09,797 INFO  L276                IsEmpty]: Start isEmpty. Operand 6060 states and 19285 transitions.
[2022-02-08 23:59:09,806 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 81
[2022-02-08 23:59:09,806 INFO  L506         BasicCegarLoop]: Found error trace
[2022-02-08 23:59:09,806 INFO  L514         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-08 23:59:09,806 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2022-02-08 23:59:09,806 INFO  L402      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2022-02-08 23:59:09,807 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-08 23:59:09,807 INFO  L85        PathProgramCache]: Analyzing trace with hash -1240187384, now seen corresponding path program 2 times
[2022-02-08 23:59:09,807 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-08 23:59:09,807 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119294937]
[2022-02-08 23:59:09,807 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-08 23:59:09,807 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-08 23:59:09,831 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-08 23:59:10,022 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-08 23:59:10,022 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-08 23:59:10,022 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119294937]
[2022-02-08 23:59:10,022 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119294937] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-08 23:59:10,022 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-08 23:59:10,022 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2022-02-08 23:59:10,023 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845536510]
[2022-02-08 23:59:10,023 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-08 23:59:10,023 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2022-02-08 23:59:10,023 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-08 23:59:10,023 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2022-02-08 23:59:10,024 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132
[2022-02-08 23:59:10,024 INFO  L87              Difference]: Start difference. First operand 6060 states and 19285 transitions. Second operand  has 12 states, 12 states have (on average 6.666666666666667) internal successors, (80), 12 states have internal predecessors, (80), 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)
[2022-02-08 23:59:10,254 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-08 23:59:10,254 INFO  L93              Difference]: Finished difference Result 6724 states and 21347 transitions.
[2022-02-08 23:59:10,255 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2022-02-08 23:59:10,255 INFO  L78                 Accepts]: Start accepts. Automaton has  has 12 states, 12 states have (on average 6.666666666666667) internal successors, (80), 12 states have internal predecessors, (80), 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 80
[2022-02-08 23:59:10,255 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-08 23:59:10,267 INFO  L225             Difference]: With dead ends: 6724
[2022-02-08 23:59:10,267 INFO  L226             Difference]: Without dead ends: 5809
[2022-02-08 23:59:10,268 INFO  L932         BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306
[2022-02-08 23:59:10,268 INFO  L933         BasicCegarLoop]: 154 mSDtfsCounter, 277 mSDsluCounter, 799 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 931 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-02-08 23:59:10,270 INFO  L934         BasicCegarLoop]: SdHoareTripleChecker [277 Valid, 931 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-02-08 23:59:10,279 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 5809 states.
[2022-02-08 23:59:10,353 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 5809 to 5534.
[2022-02-08 23:59:10,359 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 5534 states, 5533 states have (on average 3.1885053316464846) internal successors, (17642), 5533 states have internal predecessors, (17642), 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)
[2022-02-08 23:59:10,372 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5534 states to 5534 states and 17642 transitions.
[2022-02-08 23:59:10,372 INFO  L78                 Accepts]: Start accepts. Automaton has 5534 states and 17642 transitions. Word has length 80
[2022-02-08 23:59:10,373 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-08 23:59:10,373 INFO  L470      AbstractCegarLoop]: Abstraction has 5534 states and 17642 transitions.
[2022-02-08 23:59:10,373 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 12 states have (on average 6.666666666666667) internal successors, (80), 12 states have internal predecessors, (80), 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)
[2022-02-08 23:59:10,373 INFO  L276                IsEmpty]: Start isEmpty. Operand 5534 states and 17642 transitions.
[2022-02-08 23:59:10,380 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 81
[2022-02-08 23:59:10,381 INFO  L506         BasicCegarLoop]: Found error trace
[2022-02-08 23:59:10,381 INFO  L514         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-08 23:59:10,381 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2022-02-08 23:59:10,381 INFO  L402      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2022-02-08 23:59:10,381 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-08 23:59:10,381 INFO  L85        PathProgramCache]: Analyzing trace with hash 132816748, now seen corresponding path program 3 times
[2022-02-08 23:59:10,381 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-08 23:59:10,382 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710396388]
[2022-02-08 23:59:10,382 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-08 23:59:10,382 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-08 23:59:10,407 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-08 23:59:10,593 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-08 23:59:10,593 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-08 23:59:10,593 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710396388]
[2022-02-08 23:59:10,593 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710396388] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-08 23:59:10,593 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-08 23:59:10,593 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2022-02-08 23:59:10,594 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193227958]
[2022-02-08 23:59:10,594 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-08 23:59:10,594 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2022-02-08 23:59:10,594 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-08 23:59:10,594 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2022-02-08 23:59:10,594 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156
[2022-02-08 23:59:10,594 INFO  L87              Difference]: Start difference. First operand 5534 states and 17642 transitions. Second operand  has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 13 states have internal predecessors, (80), 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)
[2022-02-08 23:59:10,821 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-08 23:59:10,821 INFO  L93              Difference]: Finished difference Result 6129 states and 19508 transitions.
[2022-02-08 23:59:10,822 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2022-02-08 23:59:10,822 INFO  L78                 Accepts]: Start accepts. Automaton has  has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 13 states have internal predecessors, (80), 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 80
[2022-02-08 23:59:10,822 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-08 23:59:10,833 INFO  L225             Difference]: With dead ends: 6129
[2022-02-08 23:59:10,833 INFO  L226             Difference]: Without dead ends: 4919
[2022-02-08 23:59:10,833 INFO  L932         BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342
[2022-02-08 23:59:10,834 INFO  L933         BasicCegarLoop]: 154 mSDtfsCounter, 386 mSDsluCounter, 841 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 973 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-02-08 23:59:10,834 INFO  L934         BasicCegarLoop]: SdHoareTripleChecker [386 Valid, 973 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-02-08 23:59:10,842 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4919 states.
[2022-02-08 23:59:10,909 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4919 to 4615.
[2022-02-08 23:59:10,914 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4615 states, 4614 states have (on average 3.2217165149544864) internal successors, (14865), 4614 states have internal predecessors, (14865), 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)
[2022-02-08 23:59:10,926 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4615 states to 4615 states and 14865 transitions.
[2022-02-08 23:59:10,927 INFO  L78                 Accepts]: Start accepts. Automaton has 4615 states and 14865 transitions. Word has length 80
[2022-02-08 23:59:10,927 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-08 23:59:10,927 INFO  L470      AbstractCegarLoop]: Abstraction has 4615 states and 14865 transitions.
[2022-02-08 23:59:10,927 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 13 states have internal predecessors, (80), 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)
[2022-02-08 23:59:10,927 INFO  L276                IsEmpty]: Start isEmpty. Operand 4615 states and 14865 transitions.
[2022-02-08 23:59:10,934 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 81
[2022-02-08 23:59:10,935 INFO  L506         BasicCegarLoop]: Found error trace
[2022-02-08 23:59:10,935 INFO  L514         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-08 23:59:10,935 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2022-02-08 23:59:10,935 INFO  L402      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2022-02-08 23:59:10,936 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-08 23:59:10,936 INFO  L85        PathProgramCache]: Analyzing trace with hash -1418684844, now seen corresponding path program 1 times
[2022-02-08 23:59:10,936 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-08 23:59:10,936 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696668076]
[2022-02-08 23:59:10,936 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-08 23:59:10,936 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-08 23:59:10,959 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-08 23:59:11,001 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-08 23:59:11,001 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-08 23:59:11,001 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696668076]
[2022-02-08 23:59:11,001 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696668076] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-08 23:59:11,001 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-08 23:59:11,001 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2022-02-08 23:59:11,002 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996523934]
[2022-02-08 23:59:11,002 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-08 23:59:11,002 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2022-02-08 23:59:11,002 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-08 23:59:11,002 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2022-02-08 23:59:11,002 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2022-02-08 23:59:11,002 INFO  L87              Difference]: Start difference. First operand 4615 states and 14865 transitions. Second operand  has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 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)
[2022-02-08 23:59:11,148 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-08 23:59:11,149 INFO  L93              Difference]: Finished difference Result 5653 states and 17864 transitions.
[2022-02-08 23:59:11,149 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2022-02-08 23:59:11,150 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 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 80
[2022-02-08 23:59:11,150 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-08 23:59:11,158 INFO  L225             Difference]: With dead ends: 5653
[2022-02-08 23:59:11,158 INFO  L226             Difference]: Without dead ends: 4013
[2022-02-08 23:59:11,159 INFO  L932         BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110
[2022-02-08 23:59:11,159 INFO  L933         BasicCegarLoop]: 106 mSDtfsCounter, 166 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-02-08 23:59:11,159 INFO  L934         BasicCegarLoop]: SdHoareTripleChecker [166 Valid, 383 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-02-08 23:59:11,165 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4013 states.
[2022-02-08 23:59:11,217 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4013 to 4013.
[2022-02-08 23:59:11,221 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4013 states, 4012 states have (on average 3.1547856430707877) internal successors, (12657), 4012 states have internal predecessors, (12657), 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)
[2022-02-08 23:59:11,231 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4013 states to 4013 states and 12657 transitions.
[2022-02-08 23:59:11,232 INFO  L78                 Accepts]: Start accepts. Automaton has 4013 states and 12657 transitions. Word has length 80
[2022-02-08 23:59:11,232 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-08 23:59:11,232 INFO  L470      AbstractCegarLoop]: Abstraction has 4013 states and 12657 transitions.
[2022-02-08 23:59:11,232 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 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)
[2022-02-08 23:59:11,232 INFO  L276                IsEmpty]: Start isEmpty. Operand 4013 states and 12657 transitions.
[2022-02-08 23:59:11,237 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 82
[2022-02-08 23:59:11,238 INFO  L506         BasicCegarLoop]: Found error trace
[2022-02-08 23:59:11,238 INFO  L514         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-08 23:59:11,238 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2022-02-08 23:59:11,238 INFO  L402      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2022-02-08 23:59:11,238 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-08 23:59:11,238 INFO  L85        PathProgramCache]: Analyzing trace with hash 299473415, now seen corresponding path program 1 times
[2022-02-08 23:59:11,239 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-08 23:59:11,239 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446282813]
[2022-02-08 23:59:11,239 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-08 23:59:11,239 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-08 23:59:11,261 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-08 23:59:11,306 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-08 23:59:11,306 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-08 23:59:11,306 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446282813]
[2022-02-08 23:59:11,306 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446282813] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-08 23:59:11,306 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-08 23:59:11,306 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2022-02-08 23:59:11,307 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95963527]
[2022-02-08 23:59:11,307 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-08 23:59:11,307 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2022-02-08 23:59:11,307 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-08 23:59:11,307 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2022-02-08 23:59:11,307 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2022-02-08 23:59:11,308 INFO  L87              Difference]: Start difference. First operand 4013 states and 12657 transitions. Second operand  has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 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)
[2022-02-08 23:59:11,453 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-08 23:59:11,453 INFO  L93              Difference]: Finished difference Result 4016 states and 12314 transitions.
[2022-02-08 23:59:11,454 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2022-02-08 23:59:11,454 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 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) Word has length 81
[2022-02-08 23:59:11,454 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-08 23:59:11,459 INFO  L225             Difference]: With dead ends: 4016
[2022-02-08 23:59:11,459 INFO  L226             Difference]: Without dead ends: 2690
[2022-02-08 23:59:11,460 INFO  L932         BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156
[2022-02-08 23:59:11,460 INFO  L933         BasicCegarLoop]: 106 mSDtfsCounter, 267 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-02-08 23:59:11,460 INFO  L934         BasicCegarLoop]: SdHoareTripleChecker [267 Valid, 417 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-02-08 23:59:11,464 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2690 states.
[2022-02-08 23:59:11,492 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2690 to 2690.
[2022-02-08 23:59:11,494 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2690 states, 2689 states have (on average 3.023428783934548) internal successors, (8130), 2689 states have internal predecessors, (8130), 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)
[2022-02-08 23:59:11,499 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2690 states to 2690 states and 8130 transitions.
[2022-02-08 23:59:11,499 INFO  L78                 Accepts]: Start accepts. Automaton has 2690 states and 8130 transitions. Word has length 81
[2022-02-08 23:59:11,499 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-08 23:59:11,500 INFO  L470      AbstractCegarLoop]: Abstraction has 2690 states and 8130 transitions.
[2022-02-08 23:59:11,500 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 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)
[2022-02-08 23:59:11,500 INFO  L276                IsEmpty]: Start isEmpty. Operand 2690 states and 8130 transitions.
[2022-02-08 23:59:11,503 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 84
[2022-02-08 23:59:11,503 INFO  L506         BasicCegarLoop]: Found error trace
[2022-02-08 23:59:11,503 INFO  L514         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-08 23:59:11,503 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2022-02-08 23:59:11,503 INFO  L402      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2022-02-08 23:59:11,503 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-08 23:59:11,504 INFO  L85        PathProgramCache]: Analyzing trace with hash -1986686010, now seen corresponding path program 1 times
[2022-02-08 23:59:11,504 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-08 23:59:11,504 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030930756]
[2022-02-08 23:59:11,504 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-08 23:59:11,504 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-08 23:59:11,526 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-08 23:59:11,574 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-08 23:59:11,575 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-08 23:59:11,575 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030930756]
[2022-02-08 23:59:11,575 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030930756] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-08 23:59:11,575 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-08 23:59:11,575 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2022-02-08 23:59:11,575 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843674721]
[2022-02-08 23:59:11,575 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-08 23:59:11,575 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2022-02-08 23:59:11,575 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-08 23:59:11,576 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2022-02-08 23:59:11,576 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2022-02-08 23:59:11,576 INFO  L87              Difference]: Start difference. First operand 2690 states and 8130 transitions. Second operand  has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 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)
[2022-02-08 23:59:11,712 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-08 23:59:11,712 INFO  L93              Difference]: Finished difference Result 2150 states and 6312 transitions.
[2022-02-08 23:59:11,713 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2022-02-08 23:59:11,713 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 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 83
[2022-02-08 23:59:11,713 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-08 23:59:11,715 INFO  L225             Difference]: With dead ends: 2150
[2022-02-08 23:59:11,715 INFO  L226             Difference]: Without dead ends: 878
[2022-02-08 23:59:11,715 INFO  L932         BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210
[2022-02-08 23:59:11,715 INFO  L933         BasicCegarLoop]: 98 mSDtfsCounter, 257 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-02-08 23:59:11,716 INFO  L934         BasicCegarLoop]: SdHoareTripleChecker [257 Valid, 402 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-02-08 23:59:11,717 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 878 states.
[2022-02-08 23:59:11,724 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 878.
[2022-02-08 23:59:11,725 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 878 states, 877 states have (on average 2.805017103762828) internal successors, (2460), 877 states have internal predecessors, (2460), 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)
[2022-02-08 23:59:11,726 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 2460 transitions.
[2022-02-08 23:59:11,726 INFO  L78                 Accepts]: Start accepts. Automaton has 878 states and 2460 transitions. Word has length 83
[2022-02-08 23:59:11,726 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2022-02-08 23:59:11,726 INFO  L470      AbstractCegarLoop]: Abstraction has 878 states and 2460 transitions.
[2022-02-08 23:59:11,727 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 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)
[2022-02-08 23:59:11,727 INFO  L276                IsEmpty]: Start isEmpty. Operand 878 states and 2460 transitions.
[2022-02-08 23:59:11,728 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 87
[2022-02-08 23:59:11,728 INFO  L506         BasicCegarLoop]: Found error trace
[2022-02-08 23:59:11,728 INFO  L514         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-08 23:59:11,728 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2022-02-08 23:59:11,728 INFO  L402      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2022-02-08 23:59:11,728 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-08 23:59:11,729 INFO  L85        PathProgramCache]: Analyzing trace with hash 696626580, now seen corresponding path program 1 times
[2022-02-08 23:59:11,729 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-08 23:59:11,729 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18481544]
[2022-02-08 23:59:11,729 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-08 23:59:11,729 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-08 23:59:11,755 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-02-08 23:59:11,756 INFO  L352             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2022-02-08 23:59:11,789 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-02-08 23:59:11,828 INFO  L138   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2022-02-08 23:59:11,828 INFO  L628         BasicCegarLoop]: Counterexample is feasible
[2022-02-08 23:59:11,829 INFO  L764   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining)
[2022-02-08 23:59:11,831 INFO  L764   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining)
[2022-02-08 23:59:11,831 INFO  L764   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (3 of 6 remaining)
[2022-02-08 23:59:11,831 INFO  L764   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (2 of 6 remaining)
[2022-02-08 23:59:11,831 INFO  L764   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (1 of 6 remaining)
[2022-02-08 23:59:11,832 INFO  L764   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining)
[2022-02-08 23:59:11,832 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2022-02-08 23:59:11,836 INFO  L732         BasicCegarLoop]: Path program histogram: [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-08 23:59:11,839 INFO  L230   ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2022-02-08 23:59:11,839 INFO  L180   ceAbstractionStarter]: Computing trace abstraction results
[2022-02-08 23:59:11,921 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 11:59:11 BasicIcfg
[2022-02-08 23:59:11,921 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2022-02-08 23:59:11,922 INFO  L158              Benchmark]: Toolchain (without parser) took 14454.11ms. Allocated memory was 177.2MB in the beginning and 3.0GB in the end (delta: 2.9GB). Free memory was 119.1MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 1.4GB. Max. memory is 8.0GB.
[2022-02-08 23:59:11,922 INFO  L158              Benchmark]: CDTParser took 0.12ms. Allocated memory is still 177.2MB. Free memory is still 136.9MB. There was no memory consumed. Max. memory is 8.0GB.
[2022-02-08 23:59:11,922 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 453.83ms. Allocated memory was 177.2MB in the beginning and 226.5MB in the end (delta: 49.3MB). Free memory was 119.0MB in the beginning and 184.2MB in the end (delta: -65.2MB). Peak memory consumption was 9.0MB. Max. memory is 8.0GB.
[2022-02-08 23:59:11,922 INFO  L158              Benchmark]: Boogie Procedure Inliner took 75.39ms. Allocated memory is still 226.5MB. Free memory was 184.2MB in the beginning and 181.0MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB.
[2022-02-08 23:59:11,922 INFO  L158              Benchmark]: Boogie Preprocessor took 53.85ms. Allocated memory is still 226.5MB. Free memory was 181.0MB in the beginning and 178.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB.
[2022-02-08 23:59:11,923 INFO  L158              Benchmark]: RCFGBuilder took 730.84ms. Allocated memory is still 226.5MB. Free memory was 178.9MB in the beginning and 107.1MB in the end (delta: 71.8MB). Peak memory consumption was 72.4MB. Max. memory is 8.0GB.
[2022-02-08 23:59:11,923 INFO  L158              Benchmark]: TraceAbstraction took 13134.76ms. Allocated memory was 226.5MB in the beginning and 3.0GB in the end (delta: 2.8GB). Free memory was 106.6MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB.
[2022-02-08 23:59:11,924 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.12ms. Allocated memory is still 177.2MB. Free memory is still 136.9MB. There was no memory consumed. Max. memory is 8.0GB.
 * CACSL2BoogieTranslator took 453.83ms. Allocated memory was 177.2MB in the beginning and 226.5MB in the end (delta: 49.3MB). Free memory was 119.0MB in the beginning and 184.2MB in the end (delta: -65.2MB). Peak memory consumption was 9.0MB. Max. memory is 8.0GB.
 * Boogie Procedure Inliner took 75.39ms. Allocated memory is still 226.5MB. Free memory was 184.2MB in the beginning and 181.0MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB.
 * Boogie Preprocessor took 53.85ms. Allocated memory is still 226.5MB. Free memory was 181.0MB in the beginning and 178.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB.
 * RCFGBuilder took 730.84ms. Allocated memory is still 226.5MB. Free memory was 178.9MB in the beginning and 107.1MB in the end (delta: 71.8MB). Peak memory consumption was 72.4MB. Max. memory is 8.0GB.
 * TraceAbstraction took 13134.76ms. Allocated memory was 226.5MB in the beginning and 3.0GB in the end (delta: 2.8GB). Free memory was 106.6MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: ErrorAutomatonStatistics
    NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s 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: 
[L709]               0  int __unbuffered_cnt = 0;
        VAL             [__unbuffered_cnt=0]
[L710]               0  _Bool main$tmp_guard0;
        VAL             [__unbuffered_cnt=0, main$tmp_guard0=0]
[L711]               0  _Bool main$tmp_guard1;
        VAL             [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0]
[L713]               0  int x = 0;
        VAL             [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0]
[L715]               0  int y = 0;
        VAL             [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0]
[L716]               0  _Bool y$flush_delayed;
        VAL             [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0]
[L717]               0  int y$mem_tmp;
        VAL             [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0]
[L718]               0  _Bool y$r_buff0_thd0;
        VAL             [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0]
[L719]               0  _Bool y$r_buff0_thd1;
        VAL             [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0]
[L720]               0  _Bool y$r_buff0_thd2;
        VAL             [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0]
[L721]               0  _Bool y$r_buff0_thd3;
        VAL             [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0]
[L722]               0  _Bool y$r_buff1_thd0;
        VAL             [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0]
[L723]               0  _Bool y$r_buff1_thd1;
        VAL             [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0]
[L724]               0  _Bool y$r_buff1_thd2;
        VAL             [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0]
[L725]               0  _Bool y$r_buff1_thd3;
        VAL             [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0]
[L726]               0  _Bool y$read_delayed;
        VAL             [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0]
[L727]               0  int *y$read_delayed_var;
        VAL             [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}]
[L728]               0  int y$w_buff0;
        VAL             [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0]
[L729]               0  _Bool y$w_buff0_used;
        VAL             [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0]
[L730]               0  int y$w_buff1;
        VAL             [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0]
[L731]               0  _Bool y$w_buff1_used;
        VAL             [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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]
[L733]               0  int z = 0;
        VAL             [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0]
[L734]               0  _Bool weak$$choice0;
        VAL             [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0]
[L735]               0  _Bool weak$$choice2;
        VAL             [__unbuffered_cnt=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0]
[L811]               0  pthread_t t2492;
        VAL             [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2492={5: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0]
[L812]  FCALL, FORK  0  pthread_create(&t2492, ((void *)0), P0, ((void *)0))
        VAL             [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2492, ((void *)0), P0, ((void *)0))=-2, t2492={5: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0]
[L813]               0  pthread_t t2493;
        VAL             [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2492={5:0}, t2493={6: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0]
[L814]  FCALL, FORK  0  pthread_create(&t2493, ((void *)0), P1, ((void *)0))
        VAL             [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2493, ((void *)0), P1, ((void *)0))=-1, t2492={5:0}, t2493={6: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0]
[L815]               0  pthread_t t2494;
        VAL             [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2492={5:0}, t2493={6:0}, t2494={3: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0]
[L816]  FCALL, FORK  0  pthread_create(&t2494, ((void *)0), P2, ((void *)0))
        VAL             [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2494, ((void *)0), P2, ((void *)0))=0, t2492={5:0}, t2493={6:0}, t2494={3: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0]
[L774]               3  y$w_buff1 = y$w_buff0
[L775]               3  y$w_buff0 = 2
[L776]               3  y$w_buff1_used = y$w_buff0_used
[L777]               3  y$w_buff0_used = (_Bool)1
[L778]  CALL         3  __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used))
[L18]   COND FALSE   3  !(!expression)
[L778]  RET          3  __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used))
[L779]               3  y$r_buff1_thd0 = y$r_buff0_thd0
[L780]               3  y$r_buff1_thd1 = y$r_buff0_thd1
[L781]               3  y$r_buff1_thd2 = y$r_buff0_thd2
[L782]               3  y$r_buff1_thd3 = y$r_buff0_thd3
[L783]               3  y$r_buff0_thd3 = (_Bool)1
        VAL             [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0]
[L786]               3  z = 1
        VAL             [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1]
[L739]               1  z = 2
        VAL             [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2]
[L742]               1  x = 1
        VAL             [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2]
[L747]               1  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2]
[L754]               2  x = 2
        VAL             [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2]
[L757]               2  y = 1
        VAL             [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2]
[L760]  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)
[L760]  EXPR         2  y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y
[L760]  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)
[L760]               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)
[L761]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used
[L761]               2  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used
[L762]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used
[L762]               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
[L763]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2
[L763]               2  y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2
[L764]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2
[L764]               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
[L767]               2  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2]
[L789]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y)
[L789]               3  y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y)
[L790]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used
[L790]               3  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used
[L791]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used
[L791]               3  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used
[L792]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3
[L792]               3  y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3
[L793]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3
[L793]               3  y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3
[L796]               3  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2]
[L818]               0  main$tmp_guard0 = __unbuffered_cnt == 3
        VAL             [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2492={5:0}, t2493={6:0}, t2494={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2]
[L820]  CALL         0  assume_abort_if_not(main$tmp_guard0)
[L3]    COND FALSE   0  !(!cond)
        VAL             [\old(cond)=1, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2]
[L820]  RET          0  assume_abort_if_not(main$tmp_guard0)
[L822]  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)
[L822]  EXPR         0  y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y
[L822]  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)
[L822]               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)
[L823]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used
[L823]               0  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used
[L824]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used
[L824]               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
[L825]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0
[L825]               0  y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0
[L826]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0
[L826]               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
[L829]               0  weak$$choice0 = __VERIFIER_nondet_bool()
[L830]               0  weak$$choice2 = __VERIFIER_nondet_bool()
[L831]               0  y$flush_delayed = weak$$choice2
[L832]               0  y$mem_tmp = y
[L833]  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)
[L833]               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)
[L834]  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))
[L834]  EXPR         0  !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)
[L834]  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))
[L834]               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))
[L835]  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))
[L835]  EXPR         0  !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)
[L835]  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))
[L835]               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))
[L836]  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))
[L836]  EXPR         0  !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)
[L836]  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))
[L836]               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))
[L837]  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))
[L837]  EXPR         0  !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)
[L837]  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))
[L837]               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))
[L838]  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))
[L838]  EXPR         0  !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)
[L838]  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))
[L838]               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))
[L839]  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))
[L839]  EXPR         0  !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)
[L839]  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))
[L839]               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))
[L840]               0  main$tmp_guard1 = !(x == 2 && y == 2 && z == 2)
[L841]  EXPR         0  y$flush_delayed ? y$mem_tmp : y
[L841]               0  y = y$flush_delayed ? y$mem_tmp : y
[L842]               0  y$flush_delayed = (_Bool)0
        VAL             [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2492={5:0}, t2493={6:0}, t2494={3:0}, weak$$choice0=49, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2]
[L844]  CALL         0  __VERIFIER_assert(main$tmp_guard1)
[L18]   COND TRUE    0  !expression
        VAL             [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2]
[L18]                0  reach_error()
        VAL             [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2]

  - 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: 812]: 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: 816]: 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: 814]: 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 7 procedures, 138 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 12.9s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.3s, AutomataDifference: 5.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.4s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4258 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4258 mSDsluCounter, 13485 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11327 mSDsCounter, 269 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2180 IncrementalHoareTripleChecker+Invalid, 2449 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 269 mSolverCounterUnsat, 2718 mSDtfsCounter, 2180 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 294 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 251 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 563 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12242occurred in iteration=0, InterpolantAutomatonStates: 230, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.4s AutomataMinimizationTime, 20 MinimizatonAttempts, 4697 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 1625 NumberOfCodeBlocks, 1625 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1519 ConstructedInterpolants, 0 QuantifiedInterpolants, 8697 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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!
[2022-02-08 23:59:11,949 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...