/usr/bin/java -Xmx16000000000 -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/mix027_tso.opt.i
--------------------------------------------------------------------------------
This is Ultimate 0.2.1-98707888a4ba860d5b57d27ee0e051c5b948cbbf-9870788
[2021-06-01 15:43:35,948 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2021-06-01 15:43:35,949 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2021-06-01 15:43:35,988 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2021-06-01 15:43:35,989 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2021-06-01 15:43:35,992 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2021-06-01 15:43:35,994 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2021-06-01 15:43:35,999 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2021-06-01 15:43:36,001 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2021-06-01 15:43:36,005 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2021-06-01 15:43:36,006 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2021-06-01 15:43:36,007 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2021-06-01 15:43:36,007 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2021-06-01 15:43:36,009 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2021-06-01 15:43:36,010 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2021-06-01 15:43:36,011 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2021-06-01 15:43:36,013 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2021-06-01 15:43:36,014 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2021-06-01 15:43:36,016 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2021-06-01 15:43:36,021 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2021-06-01 15:43:36,022 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2021-06-01 15:43:36,024 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2021-06-01 15:43:36,024 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2021-06-01 15:43:36,026 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2021-06-01 15:43:36,032 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2021-06-01 15:43:36,032 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2021-06-01 15:43:36,033 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2021-06-01 15:43:36,034 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2021-06-01 15:43:36,035 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2021-06-01 15:43:36,035 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2021-06-01 15:43:36,036 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2021-06-01 15:43:36,036 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2021-06-01 15:43:36,038 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2021-06-01 15:43:36,038 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2021-06-01 15:43:36,039 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2021-06-01 15:43:36,039 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2021-06-01 15:43:36,040 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2021-06-01 15:43:36,040 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2021-06-01 15:43:36,040 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2021-06-01 15:43:36,041 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2021-06-01 15:43:36,041 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2021-06-01 15:43:36,045 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
[2021-06-01 15:43:36,080 INFO L113 SettingsManager]: Loading preferences was successful
[2021-06-01 15:43:36,081 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2021-06-01 15:43:36,081 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2021-06-01 15:43:36,081 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2021-06-01 15:43:36,084 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2021-06-01 15:43:36,084 INFO L138 SettingsManager]: * Create parallel compositions if possible=false
[2021-06-01 15:43:36,084 INFO L138 SettingsManager]: * Use SBE=true
[2021-06-01 15:43:36,085 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2021-06-01 15:43:36,085 INFO L138 SettingsManager]: * sizeof long=4
[2021-06-01 15:43:36,085 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2021-06-01 15:43:36,085 INFO L138 SettingsManager]: * sizeof POINTER=4
[2021-06-01 15:43:36,086 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2021-06-01 15:43:36,086 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2021-06-01 15:43:36,086 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2021-06-01 15:43:36,086 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2021-06-01 15:43:36,086 INFO L138 SettingsManager]: * sizeof long double=12
[2021-06-01 15:43:36,086 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2021-06-01 15:43:36,087 INFO L138 SettingsManager]: * Use constant arrays=true
[2021-06-01 15:43:36,087 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2021-06-01 15:43:36,087 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2021-06-01 15:43:36,087 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2021-06-01 15:43:36,087 INFO L138 SettingsManager]: * To the following directory=./dump/
[2021-06-01 15:43:36,087 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2021-06-01 15:43:36,087 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2021-06-01 15:43:36,088 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2021-06-01 15:43:36,088 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2021-06-01 15:43:36,088 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2021-06-01 15:43:36,088 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL
[2021-06-01 15:43:36,088 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2021-06-01 15:43:36,088 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF
[2021-06-01 15:43:36,089 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2021-06-01 15:43:36,089 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
[2021-06-01 15:43:36,405 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2021-06-01 15:43:36,424 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2021-06-01 15:43:36,426 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2021-06-01 15:43:36,427 INFO L271 PluginConnector]: Initializing CDTParser...
[2021-06-01 15:43:36,428 INFO L275 PluginConnector]: CDTParser initialized
[2021-06-01 15:43:36,429 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix027_tso.opt.i
[2021-06-01 15:43:36,484 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6470e892c/5650c9117f6b44eaa2485076b7382faf/FLAG7fbe6de9e
[2021-06-01 15:43:36,993 INFO L306 CDTParser]: Found 1 translation units.
[2021-06-01 15:43:36,994 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix027_tso.opt.i
[2021-06-01 15:43:37,015 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6470e892c/5650c9117f6b44eaa2485076b7382faf/FLAG7fbe6de9e
[2021-06-01 15:43:37,285 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6470e892c/5650c9117f6b44eaa2485076b7382faf
[2021-06-01 15:43:37,287 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2021-06-01 15:43:37,288 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements.
[2021-06-01 15:43:37,292 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2021-06-01 15:43:37,292 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2021-06-01 15:43:37,296 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2021-06-01 15:43:37,296 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.06 03:43:37" (1/1) ...
[2021-06-01 15:43:37,297 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fb02b10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 03:43:37, skipping insertion in model container
[2021-06-01 15:43:37,297 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.06 03:43:37" (1/1) ...
[2021-06-01 15:43:37,306 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2021-06-01 15:43:37,342 INFO L178 MainTranslator]: Built tables and reachable declarations
[2021-06-01 15:43:37,497 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix027_tso.opt.i[948,961]
[2021-06-01 15:43:37,728 INFO L206 PostProcessor]: Analyzing one entry point: main
[2021-06-01 15:43:37,736 INFO L203 MainTranslator]: Completed pre-run
[2021-06-01 15:43:37,745 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix027_tso.opt.i[948,961]
[2021-06-01 15:43:37,795 INFO L206 PostProcessor]: Analyzing one entry point: main
[2021-06-01 15:43:37,861 INFO L208 MainTranslator]: Completed translation
[2021-06-01 15:43:37,862 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 03:43:37 WrapperNode
[2021-06-01 15:43:37,862 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2021-06-01 15:43:37,863 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2021-06-01 15:43:37,863 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner...
[2021-06-01 15:43:37,863 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized
[2021-06-01 15:43:37,868 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 03:43:37" (1/1) ...
[2021-06-01 15:43:37,882 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 03:43:37" (1/1) ...
[2021-06-01 15:43:37,915 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2021-06-01 15:43:37,916 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2021-06-01 15:43:37,916 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2021-06-01 15:43:37,916 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2021-06-01 15:43:37,923 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 03:43:37" (1/1) ...
[2021-06-01 15:43:37,923 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 03:43:37" (1/1) ...
[2021-06-01 15:43:37,927 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 03:43:37" (1/1) ...
[2021-06-01 15:43:37,928 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 03:43:37" (1/1) ...
[2021-06-01 15:43:37,939 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 03:43:37" (1/1) ...
[2021-06-01 15:43:37,951 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 03:43:37" (1/1) ...
[2021-06-01 15:43:37,954 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 03:43:37" (1/1) ...
[2021-06-01 15:43:37,959 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2021-06-01 15:43:37,959 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2021-06-01 15:43:37,959 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2021-06-01 15:43:37,960 INFO L275 PluginConnector]: RCFGBuilder initialized
[2021-06-01 15:43:37,960 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 03:43:37" (1/1) ...
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2021-06-01 15:43:38,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2021-06-01 15:43:38,035 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2021-06-01 15:43:38,035 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2021-06-01 15:43:38,035 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2021-06-01 15:43:38,035 INFO L130 BoogieDeclarations]: Found specification of procedure P0
[2021-06-01 15:43:38,036 INFO L138 BoogieDeclarations]: Found implementation of procedure P0
[2021-06-01 15:43:38,036 INFO L130 BoogieDeclarations]: Found specification of procedure P1
[2021-06-01 15:43:38,036 INFO L138 BoogieDeclarations]: Found implementation of procedure P1
[2021-06-01 15:43:38,036 INFO L130 BoogieDeclarations]: Found specification of procedure P2
[2021-06-01 15:43:38,036 INFO L138 BoogieDeclarations]: Found implementation of procedure P2
[2021-06-01 15:43:38,036 INFO L130 BoogieDeclarations]: Found specification of procedure P3
[2021-06-01 15:43:38,036 INFO L138 BoogieDeclarations]: Found implementation of procedure P3
[2021-06-01 15:43:38,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2021-06-01 15:43:38,037 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2021-06-01 15:43:38,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2021-06-01 15:43:38,037 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2021-06-01 15:43:38,038 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2021-06-01 15:43:39,877 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2021-06-01 15:43:39,878 INFO L299 CfgBuilder]: Removed 10 assume(true) statements.
[2021-06-01 15:43:39,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.06 03:43:39 BoogieIcfgContainer
[2021-06-01 15:43:39,880 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2021-06-01 15:43:39,881 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2021-06-01 15:43:39,881 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2021-06-01 15:43:39,883 INFO L275 PluginConnector]: TraceAbstraction initialized
[2021-06-01 15:43:39,883 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.06 03:43:37" (1/3) ...
[2021-06-01 15:43:39,884 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4886453c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.06 03:43:39, skipping insertion in model container
[2021-06-01 15:43:39,884 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 03:43:37" (2/3) ...
[2021-06-01 15:43:39,884 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4886453c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.06 03:43:39, skipping insertion in model container
[2021-06-01 15:43:39,885 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.06 03:43:39" (3/3) ...
[2021-06-01 15:43:39,886 INFO L111 eAbstractionObserver]: Analyzing ICFG mix027_tso.opt.i
[2021-06-01 15:43:39,891 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2021-06-01 15:43:39,891 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2021-06-01 15:43:39,892 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations.
[2021-06-01 15:43:39,892 INFO L471 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2021-06-01 15:43:39,925 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,926 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,926 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,926 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,926 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,926 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,926 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,927 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,927 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,927 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,927 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,927 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,927 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,927 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,928 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,928 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,928 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,928 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,928 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,929 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,929 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,929 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,929 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,930 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,930 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,930 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,930 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,930 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,931 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,931 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,931 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,931 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,931 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,931 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,931 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,932 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,932 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,932 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,932 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,932 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,932 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,933 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,933 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,933 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,933 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,933 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,933 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,933 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,934 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,934 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,934 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,934 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,934 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,934 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,935 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,935 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,935 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,935 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,936 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,936 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,936 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,936 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,936 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,936 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,937 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,937 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,937 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,937 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,937 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,937 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,937 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,938 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,938 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,938 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,938 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,938 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,938 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,939 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,939 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,939 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,939 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,939 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,940 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,940 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,940 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,940 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,940 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,940 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,940 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,941 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,941 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,941 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,941 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,941 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,941 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,942 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,942 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,942 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,942 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,942 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,942 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,943 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,943 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,944 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,944 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,944 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,944 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,944 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,945 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,945 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,945 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,945 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,947 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,947 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,947 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,947 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,947 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,948 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,948 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,948 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,948 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,948 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,950 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,950 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,950 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,950 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,950 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,950 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,951 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,951 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,951 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,951 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,952 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,952 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,952 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,953 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,953 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,953 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,953 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,953 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,953 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,953 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,955 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,955 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,955 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,955 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,955 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,955 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,955 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,955 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,956 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,956 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,956 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,956 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:39,957 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2021-06-01 15:43:39,976 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2021-06-01 15:43:39,992 INFO L378 AbstractCegarLoop]: Interprodecural is true
[2021-06-01 15:43:39,992 INFO L379 AbstractCegarLoop]: Hoare is false
[2021-06-01 15:43:39,992 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP
[2021-06-01 15:43:39,992 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2021-06-01 15:43:39,992 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2021-06-01 15:43:39,992 INFO L383 AbstractCegarLoop]: Difference is false
[2021-06-01 15:43:39,993 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2021-06-01 15:43:39,993 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == P1========
[2021-06-01 15:43:40,002 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 140 places, 129 transitions, 278 flow
[2021-06-01 15:44:18,649 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 154972 states, 154968 states have (on average 4.530522430437252) internal successors, (702086), 154971 states have internal predecessors, (702086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:44:18,864 INFO L276 IsEmpty]: Start isEmpty. Operand has 154972 states, 154968 states have (on average 4.530522430437252) internal successors, (702086), 154971 states have internal predecessors, (702086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:44:19,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2021-06-01 15:44:19,758 INFO L301 ceAbstractionStarter]: Result for error location P1 was SAFE (1/3)
[2021-06-01 15:44:19,760 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2021-06-01 15:44:19,774 INFO L378 AbstractCegarLoop]: Interprodecural is true
[2021-06-01 15:44:19,774 INFO L379 AbstractCegarLoop]: Hoare is false
[2021-06-01 15:44:19,774 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP
[2021-06-01 15:44:19,774 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2021-06-01 15:44:19,774 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2021-06-01 15:44:19,774 INFO L383 AbstractCegarLoop]: Difference is false
[2021-06-01 15:44:19,774 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2021-06-01 15:44:19,774 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == P1Thread1of1ForFork3========
[2021-06-01 15:44:19,787 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 140 places, 129 transitions, 278 flow
[2021-06-01 15:44:57,422 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 154972 states, 154968 states have (on average 4.530522430437252) internal successors, (702086), 154971 states have internal predecessors, (702086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:44:57,809 INFO L276 IsEmpty]: Start isEmpty. Operand has 154972 states, 154968 states have (on average 4.530522430437252) internal successors, (702086), 154971 states have internal predecessors, (702086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:44:57,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54
[2021-06-01 15:44:57,810 INFO L546 BasicCegarLoop]: Found error trace
[2021-06-01 15:44:57,811 INFO L554 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]
[2021-06-01 15:44:57,811 INFO L430 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 15:44:57,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 15:44:57,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1619171300, now seen corresponding path program 1 times
[2021-06-01 15:44:57,823 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 15:44:57,823 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870844307]
[2021-06-01 15:44:57,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 15:44:57,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 15:44:58,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-01 15:44:58,132 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 15:44:58,133 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870844307]
[2021-06-01 15:44:58,134 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870844307] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 15:44:58,134 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 15:44:58,134 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2021-06-01 15:44:58,135 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011386570]
[2021-06-01 15:44:58,138 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states
[2021-06-01 15:44:58,139 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 15:44:58,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-06-01 15:44:58,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-06-01 15:44:58,366 INFO L87 Difference]: Start difference. First operand has 154972 states, 154968 states have (on average 4.530522430437252) internal successors, (702086), 154971 states have internal predecessors, (702086), 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 26.5) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:45:00,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 15:45:00,362 INFO L93 Difference]: Finished difference Result 133156 states and 592165 transitions.
[2021-06-01 15:45:00,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2021-06-01 15:45:00,364 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 26.5) internal successors, (53), 3 states have internal predecessors, (53), 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 53
[2021-06-01 15:45:00,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 15:45:00,372 INFO L225 Difference]: With dead ends: 133156
[2021-06-01 15:45:00,373 INFO L226 Difference]: Without dead ends: 0
[2021-06-01 15:45:00,374 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-06-01 15:45:00,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2021-06-01 15:45:00,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2021-06-01 15:45:00,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:45:00,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2021-06-01 15:45:00,392 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 53
[2021-06-01 15:45:00,392 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-06-01 15:45:00,392 INFO L482 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2021-06-01 15:45:00,392 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 26.5) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:45:00,392 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2021-06-01 15:45:00,393 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2021-06-01 15:45:00,393 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2021-06-01 15:45:00,393 INFO L301 ceAbstractionStarter]: Result for error location P1Thread1of1ForFork3 was SAFE (2/3)
[2021-06-01 15:45:00,394 INFO L255 AbstractCegarLoop]: Starting to check reachability of 5 error locations.
[2021-06-01 15:45:00,395 INFO L378 AbstractCegarLoop]: Interprodecural is true
[2021-06-01 15:45:00,395 INFO L379 AbstractCegarLoop]: Hoare is false
[2021-06-01 15:45:00,395 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP
[2021-06-01 15:45:00,395 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2021-06-01 15:45:00,395 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2021-06-01 15:45:00,395 INFO L383 AbstractCegarLoop]: Difference is false
[2021-06-01 15:45:00,396 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2021-06-01 15:45:00,396 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.start========
[2021-06-01 15:45:00,397 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 140 places, 129 transitions, 278 flow
[2021-06-01 15:45:37,959 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 154972 states, 154968 states have (on average 4.530522430437252) internal successors, (702086), 154971 states have internal predecessors, (702086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:45:38,194 INFO L276 IsEmpty]: Start isEmpty. Operand has 154972 states, 154968 states have (on average 4.530522430437252) internal successors, (702086), 154971 states have internal predecessors, (702086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:45:38,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80
[2021-06-01 15:45:38,256 INFO L546 BasicCegarLoop]: Found error trace
[2021-06-01 15:45:38,257 INFO L554 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]
[2021-06-01 15:45:38,257 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 15:45:38,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 15:45:38,257 INFO L82 PathProgramCache]: Analyzing trace with hash -272929157, now seen corresponding path program 1 times
[2021-06-01 15:45:38,258 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 15:45:38,264 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037205843]
[2021-06-01 15:45:38,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 15:45:38,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 15:45:38,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-01 15:45:38,477 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 15:45:38,477 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037205843]
[2021-06-01 15:45:38,478 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037205843] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 15:45:38,478 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 15:45:38,479 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2021-06-01 15:45:38,479 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412374066]
[2021-06-01 15:45:38,480 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states
[2021-06-01 15:45:38,480 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 15:45:38,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-06-01 15:45:38,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2021-06-01 15:45:38,664 INFO L87 Difference]: Start difference. First operand has 154972 states, 154968 states have (on average 4.530522430437252) internal successors, (702086), 154971 states have internal predecessors, (702086), 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 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 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)
[2021-06-01 15:45:41,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 15:45:41,193 INFO L93 Difference]: Finished difference Result 224956 states and 1002002 transitions.
[2021-06-01 15:45:41,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2021-06-01 15:45:41,193 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 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
[2021-06-01 15:45:41,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 15:45:41,815 INFO L225 Difference]: With dead ends: 224956
[2021-06-01 15:45:41,815 INFO L226 Difference]: Without dead ends: 79804
[2021-06-01 15:45:41,816 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 98.4ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110
[2021-06-01 15:45:43,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79804 states.
[2021-06-01 15:45:45,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79804 to 79804.
[2021-06-01 15:45:45,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79804 states, 79802 states have (on average 4.395403623969324) internal successors, (350762), 79803 states have internal predecessors, (350762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:45:46,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79804 states to 79804 states and 350762 transitions.
[2021-06-01 15:45:46,434 INFO L78 Accepts]: Start accepts. Automaton has 79804 states and 350762 transitions. Word has length 79
[2021-06-01 15:45:46,435 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-06-01 15:45:46,435 INFO L482 AbstractCegarLoop]: Abstraction has 79804 states and 350762 transitions.
[2021-06-01 15:45:46,436 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 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)
[2021-06-01 15:45:46,436 INFO L276 IsEmpty]: Start isEmpty. Operand 79804 states and 350762 transitions.
[2021-06-01 15:45:46,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82
[2021-06-01 15:45:46,530 INFO L546 BasicCegarLoop]: Found error trace
[2021-06-01 15:45:46,530 INFO L554 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]
[2021-06-01 15:45:46,530 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2021-06-01 15:45:46,530 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 15:45:46,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 15:45:46,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1697585212, now seen corresponding path program 1 times
[2021-06-01 15:45:46,531 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 15:45:46,531 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879844415]
[2021-06-01 15:45:46,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 15:45:46,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 15:45:46,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-01 15:45:46,765 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 15:45:46,766 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879844415]
[2021-06-01 15:45:46,766 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879844415] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 15:45:46,766 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 15:45:46,766 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2021-06-01 15:45:46,766 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375151096]
[2021-06-01 15:45:46,767 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states
[2021-06-01 15:45:46,767 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 15:45:46,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-06-01 15:45:46,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2021-06-01 15:45:46,768 INFO L87 Difference]: Start difference. First operand 79804 states and 350762 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:45:47,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 15:45:47,974 INFO L93 Difference]: Finished difference Result 91036 states and 397214 transitions.
[2021-06-01 15:45:47,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2021-06-01 15:45:47,975 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 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
[2021-06-01 15:45:47,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 15:45:48,389 INFO L225 Difference]: With dead ends: 91036
[2021-06-01 15:45:48,389 INFO L226 Difference]: Without dead ends: 72028
[2021-06-01 15:45:48,390 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 78.5ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110
[2021-06-01 15:45:48,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72028 states.
[2021-06-01 15:45:50,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72028 to 72028.
[2021-06-01 15:45:50,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72028 states, 72026 states have (on average 4.373615083442091) internal successors, (315014), 72027 states have internal predecessors, (315014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:45:51,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72028 states to 72028 states and 315014 transitions.
[2021-06-01 15:45:51,570 INFO L78 Accepts]: Start accepts. Automaton has 72028 states and 315014 transitions. Word has length 81
[2021-06-01 15:45:51,585 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-06-01 15:45:51,585 INFO L482 AbstractCegarLoop]: Abstraction has 72028 states and 315014 transitions.
[2021-06-01 15:45:51,585 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:45:51,585 INFO L276 IsEmpty]: Start isEmpty. Operand 72028 states and 315014 transitions.
[2021-06-01 15:45:51,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83
[2021-06-01 15:45:51,719 INFO L546 BasicCegarLoop]: Found error trace
[2021-06-01 15:45:51,720 INFO L554 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]
[2021-06-01 15:45:51,720 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2021-06-01 15:45:51,720 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 15:45:51,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 15:45:51,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1253010600, now seen corresponding path program 1 times
[2021-06-01 15:45:51,721 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 15:45:51,721 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198571171]
[2021-06-01 15:45:51,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 15:45:51,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 15:45:51,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-01 15:45:51,934 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 15:45:51,934 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198571171]
[2021-06-01 15:45:51,934 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198571171] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 15:45:51,935 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 15:45:51,935 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2021-06-01 15:45:51,935 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597796514]
[2021-06-01 15:45:51,935 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states
[2021-06-01 15:45:51,935 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 15:45:51,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2021-06-01 15:45:51,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2021-06-01 15:45:51,936 INFO L87 Difference]: Start difference. First operand 72028 states and 315014 transitions. Second operand has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 9 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:45:53,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 15:45:53,267 INFO L93 Difference]: Finished difference Result 84391 states and 366383 transitions.
[2021-06-01 15:45:53,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2021-06-01 15:45:53,268 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 9 states have internal predecessors, (82), 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 82
[2021-06-01 15:45:53,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 15:45:53,671 INFO L225 Difference]: With dead ends: 84391
[2021-06-01 15:45:53,671 INFO L226 Difference]: Without dead ends: 70663
[2021-06-01 15:45:53,671 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 165.5ms TimeCoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272
[2021-06-01 15:45:54,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70663 states.
[2021-06-01 15:45:56,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70663 to 70663.
[2021-06-01 15:45:56,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70663 states, 70661 states have (on average 4.364147125005307) internal successors, (308375), 70662 states have internal predecessors, (308375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:45:56,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70663 states to 70663 states and 308375 transitions.
[2021-06-01 15:45:56,447 INFO L78 Accepts]: Start accepts. Automaton has 70663 states and 308375 transitions. Word has length 82
[2021-06-01 15:45:56,447 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-06-01 15:45:56,448 INFO L482 AbstractCegarLoop]: Abstraction has 70663 states and 308375 transitions.
[2021-06-01 15:45:56,448 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 9 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:45:56,448 INFO L276 IsEmpty]: Start isEmpty. Operand 70663 states and 308375 transitions.
[2021-06-01 15:45:56,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85
[2021-06-01 15:45:56,525 INFO L546 BasicCegarLoop]: Found error trace
[2021-06-01 15:45:56,525 INFO L554 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]
[2021-06-01 15:45:56,525 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2021-06-01 15:45:56,526 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 15:45:56,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 15:45:56,526 INFO L82 PathProgramCache]: Analyzing trace with hash -866758087, now seen corresponding path program 1 times
[2021-06-01 15:45:56,526 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 15:45:56,526 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049430904]
[2021-06-01 15:45:56,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 15:45:56,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 15:45:56,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-01 15:45:56,807 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 15:45:56,807 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049430904]
[2021-06-01 15:45:56,808 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049430904] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 15:45:56,808 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 15:45:56,808 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2021-06-01 15:45:56,808 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546544546]
[2021-06-01 15:45:56,808 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states
[2021-06-01 15:45:56,808 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 15:45:56,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2021-06-01 15:45:56,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156
[2021-06-01 15:45:56,809 INFO L87 Difference]: Start difference. First operand 70663 states and 308375 transitions. Second operand has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 13 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:45:58,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 15:45:58,117 INFO L93 Difference]: Finished difference Result 81415 states and 353019 transitions.
[2021-06-01 15:45:58,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states.
[2021-06-01 15:45:58,118 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 13 states have internal predecessors, (84), 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 84
[2021-06-01 15:45:58,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 15:45:58,392 INFO L225 Difference]: With dead ends: 81415
[2021-06-01 15:45:58,392 INFO L226 Difference]: Without dead ends: 69991
[2021-06-01 15:45:58,393 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 268.0ms TimeCoverageRelationStatistics Valid=134, Invalid=286, Unknown=0, NotChecked=0, Total=420
[2021-06-01 15:45:58,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69991 states.
[2021-06-01 15:46:00,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69991 to 69991.
[2021-06-01 15:46:00,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69991 states, 69989 states have (on average 4.3585563445684326) internal successors, (305051), 69990 states have internal predecessors, (305051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:46:01,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69991 states to 69991 states and 305051 transitions.
[2021-06-01 15:46:01,180 INFO L78 Accepts]: Start accepts. Automaton has 69991 states and 305051 transitions. Word has length 84
[2021-06-01 15:46:01,180 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-06-01 15:46:01,180 INFO L482 AbstractCegarLoop]: Abstraction has 69991 states and 305051 transitions.
[2021-06-01 15:46:01,181 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 13 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:46:01,181 INFO L276 IsEmpty]: Start isEmpty. Operand 69991 states and 305051 transitions.
[2021-06-01 15:46:01,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86
[2021-06-01 15:46:01,264 INFO L546 BasicCegarLoop]: Found error trace
[2021-06-01 15:46:01,264 INFO L554 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]
[2021-06-01 15:46:01,264 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2021-06-01 15:46:01,264 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 15:46:01,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 15:46:01,264 INFO L82 PathProgramCache]: Analyzing trace with hash -1709294041, now seen corresponding path program 1 times
[2021-06-01 15:46:01,264 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 15:46:01,265 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006499219]
[2021-06-01 15:46:01,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 15:46:01,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 15:46:01,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-01 15:46:01,450 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 15:46:01,450 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006499219]
[2021-06-01 15:46:01,450 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006499219] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 15:46:01,450 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 15:46:01,450 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2021-06-01 15:46:01,450 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774645013]
[2021-06-01 15:46:01,450 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states
[2021-06-01 15:46:01,451 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 15:46:01,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2021-06-01 15:46:01,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110
[2021-06-01 15:46:01,451 INFO L87 Difference]: Start difference. First operand 69991 states and 305051 transitions. Second operand has 11 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 11 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:46:02,249 WARN L205 SmtUtils]: Spent 453.00 ms on a formula simplification that was a NOOP. DAG size: 12
[2021-06-01 15:46:02,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 15:46:02,784 INFO L93 Difference]: Finished difference Result 83480 states and 362020 transitions.
[2021-06-01 15:46:02,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states.
[2021-06-01 15:46:02,785 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 11 states have internal predecessors, (85), 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 85
[2021-06-01 15:46:02,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 15:46:03,049 INFO L225 Difference]: With dead ends: 83480
[2021-06-01 15:46:03,050 INFO L226 Difference]: Without dead ends: 73176
[2021-06-01 15:46:03,050 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 678.4ms TimeCoverageRelationStatistics Valid=128, Invalid=252, Unknown=0, NotChecked=0, Total=380
[2021-06-01 15:46:03,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73176 states.
[2021-06-01 15:46:05,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73176 to 71544.
[2021-06-01 15:46:05,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71544 states, 71543 states have (on average 4.345973750052416) internal successors, (310924), 71543 states have internal predecessors, (310924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:46:05,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71544 states to 71544 states and 310924 transitions.
[2021-06-01 15:46:05,821 INFO L78 Accepts]: Start accepts. Automaton has 71544 states and 310924 transitions. Word has length 85
[2021-06-01 15:46:05,821 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-06-01 15:46:05,821 INFO L482 AbstractCegarLoop]: Abstraction has 71544 states and 310924 transitions.
[2021-06-01 15:46:05,821 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 11 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:46:05,821 INFO L276 IsEmpty]: Start isEmpty. Operand 71544 states and 310924 transitions.
[2021-06-01 15:46:05,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87
[2021-06-01 15:46:05,921 INFO L546 BasicCegarLoop]: Found error trace
[2021-06-01 15:46:05,921 INFO L554 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]
[2021-06-01 15:46:05,921 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2021-06-01 15:46:05,921 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 15:46:05,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 15:46:05,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1618434219, now seen corresponding path program 1 times
[2021-06-01 15:46:05,922 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 15:46:05,922 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55295601]
[2021-06-01 15:46:05,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 15:46:05,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 15:46:06,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-01 15:46:06,051 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 15:46:06,052 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55295601]
[2021-06-01 15:46:06,052 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55295601] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 15:46:06,052 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 15:46:06,052 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2021-06-01 15:46:06,052 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484822626]
[2021-06-01 15:46:06,053 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states
[2021-06-01 15:46:06,053 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 15:46:06,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-06-01 15:46:06,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2021-06-01 15:46:06,053 INFO L87 Difference]: Start difference. First operand 71544 states and 310924 transitions. Second operand has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:46:07,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 15:46:07,165 INFO L93 Difference]: Finished difference Result 88610 states and 380102 transitions.
[2021-06-01 15:46:07,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2021-06-01 15:46:07,165 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 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 86
[2021-06-01 15:46:07,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 15:46:07,409 INFO L225 Difference]: With dead ends: 88610
[2021-06-01 15:46:07,409 INFO L226 Difference]: Without dead ends: 65058
[2021-06-01 15:46:07,410 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 84.1ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110
[2021-06-01 15:46:07,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65058 states.
[2021-06-01 15:46:09,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65058 to 65058.
[2021-06-01 15:46:09,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65058 states, 65057 states have (on average 4.280769171649476) internal successors, (278494), 65057 states have internal predecessors, (278494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:46:09,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65058 states to 65058 states and 278494 transitions.
[2021-06-01 15:46:09,376 INFO L78 Accepts]: Start accepts. Automaton has 65058 states and 278494 transitions. Word has length 86
[2021-06-01 15:46:09,376 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-06-01 15:46:09,376 INFO L482 AbstractCegarLoop]: Abstraction has 65058 states and 278494 transitions.
[2021-06-01 15:46:09,376 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:46:09,376 INFO L276 IsEmpty]: Start isEmpty. Operand 65058 states and 278494 transitions.
[2021-06-01 15:46:10,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88
[2021-06-01 15:46:10,032 INFO L546 BasicCegarLoop]: Found error trace
[2021-06-01 15:46:10,032 INFO L554 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, 1]
[2021-06-01 15:46:10,033 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2021-06-01 15:46:10,033 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 15:46:10,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 15:46:10,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1287253463, now seen corresponding path program 1 times
[2021-06-01 15:46:10,033 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 15:46:10,033 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081572032]
[2021-06-01 15:46:10,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 15:46:10,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 15:46:10,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-01 15:46:10,141 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 15:46:10,142 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081572032]
[2021-06-01 15:46:10,142 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081572032] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 15:46:10,142 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 15:46:10,142 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2021-06-01 15:46:10,142 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948850301]
[2021-06-01 15:46:10,142 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states
[2021-06-01 15:46:10,142 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 15:46:10,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2021-06-01 15:46:10,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2021-06-01 15:46:10,143 INFO L87 Difference]: Start difference. First operand 65058 states and 278494 transitions. Second operand has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:46:10,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 15:46:10,630 INFO L93 Difference]: Finished difference Result 66462 states and 277876 transitions.
[2021-06-01 15:46:10,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2021-06-01 15:46:10,630 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 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 87
[2021-06-01 15:46:10,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 15:46:10,756 INFO L225 Difference]: With dead ends: 66462
[2021-06-01 15:46:10,756 INFO L226 Difference]: Without dead ends: 46590
[2021-06-01 15:46:10,756 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 91.6ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156
[2021-06-01 15:46:10,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46590 states.
[2021-06-01 15:46:12,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46590 to 44362.
[2021-06-01 15:46:12,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44362 states, 44361 states have (on average 4.124861928270327) internal successors, (182983), 44361 states have internal predecessors, (182983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:46:12,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44362 states to 44362 states and 182983 transitions.
[2021-06-01 15:46:12,397 INFO L78 Accepts]: Start accepts. Automaton has 44362 states and 182983 transitions. Word has length 87
[2021-06-01 15:46:12,398 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-06-01 15:46:12,398 INFO L482 AbstractCegarLoop]: Abstraction has 44362 states and 182983 transitions.
[2021-06-01 15:46:12,398 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:46:12,398 INFO L276 IsEmpty]: Start isEmpty. Operand 44362 states and 182983 transitions.
[2021-06-01 15:46:12,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91
[2021-06-01 15:46:12,468 INFO L546 BasicCegarLoop]: Found error trace
[2021-06-01 15:46:12,468 INFO L554 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, 1, 1, 1, 1]
[2021-06-01 15:46:12,468 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2021-06-01 15:46:12,468 INFO L430 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 15:46:12,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 15:46:12,469 INFO L82 PathProgramCache]: Analyzing trace with hash 767359199, now seen corresponding path program 1 times
[2021-06-01 15:46:12,469 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 15:46:12,469 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665616379]
[2021-06-01 15:46:12,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 15:46:12,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 15:46:12,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-01 15:46:12,587 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 15:46:12,587 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665616379]
[2021-06-01 15:46:12,587 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665616379] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 15:46:12,587 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 15:46:12,587 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2021-06-01 15:46:12,587 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271688646]
[2021-06-01 15:46:12,588 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states
[2021-06-01 15:46:12,588 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 15:46:12,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2021-06-01 15:46:12,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2021-06-01 15:46:12,588 INFO L87 Difference]: Start difference. First operand 44362 states and 182983 transitions. Second operand has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:46:13,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 15:46:13,486 INFO L93 Difference]: Finished difference Result 38440 states and 155512 transitions.
[2021-06-01 15:46:13,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2021-06-01 15:46:13,497 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 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 90
[2021-06-01 15:46:13,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 15:46:13,615 INFO L225 Difference]: With dead ends: 38440
[2021-06-01 15:46:13,615 INFO L226 Difference]: Without dead ends: 28000
[2021-06-01 15:46:13,615 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 121.7ms TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210
[2021-06-01 15:46:13,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28000 states.
[2021-06-01 15:46:14,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28000 to 25984.
[2021-06-01 15:46:14,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25984 states, 25983 states have (on average 3.9989608590232075) internal successors, (103905), 25983 states have internal predecessors, (103905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:46:14,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25984 states to 25984 states and 103905 transitions.
[2021-06-01 15:46:14,196 INFO L78 Accepts]: Start accepts. Automaton has 25984 states and 103905 transitions. Word has length 90
[2021-06-01 15:46:14,196 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-06-01 15:46:14,196 INFO L482 AbstractCegarLoop]: Abstraction has 25984 states and 103905 transitions.
[2021-06-01 15:46:14,196 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:46:14,196 INFO L276 IsEmpty]: Start isEmpty. Operand 25984 states and 103905 transitions.
[2021-06-01 15:46:14,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96
[2021-06-01 15:46:14,237 INFO L546 BasicCegarLoop]: Found error trace
[2021-06-01 15:46:14,237 INFO L554 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, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-01 15:46:14,237 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2021-06-01 15:46:14,237 INFO L430 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 15:46:14,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 15:46:14,237 INFO L82 PathProgramCache]: Analyzing trace with hash 871265229, now seen corresponding path program 1 times
[2021-06-01 15:46:14,238 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 15:46:14,238 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543608939]
[2021-06-01 15:46:14,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 15:46:14,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 15:46:14,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-01 15:46:14,411 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 15:46:14,411 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543608939]
[2021-06-01 15:46:14,411 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543608939] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 15:46:14,411 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 15:46:14,411 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2021-06-01 15:46:14,411 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874666363]
[2021-06-01 15:46:14,412 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states
[2021-06-01 15:46:14,412 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 15:46:14,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2021-06-01 15:46:14,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132
[2021-06-01 15:46:14,413 INFO L87 Difference]: Start difference. First operand 25984 states and 103905 transitions. Second operand has 12 states, 12 states have (on average 7.916666666666667) internal successors, (95), 12 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:46:15,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 15:46:15,854 INFO L93 Difference]: Finished difference Result 80912 states and 320892 transitions.
[2021-06-01 15:46:15,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states.
[2021-06-01 15:46:15,854 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.916666666666667) internal successors, (95), 12 states have internal predecessors, (95), 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 95
[2021-06-01 15:46:15,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 15:46:16,011 INFO L225 Difference]: With dead ends: 80912
[2021-06-01 15:46:16,011 INFO L226 Difference]: Without dead ends: 54599
[2021-06-01 15:46:16,012 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 392.6ms TimeCoverageRelationStatistics Valid=222, Invalid=534, Unknown=0, NotChecked=0, Total=756
[2021-06-01 15:46:16,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54599 states.
[2021-06-01 15:46:16,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54599 to 25984.
[2021-06-01 15:46:17,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25984 states, 25983 states have (on average 3.9483893314859717) internal successors, (102591), 25983 states have internal predecessors, (102591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:46:17,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25984 states to 25984 states and 102591 transitions.
[2021-06-01 15:46:17,107 INFO L78 Accepts]: Start accepts. Automaton has 25984 states and 102591 transitions. Word has length 95
[2021-06-01 15:46:17,107 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-06-01 15:46:17,107 INFO L482 AbstractCegarLoop]: Abstraction has 25984 states and 102591 transitions.
[2021-06-01 15:46:17,107 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 7.916666666666667) internal successors, (95), 12 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:46:17,108 INFO L276 IsEmpty]: Start isEmpty. Operand 25984 states and 102591 transitions.
[2021-06-01 15:46:17,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96
[2021-06-01 15:46:17,150 INFO L546 BasicCegarLoop]: Found error trace
[2021-06-01 15:46:17,150 INFO L554 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, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-01 15:46:17,150 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2021-06-01 15:46:17,150 INFO L430 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 15:46:17,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 15:46:17,151 INFO L82 PathProgramCache]: Analyzing trace with hash 819880593, now seen corresponding path program 2 times
[2021-06-01 15:46:17,151 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 15:46:17,151 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234740529]
[2021-06-01 15:46:17,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 15:46:17,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 15:46:17,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-01 15:46:17,442 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 15:46:17,443 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234740529]
[2021-06-01 15:46:17,443 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234740529] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 15:46:17,443 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 15:46:17,443 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15
[2021-06-01 15:46:17,443 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236927456]
[2021-06-01 15:46:17,443 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states
[2021-06-01 15:46:17,443 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 15:46:17,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2021-06-01 15:46:17,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210
[2021-06-01 15:46:17,444 INFO L87 Difference]: Start difference. First operand 25984 states and 102591 transitions. Second operand has 15 states, 15 states have (on average 6.333333333333333) internal successors, (95), 15 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:46:18,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 15:46:18,326 INFO L93 Difference]: Finished difference Result 62351 states and 242038 transitions.
[2021-06-01 15:46:18,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states.
[2021-06-01 15:46:18,326 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.333333333333333) internal successors, (95), 15 states have internal predecessors, (95), 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 95
[2021-06-01 15:46:18,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 15:46:18,455 INFO L225 Difference]: With dead ends: 62351
[2021-06-01 15:46:18,455 INFO L226 Difference]: Without dead ends: 44996
[2021-06-01 15:46:18,456 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 451.8ms TimeCoverageRelationStatistics Valid=162, Invalid=390, Unknown=0, NotChecked=0, Total=552
[2021-06-01 15:46:18,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44996 states.
[2021-06-01 15:46:19,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44996 to 28282.
[2021-06-01 15:46:19,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28282 states, 28281 states have (on average 3.907853329090202) internal successors, (110518), 28281 states have internal predecessors, (110518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:46:19,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28282 states to 28282 states and 110518 transitions.
[2021-06-01 15:46:19,637 INFO L78 Accepts]: Start accepts. Automaton has 28282 states and 110518 transitions. Word has length 95
[2021-06-01 15:46:19,637 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-06-01 15:46:19,637 INFO L482 AbstractCegarLoop]: Abstraction has 28282 states and 110518 transitions.
[2021-06-01 15:46:19,637 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 6.333333333333333) internal successors, (95), 15 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:46:19,637 INFO L276 IsEmpty]: Start isEmpty. Operand 28282 states and 110518 transitions.
[2021-06-01 15:46:19,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96
[2021-06-01 15:46:19,687 INFO L546 BasicCegarLoop]: Found error trace
[2021-06-01 15:46:19,687 INFO L554 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, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-01 15:46:19,687 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2021-06-01 15:46:19,687 INFO L430 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 15:46:19,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 15:46:19,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1475251078, now seen corresponding path program 1 times
[2021-06-01 15:46:19,688 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 15:46:19,688 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248963526]
[2021-06-01 15:46:19,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 15:46:19,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 15:46:19,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-01 15:46:19,780 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 15:46:19,780 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248963526]
[2021-06-01 15:46:19,780 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248963526] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 15:46:19,780 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 15:46:19,780 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2021-06-01 15:46:19,780 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572912624]
[2021-06-01 15:46:19,780 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states
[2021-06-01 15:46:19,781 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 15:46:19,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-06-01 15:46:19,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2021-06-01 15:46:19,781 INFO L87 Difference]: Start difference. First operand 28282 states and 110518 transitions. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:46:20,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 15:46:20,085 INFO L93 Difference]: Finished difference Result 43558 states and 170214 transitions.
[2021-06-01 15:46:20,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2021-06-01 15:46:20,086 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 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 95
[2021-06-01 15:46:20,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 15:46:20,171 INFO L225 Difference]: With dead ends: 43558
[2021-06-01 15:46:20,171 INFO L226 Difference]: Without dead ends: 27616
[2021-06-01 15:46:20,172 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 57.2ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72
[2021-06-01 15:46:20,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27616 states.
[2021-06-01 15:46:21,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27616 to 26806.
[2021-06-01 15:46:21,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26806 states, 26805 states have (on average 3.846595784368588) internal successors, (103108), 26805 states have internal predecessors, (103108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:46:21,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26806 states to 26806 states and 103108 transitions.
[2021-06-01 15:46:21,144 INFO L78 Accepts]: Start accepts. Automaton has 26806 states and 103108 transitions. Word has length 95
[2021-06-01 15:46:21,145 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-06-01 15:46:21,145 INFO L482 AbstractCegarLoop]: Abstraction has 26806 states and 103108 transitions.
[2021-06-01 15:46:21,145 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:46:21,145 INFO L276 IsEmpty]: Start isEmpty. Operand 26806 states and 103108 transitions.
[2021-06-01 15:46:21,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96
[2021-06-01 15:46:21,185 INFO L546 BasicCegarLoop]: Found error trace
[2021-06-01 15:46:21,185 INFO L554 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, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-01 15:46:21,185 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2021-06-01 15:46:21,186 INFO L430 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 15:46:21,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 15:46:21,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1397768286, now seen corresponding path program 2 times
[2021-06-01 15:46:21,186 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 15:46:21,186 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248570017]
[2021-06-01 15:46:21,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 15:46:21,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 15:46:21,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-01 15:46:21,301 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 15:46:21,302 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248570017]
[2021-06-01 15:46:21,302 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248570017] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 15:46:21,302 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 15:46:21,302 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2021-06-01 15:46:21,302 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422791958]
[2021-06-01 15:46:21,302 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states
[2021-06-01 15:46:21,302 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 15:46:21,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2021-06-01 15:46:21,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2021-06-01 15:46:21,303 INFO L87 Difference]: Start difference. First operand 26806 states and 103108 transitions. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:46:21,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 15:46:21,602 INFO L93 Difference]: Finished difference Result 23080 states and 88096 transitions.
[2021-06-01 15:46:21,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2021-06-01 15:46:21,603 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 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 95
[2021-06-01 15:46:21,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 15:46:21,629 INFO L225 Difference]: With dead ends: 23080
[2021-06-01 15:46:21,629 INFO L226 Difference]: Without dead ends: 8626
[2021-06-01 15:46:21,629 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 129.2ms TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272
[2021-06-01 15:46:21,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8626 states.
[2021-06-01 15:46:21,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8626 to 8050.
[2021-06-01 15:46:21,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8050 states, 8049 states have (on average 3.7819604919865824) internal successors, (30441), 8049 states have internal predecessors, (30441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:46:21,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8050 states to 8050 states and 30441 transitions.
[2021-06-01 15:46:21,806 INFO L78 Accepts]: Start accepts. Automaton has 8050 states and 30441 transitions. Word has length 95
[2021-06-01 15:46:21,806 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-06-01 15:46:21,806 INFO L482 AbstractCegarLoop]: Abstraction has 8050 states and 30441 transitions.
[2021-06-01 15:46:21,806 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:46:21,807 INFO L276 IsEmpty]: Start isEmpty. Operand 8050 states and 30441 transitions.
[2021-06-01 15:46:21,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101
[2021-06-01 15:46:21,819 INFO L546 BasicCegarLoop]: Found error trace
[2021-06-01 15:46:21,819 INFO L554 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-01 15:46:21,820 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2021-06-01 15:46:21,820 INFO L430 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 15:46:21,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 15:46:21,820 INFO L82 PathProgramCache]: Analyzing trace with hash 668293744, now seen corresponding path program 1 times
[2021-06-01 15:46:21,820 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 15:46:21,820 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601386449]
[2021-06-01 15:46:21,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 15:46:22,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 15:46:22,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-01 15:46:22,414 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 15:46:22,414 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601386449]
[2021-06-01 15:46:22,414 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601386449] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 15:46:22,414 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 15:46:22,414 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2021-06-01 15:46:22,414 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758661433]
[2021-06-01 15:46:22,414 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states
[2021-06-01 15:46:22,414 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 15:46:22,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2021-06-01 15:46:22,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2021-06-01 15:46:22,415 INFO L87 Difference]: Start difference. First operand 8050 states and 30441 transitions. Second operand has 10 states, 10 states have (on average 10.0) internal successors, (100), 10 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:46:22,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 15:46:22,723 INFO L93 Difference]: Finished difference Result 10810 states and 40981 transitions.
[2021-06-01 15:46:22,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2021-06-01 15:46:22,724 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.0) internal successors, (100), 10 states have internal predecessors, (100), 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 100
[2021-06-01 15:46:22,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 15:46:22,766 INFO L225 Difference]: With dead ends: 10810
[2021-06-01 15:46:22,766 INFO L226 Difference]: Without dead ends: 8464
[2021-06-01 15:46:22,766 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 171.1ms TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156
[2021-06-01 15:46:22,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8464 states.
[2021-06-01 15:46:22,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8464 to 7186.
[2021-06-01 15:46:22,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7186 states, 7185 states have (on average 3.7356993736951982) internal successors, (26841), 7185 states have internal predecessors, (26841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:46:22,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7186 states to 7186 states and 26841 transitions.
[2021-06-01 15:46:22,968 INFO L78 Accepts]: Start accepts. Automaton has 7186 states and 26841 transitions. Word has length 100
[2021-06-01 15:46:22,968 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-06-01 15:46:22,968 INFO L482 AbstractCegarLoop]: Abstraction has 7186 states and 26841 transitions.
[2021-06-01 15:46:22,968 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 10.0) internal successors, (100), 10 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:46:22,968 INFO L276 IsEmpty]: Start isEmpty. Operand 7186 states and 26841 transitions.
[2021-06-01 15:46:22,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101
[2021-06-01 15:46:22,984 INFO L546 BasicCegarLoop]: Found error trace
[2021-06-01 15:46:22,984 INFO L554 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-01 15:46:22,984 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2021-06-01 15:46:22,984 INFO L430 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 15:46:22,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 15:46:22,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1298197104, now seen corresponding path program 2 times
[2021-06-01 15:46:22,984 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 15:46:22,985 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829688446]
[2021-06-01 15:46:22,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 15:46:23,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-06-01 15:46:23,099 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-06-01 15:46:23,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-06-01 15:46:23,147 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-06-01 15:46:23,218 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2021-06-01 15:46:23,218 INFO L655 BasicCegarLoop]: Counterexample might be feasible
[2021-06-01 15:46:23,218 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2021-06-01 15:46:23,218 INFO L301 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (3/3)
[2021-06-01 15:46:23,232 INFO L247 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2021-06-01 15:46:23,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.06 03:46:23 BasicIcfg
[2021-06-01 15:46:23,510 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2021-06-01 15:46:23,510 INFO L168 Benchmark]: Toolchain (without parser) took 166222.19 ms. Allocated memory was 362.8 MB in the beginning and 14.8 GB in the end (delta: 14.5 GB). Free memory was 324.9 MB in the beginning and 7.6 GB in the end (delta: -7.3 GB). Peak memory consumption was 7.2 GB. Max. memory is 16.0 GB.
[2021-06-01 15:46:23,516 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 362.8 MB. Free memory was 342.9 MB in the beginning and 342.8 MB in the end (delta: 65.7 kB). There was no memory consumed. Max. memory is 16.0 GB.
[2021-06-01 15:46:23,516 INFO L168 Benchmark]: CACSL2BoogieTranslator took 570.00 ms. Allocated memory is still 362.8 MB. Free memory was 324.7 MB in the beginning and 320.5 MB in the end (delta: 4.3 MB). Peak memory consumption was 7.3 MB. Max. memory is 16.0 GB.
[2021-06-01 15:46:23,516 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.38 ms. Allocated memory is still 362.8 MB. Free memory was 320.5 MB in the beginning and 317.2 MB in the end (delta: 3.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB.
[2021-06-01 15:46:23,516 INFO L168 Benchmark]: Boogie Preprocessor took 43.08 ms. Allocated memory is still 362.8 MB. Free memory was 317.2 MB in the beginning and 314.8 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB.
[2021-06-01 15:46:23,516 INFO L168 Benchmark]: RCFGBuilder took 1920.26 ms. Allocated memory is still 362.8 MB. Free memory was 314.8 MB in the beginning and 198.3 MB in the end (delta: 116.5 MB). Peak memory consumption was 120.6 MB. Max. memory is 16.0 GB.
[2021-06-01 15:46:23,517 INFO L168 Benchmark]: TraceAbstraction took 163628.86 ms. Allocated memory was 362.8 MB in the beginning and 14.8 GB in the end (delta: 14.5 GB). Free memory was 197.6 MB in the beginning and 7.6 GB in the end (delta: -7.4 GB). Peak memory consumption was 7.1 GB. Max. memory is 16.0 GB.
[2021-06-01 15:46:23,520 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.16 ms. Allocated memory is still 362.8 MB. Free memory was 342.9 MB in the beginning and 342.8 MB in the end (delta: 65.7 kB). There was no memory consumed. Max. memory is 16.0 GB.
* CACSL2BoogieTranslator took 570.00 ms. Allocated memory is still 362.8 MB. Free memory was 324.7 MB in the beginning and 320.5 MB in the end (delta: 4.3 MB). Peak memory consumption was 7.3 MB. Max. memory is 16.0 GB.
* Boogie Procedure Inliner took 52.38 ms. Allocated memory is still 362.8 MB. Free memory was 320.5 MB in the beginning and 317.2 MB in the end (delta: 3.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB.
* Boogie Preprocessor took 43.08 ms. Allocated memory is still 362.8 MB. Free memory was 317.2 MB in the beginning and 314.8 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB.
* RCFGBuilder took 1920.26 ms. Allocated memory is still 362.8 MB. Free memory was 314.8 MB in the beginning and 198.3 MB in the end (delta: 116.5 MB). Peak memory consumption was 120.6 MB. Max. memory is 16.0 GB.
* TraceAbstraction took 163628.86 ms. Allocated memory was 362.8 MB in the beginning and 14.8 GB in the end (delta: 14.5 GB). Free memory was 197.6 MB in the beginning and 7.6 GB in the end (delta: -7.4 GB). Peak memory consumption was 7.1 GB. Max. memory is 16.0 GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- PositiveResult [Line: 18]: call to reach_error is unreachable
For all program executions holds that call to reach_error is unreachable at this location
- CounterExampleResult [Line: 18]: a call to reach_error is reachable
a call to reach_error is reachable
We found a FailurePath:
[L710] 0 int __unbuffered_cnt = 0;
VAL [__unbuffered_cnt=0]
[L712] 0 int __unbuffered_p1_EAX = 0;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0]
[L714] 0 int __unbuffered_p3_EAX = 0;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0]
[L716] 0 int __unbuffered_p3_EBX = 0;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0]
[L718] 0 int a = 0;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0]
[L719] 0 _Bool main$tmp_guard0;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0]
[L720] 0 _Bool main$tmp_guard1;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0]
[L722] 0 int x = 0;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0]
[L723] 0 _Bool x$flush_delayed;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0]
[L724] 0 int x$mem_tmp;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0]
[L725] 0 _Bool x$r_buff0_thd0;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0]
[L726] 0 _Bool x$r_buff0_thd1;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0]
[L727] 0 _Bool x$r_buff0_thd2;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0]
[L728] 0 _Bool x$r_buff0_thd3;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0]
[L729] 0 _Bool x$r_buff0_thd4;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0]
[L730] 0 _Bool x$r_buff1_thd0;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0]
[L731] 0 _Bool x$r_buff1_thd1;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0]
[L732] 0 _Bool x$r_buff1_thd2;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0]
[L733] 0 _Bool x$r_buff1_thd3;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0]
[L734] 0 _Bool x$r_buff1_thd4;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0]
[L735] 0 _Bool x$read_delayed;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0]
[L736] 0 int *x$read_delayed_var;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}]
[L737] 0 int x$w_buff0;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0]
[L738] 0 _Bool x$w_buff0_used;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0]
[L739] 0 int x$w_buff1;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0]
[L740] 0 _Bool x$w_buff1_used;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0]
[L742] 0 int y = 0;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0]
[L744] 0 int z = 0;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L745] 0 _Bool weak$$choice0;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L746] 0 _Bool weak$$choice2;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L851] 0 pthread_t t741;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L852] FCALL, FORK 0 pthread_create(&t741, ((void *)0), P0, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L853] 0 pthread_t t742;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L854] FCALL, FORK 0 pthread_create(&t742, ((void *)0), P1, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L770] 2 x$w_buff1 = x$w_buff0
[L771] 2 x$w_buff0 = 2
[L772] 2 x$w_buff1_used = x$w_buff0_used
[L773] 2 x$w_buff0_used = (_Bool)1
[L18] COND FALSE 2 !(!expression)
[L775] 2 x$r_buff1_thd0 = x$r_buff0_thd0
[L776] 2 x$r_buff1_thd1 = x$r_buff0_thd1
[L777] 2 x$r_buff1_thd2 = x$r_buff0_thd2
[L778] 2 x$r_buff1_thd3 = x$r_buff0_thd3
[L779] 2 x$r_buff1_thd4 = x$r_buff0_thd4
[L780] 2 x$r_buff0_thd2 = (_Bool)1
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L783] 2 __unbuffered_p1_EAX = y
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L855] 0 pthread_t t743;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L856] FCALL, FORK 0 pthread_create(&t743, ((void *)0), P2, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L857] 0 pthread_t t744;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L858] FCALL, FORK 0 pthread_create(&t744, ((void *)0), P3, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L800] 3 y = 1
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, 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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0]
[L803] 3 z = 1
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, 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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1]
[L806] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x)
[L806] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x
[L806] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x)
[L806] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x)
[L807] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used
[L807] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used
[L808] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used
[L808] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used
[L809] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3
[L809] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3
[L810] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3
[L810] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3
[L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, 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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1]
[L820] 4 z = 2
VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, 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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2]
[L823] 4 __unbuffered_p3_EAX = z
VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, 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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2]
[L826] 4 __unbuffered_p3_EBX = a
VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, 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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2]
[L829] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x)
[L829] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x
[L829] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x)
[L829] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x)
[L830] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used
[L830] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used
[L831] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used
[L831] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used
[L832] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4
[L832] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4
[L833] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4
[L833] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4
[L836] 4 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, 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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2]
[L750] 1 a = 1
VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, 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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2]
[L753] 1 x = 1
VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, 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=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2]
[L756] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x)
[L756] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x
[L756] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x)
[L756] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x)
[L757] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used
[L757] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used
[L758] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used
[L758] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used
[L759] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1
[L759] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1
[L760] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1
[L760] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1
[L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, 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=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2]
[L786] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)
[L786] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)
[L787] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used
[L787] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used
[L788] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used
[L788] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used
[L789] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2
[L789] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2
[L790] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2
[L790] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2
[L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2]
[L860] 0 main$tmp_guard0 = __unbuffered_cnt == 4
VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2]
[L3] COND FALSE 0 !(!cond)
VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2]
[L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x)
[L864] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x
[L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x)
[L864] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x)
[L865] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used
[L865] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used
[L866] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used
[L866] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used
[L867] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0
[L867] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0
[L868] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0
[L868] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0
[L871] 0 weak$$choice0 = __VERIFIER_nondet_bool()
[L872] 0 weak$$choice2 = __VERIFIER_nondet_bool()
[L873] 0 x$flush_delayed = weak$$choice2
[L874] 0 x$mem_tmp = x
[L875] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1)
[L875] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1)
[L876] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0))
[L876] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)
[L876] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0))
[L876] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0))
[L877] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1))
[L877] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)
[L877] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1))
[L877] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1))
[L878] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used))
[L878] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)
[L878] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used))
[L878] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used))
[L879] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L879] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)
[L879] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L879] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L880] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0))
[L880] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)
[L880] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0))
[L880] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0))
[L881] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L881] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)
[L881] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L881] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L882] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0)
[L883] EXPR 0 x$flush_delayed ? x$mem_tmp : x
[L883] 0 x = x$flush_delayed ? x$mem_tmp : x
[L884] 0 x$flush_delayed = (_Bool)0
VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2]
[L18] COND TRUE 0 !expression
VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2]
[L18] 0 reach_error()
VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2]
- StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: P1 with 1 thread instances
CFG has 9 procedures, 166 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 39768.4ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 1108.6ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 38656.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=154972occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available
- StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: P1Thread1of1ForFork3 with 1 thread instances
CFG has 9 procedures, 166 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 40619.5ms, OverallIterations: 1, TraceHistogramMax: 1, EmptinessCheckTime: 373.8ms, AutomataDifference: 2234.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 37662.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 115 SDtfs, 58 SDslu, 92 SDs, 0 SdLazy, 13 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 33.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=154972occurred in iteration=0, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 7.4ms AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 10.3ms SsaConstructionTime, 75.5ms SatisfiabilityAnalysisTime, 159.1ms InterpolantComputationTime, 53 NumberOfCodeBlocks, 53 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 52 ConstructedInterpolants, 0 QuantifiedInterpolants, 96 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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
- StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances
CFG has 9 procedures, 166 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 82823.2ms, OverallIterations: 14, TraceHistogramMax: 1, EmptinessCheckTime: 1710.7ms, AutomataDifference: 16555.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 37563.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 2616 SDtfs, 5103 SDslu, 11673 SDs, 0 SdLazy, 1676 SolverSat, 359 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1582.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 215 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 2788.8ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=154972occurred in iteration=0, InterpolantAutomatonStates: 163, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 23940.9ms AutomataMinimizationTime, 13 MinimizatonAttempts, 53869 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 88.8ms SsaConstructionTime, 886.9ms SatisfiabilityAnalysisTime, 1813.4ms InterpolantComputationTime, 1254 NumberOfCodeBlocks, 1254 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1141 ConstructedInterpolants, 0 QuantifiedInterpolants, 6889 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
Received shutdown request...