/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix030_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.0-60729f1 [2020-11-11 17:27:25,437 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-11 17:27:25,440 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-11 17:27:25,488 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-11 17:27:25,489 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-11 17:27:25,493 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-11 17:27:25,497 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-11 17:27:25,505 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-11 17:27:25,509 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-11 17:27:25,516 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-11 17:27:25,517 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-11 17:27:25,519 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-11 17:27:25,519 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-11 17:27:25,524 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-11 17:27:25,526 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-11 17:27:25,528 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-11 17:27:25,529 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-11 17:27:25,534 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-11 17:27:25,542 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-11 17:27:25,550 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-11 17:27:25,552 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-11 17:27:25,554 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-11 17:27:25,556 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-11 17:27:25,559 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-11 17:27:25,569 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-11 17:27:25,570 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-11 17:27:25,571 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-11 17:27:25,573 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-11 17:27:25,574 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-11 17:27:25,575 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-11 17:27:25,575 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-11 17:27:25,576 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-11 17:27:25,578 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-11 17:27:25,579 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-11 17:27:25,580 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-11 17:27:25,581 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-11 17:27:25,582 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-11 17:27:25,582 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-11 17:27:25,582 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-11 17:27:25,583 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-11 17:27:25,584 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-11 17:27:25,585 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 [2020-11-11 17:27:25,648 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-11 17:27:25,648 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-11 17:27:25,652 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-11 17:27:25,652 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-11 17:27:25,652 INFO L138 SettingsManager]: * Use SBE=true [2020-11-11 17:27:25,653 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-11 17:27:25,653 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-11 17:27:25,653 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-11 17:27:25,653 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-11 17:27:25,654 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-11 17:27:25,655 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-11 17:27:25,655 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-11 17:27:25,656 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-11 17:27:25,656 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-11 17:27:25,656 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-11 17:27:25,656 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-11 17:27:25,657 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-11 17:27:25,657 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-11 17:27:25,657 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-11 17:27:25,657 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-11 17:27:25,658 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-11 17:27:25,658 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-11 17:27:25,658 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-11 17:27:25,659 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-11 17:27:25,659 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-11 17:27:25,659 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-11 17:27:25,659 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-11 17:27:25,660 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2020-11-11 17:27:25,660 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-11 17:27:25,660 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 [2020-11-11 17:27:26,111 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-11 17:27:26,135 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-11 17:27:26,138 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-11 17:27:26,140 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-11 17:27:26,140 INFO L275 PluginConnector]: CDTParser initialized [2020-11-11 17:27:26,142 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix030_pso.opt.i [2020-11-11 17:27:26,233 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de149660f/1796a41bc5364f6f9b2740adaa55522b/FLAG02774761d [2020-11-11 17:27:26,990 INFO L306 CDTParser]: Found 1 translation units. [2020-11-11 17:27:26,991 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix030_pso.opt.i [2020-11-11 17:27:27,014 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de149660f/1796a41bc5364f6f9b2740adaa55522b/FLAG02774761d [2020-11-11 17:27:27,269 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de149660f/1796a41bc5364f6f9b2740adaa55522b [2020-11-11 17:27:27,272 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-11 17:27:27,278 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-11-11 17:27:27,280 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-11 17:27:27,280 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-11 17:27:27,284 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-11 17:27:27,285 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 05:27:27" (1/1) ... [2020-11-11 17:27:27,289 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b7a633e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:27:27, skipping insertion in model container [2020-11-11 17:27:27,289 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 05:27:27" (1/1) ... [2020-11-11 17:27:27,298 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-11 17:27:27,345 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-11 17:27:27,780 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-11 17:27:27,792 INFO L203 MainTranslator]: Completed pre-run [2020-11-11 17:27:27,877 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-11 17:27:28,067 INFO L208 MainTranslator]: Completed translation [2020-11-11 17:27:28,070 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:27:28 WrapperNode [2020-11-11 17:27:28,070 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-11 17:27:28,073 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-11 17:27:28,073 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-11 17:27:28,073 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-11 17:27:28,083 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:27:28" (1/1) ... [2020-11-11 17:27:28,142 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:27:28" (1/1) ... [2020-11-11 17:27:28,203 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-11 17:27:28,204 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-11 17:27:28,204 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-11 17:27:28,204 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-11 17:27:28,215 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:27:28" (1/1) ... [2020-11-11 17:27:28,215 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:27:28" (1/1) ... [2020-11-11 17:27:28,232 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:27:28" (1/1) ... [2020-11-11 17:27:28,233 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:27:28" (1/1) ... [2020-11-11 17:27:28,259 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:27:28" (1/1) ... [2020-11-11 17:27:28,266 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:27:28" (1/1) ... [2020-11-11 17:27:28,275 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:27:28" (1/1) ... [2020-11-11 17:27:28,285 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-11 17:27:28,288 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-11 17:27:28,288 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-11 17:27:28,288 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-11 17:27:28,289 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:27:28" (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 [2020-11-11 17:27:28,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-11 17:27:28,384 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-11 17:27:28,384 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-11 17:27:28,385 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-11 17:27:28,385 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-11-11 17:27:28,386 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-11-11 17:27:28,387 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-11-11 17:27:28,388 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-11-11 17:27:28,389 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-11-11 17:27:28,390 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-11-11 17:27:28,390 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-11-11 17:27:28,390 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-11-11 17:27:28,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-11 17:27:28,391 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-11 17:27:28,391 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-11 17:27:28,391 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-11 17:27:28,393 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-11-11 17:27:31,109 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-11 17:27:31,109 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-11-11 17:27:31,112 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 05:27:31 BoogieIcfgContainer [2020-11-11 17:27:31,112 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-11 17:27:31,114 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-11 17:27:31,114 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-11 17:27:31,117 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-11 17:27:31,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 05:27:27" (1/3) ... [2020-11-11 17:27:31,119 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ddb9071 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 05:27:31, skipping insertion in model container [2020-11-11 17:27:31,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:27:28" (2/3) ... [2020-11-11 17:27:31,119 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ddb9071 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 05:27:31, skipping insertion in model container [2020-11-11 17:27:31,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 05:27:31" (3/3) ... [2020-11-11 17:27:31,121 INFO L111 eAbstractionObserver]: Analyzing ICFG mix030_pso.opt.i [2020-11-11 17:27:31,138 WARN L168 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-11 17:27:31,138 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-11 17:27:31,142 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-11 17:27:31,143 INFO L351 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-11 17:27:31,184 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,184 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,184 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,185 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,185 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,185 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,185 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,185 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,186 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,186 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,186 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,186 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,187 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,187 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,187 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,187 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,187 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,188 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,188 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,188 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,188 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,188 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,189 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,189 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,189 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,189 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,189 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,190 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,190 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,190 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,190 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,190 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,191 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,191 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,191 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,192 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,192 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,192 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,192 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,193 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,193 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,193 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,193 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,193 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,193 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,194 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,194 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,194 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,194 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,194 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,195 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,195 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,195 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,195 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,195 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,195 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,196 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,196 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,196 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,196 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,196 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,196 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,197 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,197 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,197 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,197 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,197 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,198 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,198 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,198 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,198 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,198 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,198 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,199 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,199 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,199 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,199 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,200 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,200 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,200 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,201 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,201 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,201 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,201 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,202 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,202 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,202 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,202 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,202 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,203 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,203 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,203 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,203 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,203 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,204 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,204 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,204 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,204 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,204 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,205 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,205 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,205 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,205 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,205 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,206 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,206 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,206 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,207 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,207 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,207 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,209 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,210 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,210 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,210 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,214 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,214 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,214 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,214 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,215 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,215 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,215 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,215 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,215 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,215 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,219 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,220 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,220 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,220 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,220 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,221 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,221 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,221 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,221 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,221 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,222 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,222 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,222 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,222 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,224 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,224 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,224 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,224 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,225 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,225 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,225 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,225 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,225 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,225 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:27:31,227 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-11 17:27:31,240 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-11-11 17:27:31,265 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-11 17:27:31,265 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-11 17:27:31,265 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-11 17:27:31,265 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-11 17:27:31,265 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-11 17:27:31,265 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-11 17:27:31,266 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-11 17:27:31,266 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-11 17:27:31,280 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 129 places, 119 transitions, 258 flow [2020-11-11 17:28:21,869 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 142925 states, 142921 states have (on average 4.5566711679879095) internal successors, (651244), 142924 states have internal predecessors, (651244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 17:28:22,218 INFO L276 IsEmpty]: Start isEmpty. Operand has 142925 states, 142921 states have (on average 4.5566711679879095) internal successors, (651244), 142924 states have internal predecessors, (651244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 17:28:22,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-11-11 17:28:22,232 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 17:28:22,233 INFO L494 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] [2020-11-11 17:28:22,233 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-11 17:28:22,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 17:28:22,246 INFO L82 PathProgramCache]: Analyzing trace with hash 368406893, now seen corresponding path program 1 times [2020-11-11 17:28:22,257 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 17:28:22,257 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485888536] [2020-11-11 17:28:22,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 17:28:22,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 17:28:22,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-11 17:28:22,616 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485888536] [2020-11-11 17:28:22,617 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 17:28:22,618 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-11 17:28:22,618 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090881867] [2020-11-11 17:28:22,623 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-11 17:28:22,624 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 17:28:22,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-11 17:28:22,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-11 17:28:22,817 INFO L87 Difference]: Start difference. First operand has 142925 states, 142921 states have (on average 4.5566711679879095) internal successors, (651244), 142924 states have internal predecessors, (651244), 0 states have call successors, (0), 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 25.5) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 17:28:25,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 17:28:25,619 INFO L93 Difference]: Finished difference Result 119013 states and 528849 transitions. [2020-11-11 17:28:25,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-11 17:28:25,622 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 25.5) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2020-11-11 17:28:25,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 17:28:26,721 INFO L225 Difference]: With dead ends: 119013 [2020-11-11 17:28:26,722 INFO L226 Difference]: Without dead ends: 66597 [2020-11-11 17:28:26,724 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-11 17:28:27,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66597 states. [2020-11-11 17:28:30,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66597 to 66597. [2020-11-11 17:28:31,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66597 states, 66596 states have (on average 4.402441588083368) internal successors, (293185), 66596 states have internal predecessors, (293185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 17:28:31,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66597 states to 66597 states and 293185 transitions. [2020-11-11 17:28:31,843 INFO L78 Accepts]: Start accepts. Automaton has 66597 states and 293185 transitions. Word has length 51 [2020-11-11 17:28:31,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 17:28:31,845 INFO L481 AbstractCegarLoop]: Abstraction has 66597 states and 293185 transitions. [2020-11-11 17:28:31,846 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 25.5) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 17:28:31,846 INFO L276 IsEmpty]: Start isEmpty. Operand 66597 states and 293185 transitions. [2020-11-11 17:28:31,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-11-11 17:28:31,922 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 17:28:31,922 INFO L494 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] [2020-11-11 17:28:31,923 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-11 17:28:31,923 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-11 17:28:31,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 17:28:31,925 INFO L82 PathProgramCache]: Analyzing trace with hash 454814497, now seen corresponding path program 1 times [2020-11-11 17:28:31,925 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 17:28:31,925 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032099104] [2020-11-11 17:28:31,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 17:28:32,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 17:28:32,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-11 17:28:32,297 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032099104] [2020-11-11 17:28:32,298 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 17:28:32,298 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-11 17:28:32,298 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937042130] [2020-11-11 17:28:32,303 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-11 17:28:32,303 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 17:28:32,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-11 17:28:32,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-11 17:28:32,305 INFO L87 Difference]: Start difference. First operand 66597 states and 293185 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 17:28:34,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 17:28:34,022 INFO L93 Difference]: Finished difference Result 71973 states and 313473 transitions. [2020-11-11 17:28:34,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-11 17:28:34,027 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2020-11-11 17:28:34,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 17:28:34,493 INFO L225 Difference]: With dead ends: 71973 [2020-11-11 17:28:34,493 INFO L226 Difference]: Without dead ends: 55845 [2020-11-11 17:28:34,494 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-11-11 17:28:35,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55845 states. [2020-11-11 17:28:37,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55845 to 55845. [2020-11-11 17:28:37,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55845 states, 55844 states have (on average 4.363029152639496) internal successors, (243649), 55844 states have internal predecessors, (243649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 17:28:37,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55845 states to 55845 states and 243649 transitions. [2020-11-11 17:28:37,549 INFO L78 Accepts]: Start accepts. Automaton has 55845 states and 243649 transitions. Word has length 68 [2020-11-11 17:28:37,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 17:28:37,553 INFO L481 AbstractCegarLoop]: Abstraction has 55845 states and 243649 transitions. [2020-11-11 17:28:37,553 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 17:28:37,553 INFO L276 IsEmpty]: Start isEmpty. Operand 55845 states and 243649 transitions. [2020-11-11 17:28:37,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2020-11-11 17:28:37,638 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 17:28:37,638 INFO L494 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] [2020-11-11 17:28:37,638 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-11 17:28:37,638 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-11 17:28:37,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 17:28:37,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1451534115, now seen corresponding path program 1 times [2020-11-11 17:28:37,642 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 17:28:37,642 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839900035] [2020-11-11 17:28:37,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 17:28:37,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 17:28:37,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-11 17:28:37,932 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839900035] [2020-11-11 17:28:37,932 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 17:28:37,932 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-11 17:28:37,933 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833725551] [2020-11-11 17:28:37,933 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-11 17:28:37,933 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 17:28:37,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-11 17:28:37,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-11 17:28:37,934 INFO L87 Difference]: Start difference. First operand 55845 states and 243649 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 17:28:39,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 17:28:39,184 INFO L93 Difference]: Finished difference Result 64293 states and 278145 transitions. [2020-11-11 17:28:39,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-11 17:28:39,184 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2020-11-11 17:28:39,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 17:28:39,372 INFO L225 Difference]: With dead ends: 64293 [2020-11-11 17:28:39,372 INFO L226 Difference]: Without dead ends: 53541 [2020-11-11 17:28:39,373 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-11-11 17:28:40,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53541 states. [2020-11-11 17:28:41,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53541 to 53541. [2020-11-11 17:28:41,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53541 states, 53540 states have (on average 4.348169592827793) internal successors, (232801), 53540 states have internal predecessors, (232801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 17:28:41,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53541 states to 53541 states and 232801 transitions. [2020-11-11 17:28:41,896 INFO L78 Accepts]: Start accepts. Automaton has 53541 states and 232801 transitions. Word has length 71 [2020-11-11 17:28:41,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 17:28:41,897 INFO L481 AbstractCegarLoop]: Abstraction has 53541 states and 232801 transitions. [2020-11-11 17:28:41,897 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 17:28:41,897 INFO L276 IsEmpty]: Start isEmpty. Operand 53541 states and 232801 transitions. [2020-11-11 17:28:41,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-11-11 17:28:41,984 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 17:28:41,984 INFO L494 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] [2020-11-11 17:28:41,985 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-11 17:28:41,985 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-11 17:28:41,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 17:28:41,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1026898932, now seen corresponding path program 1 times [2020-11-11 17:28:41,986 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 17:28:41,986 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661978935] [2020-11-11 17:28:41,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 17:28:42,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 17:28:42,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-11 17:28:42,427 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661978935] [2020-11-11 17:28:42,427 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 17:28:42,427 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-11-11 17:28:42,428 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681739479] [2020-11-11 17:28:42,430 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-11 17:28:42,430 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 17:28:42,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-11 17:28:42,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2020-11-11 17:28:42,432 INFO L87 Difference]: Start difference. First operand 53541 states and 232801 transitions. Second operand has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 11 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) [2020-11-11 17:28:44,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 17:28:44,282 INFO L93 Difference]: Finished difference Result 63735 states and 275307 transitions. [2020-11-11 17:28:44,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-11-11 17:28:44,283 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 11 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 [2020-11-11 17:28:44,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 17:28:44,458 INFO L225 Difference]: With dead ends: 63735 [2020-11-11 17:28:44,458 INFO L226 Difference]: Without dead ends: 53655 [2020-11-11 17:28:44,458 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2020-11-11 17:28:45,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53655 states. [2020-11-11 17:28:46,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53655 to 52101. [2020-11-11 17:28:46,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52101 states, 52100 states have (on average 4.340287907869482) internal successors, (226129), 52100 states have internal predecessors, (226129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 17:28:47,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52101 states to 52101 states and 226129 transitions. [2020-11-11 17:28:47,170 INFO L78 Accepts]: Start accepts. Automaton has 52101 states and 226129 transitions. Word has length 73 [2020-11-11 17:28:47,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 17:28:47,171 INFO L481 AbstractCegarLoop]: Abstraction has 52101 states and 226129 transitions. [2020-11-11 17:28:47,171 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 11 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) [2020-11-11 17:28:47,171 INFO L276 IsEmpty]: Start isEmpty. Operand 52101 states and 226129 transitions. [2020-11-11 17:28:47,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-11-11 17:28:47,236 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 17:28:47,237 INFO L494 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] [2020-11-11 17:28:47,237 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-11 17:28:47,237 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-11 17:28:47,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 17:28:47,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1593966536, now seen corresponding path program 1 times [2020-11-11 17:28:47,237 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 17:28:47,238 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976491061] [2020-11-11 17:28:47,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 17:28:47,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 17:28:47,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-11 17:28:47,474 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976491061] [2020-11-11 17:28:47,475 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 17:28:47,475 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-11 17:28:47,475 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499565921] [2020-11-11 17:28:47,475 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-11 17:28:47,476 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 17:28:47,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-11 17:28:47,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-11-11 17:28:47,477 INFO L87 Difference]: Start difference. First operand 52101 states and 226129 transitions. Second operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 9 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 17:28:48,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 17:28:48,996 INFO L93 Difference]: Finished difference Result 59269 states and 255765 transitions. [2020-11-11 17:28:48,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-11 17:28:48,997 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 9 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2020-11-11 17:28:48,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 17:28:49,225 INFO L225 Difference]: With dead ends: 59269 [2020-11-11 17:28:49,225 INFO L226 Difference]: Without dead ends: 52325 [2020-11-11 17:28:49,226 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2020-11-11 17:28:49,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52325 states. [2020-11-11 17:28:51,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52325 to 52325. [2020-11-11 17:28:51,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52325 states, 52324 states have (on average 4.33928980964758) internal successors, (227049), 52324 states have internal predecessors, (227049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 17:28:51,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52325 states to 52325 states and 227049 transitions. [2020-11-11 17:28:51,346 INFO L78 Accepts]: Start accepts. Automaton has 52325 states and 227049 transitions. Word has length 74 [2020-11-11 17:28:51,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 17:28:51,346 INFO L481 AbstractCegarLoop]: Abstraction has 52325 states and 227049 transitions. [2020-11-11 17:28:51,347 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 9 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 17:28:51,347 INFO L276 IsEmpty]: Start isEmpty. Operand 52325 states and 227049 transitions. [2020-11-11 17:28:51,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-11-11 17:28:51,435 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 17:28:51,435 INFO L494 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] [2020-11-11 17:28:51,435 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-11 17:28:51,435 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-11 17:28:51,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 17:28:51,436 INFO L82 PathProgramCache]: Analyzing trace with hash -801638869, now seen corresponding path program 1 times [2020-11-11 17:28:51,436 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 17:28:51,436 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373970537] [2020-11-11 17:28:51,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 17:28:51,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 17:28:52,537 WARN L193 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2020-11-11 17:28:52,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-11 17:28:52,579 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373970537] [2020-11-11 17:28:52,580 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 17:28:52,580 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-11-11 17:28:52,580 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783404502] [2020-11-11 17:28:52,581 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-11 17:28:52,581 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 17:28:52,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-11 17:28:52,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2020-11-11 17:28:52,582 INFO L87 Difference]: Start difference. First operand 52325 states and 227049 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) [2020-11-11 17:28:53,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 17:28:53,355 INFO L93 Difference]: Finished difference Result 55461 states and 239089 transitions. [2020-11-11 17:28:53,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-11 17:28:53,355 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 [2020-11-11 17:28:53,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 17:28:53,516 INFO L225 Difference]: With dead ends: 55461 [2020-11-11 17:28:53,516 INFO L226 Difference]: Without dead ends: 49189 [2020-11-11 17:28:53,516 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2020-11-11 17:28:53,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49189 states. [2020-11-11 17:28:55,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49189 to 48741. [2020-11-11 17:28:55,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48741 states, 48740 states have (on average 4.3299343455067705) internal successors, (211041), 48740 states have internal predecessors, (211041), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 17:28:55,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48741 states to 48741 states and 211041 transitions. [2020-11-11 17:28:55,979 INFO L78 Accepts]: Start accepts. Automaton has 48741 states and 211041 transitions. Word has length 75 [2020-11-11 17:28:55,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 17:28:55,980 INFO L481 AbstractCegarLoop]: Abstraction has 48741 states and 211041 transitions. [2020-11-11 17:28:55,980 INFO L482 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) [2020-11-11 17:28:55,980 INFO L276 IsEmpty]: Start isEmpty. Operand 48741 states and 211041 transitions. [2020-11-11 17:28:56,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-11-11 17:28:56,107 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 17:28:56,108 INFO L494 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] [2020-11-11 17:28:56,108 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-11 17:28:56,108 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-11 17:28:56,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 17:28:56,126 INFO L82 PathProgramCache]: Analyzing trace with hash 959511590, now seen corresponding path program 1 times [2020-11-11 17:28:56,128 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 17:28:56,128 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322691627] [2020-11-11 17:28:56,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 17:28:56,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 17:28:56,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-11 17:28:56,623 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322691627] [2020-11-11 17:28:56,623 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 17:28:56,623 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-11-11 17:28:56,624 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669029552] [2020-11-11 17:28:56,624 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-11 17:28:56,624 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 17:28:56,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-11 17:28:56,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2020-11-11 17:28:56,625 INFO L87 Difference]: Start difference. First operand 48741 states and 211041 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) [2020-11-11 17:28:57,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 17:28:57,700 INFO L93 Difference]: Finished difference Result 57285 states and 246645 transitions. [2020-11-11 17:28:57,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-11 17:28:57,701 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 [2020-11-11 17:28:57,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 17:28:57,904 INFO L225 Difference]: With dead ends: 57285 [2020-11-11 17:28:57,904 INFO L226 Difference]: Without dead ends: 49605 [2020-11-11 17:28:57,905 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2020-11-11 17:28:58,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49605 states. [2020-11-11 17:28:59,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49605 to 49605. [2020-11-11 17:28:59,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49605 states, 49604 states have (on average 4.329509716958309) internal successors, (214761), 49604 states have internal predecessors, (214761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 17:28:59,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49605 states to 49605 states and 214761 transitions. [2020-11-11 17:28:59,952 INFO L78 Accepts]: Start accepts. Automaton has 49605 states and 214761 transitions. Word has length 75 [2020-11-11 17:28:59,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 17:28:59,952 INFO L481 AbstractCegarLoop]: Abstraction has 49605 states and 214761 transitions. [2020-11-11 17:28:59,952 INFO L482 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) [2020-11-11 17:28:59,952 INFO L276 IsEmpty]: Start isEmpty. Operand 49605 states and 214761 transitions. [2020-11-11 17:29:00,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-11-11 17:29:00,675 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 17:29:00,676 INFO L494 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] [2020-11-11 17:29:00,676 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-11 17:29:00,676 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-11 17:29:00,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 17:29:00,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1534576414, now seen corresponding path program 1 times [2020-11-11 17:29:00,678 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 17:29:00,679 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730193150] [2020-11-11 17:29:00,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 17:29:00,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 17:29:01,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-11 17:29:01,048 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730193150] [2020-11-11 17:29:01,048 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 17:29:01,048 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-11-11 17:29:01,048 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579735371] [2020-11-11 17:29:01,048 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-11 17:29:01,049 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 17:29:01,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-11 17:29:01,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2020-11-11 17:29:01,050 INFO L87 Difference]: Start difference. First operand 49605 states and 214761 transitions. Second operand has 11 states, 11 states have (on average 6.909090909090909) internal successors, (76), 11 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) [2020-11-11 17:29:02,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 17:29:02,003 INFO L93 Difference]: Finished difference Result 60133 states and 259289 transitions. [2020-11-11 17:29:02,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-11 17:29:02,004 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.909090909090909) internal successors, (76), 11 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 [2020-11-11 17:29:02,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 17:29:02,248 INFO L225 Difference]: With dead ends: 60133 [2020-11-11 17:29:02,248 INFO L226 Difference]: Without dead ends: 54197 [2020-11-11 17:29:02,248 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2020-11-11 17:29:02,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54197 states. [2020-11-11 17:29:04,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54197 to 52405. [2020-11-11 17:29:04,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52405 states, 52404 states have (on average 4.329917563544767) internal successors, (226905), 52404 states have internal predecessors, (226905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 17:29:05,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52405 states to 52405 states and 226905 transitions. [2020-11-11 17:29:05,164 INFO L78 Accepts]: Start accepts. Automaton has 52405 states and 226905 transitions. Word has length 76 [2020-11-11 17:29:05,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 17:29:05,165 INFO L481 AbstractCegarLoop]: Abstraction has 52405 states and 226905 transitions. [2020-11-11 17:29:05,165 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 6.909090909090909) internal successors, (76), 11 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) [2020-11-11 17:29:05,165 INFO L276 IsEmpty]: Start isEmpty. Operand 52405 states and 226905 transitions. [2020-11-11 17:29:05,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-11-11 17:29:05,274 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 17:29:05,274 INFO L494 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] [2020-11-11 17:29:05,274 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-11 17:29:05,274 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-11 17:29:05,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 17:29:05,275 INFO L82 PathProgramCache]: Analyzing trace with hash -1608899963, now seen corresponding path program 1 times [2020-11-11 17:29:05,275 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 17:29:05,275 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876996247] [2020-11-11 17:29:05,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 17:29:05,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 17:29:05,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-11 17:29:05,754 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876996247] [2020-11-11 17:29:05,754 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 17:29:05,755 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-11-11 17:29:05,755 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255081318] [2020-11-11 17:29:05,755 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-11 17:29:05,755 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 17:29:05,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-11 17:29:05,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2020-11-11 17:29:05,756 INFO L87 Difference]: Start difference. First operand 52405 states and 226905 transitions. Second operand has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 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) [2020-11-11 17:29:06,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 17:29:06,886 INFO L93 Difference]: Finished difference Result 63773 states and 275331 transitions. [2020-11-11 17:29:06,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-11 17:29:06,887 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 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 [2020-11-11 17:29:06,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 17:29:07,094 INFO L225 Difference]: With dead ends: 63773 [2020-11-11 17:29:07,094 INFO L226 Difference]: Without dead ends: 58173 [2020-11-11 17:29:07,095 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2020-11-11 17:29:08,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58173 states. [2020-11-11 17:29:09,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58173 to 57277. [2020-11-11 17:29:09,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57277 states, 57276 states have (on average 4.333455548571828) internal successors, (248203), 57276 states have internal predecessors, (248203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 17:29:10,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57277 states to 57277 states and 248203 transitions. [2020-11-11 17:29:10,071 INFO L78 Accepts]: Start accepts. Automaton has 57277 states and 248203 transitions. Word has length 77 [2020-11-11 17:29:10,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 17:29:10,072 INFO L481 AbstractCegarLoop]: Abstraction has 57277 states and 248203 transitions. [2020-11-11 17:29:10,072 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 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) [2020-11-11 17:29:10,072 INFO L276 IsEmpty]: Start isEmpty. Operand 57277 states and 248203 transitions. [2020-11-11 17:29:10,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-11-11 17:29:10,163 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 17:29:10,163 INFO L494 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] [2020-11-11 17:29:10,163 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-11 17:29:10,163 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-11 17:29:10,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 17:29:10,164 INFO L82 PathProgramCache]: Analyzing trace with hash -796689787, now seen corresponding path program 1 times [2020-11-11 17:29:10,164 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 17:29:10,164 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763178421] [2020-11-11 17:29:10,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 17:29:10,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 17:29:10,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-11 17:29:10,689 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763178421] [2020-11-11 17:29:10,689 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 17:29:10,689 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-11-11 17:29:10,689 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329678282] [2020-11-11 17:29:10,690 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-11 17:29:10,690 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 17:29:10,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-11 17:29:10,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2020-11-11 17:29:10,691 INFO L87 Difference]: Start difference. First operand 57277 states and 248203 transitions. Second operand has 14 states, 14 states have (on average 5.5) internal successors, (77), 14 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) [2020-11-11 17:29:11,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 17:29:11,873 INFO L93 Difference]: Finished difference Result 61117 states and 263315 transitions. [2020-11-11 17:29:11,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-11-11 17:29:11,874 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.5) internal successors, (77), 14 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 [2020-11-11 17:29:11,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 17:29:12,754 INFO L225 Difference]: With dead ends: 61117 [2020-11-11 17:29:12,755 INFO L226 Difference]: Without dead ends: 56317 [2020-11-11 17:29:12,755 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=124, Invalid=382, Unknown=0, NotChecked=0, Total=506 [2020-11-11 17:29:13,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56317 states. [2020-11-11 17:29:14,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56317 to 54973. [2020-11-11 17:29:14,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54973 states, 54972 states have (on average 4.326038710616314) internal successors, (237811), 54972 states have internal predecessors, (237811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 17:29:14,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54973 states to 54973 states and 237811 transitions. [2020-11-11 17:29:14,827 INFO L78 Accepts]: Start accepts. Automaton has 54973 states and 237811 transitions. Word has length 77 [2020-11-11 17:29:14,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 17:29:14,828 INFO L481 AbstractCegarLoop]: Abstraction has 54973 states and 237811 transitions. [2020-11-11 17:29:14,828 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 5.5) internal successors, (77), 14 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) [2020-11-11 17:29:14,828 INFO L276 IsEmpty]: Start isEmpty. Operand 54973 states and 237811 transitions. [2020-11-11 17:29:14,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-11-11 17:29:14,934 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 17:29:14,934 INFO L494 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] [2020-11-11 17:29:14,934 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-11 17:29:14,935 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-11 17:29:14,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 17:29:14,935 INFO L82 PathProgramCache]: Analyzing trace with hash 2097378215, now seen corresponding path program 1 times [2020-11-11 17:29:14,936 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 17:29:14,936 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766406103] [2020-11-11 17:29:14,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 17:29:14,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 17:29:15,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-11 17:29:15,077 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766406103] [2020-11-11 17:29:15,077 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 17:29:15,077 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-11 17:29:15,077 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393860816] [2020-11-11 17:29:15,078 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-11 17:29:15,078 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 17:29:15,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-11 17:29:15,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-11 17:29:15,079 INFO L87 Difference]: Start difference. First operand 54973 states and 237811 transitions. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 17:29:16,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 17:29:16,523 INFO L93 Difference]: Finished difference Result 86709 states and 372802 transitions. [2020-11-11 17:29:16,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-11 17:29:16,524 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2020-11-11 17:29:16,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 17:29:16,873 INFO L225 Difference]: With dead ends: 86709 [2020-11-11 17:29:16,873 INFO L226 Difference]: Without dead ends: 58333 [2020-11-11 17:29:16,874 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-11-11 17:29:17,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58333 states. [2020-11-11 17:29:18,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58333 to 50493. [2020-11-11 17:29:18,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50493 states, 50492 states have (on average 4.226788402123109) internal successors, (213419), 50492 states have internal predecessors, (213419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 17:29:18,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50493 states to 50493 states and 213419 transitions. [2020-11-11 17:29:18,886 INFO L78 Accepts]: Start accepts. Automaton has 50493 states and 213419 transitions. Word has length 77 [2020-11-11 17:29:18,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 17:29:18,886 INFO L481 AbstractCegarLoop]: Abstraction has 50493 states and 213419 transitions. [2020-11-11 17:29:18,886 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 17:29:18,887 INFO L276 IsEmpty]: Start isEmpty. Operand 50493 states and 213419 transitions. [2020-11-11 17:29:18,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-11-11 17:29:18,967 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 17:29:18,967 INFO L494 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] [2020-11-11 17:29:18,967 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-11 17:29:18,967 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-11 17:29:18,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 17:29:18,968 INFO L82 PathProgramCache]: Analyzing trace with hash 949252775, now seen corresponding path program 2 times [2020-11-11 17:29:18,968 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 17:29:18,968 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083044701] [2020-11-11 17:29:18,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 17:29:19,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 17:29:19,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-11 17:29:19,314 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083044701] [2020-11-11 17:29:19,314 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 17:29:19,314 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-11-11 17:29:19,314 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052041782] [2020-11-11 17:29:19,315 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-11 17:29:19,315 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 17:29:19,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-11 17:29:19,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2020-11-11 17:29:19,316 INFO L87 Difference]: Start difference. First operand 50493 states and 213419 transitions. Second operand has 11 states, 11 states have (on average 7.0) internal successors, (77), 11 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) [2020-11-11 17:29:20,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 17:29:20,046 INFO L93 Difference]: Finished difference Result 72207 states and 301961 transitions. [2020-11-11 17:29:20,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-11 17:29:20,046 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.0) internal successors, (77), 11 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 [2020-11-11 17:29:20,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 17:29:21,204 INFO L225 Difference]: With dead ends: 72207 [2020-11-11 17:29:21,205 INFO L226 Difference]: Without dead ends: 67223 [2020-11-11 17:29:21,205 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2020-11-11 17:29:21,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67223 states. [2020-11-11 17:29:23,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67223 to 51081. [2020-11-11 17:29:23,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51081 states, 51080 states have (on average 4.21074784651527) internal successors, (215085), 51080 states have internal predecessors, (215085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 17:29:23,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51081 states to 51081 states and 215085 transitions. [2020-11-11 17:29:23,397 INFO L78 Accepts]: Start accepts. Automaton has 51081 states and 215085 transitions. Word has length 77 [2020-11-11 17:29:23,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 17:29:23,398 INFO L481 AbstractCegarLoop]: Abstraction has 51081 states and 215085 transitions. [2020-11-11 17:29:23,398 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 7.0) internal successors, (77), 11 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) [2020-11-11 17:29:23,398 INFO L276 IsEmpty]: Start isEmpty. Operand 51081 states and 215085 transitions. [2020-11-11 17:29:23,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-11-11 17:29:23,489 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 17:29:23,490 INFO L494 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] [2020-11-11 17:29:23,490 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-11 17:29:23,490 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-11 17:29:23,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 17:29:23,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1732257315, now seen corresponding path program 3 times [2020-11-11 17:29:23,491 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 17:29:23,492 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351844036] [2020-11-11 17:29:23,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 17:29:23,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 17:29:23,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-11 17:29:23,833 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351844036] [2020-11-11 17:29:23,833 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 17:29:23,833 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-11-11 17:29:23,834 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674255224] [2020-11-11 17:29:23,834 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-11 17:29:23,834 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 17:29:23,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-11 17:29:23,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2020-11-11 17:29:23,835 INFO L87 Difference]: Start difference. First operand 51081 states and 215085 transitions. Second operand has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 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) [2020-11-11 17:29:25,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 17:29:25,536 INFO L93 Difference]: Finished difference Result 75175 states and 312716 transitions. [2020-11-11 17:29:25,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-11 17:29:25,537 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 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 [2020-11-11 17:29:25,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 17:29:25,873 INFO L225 Difference]: With dead ends: 75175 [2020-11-11 17:29:25,873 INFO L226 Difference]: Without dead ends: 60195 [2020-11-11 17:29:25,874 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=102, Invalid=240, Unknown=0, NotChecked=0, Total=342 [2020-11-11 17:29:26,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60195 states. [2020-11-11 17:29:27,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60195 to 49205. [2020-11-11 17:29:27,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49205 states, 49204 states have (on average 4.202605479229331) internal successors, (206785), 49204 states have internal predecessors, (206785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 17:29:28,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49205 states to 49205 states and 206785 transitions. [2020-11-11 17:29:28,037 INFO L78 Accepts]: Start accepts. Automaton has 49205 states and 206785 transitions. Word has length 77 [2020-11-11 17:29:28,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 17:29:28,038 INFO L481 AbstractCegarLoop]: Abstraction has 49205 states and 206785 transitions. [2020-11-11 17:29:28,038 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 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) [2020-11-11 17:29:28,038 INFO L276 IsEmpty]: Start isEmpty. Operand 49205 states and 206785 transitions. [2020-11-11 17:29:28,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-11-11 17:29:28,117 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 17:29:28,118 INFO L494 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] [2020-11-11 17:29:28,118 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-11 17:29:28,118 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-11 17:29:28,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 17:29:28,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1429748425, now seen corresponding path program 2 times [2020-11-11 17:29:28,119 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 17:29:28,119 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843710006] [2020-11-11 17:29:28,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 17:29:28,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 17:29:28,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-11 17:29:28,250 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843710006] [2020-11-11 17:29:28,250 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 17:29:28,250 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-11 17:29:28,251 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504376838] [2020-11-11 17:29:28,251 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-11 17:29:28,252 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 17:29:28,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-11 17:29:28,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-11 17:29:28,252 INFO L87 Difference]: Start difference. First operand 49205 states and 206785 transitions. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 17:29:28,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 17:29:28,761 INFO L93 Difference]: Finished difference Result 62525 states and 259113 transitions. [2020-11-11 17:29:28,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-11 17:29:28,762 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2020-11-11 17:29:28,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 17:29:28,897 INFO L225 Difference]: With dead ends: 62525 [2020-11-11 17:29:28,897 INFO L226 Difference]: Without dead ends: 45165 [2020-11-11 17:29:28,897 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-11-11 17:29:29,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45165 states. [2020-11-11 17:29:30,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45165 to 45165. [2020-11-11 17:29:30,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45165 states, 45164 states have (on average 4.147750420689045) internal successors, (187329), 45164 states have internal predecessors, (187329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 17:29:30,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45165 states to 45165 states and 187329 transitions. [2020-11-11 17:29:30,837 INFO L78 Accepts]: Start accepts. Automaton has 45165 states and 187329 transitions. Word has length 77 [2020-11-11 17:29:30,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 17:29:30,837 INFO L481 AbstractCegarLoop]: Abstraction has 45165 states and 187329 transitions. [2020-11-11 17:29:30,837 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 17:29:30,837 INFO L276 IsEmpty]: Start isEmpty. Operand 45165 states and 187329 transitions. [2020-11-11 17:29:30,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-11-11 17:29:30,907 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 17:29:30,907 INFO L494 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] [2020-11-11 17:29:30,907 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-11 17:29:30,907 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-11 17:29:30,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 17:29:30,908 INFO L82 PathProgramCache]: Analyzing trace with hash -935342837, now seen corresponding path program 1 times [2020-11-11 17:29:30,908 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 17:29:30,908 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148215204] [2020-11-11 17:29:30,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 17:29:30,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 17:29:31,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-11 17:29:31,052 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148215204] [2020-11-11 17:29:31,052 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 17:29:31,053 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-11 17:29:31,053 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262219879] [2020-11-11 17:29:31,053 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-11 17:29:31,053 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 17:29:31,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-11 17:29:31,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-11-11 17:29:31,054 INFO L87 Difference]: Start difference. First operand 45165 states and 187329 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 17:29:32,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 17:29:32,190 INFO L93 Difference]: Finished difference Result 48459 states and 195954 transitions. [2020-11-11 17:29:32,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-11 17:29:32,190 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2020-11-11 17:29:32,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 17:29:32,296 INFO L225 Difference]: With dead ends: 48459 [2020-11-11 17:29:32,296 INFO L226 Difference]: Without dead ends: 33483 [2020-11-11 17:29:32,297 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2020-11-11 17:29:32,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33483 states. [2020-11-11 17:29:32,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33483 to 33483. [2020-11-11 17:29:33,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33483 states, 33482 states have (on average 4.004868287438026) internal successors, (134091), 33482 states have internal predecessors, (134091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 17:29:33,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33483 states to 33483 states and 134091 transitions. [2020-11-11 17:29:33,125 INFO L78 Accepts]: Start accepts. Automaton has 33483 states and 134091 transitions. Word has length 78 [2020-11-11 17:29:33,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 17:29:33,125 INFO L481 AbstractCegarLoop]: Abstraction has 33483 states and 134091 transitions. [2020-11-11 17:29:33,125 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 17:29:33,126 INFO L276 IsEmpty]: Start isEmpty. Operand 33483 states and 134091 transitions. [2020-11-11 17:29:33,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2020-11-11 17:29:33,666 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 17:29:33,666 INFO L494 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] [2020-11-11 17:29:33,667 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-11 17:29:33,667 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-11 17:29:33,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 17:29:33,667 INFO L82 PathProgramCache]: Analyzing trace with hash -636837358, now seen corresponding path program 1 times [2020-11-11 17:29:33,667 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 17:29:33,668 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187565711] [2020-11-11 17:29:33,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 17:29:33,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 17:29:33,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-11 17:29:33,847 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187565711] [2020-11-11 17:29:33,847 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 17:29:33,847 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-11 17:29:33,847 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888536282] [2020-11-11 17:29:33,847 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-11 17:29:33,848 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 17:29:33,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-11 17:29:33,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-11 17:29:33,848 INFO L87 Difference]: Start difference. First operand 33483 states and 134091 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 17:29:34,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 17:29:34,453 INFO L93 Difference]: Finished difference Result 54183 states and 214749 transitions. [2020-11-11 17:29:34,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-11 17:29:34,454 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2020-11-11 17:29:34,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 17:29:34,600 INFO L225 Difference]: With dead ends: 54183 [2020-11-11 17:29:34,600 INFO L226 Difference]: Without dead ends: 35787 [2020-11-11 17:29:34,601 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-11-11 17:29:34,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35787 states. [2020-11-11 17:29:35,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35787 to 32331. [2020-11-11 17:29:35,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32331 states, 32330 states have (on average 3.9224559232910607) internal successors, (126813), 32330 states have internal predecessors, (126813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 17:29:36,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32331 states to 32331 states and 126813 transitions. [2020-11-11 17:29:36,016 INFO L78 Accepts]: Start accepts. Automaton has 32331 states and 126813 transitions. Word has length 80 [2020-11-11 17:29:36,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 17:29:36,016 INFO L481 AbstractCegarLoop]: Abstraction has 32331 states and 126813 transitions. [2020-11-11 17:29:36,017 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 17:29:36,017 INFO L276 IsEmpty]: Start isEmpty. Operand 32331 states and 126813 transitions. [2020-11-11 17:29:36,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-11-11 17:29:36,079 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 17:29:36,079 INFO L494 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] [2020-11-11 17:29:36,079 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-11 17:29:36,079 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-11 17:29:36,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 17:29:36,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1827353018, now seen corresponding path program 1 times [2020-11-11 17:29:36,080 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 17:29:36,080 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550339365] [2020-11-11 17:29:36,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 17:29:36,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 17:29:36,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-11 17:29:36,559 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550339365] [2020-11-11 17:29:36,559 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 17:29:36,559 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-11-11 17:29:36,560 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287015614] [2020-11-11 17:29:36,560 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-11 17:29:36,561 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 17:29:36,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-11 17:29:36,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2020-11-11 17:29:36,562 INFO L87 Difference]: Start difference. First operand 32331 states and 126813 transitions. Second operand has 15 states, 15 states have (on average 5.4) internal successors, (81), 15 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 17:29:37,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 17:29:37,332 INFO L93 Difference]: Finished difference Result 37651 states and 146751 transitions. [2020-11-11 17:29:37,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-11 17:29:37,333 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.4) internal successors, (81), 15 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2020-11-11 17:29:37,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 17:29:37,419 INFO L225 Difference]: With dead ends: 37651 [2020-11-11 17:29:37,419 INFO L226 Difference]: Without dead ends: 33555 [2020-11-11 17:29:37,420 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=123, Invalid=339, Unknown=0, NotChecked=0, Total=462 [2020-11-11 17:29:37,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33555 states. [2020-11-11 17:29:38,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33555 to 32735. [2020-11-11 17:29:38,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32735 states, 32734 states have (on average 3.913484450418525) internal successors, (128104), 32734 states have internal predecessors, (128104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 17:29:38,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32735 states to 32735 states and 128104 transitions. [2020-11-11 17:29:38,790 INFO L78 Accepts]: Start accepts. Automaton has 32735 states and 128104 transitions. Word has length 81 [2020-11-11 17:29:38,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 17:29:38,790 INFO L481 AbstractCegarLoop]: Abstraction has 32735 states and 128104 transitions. [2020-11-11 17:29:38,790 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 5.4) internal successors, (81), 15 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 17:29:38,790 INFO L276 IsEmpty]: Start isEmpty. Operand 32735 states and 128104 transitions. [2020-11-11 17:29:38,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-11-11 17:29:38,845 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 17:29:38,845 INFO L494 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] [2020-11-11 17:29:38,845 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-11 17:29:38,845 INFO L429 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-11 17:29:38,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 17:29:38,846 INFO L82 PathProgramCache]: Analyzing trace with hash 2129102640, now seen corresponding path program 1 times [2020-11-11 17:29:38,846 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 17:29:38,846 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550071260] [2020-11-11 17:29:38,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 17:29:38,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 17:29:39,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-11 17:29:39,006 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550071260] [2020-11-11 17:29:39,006 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 17:29:39,006 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-11 17:29:39,006 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028013256] [2020-11-11 17:29:39,008 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-11 17:29:39,009 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 17:29:39,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-11 17:29:39,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-11-11 17:29:39,015 INFO L87 Difference]: Start difference. First operand 32735 states and 128104 transitions. Second operand has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 17:29:39,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 17:29:39,426 INFO L93 Difference]: Finished difference Result 28505 states and 108307 transitions. [2020-11-11 17:29:39,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-11 17:29:39,427 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2020-11-11 17:29:39,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 17:29:39,474 INFO L225 Difference]: With dead ends: 28505 [2020-11-11 17:29:39,474 INFO L226 Difference]: Without dead ends: 19145 [2020-11-11 17:29:39,475 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2020-11-11 17:29:39,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19145 states. [2020-11-11 17:29:39,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19145 to 17855. [2020-11-11 17:29:39,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17855 states, 17854 states have (on average 3.744651058586311) internal successors, (66857), 17854 states have internal predecessors, (66857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 17:29:39,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17855 states to 17855 states and 66857 transitions. [2020-11-11 17:29:39,870 INFO L78 Accepts]: Start accepts. Automaton has 17855 states and 66857 transitions. Word has length 81 [2020-11-11 17:29:39,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 17:29:39,871 INFO L481 AbstractCegarLoop]: Abstraction has 17855 states and 66857 transitions. [2020-11-11 17:29:39,871 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 17:29:39,871 INFO L276 IsEmpty]: Start isEmpty. Operand 17855 states and 66857 transitions. [2020-11-11 17:29:39,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2020-11-11 17:29:39,899 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 17:29:39,899 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-11 17:29:39,899 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-11 17:29:39,899 INFO L429 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-11 17:29:39,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 17:29:39,900 INFO L82 PathProgramCache]: Analyzing trace with hash 954347287, now seen corresponding path program 1 times [2020-11-11 17:29:39,900 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 17:29:39,900 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623735757] [2020-11-11 17:29:39,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 17:29:39,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 17:29:40,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-11 17:29:40,080 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623735757] [2020-11-11 17:29:40,080 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 17:29:40,081 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-11 17:29:40,081 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955293090] [2020-11-11 17:29:40,082 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-11 17:29:40,083 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 17:29:40,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-11 17:29:40,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-11-11 17:29:40,084 INFO L87 Difference]: Start difference. First operand 17855 states and 66857 transitions. Second operand has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 17:29:41,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 17:29:41,120 INFO L93 Difference]: Finished difference Result 14075 states and 51710 transitions. [2020-11-11 17:29:41,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-11 17:29:41,120 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2020-11-11 17:29:41,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 17:29:41,145 INFO L225 Difference]: With dead ends: 14075 [2020-11-11 17:29:41,145 INFO L226 Difference]: Without dead ends: 7591 [2020-11-11 17:29:41,146 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2020-11-11 17:29:41,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7591 states. [2020-11-11 17:29:41,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7591 to 5871. [2020-11-11 17:29:41,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5871 states, 5870 states have (on average 3.5943781942078363) internal successors, (21099), 5870 states have internal predecessors, (21099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 17:29:41,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5871 states to 5871 states and 21099 transitions. [2020-11-11 17:29:41,311 INFO L78 Accepts]: Start accepts. Automaton has 5871 states and 21099 transitions. Word has length 84 [2020-11-11 17:29:41,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 17:29:41,312 INFO L481 AbstractCegarLoop]: Abstraction has 5871 states and 21099 transitions. [2020-11-11 17:29:41,312 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 17:29:41,312 INFO L276 IsEmpty]: Start isEmpty. Operand 5871 states and 21099 transitions. [2020-11-11 17:29:41,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-11-11 17:29:41,321 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 17:29:41,321 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-11 17:29:41,321 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-11-11 17:29:41,322 INFO L429 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-11 17:29:41,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 17:29:41,322 INFO L82 PathProgramCache]: Analyzing trace with hash -380964139, now seen corresponding path program 1 times [2020-11-11 17:29:41,322 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 17:29:41,322 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885822240] [2020-11-11 17:29:41,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 17:29:41,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 17:29:41,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-11 17:29:41,562 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885822240] [2020-11-11 17:29:41,562 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 17:29:41,562 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-11 17:29:41,563 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217146417] [2020-11-11 17:29:41,563 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-11 17:29:41,563 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 17:29:41,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-11 17:29:41,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2020-11-11 17:29:41,564 INFO L87 Difference]: Start difference. First operand 5871 states and 21099 transitions. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 17:29:41,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 17:29:41,955 INFO L93 Difference]: Finished difference Result 7933 states and 28501 transitions. [2020-11-11 17:29:41,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-11 17:29:41,956 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2020-11-11 17:29:41,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 17:29:41,969 INFO L225 Difference]: With dead ends: 7933 [2020-11-11 17:29:41,969 INFO L226 Difference]: Without dead ends: 2859 [2020-11-11 17:29:41,969 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2020-11-11 17:29:41,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2859 states. [2020-11-11 17:29:42,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2859 to 2859. [2020-11-11 17:29:42,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2859 states, 2858 states have (on average 3.4720083974807556) internal successors, (9923), 2858 states have internal predecessors, (9923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 17:29:42,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2859 states to 2859 states and 9923 transitions. [2020-11-11 17:29:42,067 INFO L78 Accepts]: Start accepts. Automaton has 2859 states and 9923 transitions. Word has length 88 [2020-11-11 17:29:42,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 17:29:42,067 INFO L481 AbstractCegarLoop]: Abstraction has 2859 states and 9923 transitions. [2020-11-11 17:29:42,068 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 17:29:42,068 INFO L276 IsEmpty]: Start isEmpty. Operand 2859 states and 9923 transitions. [2020-11-11 17:29:42,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-11-11 17:29:42,074 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 17:29:42,074 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-11 17:29:42,074 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-11-11 17:29:42,074 INFO L429 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-11 17:29:42,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 17:29:42,075 INFO L82 PathProgramCache]: Analyzing trace with hash -1880643579, now seen corresponding path program 2 times [2020-11-11 17:29:42,075 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 17:29:42,075 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004305709] [2020-11-11 17:29:42,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 17:29:42,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 17:29:42,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-11 17:29:42,585 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004305709] [2020-11-11 17:29:42,585 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 17:29:42,585 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-11-11 17:29:42,585 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171935411] [2020-11-11 17:29:42,586 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-11 17:29:42,586 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 17:29:42,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-11 17:29:42,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2020-11-11 17:29:42,588 INFO L87 Difference]: Start difference. First operand 2859 states and 9923 transitions. Second operand has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 14 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 17:29:42,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 17:29:42,984 INFO L93 Difference]: Finished difference Result 4469 states and 15773 transitions. [2020-11-11 17:29:42,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-11 17:29:42,985 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 14 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2020-11-11 17:29:42,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 17:29:42,993 INFO L225 Difference]: With dead ends: 4469 [2020-11-11 17:29:42,993 INFO L226 Difference]: Without dead ends: 2523 [2020-11-11 17:29:42,994 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2020-11-11 17:29:43,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2523 states. [2020-11-11 17:29:43,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2523 to 2523. [2020-11-11 17:29:43,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2523 states, 2522 states have (on average 3.5) internal successors, (8827), 2522 states have internal predecessors, (8827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 17:29:43,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2523 states to 2523 states and 8827 transitions. [2020-11-11 17:29:43,067 INFO L78 Accepts]: Start accepts. Automaton has 2523 states and 8827 transitions. Word has length 88 [2020-11-11 17:29:43,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 17:29:43,067 INFO L481 AbstractCegarLoop]: Abstraction has 2523 states and 8827 transitions. [2020-11-11 17:29:43,067 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 14 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 17:29:43,067 INFO L276 IsEmpty]: Start isEmpty. Operand 2523 states and 8827 transitions. [2020-11-11 17:29:43,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-11-11 17:29:43,073 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 17:29:43,073 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-11 17:29:43,073 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-11-11 17:29:43,074 INFO L429 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-11 17:29:43,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 17:29:43,074 INFO L82 PathProgramCache]: Analyzing trace with hash -353192443, now seen corresponding path program 3 times [2020-11-11 17:29:43,074 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 17:29:43,076 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201157118] [2020-11-11 17:29:43,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 17:29:43,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-11 17:29:43,135 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-11 17:29:43,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-11 17:29:43,210 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-11 17:29:43,296 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-11 17:29:43,297 INFO L595 BasicCegarLoop]: Counterexample might be feasible [2020-11-11 17:29:43,297 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-11-11 17:29:43,498 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.11 05:29:43 BasicIcfg [2020-11-11 17:29:43,499 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-11 17:29:43,500 INFO L168 Benchmark]: Toolchain (without parser) took 136226.74 ms. Allocated memory was 302.0 MB in the beginning and 15.6 GB in the end (delta: 15.3 GB). Free memory was 275.6 MB in the beginning and 8.0 GB in the end (delta: -7.7 GB). Peak memory consumption was 7.6 GB. Max. memory is 16.0 GB. [2020-11-11 17:29:43,501 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 302.0 MB. Free memory is still 272.6 MB. There was no memory consumed. Max. memory is 16.0 GB. [2020-11-11 17:29:43,501 INFO L168 Benchmark]: CACSL2BoogieTranslator took 790.97 ms. Allocated memory is still 302.0 MB. Free memory was 275.0 MB in the beginning and 268.1 MB in the end (delta: 6.9 MB). Peak memory consumption was 29.8 MB. Max. memory is 16.0 GB. [2020-11-11 17:29:43,502 INFO L168 Benchmark]: Boogie Procedure Inliner took 130.74 ms. Allocated memory is still 302.0 MB. Free memory was 268.1 MB in the beginning and 265.2 MB in the end (delta: 3.0 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2020-11-11 17:29:43,502 INFO L168 Benchmark]: Boogie Preprocessor took 82.55 ms. Allocated memory is still 302.0 MB. Free memory was 265.2 MB in the beginning and 262.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2020-11-11 17:29:43,503 INFO L168 Benchmark]: RCFGBuilder took 2824.69 ms. Allocated memory was 302.0 MB in the beginning and 371.2 MB in the end (delta: 69.2 MB). Free memory was 262.7 MB in the beginning and 338.6 MB in the end (delta: -75.9 MB). Peak memory consumption was 112.0 MB. Max. memory is 16.0 GB. [2020-11-11 17:29:43,503 INFO L168 Benchmark]: TraceAbstraction took 132385.00 ms. Allocated memory was 371.2 MB in the beginning and 15.6 GB in the end (delta: 15.3 GB). Free memory was 338.6 MB in the beginning and 8.0 GB in the end (delta: -7.7 GB). Peak memory consumption was 7.6 GB. Max. memory is 16.0 GB. [2020-11-11 17:29:43,507 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.20 ms. Allocated memory is still 302.0 MB. Free memory is still 272.6 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 790.97 ms. Allocated memory is still 302.0 MB. Free memory was 275.0 MB in the beginning and 268.1 MB in the end (delta: 6.9 MB). Peak memory consumption was 29.8 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 130.74 ms. Allocated memory is still 302.0 MB. Free memory was 268.1 MB in the beginning and 265.2 MB in the end (delta: 3.0 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 82.55 ms. Allocated memory is still 302.0 MB. Free memory was 265.2 MB in the beginning and 262.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 2824.69 ms. Allocated memory was 302.0 MB in the beginning and 371.2 MB in the end (delta: 69.2 MB). Free memory was 262.7 MB in the beginning and 338.6 MB in the end (delta: -75.9 MB). Peak memory consumption was 112.0 MB. Max. memory is 16.0 GB. * TraceAbstraction took 132385.00 ms. Allocated memory was 371.2 MB in the beginning and 15.6 GB in the end (delta: 15.3 GB). Free memory was 338.6 MB in the beginning and 8.0 GB in the end (delta: -7.7 GB). Peak memory consumption was 7.6 GB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0] [L714] 0 int __unbuffered_p3_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0] [L716] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0] [L717] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0] [L718] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L720] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L722] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L723] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L724] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L725] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L726] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L727] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L728] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L729] 0 _Bool y$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0] [L730] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0] [L731] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L732] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L733] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L734] 0 _Bool y$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0] [L735] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0] [L736] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L737] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L738] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L739] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L740] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L742] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L743] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L744] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L844] 0 pthread_t t813; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L845] FCALL, FORK 0 pthread_create(&t813, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L846] 0 pthread_t t814; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L847] FCALL, FORK 0 pthread_create(&t814, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L848] 0 pthread_t t815; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L849] FCALL, FORK 0 pthread_create(&t815, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L850] 0 pthread_t t816; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L851] FCALL, FORK 0 pthread_create(&t816, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L783] 3 y$w_buff1 = y$w_buff0 [L784] 3 y$w_buff0 = 2 [L785] 3 y$w_buff1_used = y$w_buff0_used [L786] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L788] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L789] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L790] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L791] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L792] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L793] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L796] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L813] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L816] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L819] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L748] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L763] 2 x = 2 VAL [__unbuffered_cnt=1, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L766] 2 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L799] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L799] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L800] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L800] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L801] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L801] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L802] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L802] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L803] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L803] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L806] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L822] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L822] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L822] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L822] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L823] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L823] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L824] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L824] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L825] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L825] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L826] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L826] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L769] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L769] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L770] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L771] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L772] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L773] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L776] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L829] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L853] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L857] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L857] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L857] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L857] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L858] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L858] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L859] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L859] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L860] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L860] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L861] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L861] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L864] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L865] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L866] 0 y$flush_delayed = weak$$choice2 [L867] 0 y$mem_tmp = y [L868] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L868] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L869] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L869] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L870] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L870] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L871] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L871] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L872] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L872] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L873] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L873] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L874] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L874] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L876] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L876] 0 y = y$flush_delayed ? y$mem_tmp : y [L877] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L17] COND FALSE 0 !(0) VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L17] 0 __assert_fail ("0", "mix030_pso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 117 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 132.0s, OverallIterations: 22, TraceHistogramMax: 1, AutomataDifference: 29.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 50.6s, HoareTripleCheckerStatistics: 3508 SDtfs, 6293 SDslu, 15295 SDs, 0 SdLazy, 1987 SolverSat, 452 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 325 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 280 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 741 ImplicationChecksByTransitivity, 7.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=142925occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 40.6s AutomataMinimizationTime, 21 MinimizatonAttempts, 48292 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 1693 NumberOfCodeBlocks, 1693 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1584 ConstructedInterpolants, 0 QuantifiedInterpolants, 764359 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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...