/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi000_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 23:10:05,392 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 23:10:05,395 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 23:10:05,410 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 23:10:05,410 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 23:10:05,412 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 23:10:05,413 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 23:10:05,415 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 23:10:05,418 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 23:10:05,419 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 23:10:05,420 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 23:10:05,421 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 23:10:05,421 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 23:10:05,423 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 23:10:05,423 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 23:10:05,425 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 23:10:05,425 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 23:10:05,426 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 23:10:05,428 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 23:10:05,430 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 23:10:05,432 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 23:10:05,433 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 23:10:05,434 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 23:10:05,435 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 23:10:05,437 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 23:10:05,437 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 23:10:05,437 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 23:10:05,438 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 23:10:05,439 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 23:10:05,440 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 23:10:05,440 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 23:10:05,441 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 23:10:05,441 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 23:10:05,442 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 23:10:05,443 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 23:10:05,443 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 23:10:05,444 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 23:10:05,444 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 23:10:05,444 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 23:10:05,445 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 23:10:05,446 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 23:10:05,447 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 23:10:05,461 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 23:10:05,462 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 23:10:05,463 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 23:10:05,463 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 23:10:05,463 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 23:10:05,464 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 23:10:05,464 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 23:10:05,464 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 23:10:05,464 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 23:10:05,464 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 23:10:05,465 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 23:10:05,465 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 23:10:05,465 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 23:10:05,465 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 23:10:05,465 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 23:10:05,465 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 23:10:05,466 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 23:10:05,466 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 23:10:05,466 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 23:10:05,466 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 23:10:05,466 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 23:10:05,467 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 23:10:05,467 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 23:10:05,467 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 23:10:05,467 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 23:10:05,468 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 23:10:05,468 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 23:10:05,468 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 23:10:05,468 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 23:10:05,468 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 23:10:05,747 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 23:10:05,761 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 23:10:05,764 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 23:10:05,765 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 23:10:05,766 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 23:10:05,766 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi000_tso.oepc.i [2019-12-26 23:10:05,829 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac0342243/6592f30b595b4f33a6db70e562f6dbd3/FLAGe188ececf [2019-12-26 23:10:06,398 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 23:10:06,399 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi000_tso.oepc.i [2019-12-26 23:10:06,413 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac0342243/6592f30b595b4f33a6db70e562f6dbd3/FLAGe188ececf [2019-12-26 23:10:06,669 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac0342243/6592f30b595b4f33a6db70e562f6dbd3 [2019-12-26 23:10:06,680 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 23:10:06,683 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 23:10:06,686 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 23:10:06,686 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 23:10:06,690 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 23:10:06,691 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:10:06" (1/1) ... [2019-12-26 23:10:06,695 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1477f632 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:10:06, skipping insertion in model container [2019-12-26 23:10:06,695 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:10:06" (1/1) ... [2019-12-26 23:10:06,704 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 23:10:06,783 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 23:10:07,433 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:10:07,451 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 23:10:07,556 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:10:07,627 INFO L208 MainTranslator]: Completed translation [2019-12-26 23:10:07,628 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:10:07 WrapperNode [2019-12-26 23:10:07,628 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 23:10:07,629 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 23:10:07,629 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 23:10:07,629 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 23:10:07,639 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:10:07" (1/1) ... [2019-12-26 23:10:07,671 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:10:07" (1/1) ... [2019-12-26 23:10:07,722 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 23:10:07,723 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 23:10:07,723 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 23:10:07,723 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 23:10:07,733 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:10:07" (1/1) ... [2019-12-26 23:10:07,733 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:10:07" (1/1) ... [2019-12-26 23:10:07,739 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:10:07" (1/1) ... [2019-12-26 23:10:07,740 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:10:07" (1/1) ... [2019-12-26 23:10:07,764 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:10:07" (1/1) ... [2019-12-26 23:10:07,776 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:10:07" (1/1) ... [2019-12-26 23:10:07,784 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:10:07" (1/1) ... [2019-12-26 23:10:07,794 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 23:10:07,795 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 23:10:07,795 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 23:10:07,795 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 23:10:07,796 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:10:07" (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 [2019-12-26 23:10:07,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 23:10:07,860 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 23:10:07,860 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 23:10:07,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 23:10:07,860 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 23:10:07,861 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 23:10:07,861 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 23:10:07,861 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 23:10:07,861 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 23:10:07,861 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 23:10:07,862 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 23:10:07,864 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 23:10:09,011 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 23:10:09,012 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 23:10:09,013 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:10:09 BoogieIcfgContainer [2019-12-26 23:10:09,014 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 23:10:09,015 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 23:10:09,015 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 23:10:09,018 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 23:10:09,019 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 11:10:06" (1/3) ... [2019-12-26 23:10:09,020 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@271bc766 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:10:09, skipping insertion in model container [2019-12-26 23:10:09,020 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:10:07" (2/3) ... [2019-12-26 23:10:09,021 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@271bc766 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:10:09, skipping insertion in model container [2019-12-26 23:10:09,021 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:10:09" (3/3) ... [2019-12-26 23:10:09,023 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi000_tso.oepc.i [2019-12-26 23:10:09,034 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 23:10:09,034 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 23:10:09,047 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 23:10:09,048 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 23:10:09,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,127 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,127 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,134 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,134 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,134 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,134 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,141 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,141 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,142 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,142 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,142 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,169 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,170 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,170 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,171 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,192 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,192 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,224 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,225 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,225 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,225 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,225 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,226 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,226 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,227 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,227 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,227 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,239 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,240 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,242 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:09,262 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-26 23:10:09,282 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 23:10:09,282 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 23:10:09,282 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 23:10:09,282 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 23:10:09,282 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 23:10:09,282 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 23:10:09,282 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 23:10:09,282 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 23:10:09,300 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 231 places, 307 transitions [2019-12-26 23:10:09,302 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 231 places, 307 transitions [2019-12-26 23:10:09,465 INFO L132 PetriNetUnfolder]: 83/305 cut-off events. [2019-12-26 23:10:09,465 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:10:09,515 INFO L76 FinitePrefix]: Finished finitePrefix Result has 312 conditions, 305 events. 83/305 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 708 event pairs. 0/220 useless extension candidates. Maximal degree in co-relation 276. Up to 2 conditions per place. [2019-12-26 23:10:09,614 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 231 places, 307 transitions [2019-12-26 23:10:09,761 INFO L132 PetriNetUnfolder]: 83/305 cut-off events. [2019-12-26 23:10:09,761 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:10:09,780 INFO L76 FinitePrefix]: Finished finitePrefix Result has 312 conditions, 305 events. 83/305 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 708 event pairs. 0/220 useless extension candidates. Maximal degree in co-relation 276. Up to 2 conditions per place. [2019-12-26 23:10:09,819 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 40114 [2019-12-26 23:10:09,821 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 23:10:16,454 WARN L192 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-26 23:10:16,563 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-26 23:10:16,650 INFO L206 etLargeBlockEncoding]: Checked pairs total: 232725 [2019-12-26 23:10:16,650 INFO L214 etLargeBlockEncoding]: Total number of compositions: 139 [2019-12-26 23:10:16,654 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 147 places, 184 transitions [2019-12-26 23:10:20,388 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 50078 states. [2019-12-26 23:10:20,390 INFO L276 IsEmpty]: Start isEmpty. Operand 50078 states. [2019-12-26 23:10:20,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-26 23:10:20,395 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:10:20,396 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-26 23:10:20,396 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:10:20,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:10:20,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1268502306, now seen corresponding path program 1 times [2019-12-26 23:10:20,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:10:20,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765414308] [2019-12-26 23:10:20,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:10:20,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:10:20,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:10:20,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765414308] [2019-12-26 23:10:20,648 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:10:20,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 23:10:20,649 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8264717] [2019-12-26 23:10:20,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:10:20,654 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:10:20,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:10:20,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:10:20,671 INFO L87 Difference]: Start difference. First operand 50078 states. Second operand 3 states. [2019-12-26 23:10:21,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:10:21,725 INFO L93 Difference]: Finished difference Result 50030 states and 178645 transitions. [2019-12-26 23:10:21,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:10:21,728 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-26 23:10:21,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:10:22,155 INFO L225 Difference]: With dead ends: 50030 [2019-12-26 23:10:22,155 INFO L226 Difference]: Without dead ends: 49055 [2019-12-26 23:10:22,156 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:10:24,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49055 states. [2019-12-26 23:10:25,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49055 to 49055. [2019-12-26 23:10:25,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49055 states. [2019-12-26 23:10:25,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49055 states to 49055 states and 175395 transitions. [2019-12-26 23:10:25,892 INFO L78 Accepts]: Start accepts. Automaton has 49055 states and 175395 transitions. Word has length 5 [2019-12-26 23:10:25,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:10:25,893 INFO L462 AbstractCegarLoop]: Abstraction has 49055 states and 175395 transitions. [2019-12-26 23:10:25,893 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:10:25,893 INFO L276 IsEmpty]: Start isEmpty. Operand 49055 states and 175395 transitions. [2019-12-26 23:10:25,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-26 23:10:25,898 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:10:25,898 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:10:25,899 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:10:25,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:10:25,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1198055303, now seen corresponding path program 1 times [2019-12-26 23:10:25,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:10:25,900 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669053583] [2019-12-26 23:10:25,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:10:25,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:10:26,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:10:26,078 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669053583] [2019-12-26 23:10:26,078 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:10:26,078 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:10:26,078 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668589838] [2019-12-26 23:10:26,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:10:26,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:10:26,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:10:26,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:10:26,081 INFO L87 Difference]: Start difference. First operand 49055 states and 175395 transitions. Second operand 4 states. [2019-12-26 23:10:26,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:10:26,225 INFO L93 Difference]: Finished difference Result 6292 states and 16551 transitions. [2019-12-26 23:10:26,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 23:10:26,226 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-26 23:10:26,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:10:26,242 INFO L225 Difference]: With dead ends: 6292 [2019-12-26 23:10:26,243 INFO L226 Difference]: Without dead ends: 5317 [2019-12-26 23:10:26,244 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:10:26,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5317 states. [2019-12-26 23:10:26,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5317 to 5317. [2019-12-26 23:10:26,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5317 states. [2019-12-26 23:10:26,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5317 states to 5317 states and 13388 transitions. [2019-12-26 23:10:26,375 INFO L78 Accepts]: Start accepts. Automaton has 5317 states and 13388 transitions. Word has length 11 [2019-12-26 23:10:26,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:10:26,376 INFO L462 AbstractCegarLoop]: Abstraction has 5317 states and 13388 transitions. [2019-12-26 23:10:26,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:10:26,376 INFO L276 IsEmpty]: Start isEmpty. Operand 5317 states and 13388 transitions. [2019-12-26 23:10:26,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-26 23:10:26,382 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:10:26,382 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:10:26,383 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:10:26,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:10:26,383 INFO L82 PathProgramCache]: Analyzing trace with hash -2038106739, now seen corresponding path program 1 times [2019-12-26 23:10:26,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:10:26,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931584905] [2019-12-26 23:10:26,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:10:26,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:10:26,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:10:26,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931584905] [2019-12-26 23:10:26,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:10:26,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:10:26,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164485977] [2019-12-26 23:10:26,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:10:26,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:10:26,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:10:26,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:10:26,492 INFO L87 Difference]: Start difference. First operand 5317 states and 13388 transitions. Second operand 4 states. [2019-12-26 23:10:26,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:10:26,970 INFO L93 Difference]: Finished difference Result 6650 states and 16215 transitions. [2019-12-26 23:10:26,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:10:26,971 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-26 23:10:26,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:10:26,989 INFO L225 Difference]: With dead ends: 6650 [2019-12-26 23:10:26,989 INFO L226 Difference]: Without dead ends: 6637 [2019-12-26 23:10:26,990 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:10:27,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6637 states. [2019-12-26 23:10:27,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6637 to 6481. [2019-12-26 23:10:27,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6481 states. [2019-12-26 23:10:27,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6481 states to 6481 states and 15900 transitions. [2019-12-26 23:10:27,256 INFO L78 Accepts]: Start accepts. Automaton has 6481 states and 15900 transitions. Word has length 11 [2019-12-26 23:10:27,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:10:27,256 INFO L462 AbstractCegarLoop]: Abstraction has 6481 states and 15900 transitions. [2019-12-26 23:10:27,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:10:27,257 INFO L276 IsEmpty]: Start isEmpty. Operand 6481 states and 15900 transitions. [2019-12-26 23:10:27,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-26 23:10:27,259 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:10:27,259 INFO L411 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] [2019-12-26 23:10:27,260 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:10:27,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:10:27,260 INFO L82 PathProgramCache]: Analyzing trace with hash 160503652, now seen corresponding path program 1 times [2019-12-26 23:10:27,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:10:27,261 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652696177] [2019-12-26 23:10:27,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:10:27,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:10:27,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:10:27,415 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652696177] [2019-12-26 23:10:27,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:10:27,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:10:27,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422440059] [2019-12-26 23:10:27,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:10:27,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:10:27,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:10:27,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:10:27,417 INFO L87 Difference]: Start difference. First operand 6481 states and 15900 transitions. Second operand 5 states. [2019-12-26 23:10:27,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:10:27,476 INFO L93 Difference]: Finished difference Result 1835 states and 4003 transitions. [2019-12-26 23:10:27,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:10:27,479 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-12-26 23:10:27,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:10:27,486 INFO L225 Difference]: With dead ends: 1835 [2019-12-26 23:10:27,486 INFO L226 Difference]: Without dead ends: 1665 [2019-12-26 23:10:27,486 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:10:27,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1665 states. [2019-12-26 23:10:27,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1665 to 1595. [2019-12-26 23:10:27,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1595 states. [2019-12-26 23:10:27,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1595 states to 1595 states and 3499 transitions. [2019-12-26 23:10:27,527 INFO L78 Accepts]: Start accepts. Automaton has 1595 states and 3499 transitions. Word has length 23 [2019-12-26 23:10:27,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:10:27,527 INFO L462 AbstractCegarLoop]: Abstraction has 1595 states and 3499 transitions. [2019-12-26 23:10:27,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:10:27,528 INFO L276 IsEmpty]: Start isEmpty. Operand 1595 states and 3499 transitions. [2019-12-26 23:10:27,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-26 23:10:27,536 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:10:27,537 INFO L411 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] [2019-12-26 23:10:27,537 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:10:27,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:10:27,538 INFO L82 PathProgramCache]: Analyzing trace with hash -175598507, now seen corresponding path program 1 times [2019-12-26 23:10:27,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:10:27,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814229899] [2019-12-26 23:10:27,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:10:27,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:10:27,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:10:27,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814229899] [2019-12-26 23:10:27,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:10:27,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 23:10:27,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358947719] [2019-12-26 23:10:27,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:10:27,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:10:27,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:10:27,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:10:27,748 INFO L87 Difference]: Start difference. First operand 1595 states and 3499 transitions. Second operand 7 states. [2019-12-26 23:10:28,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:10:28,872 INFO L93 Difference]: Finished difference Result 2420 states and 5234 transitions. [2019-12-26 23:10:28,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 23:10:28,872 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 83 [2019-12-26 23:10:28,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:10:28,878 INFO L225 Difference]: With dead ends: 2420 [2019-12-26 23:10:28,879 INFO L226 Difference]: Without dead ends: 2420 [2019-12-26 23:10:28,879 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-12-26 23:10:28,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2420 states. [2019-12-26 23:10:28,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2420 to 1759. [2019-12-26 23:10:28,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1759 states. [2019-12-26 23:10:28,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1759 states to 1759 states and 3873 transitions. [2019-12-26 23:10:28,918 INFO L78 Accepts]: Start accepts. Automaton has 1759 states and 3873 transitions. Word has length 83 [2019-12-26 23:10:28,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:10:28,919 INFO L462 AbstractCegarLoop]: Abstraction has 1759 states and 3873 transitions. [2019-12-26 23:10:28,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:10:28,919 INFO L276 IsEmpty]: Start isEmpty. Operand 1759 states and 3873 transitions. [2019-12-26 23:10:28,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-26 23:10:28,925 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:10:28,925 INFO L411 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] [2019-12-26 23:10:28,925 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:10:28,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:10:28,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1827081641, now seen corresponding path program 2 times [2019-12-26 23:10:28,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:10:28,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113704717] [2019-12-26 23:10:28,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:10:28,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:10:29,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:10:29,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113704717] [2019-12-26 23:10:29,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:10:29,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:10:29,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822193589] [2019-12-26 23:10:29,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:10:29,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:10:29,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:10:29,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:10:29,116 INFO L87 Difference]: Start difference. First operand 1759 states and 3873 transitions. Second operand 6 states. [2019-12-26 23:10:30,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:10:30,045 INFO L93 Difference]: Finished difference Result 2203 states and 4785 transitions. [2019-12-26 23:10:30,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-26 23:10:30,046 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-12-26 23:10:30,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:10:30,059 INFO L225 Difference]: With dead ends: 2203 [2019-12-26 23:10:30,059 INFO L226 Difference]: Without dead ends: 2203 [2019-12-26 23:10:30,060 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:10:30,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2203 states. [2019-12-26 23:10:30,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2203 to 1864. [2019-12-26 23:10:30,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1864 states. [2019-12-26 23:10:30,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1864 states to 1864 states and 4089 transitions. [2019-12-26 23:10:30,101 INFO L78 Accepts]: Start accepts. Automaton has 1864 states and 4089 transitions. Word has length 83 [2019-12-26 23:10:30,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:10:30,102 INFO L462 AbstractCegarLoop]: Abstraction has 1864 states and 4089 transitions. [2019-12-26 23:10:30,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:10:30,102 INFO L276 IsEmpty]: Start isEmpty. Operand 1864 states and 4089 transitions. [2019-12-26 23:10:30,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-26 23:10:30,111 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:10:30,112 INFO L411 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] [2019-12-26 23:10:30,112 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:10:30,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:10:30,113 INFO L82 PathProgramCache]: Analyzing trace with hash 219474423, now seen corresponding path program 3 times [2019-12-26 23:10:30,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:10:30,115 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133881062] [2019-12-26 23:10:30,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:10:30,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:10:30,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:10:30,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133881062] [2019-12-26 23:10:30,263 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:10:30,263 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:10:30,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627939775] [2019-12-26 23:10:30,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:10:30,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:10:30,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:10:30,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:10:30,267 INFO L87 Difference]: Start difference. First operand 1864 states and 4089 transitions. Second operand 5 states. [2019-12-26 23:10:30,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:10:30,548 INFO L93 Difference]: Finished difference Result 2008 states and 4352 transitions. [2019-12-26 23:10:30,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 23:10:30,549 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2019-12-26 23:10:30,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:10:30,553 INFO L225 Difference]: With dead ends: 2008 [2019-12-26 23:10:30,553 INFO L226 Difference]: Without dead ends: 2008 [2019-12-26 23:10:30,554 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:10:30,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2008 states. [2019-12-26 23:10:30,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2008 to 1903. [2019-12-26 23:10:30,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1903 states. [2019-12-26 23:10:30,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1903 states to 1903 states and 4168 transitions. [2019-12-26 23:10:30,589 INFO L78 Accepts]: Start accepts. Automaton has 1903 states and 4168 transitions. Word has length 83 [2019-12-26 23:10:30,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:10:30,591 INFO L462 AbstractCegarLoop]: Abstraction has 1903 states and 4168 transitions. [2019-12-26 23:10:30,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:10:30,591 INFO L276 IsEmpty]: Start isEmpty. Operand 1903 states and 4168 transitions. [2019-12-26 23:10:30,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-26 23:10:30,596 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:10:30,596 INFO L411 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] [2019-12-26 23:10:30,596 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:10:30,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:10:30,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1940404291, now seen corresponding path program 4 times [2019-12-26 23:10:30,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:10:30,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352342743] [2019-12-26 23:10:30,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:10:30,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:10:30,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:10:30,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352342743] [2019-12-26 23:10:30,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:10:30,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:10:30,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416225801] [2019-12-26 23:10:30,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:10:30,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:10:30,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:10:30,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:10:30,779 INFO L87 Difference]: Start difference. First operand 1903 states and 4168 transitions. Second operand 4 states. [2019-12-26 23:10:31,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:10:31,154 INFO L93 Difference]: Finished difference Result 2669 states and 5838 transitions. [2019-12-26 23:10:31,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 23:10:31,154 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2019-12-26 23:10:31,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:10:31,162 INFO L225 Difference]: With dead ends: 2669 [2019-12-26 23:10:31,162 INFO L226 Difference]: Without dead ends: 2669 [2019-12-26 23:10:31,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:10:31,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2669 states. [2019-12-26 23:10:31,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2669 to 1999. [2019-12-26 23:10:31,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1999 states. [2019-12-26 23:10:31,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1999 states to 1999 states and 4329 transitions. [2019-12-26 23:10:31,199 INFO L78 Accepts]: Start accepts. Automaton has 1999 states and 4329 transitions. Word has length 83 [2019-12-26 23:10:31,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:10:31,199 INFO L462 AbstractCegarLoop]: Abstraction has 1999 states and 4329 transitions. [2019-12-26 23:10:31,199 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:10:31,200 INFO L276 IsEmpty]: Start isEmpty. Operand 1999 states and 4329 transitions. [2019-12-26 23:10:31,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-26 23:10:31,204 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:10:31,205 INFO L411 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] [2019-12-26 23:10:31,205 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:10:31,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:10:31,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1104508352, now seen corresponding path program 1 times [2019-12-26 23:10:31,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:10:31,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769357269] [2019-12-26 23:10:31,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:10:31,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:10:31,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:10:31,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769357269] [2019-12-26 23:10:31,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:10:31,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-26 23:10:31,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785541372] [2019-12-26 23:10:31,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-26 23:10:31,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:10:31,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-26 23:10:31,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-26 23:10:31,522 INFO L87 Difference]: Start difference. First operand 1999 states and 4329 transitions. Second operand 10 states. [2019-12-26 23:10:33,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:10:33,215 INFO L93 Difference]: Finished difference Result 3133 states and 6617 transitions. [2019-12-26 23:10:33,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 23:10:33,216 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 84 [2019-12-26 23:10:33,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:10:33,223 INFO L225 Difference]: With dead ends: 3133 [2019-12-26 23:10:33,223 INFO L226 Difference]: Without dead ends: 3133 [2019-12-26 23:10:33,223 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2019-12-26 23:10:33,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3133 states. [2019-12-26 23:10:33,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3133 to 2367. [2019-12-26 23:10:33,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2367 states. [2019-12-26 23:10:33,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2367 states to 2367 states and 5096 transitions. [2019-12-26 23:10:33,269 INFO L78 Accepts]: Start accepts. Automaton has 2367 states and 5096 transitions. Word has length 84 [2019-12-26 23:10:33,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:10:33,269 INFO L462 AbstractCegarLoop]: Abstraction has 2367 states and 5096 transitions. [2019-12-26 23:10:33,269 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-26 23:10:33,270 INFO L276 IsEmpty]: Start isEmpty. Operand 2367 states and 5096 transitions. [2019-12-26 23:10:33,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-26 23:10:33,277 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:10:33,277 INFO L411 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] [2019-12-26 23:10:33,278 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:10:33,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:10:33,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1586153894, now seen corresponding path program 1 times [2019-12-26 23:10:33,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:10:33,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854784593] [2019-12-26 23:10:33,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:10:33,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:10:33,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:10:33,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854784593] [2019-12-26 23:10:33,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:10:33,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-26 23:10:33,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242698594] [2019-12-26 23:10:33,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 23:10:33,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:10:33,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 23:10:33,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-26 23:10:33,519 INFO L87 Difference]: Start difference. First operand 2367 states and 5096 transitions. Second operand 11 states. [2019-12-26 23:10:34,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:10:34,858 INFO L93 Difference]: Finished difference Result 3862 states and 8230 transitions. [2019-12-26 23:10:34,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 23:10:34,859 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 84 [2019-12-26 23:10:34,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:10:34,866 INFO L225 Difference]: With dead ends: 3862 [2019-12-26 23:10:34,866 INFO L226 Difference]: Without dead ends: 3862 [2019-12-26 23:10:34,867 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-12-26 23:10:34,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3862 states. [2019-12-26 23:10:34,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3862 to 2659. [2019-12-26 23:10:34,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2659 states. [2019-12-26 23:10:34,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2659 states to 2659 states and 5726 transitions. [2019-12-26 23:10:34,912 INFO L78 Accepts]: Start accepts. Automaton has 2659 states and 5726 transitions. Word has length 84 [2019-12-26 23:10:34,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:10:34,912 INFO L462 AbstractCegarLoop]: Abstraction has 2659 states and 5726 transitions. [2019-12-26 23:10:34,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 23:10:34,912 INFO L276 IsEmpty]: Start isEmpty. Operand 2659 states and 5726 transitions. [2019-12-26 23:10:34,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-26 23:10:34,918 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:10:34,919 INFO L411 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] [2019-12-26 23:10:34,919 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:10:34,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:10:34,919 INFO L82 PathProgramCache]: Analyzing trace with hash 791166708, now seen corresponding path program 2 times [2019-12-26 23:10:34,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:10:34,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21937226] [2019-12-26 23:10:34,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:10:34,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:10:34,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:10:34,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21937226] [2019-12-26 23:10:34,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:10:34,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:10:34,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732308108] [2019-12-26 23:10:34,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:10:34,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:10:34,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:10:34,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:10:34,988 INFO L87 Difference]: Start difference. First operand 2659 states and 5726 transitions. Second operand 3 states. [2019-12-26 23:10:35,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:10:35,049 INFO L93 Difference]: Finished difference Result 2658 states and 5724 transitions. [2019-12-26 23:10:35,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:10:35,050 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-12-26 23:10:35,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:10:35,054 INFO L225 Difference]: With dead ends: 2658 [2019-12-26 23:10:35,054 INFO L226 Difference]: Without dead ends: 2658 [2019-12-26 23:10:35,055 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:10:35,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2658 states. [2019-12-26 23:10:35,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2658 to 2091. [2019-12-26 23:10:35,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2091 states. [2019-12-26 23:10:35,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2091 states to 2091 states and 4569 transitions. [2019-12-26 23:10:35,088 INFO L78 Accepts]: Start accepts. Automaton has 2091 states and 4569 transitions. Word has length 84 [2019-12-26 23:10:35,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:10:35,088 INFO L462 AbstractCegarLoop]: Abstraction has 2091 states and 4569 transitions. [2019-12-26 23:10:35,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:10:35,089 INFO L276 IsEmpty]: Start isEmpty. Operand 2091 states and 4569 transitions. [2019-12-26 23:10:35,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-26 23:10:35,097 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:10:35,097 INFO L411 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] [2019-12-26 23:10:35,097 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:10:35,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:10:35,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1761939513, now seen corresponding path program 1 times [2019-12-26 23:10:35,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:10:35,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299159255] [2019-12-26 23:10:35,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:10:35,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:10:35,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:10:35,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299159255] [2019-12-26 23:10:35,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:10:35,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 23:10:35,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692374662] [2019-12-26 23:10:35,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 23:10:35,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:10:35,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 23:10:35,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-26 23:10:35,350 INFO L87 Difference]: Start difference. First operand 2091 states and 4569 transitions. Second operand 11 states. [2019-12-26 23:10:36,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:10:36,191 INFO L93 Difference]: Finished difference Result 3672 states and 7908 transitions. [2019-12-26 23:10:36,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-26 23:10:36,192 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 85 [2019-12-26 23:10:36,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:10:36,196 INFO L225 Difference]: With dead ends: 3672 [2019-12-26 23:10:36,196 INFO L226 Difference]: Without dead ends: 2397 [2019-12-26 23:10:36,197 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=205, Invalid=665, Unknown=0, NotChecked=0, Total=870 [2019-12-26 23:10:36,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2397 states. [2019-12-26 23:10:36,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2397 to 1729. [2019-12-26 23:10:36,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1729 states. [2019-12-26 23:10:36,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1729 states to 1729 states and 3674 transitions. [2019-12-26 23:10:36,230 INFO L78 Accepts]: Start accepts. Automaton has 1729 states and 3674 transitions. Word has length 85 [2019-12-26 23:10:36,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:10:36,231 INFO L462 AbstractCegarLoop]: Abstraction has 1729 states and 3674 transitions. [2019-12-26 23:10:36,231 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 23:10:36,231 INFO L276 IsEmpty]: Start isEmpty. Operand 1729 states and 3674 transitions. [2019-12-26 23:10:36,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-26 23:10:36,235 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:10:36,235 INFO L411 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] [2019-12-26 23:10:36,235 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:10:36,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:10:36,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1370724916, now seen corresponding path program 1 times [2019-12-26 23:10:36,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:10:36,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457434002] [2019-12-26 23:10:36,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:10:36,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:10:36,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:10:36,513 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457434002] [2019-12-26 23:10:36,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:10:36,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-26 23:10:36,513 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782246515] [2019-12-26 23:10:36,514 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-26 23:10:36,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:10:36,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-26 23:10:36,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-12-26 23:10:36,515 INFO L87 Difference]: Start difference. First operand 1729 states and 3674 transitions. Second operand 14 states. [2019-12-26 23:10:37,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:10:37,445 INFO L93 Difference]: Finished difference Result 2786 states and 5885 transitions. [2019-12-26 23:10:37,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-26 23:10:37,446 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 86 [2019-12-26 23:10:37,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:10:37,450 INFO L225 Difference]: With dead ends: 2786 [2019-12-26 23:10:37,450 INFO L226 Difference]: Without dead ends: 2752 [2019-12-26 23:10:37,451 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=161, Invalid=709, Unknown=0, NotChecked=0, Total=870 [2019-12-26 23:10:37,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2752 states. [2019-12-26 23:10:37,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2752 to 2197. [2019-12-26 23:10:37,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2197 states. [2019-12-26 23:10:37,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2197 states to 2197 states and 4705 transitions. [2019-12-26 23:10:37,484 INFO L78 Accepts]: Start accepts. Automaton has 2197 states and 4705 transitions. Word has length 86 [2019-12-26 23:10:37,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:10:37,485 INFO L462 AbstractCegarLoop]: Abstraction has 2197 states and 4705 transitions. [2019-12-26 23:10:37,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-26 23:10:37,485 INFO L276 IsEmpty]: Start isEmpty. Operand 2197 states and 4705 transitions. [2019-12-26 23:10:37,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-26 23:10:37,490 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:10:37,490 INFO L411 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] [2019-12-26 23:10:37,490 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:10:37,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:10:37,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1543760090, now seen corresponding path program 2 times [2019-12-26 23:10:37,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:10:37,491 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27274903] [2019-12-26 23:10:37,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:10:37,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:10:37,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:10:37,807 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27274903] [2019-12-26 23:10:37,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:10:37,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-26 23:10:37,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520101556] [2019-12-26 23:10:37,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-26 23:10:37,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:10:37,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-26 23:10:37,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-12-26 23:10:37,808 INFO L87 Difference]: Start difference. First operand 2197 states and 4705 transitions. Second operand 12 states. [2019-12-26 23:10:38,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:10:38,651 INFO L93 Difference]: Finished difference Result 2983 states and 6400 transitions. [2019-12-26 23:10:38,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-26 23:10:38,652 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 86 [2019-12-26 23:10:38,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:10:38,656 INFO L225 Difference]: With dead ends: 2983 [2019-12-26 23:10:38,656 INFO L226 Difference]: Without dead ends: 2949 [2019-12-26 23:10:38,657 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2019-12-26 23:10:38,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2949 states. [2019-12-26 23:10:38,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2949 to 2282. [2019-12-26 23:10:38,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2282 states. [2019-12-26 23:10:38,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2282 states to 2282 states and 4903 transitions. [2019-12-26 23:10:38,698 INFO L78 Accepts]: Start accepts. Automaton has 2282 states and 4903 transitions. Word has length 86 [2019-12-26 23:10:38,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:10:38,698 INFO L462 AbstractCegarLoop]: Abstraction has 2282 states and 4903 transitions. [2019-12-26 23:10:38,698 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-26 23:10:38,698 INFO L276 IsEmpty]: Start isEmpty. Operand 2282 states and 4903 transitions. [2019-12-26 23:10:38,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-26 23:10:38,703 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:10:38,704 INFO L411 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] [2019-12-26 23:10:38,704 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:10:38,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:10:38,704 INFO L82 PathProgramCache]: Analyzing trace with hash 190859616, now seen corresponding path program 3 times [2019-12-26 23:10:38,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:10:38,705 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978161850] [2019-12-26 23:10:38,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:10:38,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:10:38,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:10:38,809 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978161850] [2019-12-26 23:10:38,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:10:38,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:10:38,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805526023] [2019-12-26 23:10:38,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:10:38,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:10:38,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:10:38,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:10:38,812 INFO L87 Difference]: Start difference. First operand 2282 states and 4903 transitions. Second operand 5 states. [2019-12-26 23:10:39,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:10:39,153 INFO L93 Difference]: Finished difference Result 3529 states and 7620 transitions. [2019-12-26 23:10:39,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 23:10:39,153 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2019-12-26 23:10:39,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:10:39,158 INFO L225 Difference]: With dead ends: 3529 [2019-12-26 23:10:39,158 INFO L226 Difference]: Without dead ends: 3529 [2019-12-26 23:10:39,158 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:10:39,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3529 states. [2019-12-26 23:10:39,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3529 to 2839. [2019-12-26 23:10:39,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2839 states. [2019-12-26 23:10:39,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2839 states to 2839 states and 6098 transitions. [2019-12-26 23:10:39,210 INFO L78 Accepts]: Start accepts. Automaton has 2839 states and 6098 transitions. Word has length 86 [2019-12-26 23:10:39,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:10:39,210 INFO L462 AbstractCegarLoop]: Abstraction has 2839 states and 6098 transitions. [2019-12-26 23:10:39,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:10:39,210 INFO L276 IsEmpty]: Start isEmpty. Operand 2839 states and 6098 transitions. [2019-12-26 23:10:39,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-26 23:10:39,217 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:10:39,217 INFO L411 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] [2019-12-26 23:10:39,217 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:10:39,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:10:39,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1563899026, now seen corresponding path program 1 times [2019-12-26 23:10:39,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:10:39,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075135707] [2019-12-26 23:10:39,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:10:39,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:10:39,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:10:39,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075135707] [2019-12-26 23:10:39,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:10:39,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-26 23:10:39,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395895779] [2019-12-26 23:10:39,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-26 23:10:39,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:10:39,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-26 23:10:39,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-12-26 23:10:39,550 INFO L87 Difference]: Start difference. First operand 2839 states and 6098 transitions. Second operand 14 states. [2019-12-26 23:10:40,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:10:40,414 INFO L93 Difference]: Finished difference Result 3212 states and 6762 transitions. [2019-12-26 23:10:40,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-26 23:10:40,414 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 87 [2019-12-26 23:10:40,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:10:40,419 INFO L225 Difference]: With dead ends: 3212 [2019-12-26 23:10:40,419 INFO L226 Difference]: Without dead ends: 3077 [2019-12-26 23:10:40,420 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2019-12-26 23:10:40,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3077 states. [2019-12-26 23:10:40,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3077 to 3031. [2019-12-26 23:10:40,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3031 states. [2019-12-26 23:10:40,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3031 states to 3031 states and 6448 transitions. [2019-12-26 23:10:40,466 INFO L78 Accepts]: Start accepts. Automaton has 3031 states and 6448 transitions. Word has length 87 [2019-12-26 23:10:40,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:10:40,466 INFO L462 AbstractCegarLoop]: Abstraction has 3031 states and 6448 transitions. [2019-12-26 23:10:40,466 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-26 23:10:40,466 INFO L276 IsEmpty]: Start isEmpty. Operand 3031 states and 6448 transitions. [2019-12-26 23:10:40,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-26 23:10:40,473 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:10:40,473 INFO L411 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] [2019-12-26 23:10:40,473 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:10:40,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:10:40,474 INFO L82 PathProgramCache]: Analyzing trace with hash -126478383, now seen corresponding path program 1 times [2019-12-26 23:10:40,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:10:40,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976233547] [2019-12-26 23:10:40,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:10:40,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:10:40,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:10:40,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976233547] [2019-12-26 23:10:40,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:10:40,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-26 23:10:40,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706405399] [2019-12-26 23:10:40,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-26 23:10:40,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:10:40,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-26 23:10:40,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2019-12-26 23:10:40,904 INFO L87 Difference]: Start difference. First operand 3031 states and 6448 transitions. Second operand 17 states. [2019-12-26 23:10:42,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:10:42,513 INFO L93 Difference]: Finished difference Result 6188 states and 13239 transitions. [2019-12-26 23:10:42,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-26 23:10:42,513 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 87 [2019-12-26 23:10:42,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:10:42,520 INFO L225 Difference]: With dead ends: 6188 [2019-12-26 23:10:42,521 INFO L226 Difference]: Without dead ends: 5679 [2019-12-26 23:10:42,521 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=210, Invalid=980, Unknown=0, NotChecked=0, Total=1190 [2019-12-26 23:10:42,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5679 states. [2019-12-26 23:10:42,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5679 to 3854. [2019-12-26 23:10:42,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3854 states. [2019-12-26 23:10:42,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3854 states to 3854 states and 8298 transitions. [2019-12-26 23:10:42,586 INFO L78 Accepts]: Start accepts. Automaton has 3854 states and 8298 transitions. Word has length 87 [2019-12-26 23:10:42,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:10:42,587 INFO L462 AbstractCegarLoop]: Abstraction has 3854 states and 8298 transitions. [2019-12-26 23:10:42,587 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-26 23:10:42,587 INFO L276 IsEmpty]: Start isEmpty. Operand 3854 states and 8298 transitions. [2019-12-26 23:10:42,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-26 23:10:42,595 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:10:42,595 INFO L411 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] [2019-12-26 23:10:42,595 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:10:42,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:10:42,596 INFO L82 PathProgramCache]: Analyzing trace with hash -436099747, now seen corresponding path program 1 times [2019-12-26 23:10:42,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:10:42,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530726422] [2019-12-26 23:10:42,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:10:42,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:10:42,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:10:42,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530726422] [2019-12-26 23:10:42,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:10:42,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:10:42,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001705068] [2019-12-26 23:10:42,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:10:42,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:10:42,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:10:42,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:10:42,646 INFO L87 Difference]: Start difference. First operand 3854 states and 8298 transitions. Second operand 3 states. [2019-12-26 23:10:42,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:10:42,757 INFO L93 Difference]: Finished difference Result 4430 states and 9086 transitions. [2019-12-26 23:10:42,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:10:42,758 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2019-12-26 23:10:42,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:10:42,763 INFO L225 Difference]: With dead ends: 4430 [2019-12-26 23:10:42,763 INFO L226 Difference]: Without dead ends: 4430 [2019-12-26 23:10:42,765 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:10:42,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4430 states. [2019-12-26 23:10:42,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4430 to 4140. [2019-12-26 23:10:42,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4140 states. [2019-12-26 23:10:42,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4140 states to 4140 states and 8551 transitions. [2019-12-26 23:10:42,828 INFO L78 Accepts]: Start accepts. Automaton has 4140 states and 8551 transitions. Word has length 87 [2019-12-26 23:10:42,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:10:42,828 INFO L462 AbstractCegarLoop]: Abstraction has 4140 states and 8551 transitions. [2019-12-26 23:10:42,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:10:42,828 INFO L276 IsEmpty]: Start isEmpty. Operand 4140 states and 8551 transitions. [2019-12-26 23:10:42,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-26 23:10:42,836 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:10:42,836 INFO L411 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] [2019-12-26 23:10:42,836 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:10:42,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:10:42,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1973430413, now seen corresponding path program 2 times [2019-12-26 23:10:42,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:10:42,837 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367769251] [2019-12-26 23:10:42,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:10:42,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:10:43,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:10:43,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367769251] [2019-12-26 23:10:43,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:10:43,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:10:43,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200057656] [2019-12-26 23:10:43,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:10:43,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:10:43,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:10:43,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:10:43,089 INFO L87 Difference]: Start difference. First operand 4140 states and 8551 transitions. Second operand 7 states. [2019-12-26 23:10:43,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:10:43,764 INFO L93 Difference]: Finished difference Result 5857 states and 12258 transitions. [2019-12-26 23:10:43,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-26 23:10:43,765 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 87 [2019-12-26 23:10:43,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:10:43,773 INFO L225 Difference]: With dead ends: 5857 [2019-12-26 23:10:43,773 INFO L226 Difference]: Without dead ends: 5857 [2019-12-26 23:10:43,773 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-12-26 23:10:43,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5857 states. [2019-12-26 23:10:43,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5857 to 4779. [2019-12-26 23:10:43,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4779 states. [2019-12-26 23:10:43,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4779 states to 4779 states and 9908 transitions. [2019-12-26 23:10:43,852 INFO L78 Accepts]: Start accepts. Automaton has 4779 states and 9908 transitions. Word has length 87 [2019-12-26 23:10:43,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:10:43,852 INFO L462 AbstractCegarLoop]: Abstraction has 4779 states and 9908 transitions. [2019-12-26 23:10:43,853 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:10:43,853 INFO L276 IsEmpty]: Start isEmpty. Operand 4779 states and 9908 transitions. [2019-12-26 23:10:43,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-26 23:10:43,862 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:10:43,862 INFO L411 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] [2019-12-26 23:10:43,862 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:10:43,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:10:43,863 INFO L82 PathProgramCache]: Analyzing trace with hash -168956201, now seen corresponding path program 3 times [2019-12-26 23:10:43,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:10:43,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197391370] [2019-12-26 23:10:43,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:10:43,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:10:44,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:10:44,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197391370] [2019-12-26 23:10:44,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:10:44,106 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 23:10:44,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731360962] [2019-12-26 23:10:44,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-26 23:10:44,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:10:44,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-26 23:10:44,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-12-26 23:10:44,108 INFO L87 Difference]: Start difference. First operand 4779 states and 9908 transitions. Second operand 10 states. [2019-12-26 23:10:45,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:10:45,265 INFO L93 Difference]: Finished difference Result 6771 states and 13985 transitions. [2019-12-26 23:10:45,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-26 23:10:45,266 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 87 [2019-12-26 23:10:45,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:10:45,271 INFO L225 Difference]: With dead ends: 6771 [2019-12-26 23:10:45,271 INFO L226 Difference]: Without dead ends: 6659 [2019-12-26 23:10:45,271 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2019-12-26 23:10:45,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6659 states. [2019-12-26 23:10:45,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6659 to 4823. [2019-12-26 23:10:45,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4823 states. [2019-12-26 23:10:45,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4823 states to 4823 states and 9936 transitions. [2019-12-26 23:10:45,328 INFO L78 Accepts]: Start accepts. Automaton has 4823 states and 9936 transitions. Word has length 87 [2019-12-26 23:10:45,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:10:45,328 INFO L462 AbstractCegarLoop]: Abstraction has 4823 states and 9936 transitions. [2019-12-26 23:10:45,328 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-26 23:10:45,328 INFO L276 IsEmpty]: Start isEmpty. Operand 4823 states and 9936 transitions. [2019-12-26 23:10:45,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-26 23:10:45,338 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:10:45,338 INFO L411 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] [2019-12-26 23:10:45,338 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:10:45,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:10:45,338 INFO L82 PathProgramCache]: Analyzing trace with hash -910030344, now seen corresponding path program 1 times [2019-12-26 23:10:45,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:10:45,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765256688] [2019-12-26 23:10:45,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:10:45,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:10:45,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:10:45,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765256688] [2019-12-26 23:10:45,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:10:45,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-26 23:10:45,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002195996] [2019-12-26 23:10:45,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-26 23:10:45,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:10:45,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-26 23:10:45,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-12-26 23:10:45,696 INFO L87 Difference]: Start difference. First operand 4823 states and 9936 transitions. Second operand 15 states. [2019-12-26 23:10:47,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:10:47,746 INFO L93 Difference]: Finished difference Result 7456 states and 15308 transitions. [2019-12-26 23:10:47,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-26 23:10:47,747 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 87 [2019-12-26 23:10:47,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:10:47,755 INFO L225 Difference]: With dead ends: 7456 [2019-12-26 23:10:47,755 INFO L226 Difference]: Without dead ends: 7316 [2019-12-26 23:10:47,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=203, Invalid=987, Unknown=0, NotChecked=0, Total=1190 [2019-12-26 23:10:47,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7316 states. [2019-12-26 23:10:47,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7316 to 4834. [2019-12-26 23:10:47,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4834 states. [2019-12-26 23:10:47,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4834 states to 4834 states and 9958 transitions. [2019-12-26 23:10:47,820 INFO L78 Accepts]: Start accepts. Automaton has 4834 states and 9958 transitions. Word has length 87 [2019-12-26 23:10:47,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:10:47,820 INFO L462 AbstractCegarLoop]: Abstraction has 4834 states and 9958 transitions. [2019-12-26 23:10:47,820 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-26 23:10:47,820 INFO L276 IsEmpty]: Start isEmpty. Operand 4834 states and 9958 transitions. [2019-12-26 23:10:47,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-26 23:10:47,829 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:10:47,829 INFO L411 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] [2019-12-26 23:10:47,829 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:10:47,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:10:47,830 INFO L82 PathProgramCache]: Analyzing trace with hash -766393236, now seen corresponding path program 2 times [2019-12-26 23:10:47,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:10:47,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262352130] [2019-12-26 23:10:47,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:10:47,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:10:47,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:10:47,969 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 23:10:47,969 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 23:10:47,973 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1305] [1305] ULTIMATE.startENTRY-->L813: Formula: (let ((.cse0 (store |v_#valid_52| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1597~0.base_28|) (= 0 v_~__unbuffered_p1_EAX~0_80) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t1597~0.base_28| 4) |v_#length_17|) (= v_~y$r_buff1_thd1~0_174 0) (= 0 |v_ULTIMATE.start_main_~#t1597~0.offset_20|) (= v_~y$r_buff0_thd0~0_406 0) (= 0 v_~y$w_buff0~0_222) (= v_~y~0_511 0) (= 0 v_~y$r_buff0_thd2~0_640) (= v_~main$tmp_guard0~0_27 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1597~0.base_28|)) (= 0 v_~weak$$choice0~0_258) (= v_~y$mem_tmp~0_281 0) (= v_~y$read_delayed~0_6 0) (= v_~y$w_buff1_used~0_621 0) (= v_~x~0_48 0) (= 0 v_~y$r_buff1_thd2~0_481) (= v_~__unbuffered_p1_EBX~0_44 0) (= v_~y$flush_delayed~0_437 0) (= v_~weak$$choice2~0_358 0) (= |v_#valid_50| (store .cse0 |v_ULTIMATE.start_main_~#t1597~0.base_28| 1)) (= v_~y$r_buff0_thd1~0_95 0) (= |v_#NULL.offset_5| 0) (= 0 v_~__unbuffered_cnt~0_58) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1597~0.base_28| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1597~0.base_28|) |v_ULTIMATE.start_main_~#t1597~0.offset_20| 0)) |v_#memory_int_17|) (= v_~y$r_buff1_thd0~0_395 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~y$w_buff0_used~0_1083 0) (= v_~y$w_buff1~0_235 0) (= 0 |v_#NULL.base_5|) (= 0 v_~main$tmp_guard1~0_116) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_52|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1597~0.offset=|v_ULTIMATE.start_main_~#t1597~0.offset_20|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_200|, ULTIMATE.start_main_#t~ite66=|v_ULTIMATE.start_main_#t~ite66_296|, ULTIMATE.start_main_#t~ite89=|v_ULTIMATE.start_main_#t~ite89_37|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_29|, ULTIMATE.start_main_#t~nondet70=|v_ULTIMATE.start_main_#t~nondet70_172|, ULTIMATE.start_main_#t~ite87=|v_ULTIMATE.start_main_#t~ite87_26|, ULTIMATE.start_main_#t~ite73=|v_ULTIMATE.start_main_#t~ite73_63|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ULTIMATE.start_main_#t~ite71=|v_ULTIMATE.start_main_#t~ite71_46|, ~y$mem_tmp~0=v_~y$mem_tmp~0_281, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_80, ULTIMATE.start_main_#t~ite90=|v_ULTIMATE.start_main_#t~ite90_49|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_95, ~y$flush_delayed~0=v_~y$flush_delayed~0_437, #length=|v_#length_17|, ULTIMATE.start_main_#t~nondet62=|v_ULTIMATE.start_main_#t~nondet62_17|, ULTIMATE.start_main_#t~ite79=|v_ULTIMATE.start_main_#t~ite79_121|, ULTIMATE.start_main_#t~ite77=|v_ULTIMATE.start_main_#t~ite77_86|, ULTIMATE.start_main_#t~ite75=|v_ULTIMATE.start_main_#t~ite75_100|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_34|, ULTIMATE.start_main_#t~ite84=|v_ULTIMATE.start_main_#t~ite84_27|, ~weak$$choice0~0=v_~weak$$choice0~0_258, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite82=|v_ULTIMATE.start_main_#t~ite82_45|, ~y$w_buff1~0=v_~y$w_buff1~0_235, ULTIMATE.start_main_#t~ite80=|v_ULTIMATE.start_main_#t~ite80_130|, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_640, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_395, ~x~0=v_~x~0_48, ULTIMATE.start_main_~#t1597~0.base=|v_ULTIMATE.start_main_~#t1597~0.base_28|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_1083, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_116, ULTIMATE.start_main_#t~ite67=|v_ULTIMATE.start_main_#t~ite67_34|, ULTIMATE.start_main_#t~ite88=|v_ULTIMATE.start_main_#t~ite88_46|, ULTIMATE.start_main_#t~ite65=|v_ULTIMATE.start_main_#t~ite65_42|, ULTIMATE.start_main_#t~ite86=|v_ULTIMATE.start_main_#t~ite86_36|, ULTIMATE.start_main_#t~ite74=|v_ULTIMATE.start_main_#t~ite74_60|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_174, ULTIMATE.start_main_#t~ite72=|v_ULTIMATE.start_main_#t~ite72_48|, ULTIMATE.start_main_#t~ite91=|v_ULTIMATE.start_main_#t~ite91_259|, ~y$w_buff0~0=v_~y$w_buff0~0_222, ~y~0=v_~y~0_511, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_44, ULTIMATE.start_main_#t~nondet69=|v_ULTIMATE.start_main_#t~nondet69_172|, ULTIMATE.start_main_~#t1598~0.base=|v_ULTIMATE.start_main_~#t1598~0.base_18|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_27, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_8|, ULTIMATE.start_main_#t~ite78=|v_ULTIMATE.start_main_#t~ite78_118|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite76=|v_ULTIMATE.start_main_#t~ite76_81|, ULTIMATE.start_main_#t~ite85=|v_ULTIMATE.start_main_#t~ite85_31|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_481, ULTIMATE.start_main_#t~ite83=|v_ULTIMATE.start_main_#t~ite83_72|, ULTIMATE.start_main_#t~ite81=|v_ULTIMATE.start_main_#t~ite81_190|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_406, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_17|, ~weak$$choice2~0=v_~weak$$choice2~0_358, ULTIMATE.start_main_~#t1598~0.offset=|v_ULTIMATE.start_main_~#t1598~0.offset_15|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_621} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1597~0.offset, #NULL.offset, ULTIMATE.start_main_#t~ite68, ULTIMATE.start_main_#t~ite66, ULTIMATE.start_main_#t~ite89, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_#t~nondet70, ULTIMATE.start_main_#t~ite87, ULTIMATE.start_main_#t~ite73, ~y$read_delayed~0, ULTIMATE.start_main_#t~ite71, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_#t~ite90, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_#t~nondet62, ULTIMATE.start_main_#t~ite79, ULTIMATE.start_main_#t~ite77, ULTIMATE.start_main_#t~ite75, ULTIMATE.start_main_#t~ite63, ULTIMATE.start_main_#t~ite84, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite82, ~y$w_buff1~0, ULTIMATE.start_main_#t~ite80, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t1597~0.base, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite67, ULTIMATE.start_main_#t~ite88, ULTIMATE.start_main_#t~ite65, ULTIMATE.start_main_#t~ite86, ULTIMATE.start_main_#t~ite74, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite72, ULTIMATE.start_main_#t~ite91, ~y$w_buff0~0, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet69, ULTIMATE.start_main_~#t1598~0.base, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet61, ULTIMATE.start_main_#t~ite78, #NULL.base, ULTIMATE.start_main_#t~ite76, ULTIMATE.start_main_#t~ite85, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite83, ULTIMATE.start_main_#t~ite81, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~weak$$choice2~0, ULTIMATE.start_main_~#t1598~0.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-26 23:10:47,974 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1266] [1266] L813-1-->L815: Formula: (and (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1598~0.base_13|)) (= 0 |v_ULTIMATE.start_main_~#t1598~0.offset_11|) (not (= 0 |v_ULTIMATE.start_main_~#t1598~0.base_13|)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1598~0.base_13|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1598~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1598~0.base_13|) |v_ULTIMATE.start_main_~#t1598~0.offset_11| 1)) |v_#memory_int_11|) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1598~0.base_13| 1) |v_#valid_27|) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1598~0.base_13| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t1598~0.base=|v_ULTIMATE.start_main_~#t1598~0.base_13|, #length=|v_#length_11|, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_5|, ULTIMATE.start_main_~#t1598~0.offset=|v_ULTIMATE.start_main_~#t1598~0.offset_11|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t1598~0.base, #length, ULTIMATE.start_main_#t~nondet61, ULTIMATE.start_main_~#t1598~0.offset] because there is no mapped edge [2019-12-26 23:10:47,977 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1162] [1162] L4-->L762: Formula: (and (= v_~y$r_buff0_thd2~0_126 v_~y$r_buff1_thd2~0_73) (= 1 v_~y$r_buff0_thd2~0_125) (= v_~y~0_65 v_~y$mem_tmp~0_35) (= v_~weak$$choice2~0_74 v_~y$flush_delayed~0_44) (= v_~y$r_buff0_thd1~0_15 v_~y$r_buff1_thd1~0_11) (= v_~weak$$choice2~0_74 |v_P1Thread1of1ForFork1_#t~nondet10_8|) (not (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_6 0)) (= v_~weak$$choice0~0_30 |v_P1Thread1of1ForFork1_#t~nondet9_8|) (= v_~y$r_buff0_thd0~0_77 v_~y$r_buff1_thd0~0_69)) InVars {P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_6, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_77, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_126, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_15, P1Thread1of1ForFork1_#t~nondet9=|v_P1Thread1of1ForFork1_#t~nondet9_8|, ~y~0=v_~y~0_65, P1Thread1of1ForFork1_#t~nondet10=|v_P1Thread1of1ForFork1_#t~nondet10_8|} OutVars{P1Thread1of1ForFork1_#t~nondet9=|v_P1Thread1of1ForFork1_#t~nondet9_7|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_73, P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_6, ~weak$$choice0~0=v_~weak$$choice0~0_30, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_11, ~y$mem_tmp~0=v_~y$mem_tmp~0_35, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_77, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_125, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_15, ~y$flush_delayed~0=v_~y$flush_delayed~0_44, ~y~0=v_~y~0_65, ~weak$$choice2~0=v_~weak$$choice2~0_74, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_69, P1Thread1of1ForFork1_#t~nondet10=|v_P1Thread1of1ForFork1_#t~nondet10_7|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, P1Thread1of1ForFork1_#t~nondet9, ~weak$$choice2~0, ~y$r_buff1_thd0~0, P1Thread1of1ForFork1_#t~nondet10] because there is no mapped edge [2019-12-26 23:10:47,978 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1218] [1218] L762-2-->L762-4: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In350247971 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In350247971 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out350247971| ~y$w_buff1~0_In350247971)) (and (not .cse0) (not .cse1) (= ~y$w_buff0~0_In350247971 |P1Thread1of1ForFork1_#t~ite11_Out350247971|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In350247971, ~y$w_buff1~0=~y$w_buff1~0_In350247971, ~y$w_buff0~0=~y$w_buff0~0_In350247971, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In350247971} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In350247971, ~y$w_buff1~0=~y$w_buff1~0_In350247971, ~y$w_buff0~0=~y$w_buff0~0_In350247971, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In350247971, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out350247971|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-26 23:10:47,978 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1145] [1145] L762-4-->L763: Formula: (= v_~y~0_45 |v_P1Thread1of1ForFork1_#t~ite11_10|) InVars {P1Thread1of1ForFork1_#t~ite11=|v_P1Thread1of1ForFork1_#t~ite11_10|} OutVars{P1Thread1of1ForFork1_#t~ite11=|v_P1Thread1of1ForFork1_#t~ite11_9|, P1Thread1of1ForFork1_#t~ite12=|v_P1Thread1of1ForFork1_#t~ite12_13|, ~y~0=v_~y~0_45} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11, P1Thread1of1ForFork1_#t~ite12, ~y~0] because there is no mapped edge [2019-12-26 23:10:47,985 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1206] [1206] L767-->L768: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_173 256))) (= v_~y$r_buff0_thd2~0_264 v_~y$r_buff0_thd2~0_263)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_264, ~weak$$choice2~0=v_~weak$$choice2~0_173} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_263, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_9|, ~weak$$choice2~0=v_~weak$$choice2~0_173, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_17|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_9|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-26 23:10:47,987 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1227] [1227] L770-->L770-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-2132424821 256) 0))) (or (and (not .cse0) (= ~y$mem_tmp~0_In-2132424821 |P1Thread1of1ForFork1_#t~ite31_Out-2132424821|)) (and .cse0 (= ~y~0_In-2132424821 |P1Thread1of1ForFork1_#t~ite31_Out-2132424821|)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-2132424821, ~y$flush_delayed~0=~y$flush_delayed~0_In-2132424821, ~y~0=~y~0_In-2132424821} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-2132424821, P1Thread1of1ForFork1_#t~ite31=|P1Thread1of1ForFork1_#t~ite31_Out-2132424821|, ~y$flush_delayed~0=~y$flush_delayed~0_In-2132424821, ~y~0=~y~0_In-2132424821} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-26 23:10:47,988 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1246] [1246] L730-2-->L730-5: Formula: (let ((.cse0 (= |P0Thread1of1ForFork0_#t~ite3_Out-1587705793| |P0Thread1of1ForFork0_#t~ite4_Out-1587705793|)) (.cse1 (= 0 (mod ~y$r_buff1_thd1~0_In-1587705793 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-1587705793 256) 0))) (or (and .cse0 (not .cse1) (not .cse2) (= |P0Thread1of1ForFork0_#t~ite3_Out-1587705793| ~y$w_buff1~0_In-1587705793)) (and .cse0 (or .cse1 .cse2) (= |P0Thread1of1ForFork0_#t~ite3_Out-1587705793| ~y~0_In-1587705793)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1587705793, ~y$w_buff1~0=~y$w_buff1~0_In-1587705793, ~y~0=~y~0_In-1587705793, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1587705793} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1587705793, P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out-1587705793|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out-1587705793|, ~y$w_buff1~0=~y$w_buff1~0_In-1587705793, ~y~0=~y~0_In-1587705793, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1587705793} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-26 23:10:47,989 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1248] [1248] L778-2-->L778-4: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-75244908 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-75244908 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite34_Out-75244908| ~y$w_buff0~0_In-75244908) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out-75244908| ~y$w_buff1~0_In-75244908)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-75244908, ~y$w_buff1~0=~y$w_buff1~0_In-75244908, ~y$w_buff0~0=~y$w_buff0~0_In-75244908, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-75244908} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-75244908, ~y$w_buff1~0=~y$w_buff1~0_In-75244908, ~y$w_buff0~0=~y$w_buff0~0_In-75244908, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-75244908, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-75244908|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-26 23:10:47,989 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1163] [1163] L778-4-->L779: Formula: (= v_~y~0_81 |v_P1Thread1of1ForFork1_#t~ite34_8|) InVars {P1Thread1of1ForFork1_#t~ite34=|v_P1Thread1of1ForFork1_#t~ite34_8|} OutVars{P1Thread1of1ForFork1_#t~ite34=|v_P1Thread1of1ForFork1_#t~ite34_7|, P1Thread1of1ForFork1_#t~ite35=|v_P1Thread1of1ForFork1_#t~ite35_7|, ~y~0=v_~y~0_81} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34, P1Thread1of1ForFork1_#t~ite35, ~y~0] because there is no mapped edge [2019-12-26 23:10:47,996 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1197] [1197] L783-->L784: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_143 256))) (= v_~y$r_buff0_thd2~0_220 v_~y$r_buff0_thd2~0_219)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_220, ~weak$$choice2~0=v_~weak$$choice2~0_143} OutVars{P1Thread1of1ForFork1_#t~ite50=|v_P1Thread1of1ForFork1_#t~ite50_11|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_219, ~weak$$choice2~0=v_~weak$$choice2~0_143, P1Thread1of1ForFork1_#t~ite49=|v_P1Thread1of1ForFork1_#t~ite49_11|, P1Thread1of1ForFork1_#t~ite48=|v_P1Thread1of1ForFork1_#t~ite48_8|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite50, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite49, P1Thread1of1ForFork1_#t~ite48] because there is no mapped edge [2019-12-26 23:10:47,997 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1232] [1232] L786-->L786-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In48533620 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite54_Out48533620| ~y~0_In48533620) .cse0) (and (= ~y$mem_tmp~0_In48533620 |P1Thread1of1ForFork1_#t~ite54_Out48533620|) (not .cse0)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In48533620, ~y$flush_delayed~0=~y$flush_delayed~0_In48533620, ~y~0=~y~0_In48533620} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In48533620, ~y$flush_delayed~0=~y$flush_delayed~0_In48533620, P1Thread1of1ForFork1_#t~ite54=|P1Thread1of1ForFork1_#t~ite54_Out48533620|, ~y~0=~y~0_In48533620} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite54] because there is no mapped edge [2019-12-26 23:10:48,001 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1219] [1219] L731-->L731-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In-1830967125 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1830967125 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out-1830967125| ~y$w_buff0_used~0_In-1830967125) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out-1830967125| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1830967125, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1830967125} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1830967125|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1830967125, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1830967125} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-26 23:10:48,002 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1214] [1214] L732-->L732-2: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd1~0_In-816651285 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-816651285 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-816651285 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd1~0_In-816651285 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out-816651285| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~y$w_buff1_used~0_In-816651285 |P0Thread1of1ForFork0_#t~ite6_Out-816651285|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-816651285, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-816651285, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-816651285, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-816651285} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-816651285|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-816651285, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-816651285, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-816651285, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-816651285} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-26 23:10:48,003 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1224] [1224] L733-->L733-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1700799942 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-1700799942 256)))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite7_Out-1700799942| 0)) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite7_Out-1700799942| ~y$r_buff0_thd1~0_In-1700799942)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1700799942, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1700799942} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1700799942, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1700799942|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1700799942} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-26 23:10:48,004 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1250] [1250] L734-->L734-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-2050393932 256))) (.cse1 (= (mod ~y$r_buff1_thd1~0_In-2050393932 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd1~0_In-2050393932 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-2050393932 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-2050393932|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd1~0_In-2050393932 |P0Thread1of1ForFork0_#t~ite8_Out-2050393932|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-2050393932, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2050393932, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2050393932, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2050393932} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-2050393932, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2050393932, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-2050393932|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2050393932, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2050393932} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-26 23:10:48,004 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1267] [1267] L734-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_38 1) v_~__unbuffered_cnt~0_37) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~y$r_buff1_thd1~0_56 |v_P0Thread1of1ForFork0_#t~ite8_32|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_56, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_31|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_37} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-26 23:10:48,004 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1247] [1247] L791-->L791-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-997457261 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-997457261 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-997457261 |P1Thread1of1ForFork1_#t~ite57_Out-997457261|)) (and (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite57_Out-997457261|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-997457261, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-997457261} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-997457261, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-997457261, P1Thread1of1ForFork1_#t~ite57=|P1Thread1of1ForFork1_#t~ite57_Out-997457261|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite57] because there is no mapped edge [2019-12-26 23:10:48,005 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1251] [1251] L792-->L792-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1303671737 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-1303671737 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In-1303671737 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1303671737 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite58_Out-1303671737|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork1_#t~ite58_Out-1303671737| ~y$w_buff1_used~0_In-1303671737) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1303671737, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1303671737, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1303671737, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1303671737} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1303671737, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1303671737, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1303671737, P1Thread1of1ForFork1_#t~ite58=|P1Thread1of1ForFork1_#t~ite58_Out-1303671737|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1303671737} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite58] because there is no mapped edge [2019-12-26 23:10:48,006 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1244] [1244] L793-->L794: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1399421198 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1399421198 256) 0))) (or (and (not .cse0) (= ~y$r_buff0_thd2~0_Out1399421198 0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd2~0_In1399421198 ~y$r_buff0_thd2~0_Out1399421198)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1399421198, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1399421198} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1399421198, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out1399421198, P1Thread1of1ForFork1_#t~ite59=|P1Thread1of1ForFork1_#t~ite59_Out1399421198|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite59] because there is no mapped edge [2019-12-26 23:10:48,006 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1242] [1242] L794-->L794-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd2~0_In1661246810 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In1661246810 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In1661246810 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In1661246810 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite60_Out1661246810|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~y$r_buff1_thd2~0_In1661246810 |P1Thread1of1ForFork1_#t~ite60_Out1661246810|) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1661246810, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1661246810, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1661246810, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1661246810} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1661246810, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1661246810, P1Thread1of1ForFork1_#t~ite60=|P1Thread1of1ForFork1_#t~ite60_Out1661246810|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1661246810, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1661246810} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite60] because there is no mapped edge [2019-12-26 23:10:48,007 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1280] [1280] L794-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_44 1) v_~__unbuffered_cnt~0_43) (= v_~y$r_buff1_thd2~0_339 |v_P1Thread1of1ForFork1_#t~ite60_32|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {P1Thread1of1ForFork1_#t~ite60=|v_P1Thread1of1ForFork1_#t~ite60_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_339, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, P1Thread1of1ForFork1_#t~ite60=|v_P1Thread1of1ForFork1_#t~ite60_31|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_#t~ite60, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-26 23:10:48,008 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1168] [1168] L819-->L821-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_8 256) 0)) (or (= (mod v_~y$w_buff0_used~0_258 256) 0) (= (mod v_~y$r_buff0_thd0~0_91 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_258, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_91, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_258, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_91, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-26 23:10:48,008 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1241] [1241] L821-2-->L821-4: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd0~0_In1263530540 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1263530540 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite63_Out1263530540| ~y~0_In1263530540)) (and (= |ULTIMATE.start_main_#t~ite63_Out1263530540| ~y$w_buff1~0_In1263530540) (not .cse0) (not .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1263530540, ~y~0=~y~0_In1263530540, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1263530540, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1263530540} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out1263530540|, ~y$w_buff1~0=~y$w_buff1~0_In1263530540, ~y~0=~y~0_In1263530540, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1263530540, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1263530540} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-26 23:10:48,008 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1184] [1184] L821-4-->L822: Formula: (= v_~y~0_114 |v_ULTIMATE.start_main_#t~ite63_12|) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_12|} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_11|, ~y~0=v_~y~0_114, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ~y~0, ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-26 23:10:48,008 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1240] [1240] L822-->L822-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1818102498 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1818102498 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite65_Out-1818102498| ~y$w_buff0_used~0_In-1818102498)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite65_Out-1818102498| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1818102498, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1818102498} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1818102498, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1818102498, ULTIMATE.start_main_#t~ite65=|ULTIMATE.start_main_#t~ite65_Out-1818102498|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite65] because there is no mapped edge [2019-12-26 23:10:48,009 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1215] [1215] L823-->L823-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-268992064 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-268992064 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-268992064 256))) (.cse2 (= (mod ~y$r_buff1_thd0~0_In-268992064 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-268992064 |ULTIMATE.start_main_#t~ite66_Out-268992064|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite66_Out-268992064| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-268992064, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-268992064, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-268992064, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-268992064} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-268992064, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-268992064, ULTIMATE.start_main_#t~ite66=|ULTIMATE.start_main_#t~ite66_Out-268992064|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-268992064, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-268992064} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite66] because there is no mapped edge [2019-12-26 23:10:48,010 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1229] [1229] L824-->L824-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1944810630 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1944810630 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite67_Out1944810630| ~y$r_buff0_thd0~0_In1944810630)) (and (= |ULTIMATE.start_main_#t~ite67_Out1944810630| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1944810630, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1944810630} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1944810630, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1944810630, ULTIMATE.start_main_#t~ite67=|ULTIMATE.start_main_#t~ite67_Out1944810630|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite67] because there is no mapped edge [2019-12-26 23:10:48,011 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1221] [1221] L825-->L825-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd0~0_In-383624767 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In-383624767 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-383624767 256))) (.cse1 (= (mod ~y$r_buff1_thd0~0_In-383624767 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite68_Out-383624767|)) (and (= |ULTIMATE.start_main_#t~ite68_Out-383624767| ~y$r_buff1_thd0~0_In-383624767) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-383624767, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-383624767, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-383624767, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-383624767} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-383624767, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-383624767, ULTIMATE.start_main_#t~ite68=|ULTIMATE.start_main_#t~ite68_Out-383624767|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-383624767, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-383624767} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite68] because there is no mapped edge [2019-12-26 23:10:48,024 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1222] [1222] L840-->L840-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In-1039838908 256)))) (or (and .cse0 (= |ULTIMATE.start_main_#t~ite91_Out-1039838908| ~y~0_In-1039838908)) (and (= ~y$mem_tmp~0_In-1039838908 |ULTIMATE.start_main_#t~ite91_Out-1039838908|) (not .cse0)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-1039838908, ~y$flush_delayed~0=~y$flush_delayed~0_In-1039838908, ~y~0=~y~0_In-1039838908} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-1039838908, ULTIMATE.start_main_#t~ite91=|ULTIMATE.start_main_#t~ite91_Out-1039838908|, ~y$flush_delayed~0=~y$flush_delayed~0_In-1039838908, ~y~0=~y~0_In-1039838908} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite91] because there is no mapped edge [2019-12-26 23:10:48,024 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1290] [1290] L840-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~y$flush_delayed~0_287 0) (= v_~y~0_301 |v_ULTIMATE.start_main_#t~ite91_55|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_26 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_22|) (= (mod v_~main$tmp_guard1~0_31 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_22|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_26 0)) InVars {ULTIMATE.start_main_#t~ite91=|v_ULTIMATE.start_main_#t~ite91_55|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_31} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_26, ULTIMATE.start_main_#t~ite91=|v_ULTIMATE.start_main_#t~ite91_54|, ~y$flush_delayed~0=v_~y$flush_delayed~0_287, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_31, ~y~0=v_~y~0_301, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_22|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite91, ~y$flush_delayed~0, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 23:10:48,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 11:10:48 BasicIcfg [2019-12-26 23:10:48,131 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 23:10:48,133 INFO L168 Benchmark]: Toolchain (without parser) took 41451.05 ms. Allocated memory was 144.2 MB in the beginning and 1.1 GB in the end (delta: 963.1 MB). Free memory was 98.8 MB in the beginning and 303.5 MB in the end (delta: -204.8 MB). Peak memory consumption was 758.3 MB. Max. memory is 7.1 GB. [2019-12-26 23:10:48,134 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 144.2 MB. Free memory is still 119.0 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-26 23:10:48,135 INFO L168 Benchmark]: CACSL2BoogieTranslator took 942.82 ms. Allocated memory was 144.2 MB in the beginning and 201.3 MB in the end (delta: 57.1 MB). Free memory was 98.8 MB in the beginning and 152.8 MB in the end (delta: -54.0 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. [2019-12-26 23:10:48,135 INFO L168 Benchmark]: Boogie Procedure Inliner took 93.44 ms. Allocated memory is still 201.3 MB. Free memory was 152.8 MB in the beginning and 148.8 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 7.1 GB. [2019-12-26 23:10:48,136 INFO L168 Benchmark]: Boogie Preprocessor took 71.67 ms. Allocated memory is still 201.3 MB. Free memory was 148.8 MB in the beginning and 145.9 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-26 23:10:48,137 INFO L168 Benchmark]: RCFGBuilder took 1219.27 ms. Allocated memory was 201.3 MB in the beginning and 232.8 MB in the end (delta: 31.5 MB). Free memory was 145.9 MB in the beginning and 193.3 MB in the end (delta: -47.5 MB). Peak memory consumption was 67.6 MB. Max. memory is 7.1 GB. [2019-12-26 23:10:48,139 INFO L168 Benchmark]: TraceAbstraction took 39116.54 ms. Allocated memory was 232.8 MB in the beginning and 1.1 GB in the end (delta: 874.5 MB). Free memory was 193.3 MB in the beginning and 303.5 MB in the end (delta: -110.2 MB). Peak memory consumption was 764.3 MB. Max. memory is 7.1 GB. [2019-12-26 23:10:48,146 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 144.2 MB. Free memory is still 119.0 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 942.82 ms. Allocated memory was 144.2 MB in the beginning and 201.3 MB in the end (delta: 57.1 MB). Free memory was 98.8 MB in the beginning and 152.8 MB in the end (delta: -54.0 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 93.44 ms. Allocated memory is still 201.3 MB. Free memory was 152.8 MB in the beginning and 148.8 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 71.67 ms. Allocated memory is still 201.3 MB. Free memory was 148.8 MB in the beginning and 145.9 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1219.27 ms. Allocated memory was 201.3 MB in the beginning and 232.8 MB in the end (delta: 31.5 MB). Free memory was 145.9 MB in the beginning and 193.3 MB in the end (delta: -47.5 MB). Peak memory consumption was 67.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 39116.54 ms. Allocated memory was 232.8 MB in the beginning and 1.1 GB in the end (delta: 874.5 MB). Free memory was 193.3 MB in the beginning and 303.5 MB in the end (delta: -110.2 MB). Peak memory consumption was 764.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 7.3s, 231 ProgramPointsBefore, 147 ProgramPointsAfterwards, 307 TransitionsBefore, 184 TransitionsAfterwards, 40114 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 34 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 76 ConcurrentYvCompositions, 42 ChoiceCompositions, 15276 VarBasedMoverChecksPositive, 410 VarBasedMoverChecksNegative, 97 SemBasedMoverChecksPositive, 446 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.5s, 0 MoverChecksTotal, 232725 CheckedPairsTotal, 139 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L813] FCALL, FORK 0 pthread_create(&t1597, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L815] FCALL, FORK 0 pthread_create(&t1598, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L724] 1 y = 2 [L727] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L730] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L744] 2 x = 2 [L747] 2 y$w_buff1 = y$w_buff0 [L748] 2 y$w_buff0 = 1 [L749] 2 y$w_buff1_used = y$w_buff0_used [L750] 2 y$w_buff0_used = (_Bool)1 [L762] 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L763] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L763] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L764] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L764] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L765] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L765] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L766] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L766] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L768] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L768] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L769] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L770] 2 y = y$flush_delayed ? y$mem_tmp : y [L771] 2 y$flush_delayed = (_Bool)0 [L774] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L775] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L776] 2 y$flush_delayed = weak$$choice2 [L777] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L778] 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L779] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L779] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L780] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L780] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L781] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L781] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L782] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L782] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L784] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L784] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L785] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L786] 2 y = y$flush_delayed ? y$mem_tmp : y [L787] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L790] 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) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L790] 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) [L730] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L731] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L732] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L733] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L791] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L792] 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 [L817] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L822] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L823] 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 [L824] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L825] 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 [L828] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L829] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L830] 0 y$flush_delayed = weak$$choice2 [L831] 0 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L832] 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) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L832] 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) [L833] 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)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L833] 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)) [L834] 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)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L834] 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)) [L835] 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)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L835] 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)) [L836] 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)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L836] 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)) [L837] 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)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L837] 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)) [L838] 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)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L838] 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)) [L839] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 225 locations, 2 error locations. Result: UNSAFE, OverallTime: 38.6s, OverallIterations: 22, TraceHistogramMax: 1, AutomataDifference: 17.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5771 SDtfs, 8564 SDslu, 23984 SDs, 0 SdLazy, 12422 SolverSat, 504 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 341 GetRequests, 51 SyntacticMatches, 35 SemanticMatches, 255 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1005 ImplicationChecksByTransitivity, 4.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50078occurred 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: 4.9s AutomataMinimizationTime, 21 MinimizatonAttempts, 14674 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 1586 NumberOfCodeBlocks, 1586 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1478 ConstructedInterpolants, 0 QuantifiedInterpolants, 589266 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, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...