/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/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi008_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 03:15:40,426 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 03:15:40,429 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 03:15:40,445 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 03:15:40,445 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 03:15:40,446 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 03:15:40,447 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 03:15:40,449 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 03:15:40,451 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 03:15:40,452 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 03:15:40,453 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 03:15:40,455 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 03:15:40,455 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 03:15:40,456 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 03:15:40,461 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 03:15:40,462 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 03:15:40,463 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 03:15:40,464 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 03:15:40,468 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 03:15:40,473 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 03:15:40,474 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 03:15:40,477 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 03:15:40,479 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 03:15:40,480 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 03:15:40,483 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 03:15:40,486 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 03:15:40,486 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 03:15:40,488 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 03:15:40,488 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 03:15:40,491 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 03:15:40,491 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 03:15:40,493 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 03:15:40,494 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 03:15:40,494 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 03:15:40,497 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 03:15:40,500 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 03:15:40,500 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 03:15:40,500 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 03:15:40,501 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 03:15:40,502 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 03:15:40,504 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 03:15:40,505 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-27 03:15:40,519 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 03:15:40,519 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 03:15:40,520 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 03:15:40,520 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 03:15:40,520 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 03:15:40,521 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 03:15:40,521 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 03:15:40,521 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 03:15:40,521 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 03:15:40,521 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 03:15:40,522 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 03:15:40,522 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 03:15:40,522 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 03:15:40,522 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 03:15:40,522 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 03:15:40,523 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 03:15:40,523 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 03:15:40,523 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 03:15:40,523 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 03:15:40,523 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 03:15:40,523 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 03:15:40,524 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 03:15:40,524 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 03:15:40,524 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 03:15:40,524 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 03:15:40,524 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 03:15:40,524 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 03:15:40,525 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 03:15:40,525 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 03:15:40,835 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 03:15:40,858 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 03:15:40,862 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 03:15:40,864 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 03:15:40,864 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 03:15:40,865 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi008_power.opt.i [2019-12-27 03:15:40,924 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba8c26763/af9bb065598840f8bd9be0e2ef1db667/FLAGe10749776 [2019-12-27 03:15:41,477 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 03:15:41,478 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi008_power.opt.i [2019-12-27 03:15:41,494 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba8c26763/af9bb065598840f8bd9be0e2ef1db667/FLAGe10749776 [2019-12-27 03:15:41,759 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba8c26763/af9bb065598840f8bd9be0e2ef1db667 [2019-12-27 03:15:41,768 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 03:15:41,770 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 03:15:41,771 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 03:15:41,772 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 03:15:41,775 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 03:15:41,776 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:15:41" (1/1) ... [2019-12-27 03:15:41,779 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@85f7a91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:15:41, skipping insertion in model container [2019-12-27 03:15:41,780 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:15:41" (1/1) ... [2019-12-27 03:15:41,787 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 03:15:41,847 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 03:15:42,368 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 03:15:42,387 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 03:15:42,456 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 03:15:42,537 INFO L208 MainTranslator]: Completed translation [2019-12-27 03:15:42,538 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:15:42 WrapperNode [2019-12-27 03:15:42,538 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 03:15:42,539 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 03:15:42,539 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 03:15:42,539 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 03:15:42,548 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:15:42" (1/1) ... [2019-12-27 03:15:42,568 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:15:42" (1/1) ... [2019-12-27 03:15:42,600 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 03:15:42,601 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 03:15:42,601 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 03:15:42,601 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 03:15:42,611 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:15:42" (1/1) ... [2019-12-27 03:15:42,611 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:15:42" (1/1) ... [2019-12-27 03:15:42,616 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:15:42" (1/1) ... [2019-12-27 03:15:42,617 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:15:42" (1/1) ... [2019-12-27 03:15:42,628 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:15:42" (1/1) ... [2019-12-27 03:15:42,632 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:15:42" (1/1) ... [2019-12-27 03:15:42,636 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:15:42" (1/1) ... [2019-12-27 03:15:42,642 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 03:15:42,643 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 03:15:42,643 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 03:15:42,643 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 03:15:42,644 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:15:42" (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-27 03:15:42,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 03:15:42,715 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 03:15:42,715 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 03:15:42,715 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 03:15:42,716 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 03:15:42,716 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 03:15:42,716 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 03:15:42,716 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 03:15:42,717 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 03:15:42,717 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 03:15:42,717 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 03:15:42,719 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 03:15:43,577 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 03:15:43,577 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 03:15:43,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:15:43 BoogieIcfgContainer [2019-12-27 03:15:43,579 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 03:15:43,580 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 03:15:43,580 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 03:15:43,584 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 03:15:43,584 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 03:15:41" (1/3) ... [2019-12-27 03:15:43,585 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@120a16d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:15:43, skipping insertion in model container [2019-12-27 03:15:43,585 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:15:42" (2/3) ... [2019-12-27 03:15:43,586 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@120a16d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:15:43, skipping insertion in model container [2019-12-27 03:15:43,586 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:15:43" (3/3) ... [2019-12-27 03:15:43,587 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi008_power.opt.i [2019-12-27 03:15:43,595 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 03:15:43,596 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 03:15:43,605 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 03:15:43,606 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 03:15:43,672 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,672 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,673 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,673 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,673 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,673 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,673 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,674 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,674 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,674 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,675 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,675 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,675 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,675 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,675 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,676 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,676 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,676 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,676 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,677 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,677 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,677 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,677 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,678 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,678 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,678 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,678 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,679 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,679 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,679 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,679 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,679 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,680 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,680 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,680 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,680 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,680 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,681 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,681 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,681 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,681 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,682 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,682 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,682 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,682 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,682 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,683 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,683 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,683 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,683 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,684 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,684 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,684 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,684 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,684 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,685 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,685 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,685 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,685 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,685 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,686 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,686 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,686 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,686 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,686 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,687 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,687 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,687 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,687 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,687 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,688 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,688 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,688 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,688 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,689 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,689 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,689 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,689 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,689 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,689 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,690 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,690 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,690 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,690 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,691 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,691 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,691 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,691 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,691 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,692 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,692 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,692 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,692 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,692 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,694 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,694 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,695 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,695 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,695 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,717 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,717 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,717 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,717 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,717 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,722 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,722 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,722 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,723 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,724 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,725 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,725 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,725 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,725 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,725 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,725 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,726 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,726 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,726 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,726 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,726 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,727 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,727 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,727 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,732 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,733 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,735 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:15:43,751 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 03:15:43,772 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 03:15:43,772 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 03:15:43,772 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 03:15:43,772 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 03:15:43,773 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 03:15:43,773 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 03:15:43,773 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 03:15:43,773 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 03:15:43,790 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 228 transitions [2019-12-27 03:15:43,792 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 228 transitions [2019-12-27 03:15:43,912 INFO L132 PetriNetUnfolder]: 56/226 cut-off events. [2019-12-27 03:15:43,912 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 03:15:43,935 INFO L76 FinitePrefix]: Finished finitePrefix Result has 233 conditions, 226 events. 56/226 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 551 event pairs. 0/168 useless extension candidates. Maximal degree in co-relation 195. Up to 2 conditions per place. [2019-12-27 03:15:43,967 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 228 transitions [2019-12-27 03:15:44,028 INFO L132 PetriNetUnfolder]: 56/226 cut-off events. [2019-12-27 03:15:44,029 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 03:15:44,040 INFO L76 FinitePrefix]: Finished finitePrefix Result has 233 conditions, 226 events. 56/226 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 551 event pairs. 0/168 useless extension candidates. Maximal degree in co-relation 195. Up to 2 conditions per place. [2019-12-27 03:15:44,068 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 22816 [2019-12-27 03:15:44,069 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 03:15:49,209 WARN L192 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-27 03:15:49,351 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-27 03:15:49,432 INFO L206 etLargeBlockEncoding]: Checked pairs total: 125257 [2019-12-27 03:15:49,433 INFO L214 etLargeBlockEncoding]: Total number of compositions: 114 [2019-12-27 03:15:49,436 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 105 places, 129 transitions [2019-12-27 03:15:50,918 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25272 states. [2019-12-27 03:15:50,920 INFO L276 IsEmpty]: Start isEmpty. Operand 25272 states. [2019-12-27 03:15:50,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 03:15:50,925 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:15:50,926 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 03:15:50,927 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:15:50,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:15:50,933 INFO L82 PathProgramCache]: Analyzing trace with hash 961433507, now seen corresponding path program 1 times [2019-12-27 03:15:50,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:15:50,940 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842368750] [2019-12-27 03:15:50,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:15:51,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:15:51,209 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-27 03:15:51,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842368750] [2019-12-27 03:15:51,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:15:51,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 03:15:51,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001472956] [2019-12-27 03:15:51,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:15:51,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:15:51,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:15:51,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:15:51,236 INFO L87 Difference]: Start difference. First operand 25272 states. Second operand 3 states. [2019-12-27 03:15:52,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:15:52,555 INFO L93 Difference]: Finished difference Result 25080 states and 89817 transitions. [2019-12-27 03:15:52,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:15:52,557 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 03:15:52,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:15:52,785 INFO L225 Difference]: With dead ends: 25080 [2019-12-27 03:15:52,785 INFO L226 Difference]: Without dead ends: 23470 [2019-12-27 03:15:52,786 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-27 03:15:53,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23470 states. [2019-12-27 03:15:53,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23470 to 23470. [2019-12-27 03:15:53,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23470 states. [2019-12-27 03:15:54,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23470 states to 23470 states and 83991 transitions. [2019-12-27 03:15:54,041 INFO L78 Accepts]: Start accepts. Automaton has 23470 states and 83991 transitions. Word has length 5 [2019-12-27 03:15:54,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:15:54,041 INFO L462 AbstractCegarLoop]: Abstraction has 23470 states and 83991 transitions. [2019-12-27 03:15:54,041 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:15:54,042 INFO L276 IsEmpty]: Start isEmpty. Operand 23470 states and 83991 transitions. [2019-12-27 03:15:54,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 03:15:54,045 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:15:54,045 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:15:54,046 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:15:54,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:15:54,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1303916439, now seen corresponding path program 1 times [2019-12-27 03:15:54,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:15:54,047 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904973925] [2019-12-27 03:15:54,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:15:54,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:15:54,190 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-27 03:15:54,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904973925] [2019-12-27 03:15:54,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:15:54,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:15:54,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620538691] [2019-12-27 03:15:54,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:15:54,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:15:54,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:15:54,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:15:54,194 INFO L87 Difference]: Start difference. First operand 23470 states and 83991 transitions. Second operand 4 states. [2019-12-27 03:15:55,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:15:55,730 INFO L93 Difference]: Finished difference Result 36446 states and 124910 transitions. [2019-12-27 03:15:55,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:15:55,731 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 03:15:55,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:15:55,906 INFO L225 Difference]: With dead ends: 36446 [2019-12-27 03:15:55,907 INFO L226 Difference]: Without dead ends: 36430 [2019-12-27 03:15:55,908 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-27 03:15:56,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36430 states. [2019-12-27 03:15:57,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36430 to 35607. [2019-12-27 03:15:57,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35607 states. [2019-12-27 03:15:57,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35607 states to 35607 states and 122732 transitions. [2019-12-27 03:15:57,401 INFO L78 Accepts]: Start accepts. Automaton has 35607 states and 122732 transitions. Word has length 11 [2019-12-27 03:15:57,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:15:57,402 INFO L462 AbstractCegarLoop]: Abstraction has 35607 states and 122732 transitions. [2019-12-27 03:15:57,402 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:15:57,402 INFO L276 IsEmpty]: Start isEmpty. Operand 35607 states and 122732 transitions. [2019-12-27 03:15:57,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 03:15:57,407 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:15:57,407 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:15:57,407 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:15:57,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:15:57,408 INFO L82 PathProgramCache]: Analyzing trace with hash -273660052, now seen corresponding path program 1 times [2019-12-27 03:15:57,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:15:57,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354691095] [2019-12-27 03:15:57,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:15:57,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:15:57,492 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-27 03:15:57,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354691095] [2019-12-27 03:15:57,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:15:57,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:15:57,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050411623] [2019-12-27 03:15:57,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:15:57,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:15:57,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:15:57,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:15:57,495 INFO L87 Difference]: Start difference. First operand 35607 states and 122732 transitions. Second operand 4 states. [2019-12-27 03:15:58,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:15:58,261 INFO L93 Difference]: Finished difference Result 46394 states and 157073 transitions. [2019-12-27 03:15:58,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:15:58,262 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 03:15:58,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:15:58,403 INFO L225 Difference]: With dead ends: 46394 [2019-12-27 03:15:58,403 INFO L226 Difference]: Without dead ends: 46379 [2019-12-27 03:15:58,403 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-27 03:15:58,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46379 states. [2019-12-27 03:15:59,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46379 to 41501. [2019-12-27 03:15:59,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41501 states. [2019-12-27 03:16:00,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41501 states to 41501 states and 142005 transitions. [2019-12-27 03:16:00,083 INFO L78 Accepts]: Start accepts. Automaton has 41501 states and 142005 transitions. Word has length 14 [2019-12-27 03:16:00,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:16:00,084 INFO L462 AbstractCegarLoop]: Abstraction has 41501 states and 142005 transitions. [2019-12-27 03:16:00,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:16:00,084 INFO L276 IsEmpty]: Start isEmpty. Operand 41501 states and 142005 transitions. [2019-12-27 03:16:00,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 03:16:00,088 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:16:00,088 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:16:00,088 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:16:00,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:16:00,089 INFO L82 PathProgramCache]: Analyzing trace with hash 106501689, now seen corresponding path program 1 times [2019-12-27 03:16:00,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:16:00,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733287316] [2019-12-27 03:16:00,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:16:00,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:16:00,128 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-27 03:16:00,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733287316] [2019-12-27 03:16:00,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:16:00,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:16:00,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963291604] [2019-12-27 03:16:00,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:16:00,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:16:00,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:16:00,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:16:00,130 INFO L87 Difference]: Start difference. First operand 41501 states and 142005 transitions. Second operand 3 states. [2019-12-27 03:16:01,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:16:01,904 INFO L93 Difference]: Finished difference Result 67890 states and 222025 transitions. [2019-12-27 03:16:01,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:16:01,904 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-27 03:16:01,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:16:02,069 INFO L225 Difference]: With dead ends: 67890 [2019-12-27 03:16:02,070 INFO L226 Difference]: Without dead ends: 67890 [2019-12-27 03:16:02,070 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-27 03:16:02,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67890 states. [2019-12-27 03:16:03,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67890 to 60518. [2019-12-27 03:16:03,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60518 states. [2019-12-27 03:16:03,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60518 states to 60518 states and 201033 transitions. [2019-12-27 03:16:03,627 INFO L78 Accepts]: Start accepts. Automaton has 60518 states and 201033 transitions. Word has length 15 [2019-12-27 03:16:03,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:16:03,627 INFO L462 AbstractCegarLoop]: Abstraction has 60518 states and 201033 transitions. [2019-12-27 03:16:03,627 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:16:03,627 INFO L276 IsEmpty]: Start isEmpty. Operand 60518 states and 201033 transitions. [2019-12-27 03:16:03,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 03:16:03,633 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:16:03,633 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:16:03,633 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:16:03,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:16:03,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1396090736, now seen corresponding path program 1 times [2019-12-27 03:16:03,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:16:03,634 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420540760] [2019-12-27 03:16:03,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:16:03,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:16:03,704 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-27 03:16:03,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420540760] [2019-12-27 03:16:03,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:16:03,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 03:16:03,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528608345] [2019-12-27 03:16:03,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:16:03,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:16:03,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:16:03,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:16:03,706 INFO L87 Difference]: Start difference. First operand 60518 states and 201033 transitions. Second operand 3 states. [2019-12-27 03:16:04,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:16:04,300 INFO L93 Difference]: Finished difference Result 57116 states and 189493 transitions. [2019-12-27 03:16:04,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:16:04,301 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 03:16:04,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:16:04,395 INFO L225 Difference]: With dead ends: 57116 [2019-12-27 03:16:04,395 INFO L226 Difference]: Without dead ends: 57116 [2019-12-27 03:16:04,396 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-27 03:16:04,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57116 states. [2019-12-27 03:16:05,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57116 to 57116. [2019-12-27 03:16:05,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57116 states. [2019-12-27 03:16:05,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57116 states to 57116 states and 189493 transitions. [2019-12-27 03:16:05,990 INFO L78 Accepts]: Start accepts. Automaton has 57116 states and 189493 transitions. Word has length 16 [2019-12-27 03:16:05,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:16:05,991 INFO L462 AbstractCegarLoop]: Abstraction has 57116 states and 189493 transitions. [2019-12-27 03:16:05,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:16:05,991 INFO L276 IsEmpty]: Start isEmpty. Operand 57116 states and 189493 transitions. [2019-12-27 03:16:05,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 03:16:05,998 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:16:05,998 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:16:05,999 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:16:05,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:16:05,999 INFO L82 PathProgramCache]: Analyzing trace with hash -717781961, now seen corresponding path program 1 times [2019-12-27 03:16:05,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:16:06,000 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957040420] [2019-12-27 03:16:06,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:16:06,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:16:06,045 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-27 03:16:06,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957040420] [2019-12-27 03:16:06,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:16:06,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:16:06,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971511589] [2019-12-27 03:16:06,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:16:06,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:16:06,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:16:06,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:16:06,047 INFO L87 Difference]: Start difference. First operand 57116 states and 189493 transitions. Second operand 4 states. [2019-12-27 03:16:06,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:16:06,564 INFO L93 Difference]: Finished difference Result 71016 states and 232026 transitions. [2019-12-27 03:16:06,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:16:06,565 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-27 03:16:06,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:16:06,684 INFO L225 Difference]: With dead ends: 71016 [2019-12-27 03:16:06,684 INFO L226 Difference]: Without dead ends: 70999 [2019-12-27 03:16:06,685 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-27 03:16:07,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70999 states. [2019-12-27 03:16:08,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70999 to 57888. [2019-12-27 03:16:08,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57888 states. [2019-12-27 03:16:08,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57888 states to 57888 states and 192018 transitions. [2019-12-27 03:16:08,488 INFO L78 Accepts]: Start accepts. Automaton has 57888 states and 192018 transitions. Word has length 17 [2019-12-27 03:16:08,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:16:08,488 INFO L462 AbstractCegarLoop]: Abstraction has 57888 states and 192018 transitions. [2019-12-27 03:16:08,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:16:08,489 INFO L276 IsEmpty]: Start isEmpty. Operand 57888 states and 192018 transitions. [2019-12-27 03:16:08,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-27 03:16:08,500 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:16:08,500 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] [2019-12-27 03:16:08,501 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:16:08,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:16:08,501 INFO L82 PathProgramCache]: Analyzing trace with hash 211035802, now seen corresponding path program 1 times [2019-12-27 03:16:08,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:16:08,501 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308798124] [2019-12-27 03:16:08,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:16:08,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:16:08,551 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-27 03:16:08,551 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308798124] [2019-12-27 03:16:08,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:16:08,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:16:08,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992999811] [2019-12-27 03:16:08,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:16:08,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:16:08,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:16:08,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:16:08,553 INFO L87 Difference]: Start difference. First operand 57888 states and 192018 transitions. Second operand 5 states. [2019-12-27 03:16:10,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:16:10,650 INFO L93 Difference]: Finished difference Result 81597 states and 263870 transitions. [2019-12-27 03:16:10,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 03:16:10,651 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-12-27 03:16:10,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:16:10,789 INFO L225 Difference]: With dead ends: 81597 [2019-12-27 03:16:10,790 INFO L226 Difference]: Without dead ends: 81583 [2019-12-27 03:16:10,790 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 03:16:11,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81583 states. [2019-12-27 03:16:12,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81583 to 63420. [2019-12-27 03:16:12,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63420 states. [2019-12-27 03:16:12,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63420 states to 63420 states and 209260 transitions. [2019-12-27 03:16:12,467 INFO L78 Accepts]: Start accepts. Automaton has 63420 states and 209260 transitions. Word has length 20 [2019-12-27 03:16:12,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:16:12,468 INFO L462 AbstractCegarLoop]: Abstraction has 63420 states and 209260 transitions. [2019-12-27 03:16:12,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:16:12,468 INFO L276 IsEmpty]: Start isEmpty. Operand 63420 states and 209260 transitions. [2019-12-27 03:16:12,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 03:16:12,485 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:16:12,485 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-27 03:16:12,485 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:16:12,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:16:12,486 INFO L82 PathProgramCache]: Analyzing trace with hash 432950251, now seen corresponding path program 1 times [2019-12-27 03:16:12,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:16:12,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496797104] [2019-12-27 03:16:12,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:16:12,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:16:12,546 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-27 03:16:12,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496797104] [2019-12-27 03:16:12,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:16:12,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:16:12,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597741493] [2019-12-27 03:16:12,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:16:12,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:16:12,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:16:12,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:16:12,548 INFO L87 Difference]: Start difference. First operand 63420 states and 209260 transitions. Second operand 5 states. [2019-12-27 03:16:13,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:16:13,308 INFO L93 Difference]: Finished difference Result 85051 states and 274689 transitions. [2019-12-27 03:16:13,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 03:16:13,308 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-12-27 03:16:13,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:16:13,454 INFO L225 Difference]: With dead ends: 85051 [2019-12-27 03:16:13,454 INFO L226 Difference]: Without dead ends: 85023 [2019-12-27 03:16:13,455 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 03:16:14,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85023 states. [2019-12-27 03:16:15,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85023 to 59018. [2019-12-27 03:16:15,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59018 states. [2019-12-27 03:16:15,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59018 states to 59018 states and 195208 transitions. [2019-12-27 03:16:15,543 INFO L78 Accepts]: Start accepts. Automaton has 59018 states and 195208 transitions. Word has length 23 [2019-12-27 03:16:15,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:16:15,543 INFO L462 AbstractCegarLoop]: Abstraction has 59018 states and 195208 transitions. [2019-12-27 03:16:15,543 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:16:15,544 INFO L276 IsEmpty]: Start isEmpty. Operand 59018 states and 195208 transitions. [2019-12-27 03:16:15,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 03:16:15,591 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:16:15,591 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] [2019-12-27 03:16:15,592 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:16:15,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:16:15,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1492209156, now seen corresponding path program 1 times [2019-12-27 03:16:15,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:16:15,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444302829] [2019-12-27 03:16:15,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:16:15,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:16:15,639 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-27 03:16:15,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444302829] [2019-12-27 03:16:15,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:16:15,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 03:16:15,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980422591] [2019-12-27 03:16:15,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:16:15,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:16:15,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:16:15,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:16:15,641 INFO L87 Difference]: Start difference. First operand 59018 states and 195208 transitions. Second operand 3 states. [2019-12-27 03:16:15,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:16:15,853 INFO L93 Difference]: Finished difference Result 58992 states and 195131 transitions. [2019-12-27 03:16:15,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:16:15,854 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-12-27 03:16:15,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:16:15,966 INFO L225 Difference]: With dead ends: 58992 [2019-12-27 03:16:15,966 INFO L226 Difference]: Without dead ends: 58992 [2019-12-27 03:16:15,967 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-27 03:16:16,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58992 states. [2019-12-27 03:16:17,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58992 to 58992. [2019-12-27 03:16:17,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58992 states. [2019-12-27 03:16:17,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58992 states to 58992 states and 195131 transitions. [2019-12-27 03:16:17,612 INFO L78 Accepts]: Start accepts. Automaton has 58992 states and 195131 transitions. Word has length 30 [2019-12-27 03:16:17,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:16:17,612 INFO L462 AbstractCegarLoop]: Abstraction has 58992 states and 195131 transitions. [2019-12-27 03:16:17,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:16:17,612 INFO L276 IsEmpty]: Start isEmpty. Operand 58992 states and 195131 transitions. [2019-12-27 03:16:17,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-27 03:16:17,662 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:16:17,663 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] [2019-12-27 03:16:17,663 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:16:17,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:16:17,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1740768700, now seen corresponding path program 1 times [2019-12-27 03:16:17,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:16:17,664 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56162120] [2019-12-27 03:16:17,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:16:17,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:16:17,739 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-27 03:16:17,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56162120] [2019-12-27 03:16:17,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:16:17,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:16:17,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730586674] [2019-12-27 03:16:17,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:16:17,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:16:17,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:16:17,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:16:17,742 INFO L87 Difference]: Start difference. First operand 58992 states and 195131 transitions. Second operand 4 states. [2019-12-27 03:16:17,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:16:17,810 INFO L93 Difference]: Finished difference Result 9876 states and 26540 transitions. [2019-12-27 03:16:17,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 03:16:17,811 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-12-27 03:16:17,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:16:17,821 INFO L225 Difference]: With dead ends: 9876 [2019-12-27 03:16:17,822 INFO L226 Difference]: Without dead ends: 6208 [2019-12-27 03:16:17,822 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-27 03:16:17,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6208 states. [2019-12-27 03:16:17,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6208 to 6208. [2019-12-27 03:16:17,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6208 states. [2019-12-27 03:16:17,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6208 states to 6208 states and 14467 transitions. [2019-12-27 03:16:17,950 INFO L78 Accepts]: Start accepts. Automaton has 6208 states and 14467 transitions. Word has length 31 [2019-12-27 03:16:17,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:16:17,951 INFO L462 AbstractCegarLoop]: Abstraction has 6208 states and 14467 transitions. [2019-12-27 03:16:17,951 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:16:17,951 INFO L276 IsEmpty]: Start isEmpty. Operand 6208 states and 14467 transitions. [2019-12-27 03:16:17,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 03:16:17,960 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:16:17,961 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] [2019-12-27 03:16:17,961 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:16:17,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:16:17,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1133319609, now seen corresponding path program 1 times [2019-12-27 03:16:17,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:16:17,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897107432] [2019-12-27 03:16:17,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:16:17,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:16:18,093 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-27 03:16:18,094 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897107432] [2019-12-27 03:16:18,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:16:18,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:16:18,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966133991] [2019-12-27 03:16:18,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:16:18,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:16:18,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:16:18,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:16:18,097 INFO L87 Difference]: Start difference. First operand 6208 states and 14467 transitions. Second operand 5 states. [2019-12-27 03:16:18,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:16:18,239 INFO L93 Difference]: Finished difference Result 9706 states and 22911 transitions. [2019-12-27 03:16:18,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 03:16:18,240 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-12-27 03:16:18,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:16:18,252 INFO L225 Difference]: With dead ends: 9706 [2019-12-27 03:16:18,252 INFO L226 Difference]: Without dead ends: 7701 [2019-12-27 03:16:18,252 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-27 03:16:18,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7701 states. [2019-12-27 03:16:18,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7701 to 7701. [2019-12-27 03:16:18,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7701 states. [2019-12-27 03:16:18,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7701 states to 7701 states and 18199 transitions. [2019-12-27 03:16:18,385 INFO L78 Accepts]: Start accepts. Automaton has 7701 states and 18199 transitions. Word has length 42 [2019-12-27 03:16:18,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:16:18,386 INFO L462 AbstractCegarLoop]: Abstraction has 7701 states and 18199 transitions. [2019-12-27 03:16:18,386 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:16:18,386 INFO L276 IsEmpty]: Start isEmpty. Operand 7701 states and 18199 transitions. [2019-12-27 03:16:18,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-27 03:16:18,397 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:16:18,397 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] [2019-12-27 03:16:18,397 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:16:18,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:16:18,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1536975682, now seen corresponding path program 1 times [2019-12-27 03:16:18,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:16:18,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759402960] [2019-12-27 03:16:18,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:16:18,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:16:18,559 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-27 03:16:18,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759402960] [2019-12-27 03:16:18,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:16:18,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:16:18,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494924485] [2019-12-27 03:16:18,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:16:18,561 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:16:18,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:16:18,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:16:18,561 INFO L87 Difference]: Start difference. First operand 7701 states and 18199 transitions. Second operand 4 states. [2019-12-27 03:16:18,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:16:18,601 INFO L93 Difference]: Finished difference Result 8720 states and 20532 transitions. [2019-12-27 03:16:18,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 03:16:18,602 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2019-12-27 03:16:18,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:16:18,613 INFO L225 Difference]: With dead ends: 8720 [2019-12-27 03:16:18,613 INFO L226 Difference]: Without dead ends: 6763 [2019-12-27 03:16:18,614 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-27 03:16:18,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6763 states. [2019-12-27 03:16:18,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6763 to 6743. [2019-12-27 03:16:18,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6743 states. [2019-12-27 03:16:18,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6743 states to 6743 states and 15959 transitions. [2019-12-27 03:16:18,729 INFO L78 Accepts]: Start accepts. Automaton has 6743 states and 15959 transitions. Word has length 43 [2019-12-27 03:16:18,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:16:18,729 INFO L462 AbstractCegarLoop]: Abstraction has 6743 states and 15959 transitions. [2019-12-27 03:16:18,729 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:16:18,729 INFO L276 IsEmpty]: Start isEmpty. Operand 6743 states and 15959 transitions. [2019-12-27 03:16:18,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-27 03:16:18,740 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:16:18,741 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] [2019-12-27 03:16:18,741 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:16:18,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:16:18,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1080490012, now seen corresponding path program 2 times [2019-12-27 03:16:18,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:16:18,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091261266] [2019-12-27 03:16:18,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:16:18,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:16:18,848 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-27 03:16:18,849 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091261266] [2019-12-27 03:16:18,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:16:18,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 03:16:18,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794452424] [2019-12-27 03:16:18,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:16:18,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:16:18,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:16:18,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:16:18,851 INFO L87 Difference]: Start difference. First operand 6743 states and 15959 transitions. Second operand 5 states. [2019-12-27 03:16:19,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:16:19,273 INFO L93 Difference]: Finished difference Result 7461 states and 17482 transitions. [2019-12-27 03:16:19,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 03:16:19,274 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-12-27 03:16:19,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:16:19,285 INFO L225 Difference]: With dead ends: 7461 [2019-12-27 03:16:19,285 INFO L226 Difference]: Without dead ends: 7461 [2019-12-27 03:16:19,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-27 03:16:19,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7461 states. [2019-12-27 03:16:19,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7461 to 7257. [2019-12-27 03:16:19,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7257 states. [2019-12-27 03:16:19,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7257 states to 7257 states and 17090 transitions. [2019-12-27 03:16:19,392 INFO L78 Accepts]: Start accepts. Automaton has 7257 states and 17090 transitions. Word has length 43 [2019-12-27 03:16:19,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:16:19,393 INFO L462 AbstractCegarLoop]: Abstraction has 7257 states and 17090 transitions. [2019-12-27 03:16:19,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:16:19,393 INFO L276 IsEmpty]: Start isEmpty. Operand 7257 states and 17090 transitions. [2019-12-27 03:16:19,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 03:16:19,399 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:16:19,399 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] [2019-12-27 03:16:19,400 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:16:19,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:16:19,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1389551641, now seen corresponding path program 1 times [2019-12-27 03:16:19,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:16:19,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224814729] [2019-12-27 03:16:19,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:16:19,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:16:19,476 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-27 03:16:19,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224814729] [2019-12-27 03:16:19,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:16:19,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 03:16:19,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408483993] [2019-12-27 03:16:19,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:16:19,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:16:19,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:16:19,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:16:19,478 INFO L87 Difference]: Start difference. First operand 7257 states and 17090 transitions. Second operand 5 states. [2019-12-27 03:16:19,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:16:19,538 INFO L93 Difference]: Finished difference Result 5236 states and 12328 transitions. [2019-12-27 03:16:19,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:16:19,539 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-12-27 03:16:19,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:16:19,540 INFO L225 Difference]: With dead ends: 5236 [2019-12-27 03:16:19,540 INFO L226 Difference]: Without dead ends: 878 [2019-12-27 03:16:19,541 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-27 03:16:19,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2019-12-27 03:16:19,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 836. [2019-12-27 03:16:19,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 836 states. [2019-12-27 03:16:19,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 836 states and 1778 transitions. [2019-12-27 03:16:19,553 INFO L78 Accepts]: Start accepts. Automaton has 836 states and 1778 transitions. Word has length 44 [2019-12-27 03:16:19,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:16:19,555 INFO L462 AbstractCegarLoop]: Abstraction has 836 states and 1778 transitions. [2019-12-27 03:16:19,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:16:19,556 INFO L276 IsEmpty]: Start isEmpty. Operand 836 states and 1778 transitions. [2019-12-27 03:16:19,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 03:16:19,557 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:16:19,557 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] [2019-12-27 03:16:19,557 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:16:19,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:16:19,558 INFO L82 PathProgramCache]: Analyzing trace with hash 684089224, now seen corresponding path program 1 times [2019-12-27 03:16:19,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:16:19,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770954608] [2019-12-27 03:16:19,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:16:19,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:16:19,679 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-27 03:16:19,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770954608] [2019-12-27 03:16:19,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:16:19,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 03:16:19,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311064330] [2019-12-27 03:16:19,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 03:16:19,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:16:19,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 03:16:19,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-27 03:16:19,682 INFO L87 Difference]: Start difference. First operand 836 states and 1778 transitions. Second operand 8 states. [2019-12-27 03:16:19,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:16:19,905 INFO L93 Difference]: Finished difference Result 1541 states and 3223 transitions. [2019-12-27 03:16:19,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 03:16:19,906 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 59 [2019-12-27 03:16:19,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:16:19,908 INFO L225 Difference]: With dead ends: 1541 [2019-12-27 03:16:19,908 INFO L226 Difference]: Without dead ends: 1087 [2019-12-27 03:16:19,909 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-12-27 03:16:19,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1087 states. [2019-12-27 03:16:19,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1087 to 898. [2019-12-27 03:16:19,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 898 states. [2019-12-27 03:16:19,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 898 states to 898 states and 1882 transitions. [2019-12-27 03:16:19,924 INFO L78 Accepts]: Start accepts. Automaton has 898 states and 1882 transitions. Word has length 59 [2019-12-27 03:16:19,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:16:19,924 INFO L462 AbstractCegarLoop]: Abstraction has 898 states and 1882 transitions. [2019-12-27 03:16:19,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 03:16:19,925 INFO L276 IsEmpty]: Start isEmpty. Operand 898 states and 1882 transitions. [2019-12-27 03:16:19,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 03:16:19,926 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:16:19,927 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] [2019-12-27 03:16:19,927 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:16:19,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:16:19,928 INFO L82 PathProgramCache]: Analyzing trace with hash -810960120, now seen corresponding path program 2 times [2019-12-27 03:16:19,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:16:19,928 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770852411] [2019-12-27 03:16:19,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:16:19,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:16:20,014 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-27 03:16:20,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770852411] [2019-12-27 03:16:20,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:16:20,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 03:16:20,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415914971] [2019-12-27 03:16:20,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 03:16:20,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:16:20,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 03:16:20,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:16:20,016 INFO L87 Difference]: Start difference. First operand 898 states and 1882 transitions. Second operand 6 states. [2019-12-27 03:16:20,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:16:20,417 INFO L93 Difference]: Finished difference Result 1024 states and 2111 transitions. [2019-12-27 03:16:20,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 03:16:20,417 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-12-27 03:16:20,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:16:20,419 INFO L225 Difference]: With dead ends: 1024 [2019-12-27 03:16:20,419 INFO L226 Difference]: Without dead ends: 1024 [2019-12-27 03:16:20,420 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 03:16:20,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1024 states. [2019-12-27 03:16:20,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1024 to 928. [2019-12-27 03:16:20,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 928 states. [2019-12-27 03:16:20,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 928 states to 928 states and 1937 transitions. [2019-12-27 03:16:20,428 INFO L78 Accepts]: Start accepts. Automaton has 928 states and 1937 transitions. Word has length 59 [2019-12-27 03:16:20,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:16:20,428 INFO L462 AbstractCegarLoop]: Abstraction has 928 states and 1937 transitions. [2019-12-27 03:16:20,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 03:16:20,428 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 1937 transitions. [2019-12-27 03:16:20,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 03:16:20,429 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:16:20,429 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] [2019-12-27 03:16:20,430 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:16:20,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:16:20,430 INFO L82 PathProgramCache]: Analyzing trace with hash 208890408, now seen corresponding path program 3 times [2019-12-27 03:16:20,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:16:20,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957559294] [2019-12-27 03:16:20,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:16:20,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:16:20,529 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-27 03:16:20,529 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957559294] [2019-12-27 03:16:20,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:16:20,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:16:20,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257499175] [2019-12-27 03:16:20,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:16:20,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:16:20,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:16:20,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:16:20,532 INFO L87 Difference]: Start difference. First operand 928 states and 1937 transitions. Second operand 3 states. [2019-12-27 03:16:20,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:16:20,544 INFO L93 Difference]: Finished difference Result 927 states and 1935 transitions. [2019-12-27 03:16:20,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:16:20,545 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-27 03:16:20,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:16:20,546 INFO L225 Difference]: With dead ends: 927 [2019-12-27 03:16:20,547 INFO L226 Difference]: Without dead ends: 927 [2019-12-27 03:16:20,547 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-27 03:16:20,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2019-12-27 03:16:20,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 791. [2019-12-27 03:16:20,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2019-12-27 03:16:20,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 1687 transitions. [2019-12-27 03:16:20,560 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 1687 transitions. Word has length 59 [2019-12-27 03:16:20,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:16:20,560 INFO L462 AbstractCegarLoop]: Abstraction has 791 states and 1687 transitions. [2019-12-27 03:16:20,560 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:16:20,561 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 1687 transitions. [2019-12-27 03:16:20,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 03:16:20,562 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:16:20,562 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] [2019-12-27 03:16:20,562 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:16:20,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:16:20,563 INFO L82 PathProgramCache]: Analyzing trace with hash 1155043701, now seen corresponding path program 1 times [2019-12-27 03:16:20,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:16:20,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18555446] [2019-12-27 03:16:20,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:16:20,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 03:16:20,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 03:16:20,755 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 03:16:20,755 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 03:16:20,759 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [982] [982] ULTIMATE.startENTRY-->L813: Formula: (let ((.cse0 (store |v_#valid_55| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= 0 |v_ULTIMATE.start_main_~#t1723~0.offset_20|) (= v_~y~0_249 0) (= 0 v_~y$w_buff0~0_205) (= v_~y$w_buff0_used~0_843 0) (= v_~y$w_buff1_used~0_439 0) (= 0 v_~weak$$choice0~0_156) (= (store .cse0 |v_ULTIMATE.start_main_~#t1723~0.base_28| 1) |v_#valid_53|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1723~0.base_28| 4)) (= v_~main$tmp_guard1~0_42 0) (= |v_#NULL.offset_6| 0) (= v_~main$tmp_guard0~0_27 0) (= 0 v_~__unbuffered_p0_EAX~0_77) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1723~0.base_28|) (= v_~__unbuffered_p0_EBX~0_51 0) (= v_~y$read_delayed~0_6 0) (= v_~weak$$choice2~0_238 0) (= v_~y$r_buff0_thd0~0_100 0) (< 0 |v_#StackHeapBarrier_14|) (= 0 |v_#NULL.base_6|) (= 0 v_~y$r_buff1_thd2~0_306) (= v_~x~0_52 0) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1723~0.base_28| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1723~0.base_28|) |v_ULTIMATE.start_main_~#t1723~0.offset_20| 0))) (= 0 v_~y$r_buff0_thd2~0_438) (= v_~y$r_buff1_thd1~0_261 0) (= 0 v_~__unbuffered_cnt~0_49) (= v_~__unbuffered_p1_EBX~0_47 0) (= 0 v_~__unbuffered_p1_EAX~0_65) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1723~0.base_28|)) (= v_~y$w_buff1~0_192 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~y$flush_delayed~0_191 0) (= v_~y$mem_tmp~0_167 0) (= v_~y$r_buff0_thd1~0_295 0) (= v_~y$r_buff1_thd0~0_204 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t1723~0.base=|v_ULTIMATE.start_main_~#t1723~0.base_28|, ULTIMATE.start_main_~#t1724~0.offset=|v_ULTIMATE.start_main_~#t1724~0.offset_14|, ~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_843, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_8|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_14|, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_42, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_261, ~y$mem_tmp~0=v_~y$mem_tmp~0_167, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_77, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_65, ~y$w_buff0~0=v_~y$w_buff0~0_205, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_295, ~y$flush_delayed~0=v_~y$flush_delayed~0_191, #length=|v_#length_15|, ~y~0=v_~y~0_249, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_47, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_51, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_132|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_103|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_147|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_27, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_85|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_306, ~weak$$choice0~0=v_~weak$$choice0~0_156, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_115|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_29|, ULTIMATE.start_main_~#t1723~0.offset=|v_ULTIMATE.start_main_~#t1723~0.offset_20|, ~y$w_buff1~0=v_~y$w_buff1~0_192, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_100, #valid=|v_#valid_53|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_438, #memory_int=|v_#memory_int_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49, ULTIMATE.start_main_~#t1724~0.base=|v_ULTIMATE.start_main_~#t1724~0.base_17|, ~weak$$choice2~0=v_~weak$$choice2~0_238, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_204, ~x~0=v_~x~0_52, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_439} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1723~0.base, ULTIMATE.start_main_~#t1724~0.offset, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet55, ULTIMATE.start_main_#t~nondet56, #NULL.offset, ~main$tmp_guard1~0, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite61, ULTIMATE.start_main_~#t1723~0.offset, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t1724~0.base, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 03:16:20,760 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [952] [952] L813-1-->L815: Formula: (and (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1724~0.base_13| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1724~0.base_13|) |v_ULTIMATE.start_main_~#t1724~0.offset_11| 1)) |v_#memory_int_9|) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t1724~0.base_13| 4) |v_#length_11|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1724~0.base_13|) (not (= |v_ULTIMATE.start_main_~#t1724~0.base_13| 0)) (= |v_#valid_25| (store |v_#valid_26| |v_ULTIMATE.start_main_~#t1724~0.base_13| 1)) (= 0 |v_ULTIMATE.start_main_~#t1724~0.offset_11|) (= (select |v_#valid_26| |v_ULTIMATE.start_main_~#t1724~0.base_13|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_10|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_~#t1724~0.offset=|v_ULTIMATE.start_main_~#t1724~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_6|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_9|, #length=|v_#length_11|, ULTIMATE.start_main_~#t1724~0.base=|v_ULTIMATE.start_main_~#t1724~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1724~0.offset, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1724~0.base] because there is no mapped edge [2019-12-27 03:16:20,761 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [862] [862] P1ENTRY-->L5-3: Formula: (and (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_8| 1) (= v_~y$w_buff0~0_39 v_~y$w_buff1~0_51) (= 1 v_~y$w_buff0~0_38) (= |v_P1Thread1of1ForFork1_#in~arg.offset_8| v_P1Thread1of1ForFork1_~arg.offset_8) (= v_~y$w_buff0_used~0_162 1) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_8| v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_10) (= (mod v_~y$w_buff1_used~0_84 256) 0) (= v_~y$w_buff1_used~0_84 v_~y$w_buff0_used~0_163) (= v_P1Thread1of1ForFork1_~arg.base_8 |v_P1Thread1of1ForFork1_#in~arg.base_8|)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_163, ~y$w_buff0~0=v_~y$w_buff0~0_39, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_8|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_8|} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_10, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_8, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_162, ~y$w_buff1~0=v_~y$w_buff1~0_51, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_8|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_8, ~y$w_buff0~0=v_~y$w_buff0~0_38, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_8|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_8|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_84} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, P1Thread1of1ForFork1_~arg.offset, ~y$w_buff0_used~0, ~y$w_buff1~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~y$w_buff0~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 03:16:20,763 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [914] [914] L775-2-->L775-4: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In958771584 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In958771584 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite28_Out958771584| ~y$w_buff0~0_In958771584) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite28_Out958771584| ~y$w_buff1~0_In958771584)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In958771584, ~y$w_buff1~0=~y$w_buff1~0_In958771584, ~y$w_buff0~0=~y$w_buff0~0_In958771584, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In958771584} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In958771584, ~y$w_buff1~0=~y$w_buff1~0_In958771584, ~y$w_buff0~0=~y$w_buff0~0_In958771584, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In958771584, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out958771584|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-27 03:16:20,763 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L775-4-->L776: Formula: (= v_~y~0_77 |v_P1Thread1of1ForFork1_#t~ite28_10|) InVars {P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_10|} OutVars{P1Thread1of1ForFork1_#t~ite29=|v_P1Thread1of1ForFork1_#t~ite29_13|, ~y~0=v_~y~0_77, P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_9|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, ~y~0, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-27 03:16:20,772 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L780-->L781: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_44 256))) (= v_~y$r_buff0_thd2~0_85 v_~y$r_buff0_thd2~0_84)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_85, ~weak$$choice2~0=v_~weak$$choice2~0_44} OutVars{P1Thread1of1ForFork1_#t~ite42=|v_P1Thread1of1ForFork1_#t~ite42_8|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_84, P1Thread1of1ForFork1_#t~ite44=|v_P1Thread1of1ForFork1_#t~ite44_11|, P1Thread1of1ForFork1_#t~ite43=|v_P1Thread1of1ForFork1_#t~ite43_11|, ~weak$$choice2~0=v_~weak$$choice2~0_44} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite42, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite44, P1Thread1of1ForFork1_#t~ite43] because there is no mapped edge [2019-12-27 03:16:20,775 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [915] [915] L783-->L783-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In1342235596 256) 0))) (or (and .cse0 (= ~y~0_In1342235596 |P1Thread1of1ForFork1_#t~ite48_Out1342235596|)) (and (= |P1Thread1of1ForFork1_#t~ite48_Out1342235596| ~y$mem_tmp~0_In1342235596) (not .cse0)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In1342235596, ~y$flush_delayed~0=~y$flush_delayed~0_In1342235596, ~y~0=~y~0_In1342235596} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In1342235596, ~y$flush_delayed~0=~y$flush_delayed~0_In1342235596, ~y~0=~y~0_In1342235596, P1Thread1of1ForFork1_#t~ite48=|P1Thread1of1ForFork1_#t~ite48_Out1342235596|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite48] because there is no mapped edge [2019-12-27 03:16:20,782 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [936] [936] L791-->L791-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1022594733 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In1022594733 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite51_Out1022594733| ~y$w_buff0_used~0_In1022594733)) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite51_Out1022594733| 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1022594733, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1022594733} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1022594733, P1Thread1of1ForFork1_#t~ite51=|P1Thread1of1ForFork1_#t~ite51_Out1022594733|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1022594733} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite51] because there is no mapped edge [2019-12-27 03:16:20,783 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [916] [916] L792-->L792-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In1659670341 256))) (.cse2 (= (mod ~y$r_buff0_thd2~0_In1659670341 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd2~0_In1659670341 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1659670341 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite52_Out1659670341|)) (and (or .cse3 .cse2) (= ~y$w_buff1_used~0_In1659670341 |P1Thread1of1ForFork1_#t~ite52_Out1659670341|) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1659670341, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1659670341, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1659670341, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1659670341} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1659670341, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1659670341, P1Thread1of1ForFork1_#t~ite52=|P1Thread1of1ForFork1_#t~ite52_Out1659670341|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1659670341, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1659670341} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite52] because there is no mapped edge [2019-12-27 03:16:20,785 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [932] [932] L793-->L794: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-95338916 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-95338916 256)))) (or (and (= ~y$r_buff0_thd2~0_Out-95338916 0) (not .cse0) (not .cse1)) (and (= ~y$r_buff0_thd2~0_Out-95338916 ~y$r_buff0_thd2~0_In-95338916) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-95338916, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-95338916} OutVars{P1Thread1of1ForFork1_#t~ite53=|P1Thread1of1ForFork1_#t~ite53_Out-95338916|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-95338916, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out-95338916} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite53, ~y$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 03:16:20,785 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [937] [937] L794-->L794-2: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd2~0_In-1390564265 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1390564265 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In-1390564265 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-1390564265 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite54_Out-1390564265| ~y$r_buff1_thd2~0_In-1390564265) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite54_Out-1390564265| 0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1390564265, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1390564265, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1390564265, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1390564265} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1390564265, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1390564265, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1390564265, P1Thread1of1ForFork1_#t~ite54=|P1Thread1of1ForFork1_#t~ite54_Out-1390564265|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1390564265} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite54] because there is no mapped edge [2019-12-27 03:16:20,786 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [941] [941] L794-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= v_~y$r_buff1_thd2~0_119 |v_P1Thread1of1ForFork1_#t~ite54_20|) (= v_~__unbuffered_cnt~0_20 (+ v_~__unbuffered_cnt~0_21 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_20|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_119, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_19|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite54, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 03:16:20,796 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [921] [921] L747-->L747-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In1011870519 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite25_Out1011870519| ~y$mem_tmp~0_In1011870519)) (and .cse0 (= ~y~0_In1011870519 |P0Thread1of1ForFork0_#t~ite25_Out1011870519|)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In1011870519, ~y$flush_delayed~0=~y$flush_delayed~0_In1011870519, ~y~0=~y~0_In1011870519} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In1011870519, P0Thread1of1ForFork0_#t~ite25=|P0Thread1of1ForFork0_#t~ite25_Out1011870519|, ~y$flush_delayed~0=~y$flush_delayed~0_In1011870519, ~y~0=~y~0_In1011870519} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25] because there is no mapped edge [2019-12-27 03:16:20,797 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [943] [943] L747-2-->P0EXIT: Formula: (and (= v_~y~0_124 |v_P0Thread1of1ForFork0_#t~ite25_20|) (= v_~__unbuffered_cnt~0_26 (+ v_~__unbuffered_cnt~0_27 1)) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= 0 v_~y$flush_delayed~0_78) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_20|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_19|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, ~y$flush_delayed~0=v_~y$flush_delayed~0_78, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_26, ~y~0=v_~y~0_124} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, P0Thread1of1ForFork0_#res.offset, ~y$flush_delayed~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~y~0] because there is no mapped edge [2019-12-27 03:16:20,798 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L819-->L821-2: Formula: (and (or (= 0 (mod v_~y$r_buff0_thd0~0_32 256)) (= 0 (mod v_~y$w_buff0_used~0_212 256))) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_212, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_32, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_212, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_32, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 03:16:20,798 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [917] [917] L821-2-->L821-4: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In481550916 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In481550916 256) 0))) (or (and (= ~y$w_buff1~0_In481550916 |ULTIMATE.start_main_#t~ite57_Out481550916|) (not .cse0) (not .cse1)) (and (= ~y~0_In481550916 |ULTIMATE.start_main_#t~ite57_Out481550916|) (or .cse1 .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In481550916, ~y~0=~y~0_In481550916, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In481550916, ~y$w_buff1_used~0=~y$w_buff1_used~0_In481550916} OutVars{~y$w_buff1~0=~y$w_buff1~0_In481550916, ULTIMATE.start_main_#t~ite57=|ULTIMATE.start_main_#t~ite57_Out481550916|, ~y~0=~y~0_In481550916, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In481550916, ~y$w_buff1_used~0=~y$w_buff1_used~0_In481550916} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite57] because there is no mapped edge [2019-12-27 03:16:20,798 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L821-4-->L822: Formula: (= v_~y~0_22 |v_ULTIMATE.start_main_#t~ite57_9|) InVars {ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_9|} OutVars{ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_10|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_8|, ~y~0=v_~y~0_22} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ~y~0] because there is no mapped edge [2019-12-27 03:16:20,799 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [926] [926] L822-->L822-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-1989256931 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-1989256931 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-1989256931 |ULTIMATE.start_main_#t~ite59_Out-1989256931|)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite59_Out-1989256931|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1989256931, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1989256931} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1989256931, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1989256931, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-1989256931|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-27 03:16:20,801 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [935] [935] L823-->L823-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In-1202943769 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In-1202943769 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-1202943769 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1202943769 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite60_Out-1202943769|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$w_buff1_used~0_In-1202943769 |ULTIMATE.start_main_#t~ite60_Out-1202943769|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1202943769, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1202943769, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1202943769, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1202943769} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out-1202943769|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1202943769, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1202943769, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1202943769, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1202943769} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-27 03:16:20,801 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [938] [938] L824-->L824-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In2146440360 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In2146440360 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite61_Out2146440360|) (not .cse1)) (and (= ~y$r_buff0_thd0~0_In2146440360 |ULTIMATE.start_main_#t~ite61_Out2146440360|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2146440360, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2146440360} OutVars{ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out2146440360|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2146440360, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2146440360} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-27 03:16:20,803 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [931] [931] L825-->L825-2: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd0~0_In-790250444 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-790250444 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In-790250444 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In-790250444 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd0~0_In-790250444 |ULTIMATE.start_main_#t~ite62_Out-790250444|) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite62_Out-790250444| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-790250444, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-790250444, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-790250444, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-790250444} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-790250444|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-790250444, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-790250444, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-790250444, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-790250444} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-27 03:16:20,803 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [969] [969] L825-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_20 0) (= v_~__unbuffered_p1_EBX~0_25 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= 1 v_~__unbuffered_p0_EAX~0_55) (= v_~y$r_buff1_thd0~0_175 |v_ULTIMATE.start_main_#t~ite62_45|) (= v_~__unbuffered_p0_EBX~0_29 0) (= 1 v_~__unbuffered_p1_EAX~0_36)) InVars {ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_45|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_55, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_29, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_25, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_36} OutVars{ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_44|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_55, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_29, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_25, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_36, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_175, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 03:16:20,906 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 03:16:20 BasicIcfg [2019-12-27 03:16:20,906 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 03:16:20,911 INFO L168 Benchmark]: Toolchain (without parser) took 39138.00 ms. Allocated memory was 139.5 MB in the beginning and 2.0 GB in the end (delta: 1.9 GB). Free memory was 102.1 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 853.5 MB. Max. memory is 7.1 GB. [2019-12-27 03:16:20,912 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 139.5 MB. Free memory was 122.7 MB in the beginning and 122.4 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-27 03:16:20,912 INFO L168 Benchmark]: CACSL2BoogieTranslator took 767.01 ms. Allocated memory was 139.5 MB in the beginning and 205.0 MB in the end (delta: 65.5 MB). Free memory was 101.9 MB in the beginning and 158.0 MB in the end (delta: -56.1 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. [2019-12-27 03:16:20,913 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.59 ms. Allocated memory is still 205.0 MB. Free memory was 158.0 MB in the beginning and 154.8 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. [2019-12-27 03:16:20,914 INFO L168 Benchmark]: Boogie Preprocessor took 41.77 ms. Allocated memory is still 205.0 MB. Free memory was 154.8 MB in the beginning and 152.8 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-27 03:16:20,916 INFO L168 Benchmark]: RCFGBuilder took 936.22 ms. Allocated memory is still 205.0 MB. Free memory was 152.2 MB in the beginning and 100.0 MB in the end (delta: 52.2 MB). Peak memory consumption was 52.2 MB. Max. memory is 7.1 GB. [2019-12-27 03:16:20,919 INFO L168 Benchmark]: TraceAbstraction took 37325.83 ms. Allocated memory was 205.0 MB in the beginning and 2.0 GB in the end (delta: 1.8 GB). Free memory was 99.3 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 785.2 MB. Max. memory is 7.1 GB. [2019-12-27 03:16:20,922 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.22 ms. Allocated memory is still 139.5 MB. Free memory was 122.7 MB in the beginning and 122.4 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 767.01 ms. Allocated memory was 139.5 MB in the beginning and 205.0 MB in the end (delta: 65.5 MB). Free memory was 101.9 MB in the beginning and 158.0 MB in the end (delta: -56.1 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 61.59 ms. Allocated memory is still 205.0 MB. Free memory was 158.0 MB in the beginning and 154.8 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.77 ms. Allocated memory is still 205.0 MB. Free memory was 154.8 MB in the beginning and 152.8 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 936.22 ms. Allocated memory is still 205.0 MB. Free memory was 152.2 MB in the beginning and 100.0 MB in the end (delta: 52.2 MB). Peak memory consumption was 52.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 37325.83 ms. Allocated memory was 205.0 MB in the beginning and 2.0 GB in the end (delta: 1.8 GB). Free memory was 99.3 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 785.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.6s, 179 ProgramPointsBefore, 105 ProgramPointsAfterwards, 228 TransitionsBefore, 129 TransitionsAfterwards, 22816 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 32 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 51 ConcurrentYvCompositions, 28 ChoiceCompositions, 9059 VarBasedMoverChecksPositive, 283 VarBasedMoverChecksNegative, 68 SemBasedMoverChecksPositive, 299 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 125257 CheckedPairsTotal, 114 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L813] FCALL, FORK 0 pthread_create(&t1723, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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(&t1724, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L765] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L766] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L767] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L768] 2 y$r_buff0_thd2 = (_Bool)1 [L771] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L772] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L773] 2 y$flush_delayed = weak$$choice2 [L774] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, 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] [L775] 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_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, 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] [L776] 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_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, 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] [L776] 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)) [L777] 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_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, 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] [L777] 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)) [L778] 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_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, 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 = 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)) [L779] 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_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, 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] [L779] 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)) [L781] 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_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, 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] [L781] 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)) [L782] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, 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] [L783] 2 y = y$flush_delayed ? y$mem_tmp : y [L784] 2 y$flush_delayed = (_Bool)0 [L787] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, 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=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] [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_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, 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=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] [L729] 1 x = 1 [L732] 1 __unbuffered_p0_EAX = x [L735] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L736] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L737] 1 y$flush_delayed = weak$$choice2 [L738] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, 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] [L739] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, 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] [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) [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 [L739] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L740] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, 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] [L740] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L741] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, 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] [L741] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L742] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, 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] [L742] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L743] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, 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] [L743] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L744] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=5, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, 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] [L744] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L745] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=5, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, 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] [L745] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L746] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, 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] [L817] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 173 locations, 2 error locations. Result: UNSAFE, OverallTime: 36.9s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 12.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3706 SDtfs, 3113 SDslu, 5771 SDs, 0 SdLazy, 2467 SolverSat, 127 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 92 GetRequests, 22 SyntacticMatches, 4 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=63420occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 15.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 71039 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 591 NumberOfCodeBlocks, 591 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 514 ConstructedInterpolants, 0 QuantifiedInterpolants, 58558 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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...