/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-Delay.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe030_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-87fd7473a0bda1db0ad7f77f2116346063730f21-87fd747 [2021-08-21 17:11:40,194 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-21 17:11:40,195 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-21 17:11:40,230 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-21 17:11:40,231 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-21 17:11:40,231 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-21 17:11:40,233 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-21 17:11:40,242 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-21 17:11:40,244 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-21 17:11:40,256 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-21 17:11:40,257 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-21 17:11:40,258 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-21 17:11:40,258 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-21 17:11:40,258 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-21 17:11:40,259 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-21 17:11:40,260 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-21 17:11:40,260 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-21 17:11:40,261 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-21 17:11:40,262 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-21 17:11:40,263 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-21 17:11:40,264 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-21 17:11:40,269 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-21 17:11:40,269 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-21 17:11:40,270 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-21 17:11:40,273 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-21 17:11:40,274 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-21 17:11:40,274 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-21 17:11:40,274 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-21 17:11:40,275 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-21 17:11:40,275 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-21 17:11:40,275 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-21 17:11:40,276 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-21 17:11:40,276 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-21 17:11:40,277 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-21 17:11:40,277 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-21 17:11:40,278 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-21 17:11:40,278 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-21 17:11:40,278 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-21 17:11:40,278 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-21 17:11:40,279 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-21 17:11:40,279 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-21 17:11:40,283 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-Delay.epf [2021-08-21 17:11:40,312 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-21 17:11:40,312 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-21 17:11:40,313 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-21 17:11:40,314 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-21 17:11:40,314 INFO L138 SettingsManager]: * Use SBE=true [2021-08-21 17:11:40,314 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-21 17:11:40,314 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-21 17:11:40,314 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-21 17:11:40,314 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-21 17:11:40,314 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-21 17:11:40,314 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-21 17:11:40,314 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-21 17:11:40,314 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-21 17:11:40,315 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-21 17:11:40,315 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-21 17:11:40,315 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-21 17:11:40,315 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-21 17:11:40,315 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-21 17:11:40,315 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-21 17:11:40,315 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-08-21 17:11:40,315 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-21 17:11:40,315 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-21 17:11:40,316 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-21 17:11:40,316 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-21 17:11:40,316 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-21 17:11:40,316 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-21 17:11:40,316 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-21 17:11:40,316 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-08-21 17:11:40,316 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-21 17:11:40,316 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_DELAY_SET [2021-08-21 17:11:40,316 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-08-21 17:11:40,605 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-21 17:11:40,618 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-21 17:11:40,620 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-21 17:11:40,620 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-21 17:11:40,623 INFO L275 PluginConnector]: CDTParser initialized [2021-08-21 17:11:40,625 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe030_power.oepc.i [2021-08-21 17:11:40,666 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7955c8b5b/ea0b1d3fcd7c41938c47210ad88570ef/FLAGd6e17e54e [2021-08-21 17:11:41,118 INFO L306 CDTParser]: Found 1 translation units. [2021-08-21 17:11:41,118 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_power.oepc.i [2021-08-21 17:11:41,132 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7955c8b5b/ea0b1d3fcd7c41938c47210ad88570ef/FLAGd6e17e54e [2021-08-21 17:11:41,476 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7955c8b5b/ea0b1d3fcd7c41938c47210ad88570ef [2021-08-21 17:11:41,481 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-21 17:11:41,483 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-21 17:11:41,484 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-21 17:11:41,485 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-21 17:11:41,487 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-21 17:11:41,488 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.08 05:11:41" (1/1) ... [2021-08-21 17:11:41,489 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70eedd43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:11:41, skipping insertion in model container [2021-08-21 17:11:41,489 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.08 05:11:41" (1/1) ... [2021-08-21 17:11:41,495 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-21 17:11:41,539 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-21 17:11:41,660 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_power.oepc.i[952,965] [2021-08-21 17:11:41,804 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-21 17:11:41,815 INFO L203 MainTranslator]: Completed pre-run [2021-08-21 17:11:41,838 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_power.oepc.i[952,965] [2021-08-21 17:11:41,887 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-21 17:11:41,914 INFO L208 MainTranslator]: Completed translation [2021-08-21 17:11:41,914 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:11:41 WrapperNode [2021-08-21 17:11:41,914 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-21 17:11:41,915 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-21 17:11:41,915 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-21 17:11:41,915 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-21 17:11:41,920 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:11:41" (1/1) ... [2021-08-21 17:11:41,934 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:11:41" (1/1) ... [2021-08-21 17:11:41,954 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-21 17:11:41,954 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-21 17:11:41,954 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-21 17:11:41,954 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-21 17:11:41,960 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:11:41" (1/1) ... [2021-08-21 17:11:41,960 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:11:41" (1/1) ... [2021-08-21 17:11:41,964 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:11:41" (1/1) ... [2021-08-21 17:11:41,964 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:11:41" (1/1) ... [2021-08-21 17:11:41,969 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:11:41" (1/1) ... [2021-08-21 17:11:41,972 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:11:41" (1/1) ... [2021-08-21 17:11:41,975 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:11:41" (1/1) ... [2021-08-21 17:11:41,984 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-21 17:11:41,985 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-21 17:11:41,985 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-21 17:11:41,985 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-21 17:11:41,986 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:11:41" (1/1) ... [2021-08-21 17:11:41,990 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-21 17:11:41,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-21 17:11:42,005 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-21 17:11:42,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-21 17:11:42,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-21 17:11:42,041 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-08-21 17:11:42,043 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-21 17:11:42,043 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-21 17:11:42,043 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-08-21 17:11:42,043 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-08-21 17:11:42,043 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-08-21 17:11:42,043 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-08-21 17:11:42,043 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-08-21 17:11:42,043 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-08-21 17:11:42,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-21 17:11:42,043 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-08-21 17:11:42,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-21 17:11:42,044 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-21 17:11:42,045 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-08-21 17:11:43,650 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-21 17:11:43,651 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-08-21 17:11:43,653 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.08 05:11:43 BoogieIcfgContainer [2021-08-21 17:11:43,653 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-21 17:11:43,654 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-21 17:11:43,655 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-21 17:11:43,657 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-21 17:11:43,657 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.08 05:11:41" (1/3) ... [2021-08-21 17:11:43,658 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37907a7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.08 05:11:43, skipping insertion in model container [2021-08-21 17:11:43,658 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:11:41" (2/3) ... [2021-08-21 17:11:43,658 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37907a7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.08 05:11:43, skipping insertion in model container [2021-08-21 17:11:43,658 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.08 05:11:43" (3/3) ... [2021-08-21 17:11:43,659 INFO L111 eAbstractionObserver]: Analyzing ICFG safe030_power.oepc.i [2021-08-21 17:11:43,663 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-08-21 17:11:43,663 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-21 17:11:43,663 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-08-21 17:11:43,663 INFO L516 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-08-21 17:11:43,691 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,691 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,691 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,692 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,692 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,692 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,692 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,692 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,692 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,692 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,692 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,693 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,693 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,693 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,693 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,693 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,693 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,693 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,693 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,694 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,694 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,694 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,694 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,694 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,694 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,694 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,694 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,695 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,695 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,695 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,695 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,695 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,695 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,695 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,696 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,696 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,696 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,696 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,696 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,696 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,696 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,696 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,697 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,697 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,697 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,697 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,697 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,697 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,697 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,697 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,697 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,698 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,698 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,698 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,698 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,698 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,698 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,698 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,699 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,699 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,699 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,699 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,699 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,699 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,699 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,699 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,699 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,699 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,700 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,700 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,700 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,700 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,700 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,700 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,700 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,700 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,701 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,701 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,701 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,701 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,701 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,701 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,701 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,701 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,702 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,702 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,704 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,704 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,704 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,704 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,704 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,705 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,705 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,705 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,705 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,705 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,708 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,708 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,708 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,709 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,709 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,709 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,709 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,709 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,709 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,709 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,711 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,711 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,711 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,711 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,711 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,711 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,711 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,711 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,711 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,711 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,712 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,712 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:11:43,713 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-08-21 17:11:43,747 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-21 17:11:43,752 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-21 17:11:43,753 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-08-21 17:11:45,025 INFO L276 IsEmpty]: Start isEmpty. Operand has 11933 states, 10442 states have (on average 2.2250526719019343) internal successors, (23234), 11932 states have internal predecessors, (23234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:11:45,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-08-21 17:11:45,030 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:11:45,031 INFO L512 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] [2021-08-21 17:11:45,032 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 17:11:45,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:11:45,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1847846630, now seen corresponding path program 1 times [2021-08-21 17:11:45,041 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:11:45,042 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978982815] [2021-08-21 17:11:45,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:11:45,042 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:11:45,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:11:45,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:11:45,286 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:11:45,286 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978982815] [2021-08-21 17:11:45,286 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978982815] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:11:45,287 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:11:45,287 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-21 17:11:45,288 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379469031] [2021-08-21 17:11:45,290 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-21 17:11:45,291 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:11:45,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-21 17:11:45,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-21 17:11:45,330 INFO L87 Difference]: Start difference. First operand has 11933 states, 10442 states have (on average 2.2250526719019343) internal successors, (23234), 11932 states have internal predecessors, (23234), 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 20.0) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:11:45,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:11:45,512 INFO L93 Difference]: Finished difference Result 10014 states and 18914 transitions. [2021-08-21 17:11:45,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-21 17:11:45,514 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 20.0) internal successors, (40), 3 states have internal predecessors, (40), 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 40 [2021-08-21 17:11:45,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:11:45,566 INFO L225 Difference]: With dead ends: 10014 [2021-08-21 17:11:45,566 INFO L226 Difference]: Without dead ends: 5244 [2021-08-21 17:11:45,567 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-21 17:11:45,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5244 states. [2021-08-21 17:11:45,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5244 to 5244. [2021-08-21 17:11:45,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5244 states, 5180 states have (on average 2.3324324324324324) internal successors, (12082), 5243 states have internal predecessors, (12082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:11:45,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5244 states to 5244 states and 12082 transitions. [2021-08-21 17:11:45,764 INFO L78 Accepts]: Start accepts. Automaton has 5244 states and 12082 transitions. Word has length 40 [2021-08-21 17:11:45,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:11:45,764 INFO L470 AbstractCegarLoop]: Abstraction has 5244 states and 12082 transitions. [2021-08-21 17:11:45,765 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 20.0) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:11:45,765 INFO L276 IsEmpty]: Start isEmpty. Operand 5244 states and 12082 transitions. [2021-08-21 17:11:45,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-08-21 17:11:45,771 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:11:45,771 INFO L512 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] [2021-08-21 17:11:45,772 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-21 17:11:45,772 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 17:11:45,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:11:45,772 INFO L82 PathProgramCache]: Analyzing trace with hash -459637492, now seen corresponding path program 1 times [2021-08-21 17:11:45,773 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:11:45,773 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655058155] [2021-08-21 17:11:45,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:11:45,773 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:11:45,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:11:45,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:11:45,983 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:11:45,983 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655058155] [2021-08-21 17:11:45,983 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655058155] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:11:45,983 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:11:45,983 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-21 17:11:45,983 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052525242] [2021-08-21 17:11:45,985 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-21 17:11:45,985 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:11:45,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-21 17:11:45,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-21 17:11:45,986 INFO L87 Difference]: Start difference. First operand 5244 states and 12082 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:11:46,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:11:46,119 INFO L93 Difference]: Finished difference Result 6492 states and 15546 transitions. [2021-08-21 17:11:46,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-21 17:11:46,120 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 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 66 [2021-08-21 17:11:46,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:11:46,138 INFO L225 Difference]: With dead ends: 6492 [2021-08-21 17:11:46,138 INFO L226 Difference]: Without dead ends: 4956 [2021-08-21 17:11:46,139 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 85.0ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-08-21 17:11:46,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4956 states. [2021-08-21 17:11:46,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4956 to 4956. [2021-08-21 17:11:46,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4956 states, 4892 states have (on average 2.3470973017170893) internal successors, (11482), 4955 states have internal predecessors, (11482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:11:46,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4956 states to 4956 states and 11482 transitions. [2021-08-21 17:11:46,277 INFO L78 Accepts]: Start accepts. Automaton has 4956 states and 11482 transitions. Word has length 66 [2021-08-21 17:11:46,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:11:46,277 INFO L470 AbstractCegarLoop]: Abstraction has 4956 states and 11482 transitions. [2021-08-21 17:11:46,278 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:11:46,278 INFO L276 IsEmpty]: Start isEmpty. Operand 4956 states and 11482 transitions. [2021-08-21 17:11:46,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-08-21 17:11:46,282 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:11:46,283 INFO L512 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] [2021-08-21 17:11:46,283 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-21 17:11:46,283 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 17:11:46,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:11:46,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1682725747, now seen corresponding path program 1 times [2021-08-21 17:11:46,284 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:11:46,284 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957044488] [2021-08-21 17:11:46,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:11:46,284 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:11:46,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:11:46,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:11:46,422 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:11:46,422 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957044488] [2021-08-21 17:11:46,422 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957044488] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:11:46,422 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:11:46,422 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-21 17:11:46,423 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722304776] [2021-08-21 17:11:46,423 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-21 17:11:46,426 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:11:46,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-21 17:11:46,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-21 17:11:46,433 INFO L87 Difference]: Start difference. First operand 4956 states and 11482 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:11:46,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:11:46,554 INFO L93 Difference]: Finished difference Result 5824 states and 14146 transitions. [2021-08-21 17:11:46,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-21 17:11:46,555 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 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 68 [2021-08-21 17:11:46,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:11:46,575 INFO L225 Difference]: With dead ends: 5824 [2021-08-21 17:11:46,576 INFO L226 Difference]: Without dead ends: 4730 [2021-08-21 17:11:46,576 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 72.0ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-08-21 17:11:46,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4730 states. [2021-08-21 17:11:46,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4730 to 4730. [2021-08-21 17:11:46,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4730 states, 4672 states have (on average 2.3467465753424657) internal successors, (10964), 4729 states have internal predecessors, (10964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:11:46,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4730 states to 4730 states and 10964 transitions. [2021-08-21 17:11:46,674 INFO L78 Accepts]: Start accepts. Automaton has 4730 states and 10964 transitions. Word has length 68 [2021-08-21 17:11:46,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:11:46,674 INFO L470 AbstractCegarLoop]: Abstraction has 4730 states and 10964 transitions. [2021-08-21 17:11:46,674 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:11:46,674 INFO L276 IsEmpty]: Start isEmpty. Operand 4730 states and 10964 transitions. [2021-08-21 17:11:46,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-08-21 17:11:46,678 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:11:46,679 INFO L512 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] [2021-08-21 17:11:46,679 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-21 17:11:46,679 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 17:11:46,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:11:46,680 INFO L82 PathProgramCache]: Analyzing trace with hash -416190040, now seen corresponding path program 1 times [2021-08-21 17:11:46,680 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:11:46,680 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468487517] [2021-08-21 17:11:46,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:11:46,680 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:11:46,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:11:46,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:11:46,875 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:11:46,876 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468487517] [2021-08-21 17:11:46,876 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468487517] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:11:46,876 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:11:46,876 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-21 17:11:46,876 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121074895] [2021-08-21 17:11:46,877 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-21 17:11:46,877 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:11:46,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-21 17:11:46,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-21 17:11:46,877 INFO L87 Difference]: Start difference. First operand 4730 states and 10964 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:11:47,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:11:47,006 INFO L93 Difference]: Finished difference Result 8010 states and 20513 transitions. [2021-08-21 17:11:47,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-21 17:11:47,006 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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 69 [2021-08-21 17:11:47,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:11:47,038 INFO L225 Difference]: With dead ends: 8010 [2021-08-21 17:11:47,038 INFO L226 Difference]: Without dead ends: 5290 [2021-08-21 17:11:47,038 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 73.8ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-08-21 17:11:47,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5290 states. [2021-08-21 17:11:47,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5290 to 4250. [2021-08-21 17:11:47,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4250 states, 4192 states have (on average 2.3795324427480917) internal successors, (9975), 4249 states have internal predecessors, (9975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:11:47,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4250 states to 4250 states and 9975 transitions. [2021-08-21 17:11:47,131 INFO L78 Accepts]: Start accepts. Automaton has 4250 states and 9975 transitions. Word has length 69 [2021-08-21 17:11:47,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:11:47,132 INFO L470 AbstractCegarLoop]: Abstraction has 4250 states and 9975 transitions. [2021-08-21 17:11:47,132 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:11:47,132 INFO L276 IsEmpty]: Start isEmpty. Operand 4250 states and 9975 transitions. [2021-08-21 17:11:47,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-08-21 17:11:47,138 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:11:47,139 INFO L512 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] [2021-08-21 17:11:47,139 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-21 17:11:47,139 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 17:11:47,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:11:47,139 INFO L82 PathProgramCache]: Analyzing trace with hash 893374190, now seen corresponding path program 1 times [2021-08-21 17:11:47,139 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:11:47,139 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457979139] [2021-08-21 17:11:47,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:11:47,140 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:11:47,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:11:47,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:11:47,335 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:11:47,335 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457979139] [2021-08-21 17:11:47,335 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457979139] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:11:47,335 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:11:47,335 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-21 17:11:47,335 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743046188] [2021-08-21 17:11:47,336 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-21 17:11:47,336 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:11:47,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-21 17:11:47,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-21 17:11:47,339 INFO L87 Difference]: Start difference. First operand 4250 states and 9975 transitions. Second operand has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:11:47,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:11:47,585 INFO L93 Difference]: Finished difference Result 5170 states and 12591 transitions. [2021-08-21 17:11:47,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-21 17:11:47,586 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 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 70 [2021-08-21 17:11:47,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:11:47,599 INFO L225 Difference]: With dead ends: 5170 [2021-08-21 17:11:47,600 INFO L226 Difference]: Without dead ends: 4370 [2021-08-21 17:11:47,600 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 126.8ms TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2021-08-21 17:11:47,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4370 states. [2021-08-21 17:11:47,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4370 to 4178. [2021-08-21 17:11:47,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4178 states, 4120 states have (on average 2.362864077669903) internal successors, (9735), 4177 states have internal predecessors, (9735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:11:47,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4178 states to 4178 states and 9735 transitions. [2021-08-21 17:11:47,715 INFO L78 Accepts]: Start accepts. Automaton has 4178 states and 9735 transitions. Word has length 70 [2021-08-21 17:11:47,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:11:47,715 INFO L470 AbstractCegarLoop]: Abstraction has 4178 states and 9735 transitions. [2021-08-21 17:11:47,716 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:11:47,716 INFO L276 IsEmpty]: Start isEmpty. Operand 4178 states and 9735 transitions. [2021-08-21 17:11:47,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-08-21 17:11:47,722 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:11:47,722 INFO L512 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] [2021-08-21 17:11:47,722 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-21 17:11:47,723 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 17:11:47,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:11:47,723 INFO L82 PathProgramCache]: Analyzing trace with hash -2094853085, now seen corresponding path program 1 times [2021-08-21 17:11:47,723 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:11:47,723 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556411812] [2021-08-21 17:11:47,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:11:47,724 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:11:47,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:11:47,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:11:47,818 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:11:47,821 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556411812] [2021-08-21 17:11:47,821 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556411812] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:11:47,821 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:11:47,821 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-21 17:11:47,821 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994656952] [2021-08-21 17:11:47,822 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-21 17:11:47,822 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:11:47,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-21 17:11:47,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-21 17:11:47,822 INFO L87 Difference]: Start difference. First operand 4178 states and 9735 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:11:47,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:11:47,938 INFO L93 Difference]: Finished difference Result 7078 states and 17714 transitions. [2021-08-21 17:11:47,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-21 17:11:47,942 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 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 71 [2021-08-21 17:11:47,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:11:47,952 INFO L225 Difference]: With dead ends: 7078 [2021-08-21 17:11:47,952 INFO L226 Difference]: Without dead ends: 4313 [2021-08-21 17:11:47,952 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 70.2ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-08-21 17:11:47,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4313 states. [2021-08-21 17:11:48,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4313 to 3533. [2021-08-21 17:11:48,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3533 states, 3485 states have (on average 2.364131994261119) internal successors, (8239), 3532 states have internal predecessors, (8239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:11:48,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3533 states to 3533 states and 8239 transitions. [2021-08-21 17:11:48,019 INFO L78 Accepts]: Start accepts. Automaton has 3533 states and 8239 transitions. Word has length 71 [2021-08-21 17:11:48,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:11:48,020 INFO L470 AbstractCegarLoop]: Abstraction has 3533 states and 8239 transitions. [2021-08-21 17:11:48,020 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:11:48,020 INFO L276 IsEmpty]: Start isEmpty. Operand 3533 states and 8239 transitions. [2021-08-21 17:11:48,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-08-21 17:11:48,024 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:11:48,024 INFO L512 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] [2021-08-21 17:11:48,024 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-21 17:11:48,024 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 17:11:48,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:11:48,025 INFO L82 PathProgramCache]: Analyzing trace with hash 105019432, now seen corresponding path program 1 times [2021-08-21 17:11:48,025 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:11:48,025 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942298021] [2021-08-21 17:11:48,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:11:48,025 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:11:48,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:11:48,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:11:48,140 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:11:48,140 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942298021] [2021-08-21 17:11:48,140 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942298021] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:11:48,140 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:11:48,140 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-21 17:11:48,140 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031514707] [2021-08-21 17:11:48,140 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-21 17:11:48,140 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:11:48,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-21 17:11:48,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-08-21 17:11:48,141 INFO L87 Difference]: Start difference. First operand 3533 states and 8239 transitions. Second operand has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:11:48,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:11:48,375 INFO L93 Difference]: Finished difference Result 3869 states and 9331 transitions. [2021-08-21 17:11:48,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-21 17:11:48,376 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 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 71 [2021-08-21 17:11:48,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:11:48,383 INFO L225 Difference]: With dead ends: 3869 [2021-08-21 17:11:48,383 INFO L226 Difference]: Without dead ends: 3018 [2021-08-21 17:11:48,383 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 94.2ms TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2021-08-21 17:11:48,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3018 states. [2021-08-21 17:11:48,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3018 to 3018. [2021-08-21 17:11:48,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3018 states, 2982 states have (on average 2.386653252850436) internal successors, (7117), 3017 states have internal predecessors, (7117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:11:48,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3018 states to 3018 states and 7117 transitions. [2021-08-21 17:11:48,470 INFO L78 Accepts]: Start accepts. Automaton has 3018 states and 7117 transitions. Word has length 71 [2021-08-21 17:11:48,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:11:48,471 INFO L470 AbstractCegarLoop]: Abstraction has 3018 states and 7117 transitions. [2021-08-21 17:11:48,471 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:11:48,471 INFO L276 IsEmpty]: Start isEmpty. Operand 3018 states and 7117 transitions. [2021-08-21 17:11:48,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-08-21 17:11:48,478 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:11:48,478 INFO L512 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] [2021-08-21 17:11:48,478 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-21 17:11:48,479 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 17:11:48,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:11:48,479 INFO L82 PathProgramCache]: Analyzing trace with hash -693475568, now seen corresponding path program 1 times [2021-08-21 17:11:48,479 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:11:48,479 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837298061] [2021-08-21 17:11:48,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:11:48,479 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:11:48,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:11:48,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:11:48,700 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:11:48,700 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837298061] [2021-08-21 17:11:48,700 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837298061] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:11:48,700 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:11:48,700 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-08-21 17:11:48,700 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994652082] [2021-08-21 17:11:48,701 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-21 17:11:48,701 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:11:48,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-21 17:11:48,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-08-21 17:11:48,701 INFO L87 Difference]: Start difference. First operand 3018 states and 7117 transitions. Second operand has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:11:49,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:11:49,127 INFO L93 Difference]: Finished difference Result 3620 states and 8992 transitions. [2021-08-21 17:11:49,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-08-21 17:11:49,128 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-08-21 17:11:49,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:11:49,133 INFO L225 Difference]: With dead ends: 3620 [2021-08-21 17:11:49,133 INFO L226 Difference]: Without dead ends: 3044 [2021-08-21 17:11:49,134 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 267.5ms TimeCoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2021-08-21 17:11:49,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3044 states. [2021-08-21 17:11:49,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3044 to 3044. [2021-08-21 17:11:49,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3044 states, 3008 states have (on average 2.38031914893617) internal successors, (7160), 3043 states have internal predecessors, (7160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:11:49,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3044 states to 3044 states and 7160 transitions. [2021-08-21 17:11:49,187 INFO L78 Accepts]: Start accepts. Automaton has 3044 states and 7160 transitions. Word has length 72 [2021-08-21 17:11:49,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:11:49,187 INFO L470 AbstractCegarLoop]: Abstraction has 3044 states and 7160 transitions. [2021-08-21 17:11:49,187 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:11:49,187 INFO L276 IsEmpty]: Start isEmpty. Operand 3044 states and 7160 transitions. [2021-08-21 17:11:49,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-08-21 17:11:49,191 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:11:49,191 INFO L512 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] [2021-08-21 17:11:49,191 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-21 17:11:49,191 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 17:11:49,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:11:49,192 INFO L82 PathProgramCache]: Analyzing trace with hash -339213202, now seen corresponding path program 2 times [2021-08-21 17:11:49,192 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:11:49,192 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719673134] [2021-08-21 17:11:49,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:11:49,192 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:11:49,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:11:49,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:11:49,346 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:11:49,346 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719673134] [2021-08-21 17:11:49,346 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719673134] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:11:49,346 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:11:49,346 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-21 17:11:49,346 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355448124] [2021-08-21 17:11:49,346 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-21 17:11:49,346 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:11:49,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-21 17:11:49,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-08-21 17:11:49,347 INFO L87 Difference]: Start difference. First operand 3044 states and 7160 transitions. Second operand has 9 states, 9 states have (on average 8.0) internal successors, (72), 9 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:11:49,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:11:49,558 INFO L93 Difference]: Finished difference Result 3596 states and 8892 transitions. [2021-08-21 17:11:49,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-21 17:11:49,559 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.0) internal successors, (72), 9 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-08-21 17:11:49,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:11:49,566 INFO L225 Difference]: With dead ends: 3596 [2021-08-21 17:11:49,566 INFO L226 Difference]: Without dead ends: 3020 [2021-08-21 17:11:49,566 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 105.4ms TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2021-08-21 17:11:49,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3020 states. [2021-08-21 17:11:49,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3020 to 3020. [2021-08-21 17:11:49,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3020 states, 2984 states have (on average 2.3672922252010724) internal successors, (7064), 3019 states have internal predecessors, (7064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:11:49,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3020 states to 3020 states and 7064 transitions. [2021-08-21 17:11:49,612 INFO L78 Accepts]: Start accepts. Automaton has 3020 states and 7064 transitions. Word has length 72 [2021-08-21 17:11:49,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:11:49,612 INFO L470 AbstractCegarLoop]: Abstraction has 3020 states and 7064 transitions. [2021-08-21 17:11:49,612 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.0) internal successors, (72), 9 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:11:49,612 INFO L276 IsEmpty]: Start isEmpty. Operand 3020 states and 7064 transitions. [2021-08-21 17:11:49,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-08-21 17:11:49,616 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:11:49,616 INFO L512 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] [2021-08-21 17:11:49,616 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-21 17:11:49,616 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 17:11:49,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:11:49,617 INFO L82 PathProgramCache]: Analyzing trace with hash 424060154, now seen corresponding path program 1 times [2021-08-21 17:11:49,617 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:11:49,617 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940517970] [2021-08-21 17:11:49,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:11:49,617 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:11:49,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:11:49,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:11:49,785 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:11:49,785 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940517970] [2021-08-21 17:11:49,785 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940517970] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:11:49,785 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:11:49,786 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-21 17:11:49,786 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493616229] [2021-08-21 17:11:49,786 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-21 17:11:49,786 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:11:49,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-21 17:11:49,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-08-21 17:11:49,787 INFO L87 Difference]: Start difference. First operand 3020 states and 7064 transitions. Second operand has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 9 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:11:50,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:11:50,013 INFO L93 Difference]: Finished difference Result 4000 states and 10119 transitions. [2021-08-21 17:11:50,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-21 17:11:50,014 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 9 states have internal predecessors, (73), 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 73 [2021-08-21 17:11:50,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:11:50,021 INFO L225 Difference]: With dead ends: 4000 [2021-08-21 17:11:50,022 INFO L226 Difference]: Without dead ends: 3440 [2021-08-21 17:11:50,022 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 111.6ms TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2021-08-21 17:11:50,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3440 states. [2021-08-21 17:11:50,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3440 to 3152. [2021-08-21 17:11:50,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3152 states, 3116 states have (on average 2.3995507060333763) internal successors, (7477), 3151 states have internal predecessors, (7477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:11:50,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3152 states to 3152 states and 7477 transitions. [2021-08-21 17:11:50,092 INFO L78 Accepts]: Start accepts. Automaton has 3152 states and 7477 transitions. Word has length 73 [2021-08-21 17:11:50,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:11:50,092 INFO L470 AbstractCegarLoop]: Abstraction has 3152 states and 7477 transitions. [2021-08-21 17:11:50,093 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 9 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:11:50,093 INFO L276 IsEmpty]: Start isEmpty. Operand 3152 states and 7477 transitions. [2021-08-21 17:11:50,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-08-21 17:11:50,097 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:11:50,097 INFO L512 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] [2021-08-21 17:11:50,097 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-21 17:11:50,097 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 17:11:50,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:11:50,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1501425297, now seen corresponding path program 1 times [2021-08-21 17:11:50,098 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:11:50,098 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287645831] [2021-08-21 17:11:50,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:11:50,098 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:11:50,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:11:50,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:11:50,167 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:11:50,167 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287645831] [2021-08-21 17:11:50,167 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287645831] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:11:50,167 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:11:50,167 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-21 17:11:50,167 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163567389] [2021-08-21 17:11:50,167 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-21 17:11:50,167 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:11:50,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-21 17:11:50,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-21 17:11:50,169 INFO L87 Difference]: Start difference. First operand 3152 states and 7477 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:11:50,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:11:50,249 INFO L93 Difference]: Finished difference Result 3734 states and 8425 transitions. [2021-08-21 17:11:50,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-21 17:11:50,250 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-08-21 17:11:50,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:11:50,255 INFO L225 Difference]: With dead ends: 3734 [2021-08-21 17:11:50,255 INFO L226 Difference]: Without dead ends: 2522 [2021-08-21 17:11:50,255 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 52.9ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-08-21 17:11:50,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2522 states. [2021-08-21 17:11:50,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2522 to 2522. [2021-08-21 17:11:50,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2522 states, 2486 states have (on average 2.399839098954143) internal successors, (5966), 2521 states have internal predecessors, (5966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:11:50,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2522 states to 2522 states and 5966 transitions. [2021-08-21 17:11:50,297 INFO L78 Accepts]: Start accepts. Automaton has 2522 states and 5966 transitions. Word has length 74 [2021-08-21 17:11:50,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:11:50,297 INFO L470 AbstractCegarLoop]: Abstraction has 2522 states and 5966 transitions. [2021-08-21 17:11:50,297 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:11:50,297 INFO L276 IsEmpty]: Start isEmpty. Operand 2522 states and 5966 transitions. [2021-08-21 17:11:50,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-08-21 17:11:50,301 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:11:50,301 INFO L512 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] [2021-08-21 17:11:50,301 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-21 17:11:50,301 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 17:11:50,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:11:50,302 INFO L82 PathProgramCache]: Analyzing trace with hash 848185603, now seen corresponding path program 1 times [2021-08-21 17:11:50,302 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:11:50,302 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694141062] [2021-08-21 17:11:50,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:11:50,302 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:11:50,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:11:50,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:11:50,378 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:11:50,378 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694141062] [2021-08-21 17:11:50,378 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694141062] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:11:50,378 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:11:50,378 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-21 17:11:50,378 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113020030] [2021-08-21 17:11:50,378 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-21 17:11:50,378 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:11:50,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-21 17:11:50,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-08-21 17:11:50,379 INFO L87 Difference]: Start difference. First operand 2522 states and 5966 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:11:50,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:11:50,468 INFO L93 Difference]: Finished difference Result 2152 states and 4580 transitions. [2021-08-21 17:11:50,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-21 17:11:50,469 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2021-08-21 17:11:50,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:11:50,471 INFO L225 Difference]: With dead ends: 2152 [2021-08-21 17:11:50,471 INFO L226 Difference]: Without dead ends: 1261 [2021-08-21 17:11:50,472 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 63.8ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-08-21 17:11:50,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1261 states. [2021-08-21 17:11:50,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1261 to 1251. [2021-08-21 17:11:50,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1251 states, 1224 states have (on average 2.197712418300654) internal successors, (2690), 1250 states have internal predecessors, (2690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:11:50,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1251 states to 1251 states and 2690 transitions. [2021-08-21 17:11:50,487 INFO L78 Accepts]: Start accepts. Automaton has 1251 states and 2690 transitions. Word has length 75 [2021-08-21 17:11:50,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:11:50,487 INFO L470 AbstractCegarLoop]: Abstraction has 1251 states and 2690 transitions. [2021-08-21 17:11:50,488 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:11:50,488 INFO L276 IsEmpty]: Start isEmpty. Operand 1251 states and 2690 transitions. [2021-08-21 17:11:50,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-08-21 17:11:50,489 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:11:50,489 INFO L512 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] [2021-08-21 17:11:50,490 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-21 17:11:50,490 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 17:11:50,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:11:50,490 INFO L82 PathProgramCache]: Analyzing trace with hash 105383360, now seen corresponding path program 1 times [2021-08-21 17:11:50,490 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:11:50,490 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275328162] [2021-08-21 17:11:50,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:11:50,490 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:11:50,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:11:50,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-08-21 17:11:50,779 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:11:50,779 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275328162] [2021-08-21 17:11:50,779 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275328162] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:11:50,780 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:11:50,780 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-08-21 17:11:50,780 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964091784] [2021-08-21 17:11:50,780 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-21 17:11:50,780 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:11:50,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-21 17:11:50,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2021-08-21 17:11:50,781 INFO L87 Difference]: Start difference. First operand 1251 states and 2690 transitions. Second operand has 13 states, 13 states have (on average 6.0) internal successors, (78), 13 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:11:51,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:11:51,103 INFO L93 Difference]: Finished difference Result 2872 states and 6646 transitions. [2021-08-21 17:11:51,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-21 17:11:51,103 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.0) internal successors, (78), 13 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2021-08-21 17:11:51,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:11:51,116 INFO L225 Difference]: With dead ends: 2872 [2021-08-21 17:11:51,116 INFO L226 Difference]: Without dead ends: 2238 [2021-08-21 17:11:51,117 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 176.1ms TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2021-08-21 17:11:51,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2238 states. [2021-08-21 17:11:51,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2238 to 1336. [2021-08-21 17:11:51,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1336 states, 1309 states have (on average 2.1611917494270436) internal successors, (2829), 1335 states have internal predecessors, (2829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:11:51,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1336 states to 1336 states and 2829 transitions. [2021-08-21 17:11:51,137 INFO L78 Accepts]: Start accepts. Automaton has 1336 states and 2829 transitions. Word has length 78 [2021-08-21 17:11:51,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:11:51,137 INFO L470 AbstractCegarLoop]: Abstraction has 1336 states and 2829 transitions. [2021-08-21 17:11:51,138 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.0) internal successors, (78), 13 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:11:51,138 INFO L276 IsEmpty]: Start isEmpty. Operand 1336 states and 2829 transitions. [2021-08-21 17:11:51,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-08-21 17:11:51,140 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:11:51,140 INFO L512 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] [2021-08-21 17:11:51,140 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-21 17:11:51,141 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 17:11:51,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:11:51,141 INFO L82 PathProgramCache]: Analyzing trace with hash -2065451333, now seen corresponding path program 1 times [2021-08-21 17:11:51,141 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:11:51,141 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872561025] [2021-08-21 17:11:51,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:11:51,141 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:11:51,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:11:51,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:11:51,243 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:11:51,243 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872561025] [2021-08-21 17:11:51,243 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872561025] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:11:51,243 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:11:51,243 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-21 17:11:51,243 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566861069] [2021-08-21 17:11:51,244 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-21 17:11:51,244 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:11:51,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-21 17:11:51,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-21 17:11:51,244 INFO L87 Difference]: Start difference. First operand 1336 states and 2829 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:11:51,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:11:51,340 INFO L93 Difference]: Finished difference Result 880 states and 1618 transitions. [2021-08-21 17:11:51,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-21 17:11:51,340 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2021-08-21 17:11:51,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:11:51,341 INFO L225 Difference]: With dead ends: 880 [2021-08-21 17:11:51,341 INFO L226 Difference]: Without dead ends: 320 [2021-08-21 17:11:51,341 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 72.6ms TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2021-08-21 17:11:51,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2021-08-21 17:11:51,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 308. [2021-08-21 17:11:51,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 299 states have (on average 1.8294314381270902) internal successors, (547), 307 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:11:51,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 547 transitions. [2021-08-21 17:11:51,345 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 547 transitions. Word has length 78 [2021-08-21 17:11:51,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:11:51,345 INFO L470 AbstractCegarLoop]: Abstraction has 308 states and 547 transitions. [2021-08-21 17:11:51,345 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:11:51,345 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 547 transitions. [2021-08-21 17:11:51,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-08-21 17:11:51,346 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:11:51,346 INFO L512 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-08-21 17:11:51,346 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-21 17:11:51,346 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 17:11:51,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:11:51,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1417493384, now seen corresponding path program 1 times [2021-08-21 17:11:51,346 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:11:51,346 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178347542] [2021-08-21 17:11:51,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:11:51,347 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:11:51,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-21 17:11:51,399 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-21 17:11:51,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-21 17:11:51,493 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-21 17:11:51,493 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-21 17:11:51,494 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-21 17:11:51,495 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-21 17:11:51,495 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION [2021-08-21 17:11:51,495 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION [2021-08-21 17:11:51,495 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION [2021-08-21 17:11:51,495 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-21 17:11:51,496 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-21 17:11:51,500 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-08-21 17:11:51,500 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-21 17:11:51,605 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.08 05:11:51 BasicIcfg [2021-08-21 17:11:51,605 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-21 17:11:51,608 INFO L168 Benchmark]: Toolchain (without parser) took 10123.51 ms. Allocated memory was 195.0 MB in the beginning and 725.6 MB in the end (delta: 530.6 MB). Free memory was 158.0 MB in the beginning and 613.7 MB in the end (delta: -455.8 MB). Peak memory consumption was 478.6 MB. Max. memory is 8.0 GB. [2021-08-21 17:11:51,608 INFO L168 Benchmark]: CDTParser took 0.38 ms. Allocated memory is still 195.0 MB. Free memory is still 175.8 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-08-21 17:11:51,608 INFO L168 Benchmark]: CACSL2BoogieTranslator took 430.06 ms. Allocated memory is still 195.0 MB. Free memory was 157.6 MB in the beginning and 164.1 MB in the end (delta: -6.5 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. [2021-08-21 17:11:51,608 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.81 ms. Allocated memory is still 195.0 MB. Free memory was 164.1 MB in the beginning and 161.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-08-21 17:11:51,609 INFO L168 Benchmark]: Boogie Preprocessor took 30.15 ms. Allocated memory is still 195.0 MB. Free memory was 161.5 MB in the beginning and 158.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-08-21 17:11:51,609 INFO L168 Benchmark]: RCFGBuilder took 1668.14 ms. Allocated memory was 195.0 MB in the beginning and 269.5 MB in the end (delta: 74.4 MB). Free memory was 158.9 MB in the beginning and 223.1 MB in the end (delta: -64.2 MB). Peak memory consumption was 102.0 MB. Max. memory is 8.0 GB. [2021-08-21 17:11:51,610 INFO L168 Benchmark]: TraceAbstraction took 7951.02 ms. Allocated memory was 269.5 MB in the beginning and 725.6 MB in the end (delta: 456.1 MB). Free memory was 222.6 MB in the beginning and 613.7 MB in the end (delta: -391.2 MB). Peak memory consumption was 468.1 MB. Max. memory is 8.0 GB. [2021-08-21 17:11:51,611 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.38 ms. Allocated memory is still 195.0 MB. Free memory is still 175.8 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 430.06 ms. Allocated memory is still 195.0 MB. Free memory was 157.6 MB in the beginning and 164.1 MB in the end (delta: -6.5 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 38.81 ms. Allocated memory is still 195.0 MB. Free memory was 164.1 MB in the beginning and 161.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 30.15 ms. Allocated memory is still 195.0 MB. Free memory was 161.5 MB in the beginning and 158.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1668.14 ms. Allocated memory was 195.0 MB in the beginning and 269.5 MB in the end (delta: 74.4 MB). Free memory was 158.9 MB in the beginning and 223.1 MB in the end (delta: -64.2 MB). Peak memory consumption was 102.0 MB. Max. memory is 8.0 GB. * TraceAbstraction took 7951.02 ms. Allocated memory was 269.5 MB in the beginning and 725.6 MB in the end (delta: 456.1 MB). Free memory was 222.6 MB in the beginning and 613.7 MB in the end (delta: -391.2 MB). Peak memory consumption was 468.1 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 43692, positive: 40570, positive conditional: 40570, positive unconditional: 0, negative: 3122, negative conditional: 3122, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 42972, positive: 40570, positive conditional: 0, positive unconditional: 40570, negative: 2402, negative conditional: 0, negative unconditional: 2402, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1136, positive: 1092, positive conditional: 0, positive unconditional: 1092, negative: 44, negative conditional: 0, negative unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1136, positive: 1089, positive conditional: 0, positive unconditional: 1089, negative: 47, negative conditional: 0, negative unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 47, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 44, negative conditional: 0, negative unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 551, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 545, negative conditional: 0, negative unconditional: 545, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 42972, positive: 39478, positive conditional: 0, positive unconditional: 39478, negative: 2358, negative conditional: 0, negative unconditional: 2358, unknown: 1136, unknown conditional: 0, unknown unconditional: 1136] , Statistics on independence cache: Total cache size (in pairs): 1136, Positive cache size: 1092, Positive conditional cache size: 0, Positive unconditional cache size: 1092, Negative cache size: 44, Negative conditional cache size: 0, Negative unconditional cache size: 44, Independence queries for same thread: 720 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L710] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0] [L711] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0] [L713] 0 int x = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L715] 0 int y = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L717] 0 int z = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L718] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L719] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L720] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L721] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L722] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L723] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0] [L724] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0] [L725] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L726] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L727] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L728] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0] [L729] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L730] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L731] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L732] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L733] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L734] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L735] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L816] 0 pthread_t t2489; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L817] FCALL, FORK 0 pthread_create(&t2489, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L818] 0 pthread_t t2490; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L739] 1 z$w_buff1 = z$w_buff0 [L740] 1 z$w_buff0 = 2 [L741] 1 z$w_buff1_used = z$w_buff0_used [L742] 1 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L744] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L745] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L746] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L747] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L748] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L819] FCALL, FORK 0 pthread_create(&t2490, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L820] 0 pthread_t t2491; VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] FCALL, FORK 0 pthread_create(&t2491, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 x = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L788] 3 y = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L794] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L794] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L794] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L794] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L795] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L795] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L796] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L796] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L797] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L797] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L798] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L798] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L754] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L754] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L755] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L755] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L756] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L756] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L757] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L757] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L758] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L758] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L774] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L774] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z [L774] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L774] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L775] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L775] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L776] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L776] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L777] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L777] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L778] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L778] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L781] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L801] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L823] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, 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, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L827] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L827] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L827] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L827] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L828] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L828] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L829] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L829] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L830] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L830] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L831] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L831] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L834] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L835] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L836] 0 z$flush_delayed = weak$$choice2 [L837] 0 z$mem_tmp = z [L838] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L838] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L839] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L839] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L839] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L839] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L840] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L840] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1) [L840] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L840] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L841] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L841] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used) [L841] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L841] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L842] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L842] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L843] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L843] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L843] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L843] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L844] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L844] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) [L846] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L846] 0 z = z$flush_delayed ? z$mem_tmp : z [L847] 0 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, 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, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] 0 reach_error() VAL [__unbuffered_cnt=3, 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, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 821]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 817]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 819]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 132 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 7752.1ms, OverallIterations: 15, TraceHistogramMax: 1, EmptinessCheckTime: 143.3ms, AutomataDifference: 2883.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 1194.2ms, PartialOrderReductionTime: 1173.9ms, HoareTripleCheckerStatistics: 1775 SDtfs, 2117 SDslu, 6836 SDs, 0 SdLazy, 1146 SolverSat, 177 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 995.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 185 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 1375.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=11933occurred in iteration=0, InterpolantAutomatonStates: 146, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 1029.8ms AutomataMinimizationTime, 14 MinimizatonAttempts, 3224 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 43.7ms SsaConstructionTime, 440.6ms SatisfiabilityAnalysisTime, 1668.5ms InterpolantComputationTime, 1058 NumberOfCodeBlocks, 1058 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 963 ConstructedInterpolants, 0 QuantifiedInterpolants, 4760 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-08-21 17:11:51,640 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...