/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe004_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-9bbddad6b14272d9691b7fb6f1c011d15ab18596-9bbddad [2021-06-12 17:14:53,056 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-12 17:14:53,059 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-12 17:14:53,089 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-12 17:14:53,089 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-12 17:14:53,092 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-12 17:14:53,094 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-12 17:14:53,098 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-12 17:14:53,099 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-12 17:14:53,103 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-12 17:14:53,103 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-12 17:14:53,104 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-12 17:14:53,105 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-12 17:14:53,106 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-12 17:14:53,107 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-12 17:14:53,108 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-12 17:14:53,110 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-12 17:14:53,111 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-12 17:14:53,112 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-12 17:14:53,117 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-12 17:14:53,126 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-12 17:14:53,129 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-12 17:14:53,129 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-12 17:14:53,131 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-12 17:14:53,136 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-12 17:14:53,136 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-12 17:14:53,136 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-12 17:14:53,138 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-12 17:14:53,138 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-12 17:14:53,138 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-12 17:14:53,139 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-12 17:14:53,139 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-12 17:14:53,140 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-12 17:14:53,141 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-12 17:14:53,141 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-12 17:14:53,142 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-12 17:14:53,142 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-12 17:14:53,142 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-12 17:14:53,142 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-12 17:14:53,143 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-12 17:14:53,143 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-12 17:14:53,147 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2021-06-12 17:14:53,175 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-12 17:14:53,175 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-12 17:14:53,176 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-12 17:14:53,176 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-12 17:14:53,178 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-12 17:14:53,178 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-12 17:14:53,178 INFO L138 SettingsManager]: * Use SBE=true [2021-06-12 17:14:53,178 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-12 17:14:53,178 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-12 17:14:53,179 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-12 17:14:53,179 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-12 17:14:53,179 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-12 17:14:53,179 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-12 17:14:53,180 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-12 17:14:53,180 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-12 17:14:53,180 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-12 17:14:53,180 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-12 17:14:53,180 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-12 17:14:53,180 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-12 17:14:53,180 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-12 17:14:53,180 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-12 17:14:53,181 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-12 17:14:53,181 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-12 17:14:53,181 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-12 17:14:53,181 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-12 17:14:53,181 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-12 17:14:53,181 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-12 17:14:53,181 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-12 17:14:53,181 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-12 17:14:53,182 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-12 17:14:53,182 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-12 17:14:53,182 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-06-12 17:14:53,422 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-12 17:14:53,437 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-12 17:14:53,439 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-12 17:14:53,439 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-12 17:14:53,440 INFO L275 PluginConnector]: CDTParser initialized [2021-06-12 17:14:53,440 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe004_pso.opt.i [2021-06-12 17:14:53,494 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17d6ce819/b4218db390bc4308a7753f6f30279b98/FLAG2e9b4375d [2021-06-12 17:14:53,885 INFO L306 CDTParser]: Found 1 translation units. [2021-06-12 17:14:53,886 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe004_pso.opt.i [2021-06-12 17:14:53,901 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17d6ce819/b4218db390bc4308a7753f6f30279b98/FLAG2e9b4375d [2021-06-12 17:14:54,242 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17d6ce819/b4218db390bc4308a7753f6f30279b98 [2021-06-12 17:14:54,244 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-12 17:14:54,245 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-12 17:14:54,246 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-12 17:14:54,246 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-12 17:14:54,248 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-12 17:14:54,249 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.06 05:14:54" (1/1) ... [2021-06-12 17:14:54,249 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@124dce24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 05:14:54, skipping insertion in model container [2021-06-12 17:14:54,250 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.06 05:14:54" (1/1) ... [2021-06-12 17:14:54,254 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-12 17:14:54,287 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-12 17:14:54,373 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe004_pso.opt.i[949,962] [2021-06-12 17:14:54,494 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-12 17:14:54,500 INFO L203 MainTranslator]: Completed pre-run [2021-06-12 17:14:54,507 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe004_pso.opt.i[949,962] [2021-06-12 17:14:54,532 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-12 17:14:54,576 INFO L208 MainTranslator]: Completed translation [2021-06-12 17:14:54,577 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 05:14:54 WrapperNode [2021-06-12 17:14:54,577 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-12 17:14:54,578 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-12 17:14:54,578 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-12 17:14:54,578 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-12 17:14:54,582 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 05:14:54" (1/1) ... [2021-06-12 17:14:54,593 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 05:14:54" (1/1) ... [2021-06-12 17:14:54,617 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-12 17:14:54,617 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-12 17:14:54,617 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-12 17:14:54,617 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-12 17:14:54,622 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 05:14:54" (1/1) ... [2021-06-12 17:14:54,623 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 05:14:54" (1/1) ... [2021-06-12 17:14:54,625 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 05:14:54" (1/1) ... [2021-06-12 17:14:54,625 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 05:14:54" (1/1) ... [2021-06-12 17:14:54,631 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 05:14:54" (1/1) ... [2021-06-12 17:14:54,633 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 05:14:54" (1/1) ... [2021-06-12 17:14:54,635 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 05:14:54" (1/1) ... [2021-06-12 17:14:54,638 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-12 17:14:54,638 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-12 17:14:54,638 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-12 17:14:54,639 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-12 17:14:54,639 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 05:14:54" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-12 17:14:54,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-12 17:14:54,733 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-06-12 17:14:54,734 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-12 17:14:54,734 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-12 17:14:54,734 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-06-12 17:14:54,735 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-06-12 17:14:54,736 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-06-12 17:14:54,736 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-06-12 17:14:54,736 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-06-12 17:14:54,736 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-06-12 17:14:54,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-12 17:14:54,736 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-06-12 17:14:54,736 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-12 17:14:54,736 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-12 17:14:54,738 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-12 17:14:56,346 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-12 17:14:56,347 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-06-12 17:14:56,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.06 05:14:56 BoogieIcfgContainer [2021-06-12 17:14:56,349 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-12 17:14:56,350 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-12 17:14:56,350 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-12 17:14:56,352 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-12 17:14:56,352 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.06 05:14:54" (1/3) ... [2021-06-12 17:14:56,353 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63a9e60f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.06 05:14:56, skipping insertion in model container [2021-06-12 17:14:56,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 05:14:54" (2/3) ... [2021-06-12 17:14:56,353 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63a9e60f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.06 05:14:56, skipping insertion in model container [2021-06-12 17:14:56,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.06 05:14:56" (3/3) ... [2021-06-12 17:14:56,354 INFO L111 eAbstractionObserver]: Analyzing ICFG safe004_pso.opt.i [2021-06-12 17:14:56,359 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-12 17:14:56,359 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-12 17:14:56,359 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-06-12 17:14:56,360 INFO L471 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-12 17:14:56,384 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,385 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,385 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,385 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,385 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,385 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,385 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,385 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,385 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,385 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,386 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,386 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,386 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,386 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,386 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,386 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,386 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,386 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,387 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,387 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,387 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,387 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,388 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,388 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,388 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,388 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,388 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,388 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,388 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,389 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,389 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,389 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,389 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,389 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,389 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,390 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,390 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,390 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,390 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,390 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,390 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,390 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,390 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,390 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,390 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,391 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,391 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,391 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,391 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,391 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,391 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,391 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,391 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,391 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,391 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,391 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,392 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,392 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,392 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,392 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,392 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,393 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,393 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,393 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,393 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,393 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,393 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,393 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,393 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,393 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,393 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,393 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,393 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,394 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,394 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,394 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,394 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,394 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,394 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,394 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,394 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,395 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,396 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,397 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,397 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,397 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,398 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,398 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,398 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,398 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,399 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,399 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,400 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,400 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,400 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,400 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,403 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,404 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,405 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,405 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,405 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,410 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,410 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,410 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,410 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,410 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,410 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,410 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,411 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,412 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,412 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,412 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,412 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,412 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,412 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,412 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,412 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,412 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:14:56,413 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-12 17:14:56,428 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-12 17:14:56,446 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-12 17:14:56,446 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-12 17:14:56,446 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-12 17:14:56,446 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-12 17:14:56,446 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-12 17:14:56,446 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-12 17:14:56,446 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-12 17:14:56,446 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == P1======== [2021-06-12 17:14:56,453 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 114 places, 106 transitions, 227 flow [2021-06-12 17:14:57,109 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 16151 states, 16147 states have (on average 3.6356598748993623) internal successors, (58705), 16150 states have internal predecessors, (58705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:14:57,135 INFO L276 IsEmpty]: Start isEmpty. Operand has 16151 states, 16147 states have (on average 3.6356598748993623) internal successors, (58705), 16150 states have internal predecessors, (58705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:14:57,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-06-12 17:14:57,213 INFO L301 ceAbstractionStarter]: Result for error location P1 was SAFE (1/3) [2021-06-12 17:14:57,214 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-12 17:14:57,216 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-12 17:14:57,216 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-12 17:14:57,216 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-12 17:14:57,216 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-12 17:14:57,216 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-12 17:14:57,216 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-12 17:14:57,216 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-12 17:14:57,216 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == P1Thread1of1ForFork1======== [2021-06-12 17:14:57,219 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 114 places, 106 transitions, 227 flow [2021-06-12 17:14:57,792 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 16151 states, 16147 states have (on average 3.6356598748993623) internal successors, (58705), 16150 states have internal predecessors, (58705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:14:57,815 INFO L276 IsEmpty]: Start isEmpty. Operand has 16151 states, 16147 states have (on average 3.6356598748993623) internal successors, (58705), 16150 states have internal predecessors, (58705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:14:57,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-06-12 17:14:57,817 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:14:57,818 INFO L472 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] [2021-06-12 17:14:57,818 INFO L430 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:14:57,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:14:57,822 INFO L82 PathProgramCache]: Analyzing trace with hash -591144752, now seen corresponding path program 1 times [2021-06-12 17:14:57,827 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:14:57,828 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439626791] [2021-06-12 17:14:57,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:14:57,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:14:58,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:14:58,036 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:14:58,036 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439626791] [2021-06-12 17:14:58,037 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439626791] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:14:58,037 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:14:58,037 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-12 17:14:58,037 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046393889] [2021-06-12 17:14:58,040 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-12 17:14:58,040 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:14:58,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-12 17:14:58,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-12 17:14:58,069 INFO L87 Difference]: Start difference. First operand has 16151 states, 16147 states have (on average 3.6356598748993623) internal successors, (58705), 16150 states have internal predecessors, (58705), 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 24.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:14:58,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:14:58,222 INFO L93 Difference]: Finished difference Result 13855 states and 49120 transitions. [2021-06-12 17:14:58,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-12 17:14:58,224 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 24.0) internal successors, (48), 3 states have internal predecessors, (48), 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 48 [2021-06-12 17:14:58,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:14:58,227 INFO L225 Difference]: With dead ends: 13855 [2021-06-12 17:14:58,227 INFO L226 Difference]: Without dead ends: 0 [2021-06-12 17:14:58,229 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-12 17:14:58,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-06-12 17:14:58,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-06-12 17:14:58,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:14:58,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-06-12 17:14:58,243 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 48 [2021-06-12 17:14:58,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:14:58,243 INFO L482 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-06-12 17:14:58,243 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 24.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:14:58,243 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-06-12 17:14:58,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-06-12 17:14:58,244 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-12 17:14:58,244 INFO L301 ceAbstractionStarter]: Result for error location P1Thread1of1ForFork1 was SAFE (2/3) [2021-06-12 17:14:58,244 INFO L255 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-06-12 17:14:58,245 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-12 17:14:58,245 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-12 17:14:58,246 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-12 17:14:58,246 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-12 17:14:58,246 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-12 17:14:58,246 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-12 17:14:58,246 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-12 17:14:58,246 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.start======== [2021-06-12 17:14:58,247 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 114 places, 106 transitions, 227 flow [2021-06-12 17:14:58,835 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 16151 states, 16147 states have (on average 3.6356598748993623) internal successors, (58705), 16150 states have internal predecessors, (58705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:14:58,857 INFO L276 IsEmpty]: Start isEmpty. Operand has 16151 states, 16147 states have (on average 3.6356598748993623) internal successors, (58705), 16150 states have internal predecessors, (58705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:14:58,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-06-12 17:14:58,870 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:14:58,870 INFO L472 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] [2021-06-12 17:14:58,870 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:14:58,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:14:58,871 INFO L82 PathProgramCache]: Analyzing trace with hash -1192679358, now seen corresponding path program 1 times [2021-06-12 17:14:58,871 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:14:58,871 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598489769] [2021-06-12 17:14:58,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:14:58,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:14:59,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:14:59,080 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:14:59,080 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598489769] [2021-06-12 17:14:59,081 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598489769] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:14:59,081 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:14:59,081 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-12 17:14:59,081 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375598674] [2021-06-12 17:14:59,082 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-12 17:14:59,082 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:14:59,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-12 17:14:59,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-12 17:14:59,100 INFO L87 Difference]: Start difference. First operand has 16151 states, 16147 states have (on average 3.6356598748993623) internal successors, (58705), 16150 states have internal predecessors, (58705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:14:59,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:14:59,338 INFO L93 Difference]: Finished difference Result 20183 states and 71433 transitions. [2021-06-12 17:14:59,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-12 17:14:59,341 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 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 67 [2021-06-12 17:14:59,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:14:59,394 INFO L225 Difference]: With dead ends: 20183 [2021-06-12 17:14:59,394 INFO L226 Difference]: Without dead ends: 7943 [2021-06-12 17:14:59,394 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 99.9ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-12 17:14:59,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7943 states. [2021-06-12 17:14:59,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7943 to 7943. [2021-06-12 17:14:59,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7943 states, 7941 states have (on average 3.465936280065483) internal successors, (27523), 7942 states have internal predecessors, (27523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:14:59,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7943 states to 7943 states and 27523 transitions. [2021-06-12 17:14:59,724 INFO L78 Accepts]: Start accepts. Automaton has 7943 states and 27523 transitions. Word has length 67 [2021-06-12 17:14:59,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:14:59,725 INFO L482 AbstractCegarLoop]: Abstraction has 7943 states and 27523 transitions. [2021-06-12 17:14:59,726 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:14:59,726 INFO L276 IsEmpty]: Start isEmpty. Operand 7943 states and 27523 transitions. [2021-06-12 17:14:59,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-06-12 17:14:59,811 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:14:59,811 INFO L472 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-06-12 17:14:59,811 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-12 17:14:59,812 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:14:59,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:14:59,812 INFO L82 PathProgramCache]: Analyzing trace with hash -1997772786, now seen corresponding path program 1 times [2021-06-12 17:14:59,812 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:14:59,812 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568257630] [2021-06-12 17:14:59,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:14:59,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:15:00,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:15:00,007 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:15:00,007 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568257630] [2021-06-12 17:15:00,007 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568257630] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:15:00,007 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:15:00,007 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-12 17:15:00,007 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731376923] [2021-06-12 17:15:00,008 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-12 17:15:00,008 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:15:00,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-12 17:15:00,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-06-12 17:15:00,009 INFO L87 Difference]: Start difference. First operand 7943 states and 27523 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 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-06-12 17:15:00,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:15:00,197 INFO L93 Difference]: Finished difference Result 12023 states and 41602 transitions. [2021-06-12 17:15:00,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-12 17:15:00,198 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 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-06-12 17:15:00,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:15:00,240 INFO L225 Difference]: With dead ends: 12023 [2021-06-12 17:15:00,240 INFO L226 Difference]: Without dead ends: 7343 [2021-06-12 17:15:00,241 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 103.9ms TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2021-06-12 17:15:00,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7343 states. [2021-06-12 17:15:00,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7343 to 7343. [2021-06-12 17:15:00,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7343 states, 7341 states have (on average 3.4342732597738728) internal successors, (25211), 7342 states have internal predecessors, (25211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:15:00,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7343 states to 7343 states and 25211 transitions. [2021-06-12 17:15:00,457 INFO L78 Accepts]: Start accepts. Automaton has 7343 states and 25211 transitions. Word has length 70 [2021-06-12 17:15:00,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:15:00,457 INFO L482 AbstractCegarLoop]: Abstraction has 7343 states and 25211 transitions. [2021-06-12 17:15:00,457 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 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-06-12 17:15:00,457 INFO L276 IsEmpty]: Start isEmpty. Operand 7343 states and 25211 transitions. [2021-06-12 17:15:00,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-06-12 17:15:00,467 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:15:00,467 INFO L472 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-06-12 17:15:00,467 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-12 17:15:00,468 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:15:00,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:15:00,468 INFO L82 PathProgramCache]: Analyzing trace with hash -105471251, now seen corresponding path program 1 times [2021-06-12 17:15:00,468 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:15:00,469 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925242752] [2021-06-12 17:15:00,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:15:00,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:15:00,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:15:00,586 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:15:00,586 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925242752] [2021-06-12 17:15:00,586 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925242752] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:15:00,586 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:15:00,586 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-12 17:15:00,586 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416158634] [2021-06-12 17:15:00,586 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-12 17:15:00,586 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:15:00,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-12 17:15:00,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-06-12 17:15:00,587 INFO L87 Difference]: Start difference. First operand 7343 states and 25211 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 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-06-12 17:15:00,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:15:00,757 INFO L93 Difference]: Finished difference Result 14273 states and 48410 transitions. [2021-06-12 17:15:00,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-12 17:15:00,758 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 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-06-12 17:15:00,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:15:00,778 INFO L225 Difference]: With dead ends: 14273 [2021-06-12 17:15:00,778 INFO L226 Difference]: Without dead ends: 7521 [2021-06-12 17:15:00,778 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 97.1ms TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2021-06-12 17:15:00,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7521 states. [2021-06-12 17:15:00,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7521 to 5271. [2021-06-12 17:15:00,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5271 states, 5270 states have (on average 3.3212523719165086) internal successors, (17503), 5270 states have internal predecessors, (17503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:15:01,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5271 states to 5271 states and 17503 transitions. [2021-06-12 17:15:01,006 INFO L78 Accepts]: Start accepts. Automaton has 5271 states and 17503 transitions. Word has length 72 [2021-06-12 17:15:01,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:15:01,007 INFO L482 AbstractCegarLoop]: Abstraction has 5271 states and 17503 transitions. [2021-06-12 17:15:01,007 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 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-06-12 17:15:01,007 INFO L276 IsEmpty]: Start isEmpty. Operand 5271 states and 17503 transitions. [2021-06-12 17:15:01,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-06-12 17:15:01,015 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:15:01,015 INFO L472 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-06-12 17:15:01,015 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-12 17:15:01,015 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:15:01,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:15:01,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1526736092, now seen corresponding path program 1 times [2021-06-12 17:15:01,016 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:15:01,019 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456073927] [2021-06-12 17:15:01,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:15:01,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:15:01,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:15:01,147 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:15:01,147 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456073927] [2021-06-12 17:15:01,147 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456073927] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:15:01,147 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:15:01,147 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-12 17:15:01,147 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609806525] [2021-06-12 17:15:01,148 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-12 17:15:01,148 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:15:01,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-12 17:15:01,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-12 17:15:01,149 INFO L87 Difference]: Start difference. First operand 5271 states and 17503 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 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-06-12 17:15:01,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:15:01,270 INFO L93 Difference]: Finished difference Result 7721 states and 25598 transitions. [2021-06-12 17:15:01,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-12 17:15:01,270 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 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-06-12 17:15:01,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:15:01,279 INFO L225 Difference]: With dead ends: 7721 [2021-06-12 17:15:01,279 INFO L226 Difference]: Without dead ends: 3297 [2021-06-12 17:15:01,280 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 82.8ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-12 17:15:01,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3297 states. [2021-06-12 17:15:01,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3297 to 3297. [2021-06-12 17:15:01,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3297 states, 3296 states have (on average 3.284890776699029) internal successors, (10827), 3296 states have internal predecessors, (10827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:15:01,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3297 states to 3297 states and 10827 transitions. [2021-06-12 17:15:01,353 INFO L78 Accepts]: Start accepts. Automaton has 3297 states and 10827 transitions. Word has length 73 [2021-06-12 17:15:01,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:15:01,353 INFO L482 AbstractCegarLoop]: Abstraction has 3297 states and 10827 transitions. [2021-06-12 17:15:01,354 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 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-06-12 17:15:01,354 INFO L276 IsEmpty]: Start isEmpty. Operand 3297 states and 10827 transitions. [2021-06-12 17:15:01,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-06-12 17:15:01,358 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:15:01,358 INFO L472 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-06-12 17:15:01,358 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-12 17:15:01,358 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:15:01,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:15:01,359 INFO L82 PathProgramCache]: Analyzing trace with hash 813228213, now seen corresponding path program 1 times [2021-06-12 17:15:01,359 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:15:01,359 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572715676] [2021-06-12 17:15:01,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:15:01,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:15:01,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:15:01,554 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:15:01,555 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572715676] [2021-06-12 17:15:01,555 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572715676] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:15:01,555 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:15:01,555 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-12 17:15:01,555 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745358860] [2021-06-12 17:15:01,555 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-12 17:15:01,555 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:15:01,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-12 17:15:01,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-06-12 17:15:01,556 INFO L87 Difference]: Start difference. First operand 3297 states and 10827 transitions. Second operand has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 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-06-12 17:15:01,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:15:01,820 INFO L93 Difference]: Finished difference Result 3891 states and 12714 transitions. [2021-06-12 17:15:01,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-12 17:15:01,821 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 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-06-12 17:15:01,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:15:01,829 INFO L225 Difference]: With dead ends: 3891 [2021-06-12 17:15:01,829 INFO L226 Difference]: Without dead ends: 3291 [2021-06-12 17:15:01,829 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 185.8ms TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2021-06-12 17:15:01,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3291 states. [2021-06-12 17:15:01,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3291 to 3291. [2021-06-12 17:15:01,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3291 states, 3290 states have (on average 3.2835866261398174) internal successors, (10803), 3290 states have internal predecessors, (10803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:15:01,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3291 states to 3291 states and 10803 transitions. [2021-06-12 17:15:01,885 INFO L78 Accepts]: Start accepts. Automaton has 3291 states and 10803 transitions. Word has length 75 [2021-06-12 17:15:01,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:15:01,885 INFO L482 AbstractCegarLoop]: Abstraction has 3291 states and 10803 transitions. [2021-06-12 17:15:01,885 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 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-06-12 17:15:01,886 INFO L276 IsEmpty]: Start isEmpty. Operand 3291 states and 10803 transitions. [2021-06-12 17:15:01,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-06-12 17:15:01,890 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:15:01,890 INFO L472 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] [2021-06-12 17:15:01,890 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-12 17:15:01,890 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:15:01,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:15:01,890 INFO L82 PathProgramCache]: Analyzing trace with hash -674049107, now seen corresponding path program 1 times [2021-06-12 17:15:01,890 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:15:01,890 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183109286] [2021-06-12 17:15:01,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:15:01,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:15:02,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:15:02,041 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:15:02,041 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183109286] [2021-06-12 17:15:02,041 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183109286] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:15:02,041 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:15:02,041 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-12 17:15:02,042 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164834050] [2021-06-12 17:15:02,042 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-12 17:15:02,042 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:15:02,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-12 17:15:02,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-06-12 17:15:02,045 INFO L87 Difference]: Start difference. First operand 3291 states and 10803 transitions. Second operand has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:15:02,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:15:02,365 INFO L93 Difference]: Finished difference Result 4241 states and 13941 transitions. [2021-06-12 17:15:02,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-12 17:15:02,366 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2021-06-12 17:15:02,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:15:02,375 INFO L225 Difference]: With dead ends: 4241 [2021-06-12 17:15:02,375 INFO L226 Difference]: Without dead ends: 3645 [2021-06-12 17:15:02,376 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 171.9ms TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2021-06-12 17:15:02,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3645 states. [2021-06-12 17:15:02,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3645 to 3501. [2021-06-12 17:15:02,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3501 states, 3500 states have (on average 3.294) internal successors, (11529), 3500 states have internal predecessors, (11529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:15:02,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3501 states to 3501 states and 11529 transitions. [2021-06-12 17:15:02,443 INFO L78 Accepts]: Start accepts. Automaton has 3501 states and 11529 transitions. Word has length 76 [2021-06-12 17:15:02,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:15:02,443 INFO L482 AbstractCegarLoop]: Abstraction has 3501 states and 11529 transitions. [2021-06-12 17:15:02,444 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:15:02,444 INFO L276 IsEmpty]: Start isEmpty. Operand 3501 states and 11529 transitions. [2021-06-12 17:15:02,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-06-12 17:15:02,448 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:15:02,448 INFO L472 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] [2021-06-12 17:15:02,448 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-12 17:15:02,449 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:15:02,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:15:02,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1971943357, now seen corresponding path program 1 times [2021-06-12 17:15:02,449 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:15:02,449 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935077765] [2021-06-12 17:15:02,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:15:02,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:15:02,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:15:02,706 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:15:02,706 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935077765] [2021-06-12 17:15:02,706 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935077765] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:15:02,706 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:15:02,707 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-06-12 17:15:02,707 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956457524] [2021-06-12 17:15:02,707 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-12 17:15:02,707 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:15:02,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-12 17:15:02,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2021-06-12 17:15:02,708 INFO L87 Difference]: Start difference. First operand 3501 states and 11529 transitions. Second operand has 13 states, 13 states have (on average 5.846153846153846) internal successors, (76), 13 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:15:03,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:15:03,269 INFO L93 Difference]: Finished difference Result 3957 states and 12947 transitions. [2021-06-12 17:15:03,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-06-12 17:15:03,269 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.846153846153846) internal successors, (76), 13 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2021-06-12 17:15:03,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:15:03,278 INFO L225 Difference]: With dead ends: 3957 [2021-06-12 17:15:03,278 INFO L226 Difference]: Without dead ends: 3477 [2021-06-12 17:15:03,278 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 428.1ms TimeCoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2021-06-12 17:15:03,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3477 states. [2021-06-12 17:15:03,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3477 to 3477. [2021-06-12 17:15:03,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3477 states, 3476 states have (on average 3.2908515535097815) internal successors, (11439), 3476 states have internal predecessors, (11439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:15:03,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3477 states to 3477 states and 11439 transitions. [2021-06-12 17:15:03,349 INFO L78 Accepts]: Start accepts. Automaton has 3477 states and 11439 transitions. Word has length 76 [2021-06-12 17:15:03,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:15:03,349 INFO L482 AbstractCegarLoop]: Abstraction has 3477 states and 11439 transitions. [2021-06-12 17:15:03,350 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 5.846153846153846) internal successors, (76), 13 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:15:03,350 INFO L276 IsEmpty]: Start isEmpty. Operand 3477 states and 11439 transitions. [2021-06-12 17:15:03,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-06-12 17:15:03,355 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:15:03,355 INFO L472 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] [2021-06-12 17:15:03,355 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-12 17:15:03,355 INFO L430 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:15:03,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:15:03,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1079028512, now seen corresponding path program 1 times [2021-06-12 17:15:03,356 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:15:03,356 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458669838] [2021-06-12 17:15:03,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:15:03,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:15:03,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:15:03,433 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:15:03,433 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458669838] [2021-06-12 17:15:03,433 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458669838] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:15:03,433 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:15:03,433 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-12 17:15:03,433 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987252936] [2021-06-12 17:15:03,433 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-12 17:15:03,433 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:15:03,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-12 17:15:03,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-12 17:15:03,434 INFO L87 Difference]: Start difference. First operand 3477 states and 11439 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:15:03,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:15:03,525 INFO L93 Difference]: Finished difference Result 4193 states and 13606 transitions. [2021-06-12 17:15:03,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-12 17:15:03,526 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2021-06-12 17:15:03,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:15:03,531 INFO L225 Difference]: With dead ends: 4193 [2021-06-12 17:15:03,531 INFO L226 Difference]: Without dead ends: 3105 [2021-06-12 17:15:03,532 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 66.5ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-12 17:15:03,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3105 states. [2021-06-12 17:15:03,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3105 to 3105. [2021-06-12 17:15:03,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3105 states, 3104 states have (on average 3.2464561855670104) internal successors, (10077), 3104 states have internal predecessors, (10077), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:15:03,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3105 states to 3105 states and 10077 transitions. [2021-06-12 17:15:03,593 INFO L78 Accepts]: Start accepts. Automaton has 3105 states and 10077 transitions. Word has length 76 [2021-06-12 17:15:03,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:15:03,593 INFO L482 AbstractCegarLoop]: Abstraction has 3105 states and 10077 transitions. [2021-06-12 17:15:03,593 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:15:03,593 INFO L276 IsEmpty]: Start isEmpty. Operand 3105 states and 10077 transitions. [2021-06-12 17:15:03,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-06-12 17:15:03,597 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:15:03,598 INFO L472 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] [2021-06-12 17:15:03,598 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-12 17:15:03,598 INFO L430 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:15:03,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:15:03,598 INFO L82 PathProgramCache]: Analyzing trace with hash -132854058, now seen corresponding path program 1 times [2021-06-12 17:15:03,598 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:15:03,598 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462981313] [2021-06-12 17:15:03,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:15:03,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:15:03,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:15:03,679 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:15:03,679 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462981313] [2021-06-12 17:15:03,679 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462981313] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:15:03,679 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:15:03,679 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-12 17:15:03,679 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363385380] [2021-06-12 17:15:03,680 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-12 17:15:03,680 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:15:03,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-12 17:15:03,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-12 17:15:03,680 INFO L87 Difference]: Start difference. First operand 3105 states and 10077 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:15:03,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:15:03,786 INFO L93 Difference]: Finished difference Result 3099 states and 9764 transitions. [2021-06-12 17:15:03,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-12 17:15:03,787 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2021-06-12 17:15:03,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:15:03,791 INFO L225 Difference]: With dead ends: 3099 [2021-06-12 17:15:03,791 INFO L226 Difference]: Without dead ends: 2223 [2021-06-12 17:15:03,792 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 84.7ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-06-12 17:15:03,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2223 states. [2021-06-12 17:15:03,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2223 to 2199. [2021-06-12 17:15:03,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2199 states, 2198 states have (on average 3.100545950864422) internal successors, (6815), 2198 states have internal predecessors, (6815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:15:03,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2199 states to 2199 states and 6815 transitions. [2021-06-12 17:15:03,865 INFO L78 Accepts]: Start accepts. Automaton has 2199 states and 6815 transitions. Word has length 77 [2021-06-12 17:15:03,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:15:03,865 INFO L482 AbstractCegarLoop]: Abstraction has 2199 states and 6815 transitions. [2021-06-12 17:15:03,865 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:15:03,865 INFO L276 IsEmpty]: Start isEmpty. Operand 2199 states and 6815 transitions. [2021-06-12 17:15:03,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-06-12 17:15:03,868 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:15:03,868 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 17:15:03,869 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-12 17:15:03,869 INFO L430 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:15:03,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:15:03,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1315090985, now seen corresponding path program 1 times [2021-06-12 17:15:03,869 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:15:03,869 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628152013] [2021-06-12 17:15:03,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:15:03,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:15:03,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:15:03,973 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:15:03,973 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628152013] [2021-06-12 17:15:03,973 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628152013] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:15:03,973 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:15:03,973 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-12 17:15:03,973 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593569342] [2021-06-12 17:15:03,973 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-12 17:15:03,973 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:15:03,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-12 17:15:03,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-12 17:15:03,974 INFO L87 Difference]: Start difference. First operand 2199 states and 6815 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:15:04,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:15:04,091 INFO L93 Difference]: Finished difference Result 1749 states and 5252 transitions. [2021-06-12 17:15:04,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-12 17:15:04,091 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2021-06-12 17:15:04,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:15:04,093 INFO L225 Difference]: With dead ends: 1749 [2021-06-12 17:15:04,093 INFO L226 Difference]: Without dead ends: 1281 [2021-06-12 17:15:04,094 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 87.0ms TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2021-06-12 17:15:04,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1281 states. [2021-06-12 17:15:04,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1281 to 1233. [2021-06-12 17:15:04,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1233 states, 1232 states have (on average 2.924512987012987) internal successors, (3603), 1232 states have internal predecessors, (3603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:15:04,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1233 states to 1233 states and 3603 transitions. [2021-06-12 17:15:04,110 INFO L78 Accepts]: Start accepts. Automaton has 1233 states and 3603 transitions. Word has length 79 [2021-06-12 17:15:04,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:15:04,110 INFO L482 AbstractCegarLoop]: Abstraction has 1233 states and 3603 transitions. [2021-06-12 17:15:04,110 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:15:04,110 INFO L276 IsEmpty]: Start isEmpty. Operand 1233 states and 3603 transitions. [2021-06-12 17:15:04,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-06-12 17:15:04,112 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:15:04,112 INFO L472 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-12 17:15:04,112 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-12 17:15:04,112 INFO L430 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:15:04,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:15:04,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1050652048, now seen corresponding path program 1 times [2021-06-12 17:15:04,113 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:15:04,113 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200699405] [2021-06-12 17:15:04,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:15:04,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-12 17:15:04,152 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-12 17:15:04,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-12 17:15:04,206 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-12 17:15:04,245 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-12 17:15:04,245 INFO L573 BasicCegarLoop]: Counterexample might be feasible [2021-06-12 17:15:04,245 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-12 17:15:04,245 INFO L301 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (3/3) [2021-06-12 17:15:04,246 INFO L247 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-06-12 17:15:04,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.06 05:15:04 BasicIcfg [2021-06-12 17:15:04,346 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-12 17:15:04,346 INFO L168 Benchmark]: Toolchain (without parser) took 10101.21 ms. Allocated memory was 183.5 MB in the beginning and 1.2 GB in the end (delta: 1.0 GB). Free memory was 146.2 MB in the beginning and 876.9 MB in the end (delta: -730.7 MB). Peak memory consumption was 283.8 MB. Max. memory is 8.0 GB. [2021-06-12 17:15:04,346 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 183.5 MB. Free memory is still 164.2 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-06-12 17:15:04,346 INFO L168 Benchmark]: CACSL2BoogieTranslator took 331.13 ms. Allocated memory is still 183.5 MB. Free memory was 145.9 MB in the beginning and 141.9 MB in the end (delta: 4.1 MB). Peak memory consumption was 12.8 MB. Max. memory is 8.0 GB. [2021-06-12 17:15:04,347 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.21 ms. Allocated memory is still 183.5 MB. Free memory was 141.9 MB in the beginning and 138.7 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-06-12 17:15:04,347 INFO L168 Benchmark]: Boogie Preprocessor took 20.71 ms. Allocated memory is still 183.5 MB. Free memory was 138.7 MB in the beginning and 136.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-06-12 17:15:04,347 INFO L168 Benchmark]: RCFGBuilder took 1710.46 ms. Allocated memory was 183.5 MB in the beginning and 220.2 MB in the end (delta: 36.7 MB). Free memory was 136.6 MB in the beginning and 143.2 MB in the end (delta: -6.5 MB). Peak memory consumption was 83.1 MB. Max. memory is 8.0 GB. [2021-06-12 17:15:04,347 INFO L168 Benchmark]: TraceAbstraction took 7995.60 ms. Allocated memory was 220.2 MB in the beginning and 1.2 GB in the end (delta: 977.3 MB). Free memory was 142.7 MB in the beginning and 876.9 MB in the end (delta: -734.3 MB). Peak memory consumption was 242.5 MB. Max. memory is 8.0 GB. [2021-06-12 17:15:04,349 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.12 ms. Allocated memory is still 183.5 MB. Free memory is still 164.2 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 331.13 ms. Allocated memory is still 183.5 MB. Free memory was 145.9 MB in the beginning and 141.9 MB in the end (delta: 4.1 MB). Peak memory consumption was 12.8 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 39.21 ms. Allocated memory is still 183.5 MB. Free memory was 141.9 MB in the beginning and 138.7 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 20.71 ms. Allocated memory is still 183.5 MB. Free memory was 138.7 MB in the beginning and 136.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1710.46 ms. Allocated memory was 183.5 MB in the beginning and 220.2 MB in the end (delta: 36.7 MB). Free memory was 136.6 MB in the beginning and 143.2 MB in the end (delta: -6.5 MB). Peak memory consumption was 83.1 MB. Max. memory is 8.0 GB. * TraceAbstraction took 7995.60 ms. Allocated memory was 220.2 MB in the beginning and 1.2 GB in the end (delta: 977.3 MB). Free memory was 142.7 MB in the beginning and 876.9 MB in the end (delta: -734.3 MB). Peak memory consumption was 242.5 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 18]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L713] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L714] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0] [L715] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L717] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L718] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L719] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L720] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L721] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L722] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L723] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0] [L724] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0] [L725] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L726] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L727] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0] [L728] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0] [L729] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L730] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L731] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L732] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L733] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L735] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L736] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L737] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L818] 0 pthread_t t1882; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L819] FCALL, FORK 0 pthread_create(&t1882, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L820] 0 pthread_t t1883; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L821] FCALL, FORK 0 pthread_create(&t1883, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L822] 0 pthread_t t1884; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L761] 2 x$w_buff1 = x$w_buff0 [L762] 2 x$w_buff0 = 2 [L763] 2 x$w_buff1_used = x$w_buff0_used [L764] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L766] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L767] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L768] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L769] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L770] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L823] FCALL, FORK 0 pthread_create(&t1884, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L790] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L793] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L741] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L744] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L796] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L796] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L796] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L796] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L797] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L797] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L798] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L798] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L799] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L799] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L800] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L800] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L747] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L747] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L747] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L747] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L748] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L748] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L749] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L749] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L750] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L750] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L751] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L751] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L776] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L776] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L778] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L779] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L780] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L829] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L829] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L829] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L829] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L830] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L830] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L831] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L831] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L832] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L832] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L833] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L833] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 x$flush_delayed = weak$$choice2 [L839] 0 x$mem_tmp = x [L840] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L840] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L841] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L841] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L841] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L841] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L842] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L842] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L842] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L842] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L843] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L843] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L843] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L843] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L844] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L844] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L845] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L845] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L845] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L846] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L846] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) [L848] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L848] 0 x = x$flush_delayed ? x$mem_tmp : x [L849] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L18] 0 reach_error() VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: P1 with 1 thread instances CFG has 7 procedures, 133 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 768.4ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 103.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 662.9ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=16151occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: P1Thread1of1ForFork1 with 1 thread instances CFG has 7 procedures, 133 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 1028.1ms, OverallIterations: 1, TraceHistogramMax: 1, EmptinessCheckTime: 24.8ms, AutomataDifference: 187.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 576.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 94 SDtfs, 42 SDslu, 72 SDs, 0 SdLazy, 11 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 25.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=16151occurred in iteration=0, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 5.8ms AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 8.0ms SsaConstructionTime, 57.5ms SatisfiabilityAnalysisTime, 91.9ms InterpolantComputationTime, 48 NumberOfCodeBlocks, 48 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 47 ConstructedInterpolants, 0 QuantifiedInterpolants, 89 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 7 procedures, 133 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 5999.9ms, OverallIterations: 11, TraceHistogramMax: 1, EmptinessCheckTime: 164.3ms, AutomataDifference: 2375.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 589.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1395 SDtfs, 2111 SDslu, 5106 SDs, 0 SdLazy, 668 SolverSat, 133 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 697.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 146 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 1408.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=16151occurred in iteration=0, InterpolantAutomatonStates: 115, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 1190.0ms AutomataMinimizationTime, 10 MinimizatonAttempts, 2466 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 33.0ms SsaConstructionTime, 384.9ms SatisfiabilityAnalysisTime, 1079.5ms InterpolantComputationTime, 823 NumberOfCodeBlocks, 823 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 731 ConstructedInterpolants, 0 QuantifiedInterpolants, 3421 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...