/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/rfi003_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 03:11:11,530 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 03:11:11,532 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 03:11:11,543 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 03:11:11,544 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 03:11:11,545 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 03:11:11,546 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 03:11:11,548 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 03:11:11,550 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 03:11:11,550 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 03:11:11,551 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 03:11:11,552 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 03:11:11,553 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 03:11:11,554 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 03:11:11,555 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 03:11:11,556 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 03:11:11,557 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 03:11:11,558 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 03:11:11,560 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 03:11:11,562 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 03:11:11,564 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 03:11:11,565 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 03:11:11,567 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 03:11:11,567 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 03:11:11,570 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 03:11:11,570 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 03:11:11,571 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 03:11:11,572 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 03:11:11,572 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 03:11:11,573 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 03:11:11,574 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 03:11:11,574 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 03:11:11,575 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 03:11:11,576 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 03:11:11,577 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 03:11:11,577 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 03:11:11,578 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 03:11:11,578 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 03:11:11,579 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 03:11:11,580 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 03:11:11,580 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 03:11:11,581 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:11:11,604 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 03:11:11,604 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 03:11:11,605 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 03:11:11,606 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 03:11:11,606 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 03:11:11,606 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 03:11:11,606 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 03:11:11,606 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 03:11:11,607 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 03:11:11,607 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 03:11:11,607 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 03:11:11,607 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 03:11:11,607 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 03:11:11,608 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 03:11:11,608 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 03:11:11,608 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 03:11:11,608 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 03:11:11,608 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 03:11:11,609 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 03:11:11,609 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 03:11:11,609 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 03:11:11,609 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 03:11:11,610 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 03:11:11,610 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 03:11:11,610 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 03:11:11,610 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 03:11:11,610 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 03:11:11,610 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 03:11:11,611 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 03:11:11,900 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 03:11:11,914 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 03:11:11,918 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 03:11:11,920 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 03:11:11,920 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 03:11:11,921 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi003_tso.opt.i [2019-12-27 03:11:11,991 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11260dcaf/c64cb91e7d184e2e8758cb7d718e5185/FLAG6198c1cb8 [2019-12-27 03:11:12,555 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 03:11:12,556 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi003_tso.opt.i [2019-12-27 03:11:12,576 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11260dcaf/c64cb91e7d184e2e8758cb7d718e5185/FLAG6198c1cb8 [2019-12-27 03:11:12,828 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11260dcaf/c64cb91e7d184e2e8758cb7d718e5185 [2019-12-27 03:11:12,837 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 03:11:12,839 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 03:11:12,843 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 03:11:12,843 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 03:11:12,848 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 03:11:12,849 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:11:12" (1/1) ... [2019-12-27 03:11:12,851 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fdaac8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:11:12, skipping insertion in model container [2019-12-27 03:11:12,852 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:11:12" (1/1) ... [2019-12-27 03:11:12,860 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 03:11:12,924 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 03:11:13,422 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 03:11:13,434 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 03:11:13,568 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 03:11:13,639 INFO L208 MainTranslator]: Completed translation [2019-12-27 03:11:13,639 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:11:13 WrapperNode [2019-12-27 03:11:13,640 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 03:11:13,641 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 03:11:13,641 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 03:11:13,641 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 03:11:13,652 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:11:13" (1/1) ... [2019-12-27 03:11:13,678 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:11:13" (1/1) ... [2019-12-27 03:11:13,731 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 03:11:13,731 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 03:11:13,732 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 03:11:13,732 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 03:11:13,740 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:11:13" (1/1) ... [2019-12-27 03:11:13,741 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:11:13" (1/1) ... [2019-12-27 03:11:13,746 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:11:13" (1/1) ... [2019-12-27 03:11:13,746 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:11:13" (1/1) ... [2019-12-27 03:11:13,760 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:11:13" (1/1) ... [2019-12-27 03:11:13,767 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:11:13" (1/1) ... [2019-12-27 03:11:13,771 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:11:13" (1/1) ... [2019-12-27 03:11:13,778 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 03:11:13,779 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 03:11:13,779 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 03:11:13,779 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 03:11:13,780 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:11:13" (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:11:13,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 03:11:13,883 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 03:11:13,883 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 03:11:13,884 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 03:11:13,884 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 03:11:13,885 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 03:11:13,886 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 03:11:13,887 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 03:11:13,888 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 03:11:13,888 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 03:11:13,891 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 03:11:13,894 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:11:15,096 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 03:11:15,096 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 03:11:15,098 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:11:15 BoogieIcfgContainer [2019-12-27 03:11:15,098 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 03:11:15,099 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 03:11:15,100 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 03:11:15,103 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 03:11:15,104 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 03:11:12" (1/3) ... [2019-12-27 03:11:15,105 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53b87b2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:11:15, skipping insertion in model container [2019-12-27 03:11:15,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:11:13" (2/3) ... [2019-12-27 03:11:15,106 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53b87b2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:11:15, skipping insertion in model container [2019-12-27 03:11:15,106 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:11:15" (3/3) ... [2019-12-27 03:11:15,108 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi003_tso.opt.i [2019-12-27 03:11:15,118 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 03:11:15,119 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 03:11:15,127 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 03:11:15,128 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 03:11:15,177 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,178 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,178 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,178 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,178 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,179 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,179 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,179 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,179 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,180 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,180 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,180 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,181 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,181 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,181 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,181 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,181 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,182 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,182 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,182 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,182 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,183 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,183 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,183 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,183 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,184 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,184 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,184 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,184 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,185 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,185 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,185 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,185 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,186 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,186 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,186 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,186 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,187 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,187 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,187 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,187 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,187 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,188 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,188 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,188 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,188 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,189 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,189 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,189 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,189 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,190 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,190 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,190 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,190 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,192 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,192 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,193 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,193 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,193 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,193 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,194 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,206 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,206 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,206 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,206 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,206 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,206 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,242 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,244 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,256 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,257 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,258 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:11:15,277 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 03:11:15,301 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 03:11:15,301 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 03:11:15,301 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 03:11:15,301 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 03:11:15,301 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 03:11:15,302 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 03:11:15,302 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 03:11:15,302 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 03:11:15,327 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 244 places, 326 transitions [2019-12-27 03:11:15,329 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 244 places, 326 transitions [2019-12-27 03:11:15,595 INFO L132 PetriNetUnfolder]: 89/324 cut-off events. [2019-12-27 03:11:15,596 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 03:11:15,641 INFO L76 FinitePrefix]: Finished finitePrefix Result has 331 conditions, 324 events. 89/324 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 796 event pairs. 0/233 useless extension candidates. Maximal degree in co-relation 294. Up to 2 conditions per place. [2019-12-27 03:11:15,727 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 244 places, 326 transitions [2019-12-27 03:11:15,878 INFO L132 PetriNetUnfolder]: 89/324 cut-off events. [2019-12-27 03:11:15,879 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 03:11:15,898 INFO L76 FinitePrefix]: Finished finitePrefix Result has 331 conditions, 324 events. 89/324 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 796 event pairs. 0/233 useless extension candidates. Maximal degree in co-relation 294. Up to 2 conditions per place. [2019-12-27 03:11:15,940 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 49222 [2019-12-27 03:11:15,942 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 03:11:22,635 WARN L192 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-27 03:11:22,750 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-27 03:11:22,881 INFO L206 etLargeBlockEncoding]: Checked pairs total: 282427 [2019-12-27 03:11:22,881 INFO L214 etLargeBlockEncoding]: Total number of compositions: 142 [2019-12-27 03:11:22,885 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 155 places, 192 transitions [2019-12-27 03:11:31,436 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 86906 states. [2019-12-27 03:11:31,438 INFO L276 IsEmpty]: Start isEmpty. Operand 86906 states. [2019-12-27 03:11:31,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 03:11:31,445 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:11:31,446 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 03:11:31,447 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:11:31,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:11:31,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1352240646, now seen corresponding path program 1 times [2019-12-27 03:11:31,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:11:31,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164350973] [2019-12-27 03:11:31,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:11:31,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:11:31,792 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:11:31,793 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164350973] [2019-12-27 03:11:31,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:11:31,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 03:11:31,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335988376] [2019-12-27 03:11:31,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:11:31,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:11:31,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:11:31,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:11:31,819 INFO L87 Difference]: Start difference. First operand 86906 states. Second operand 3 states. [2019-12-27 03:11:33,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:11:33,114 INFO L93 Difference]: Finished difference Result 86858 states and 312643 transitions. [2019-12-27 03:11:33,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:11:33,116 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 03:11:33,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:11:35,701 INFO L225 Difference]: With dead ends: 86858 [2019-12-27 03:11:35,701 INFO L226 Difference]: Without dead ends: 85058 [2019-12-27 03:11:35,702 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:11:38,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85058 states. [2019-12-27 03:11:40,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85058 to 85058. [2019-12-27 03:11:40,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85058 states. [2019-12-27 03:11:42,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85058 states to 85058 states and 306544 transitions. [2019-12-27 03:11:42,964 INFO L78 Accepts]: Start accepts. Automaton has 85058 states and 306544 transitions. Word has length 5 [2019-12-27 03:11:42,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:11:42,964 INFO L462 AbstractCegarLoop]: Abstraction has 85058 states and 306544 transitions. [2019-12-27 03:11:42,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:11:42,964 INFO L276 IsEmpty]: Start isEmpty. Operand 85058 states and 306544 transitions. [2019-12-27 03:11:42,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 03:11:42,967 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:11:42,967 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:11:42,967 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:11:42,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:11:42,968 INFO L82 PathProgramCache]: Analyzing trace with hash -2045261550, now seen corresponding path program 1 times [2019-12-27 03:11:42,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:11:42,968 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121642250] [2019-12-27 03:11:42,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:11:42,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:11:43,048 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:11:43,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121642250] [2019-12-27 03:11:43,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:11:43,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:11:43,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820882532] [2019-12-27 03:11:43,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:11:43,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:11:43,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:11:43,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:11:43,051 INFO L87 Difference]: Start difference. First operand 85058 states and 306544 transitions. Second operand 4 states. [2019-12-27 03:11:44,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:11:44,177 INFO L93 Difference]: Finished difference Result 127330 states and 444666 transitions. [2019-12-27 03:11:44,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:11:44,178 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 03:11:44,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:11:48,171 INFO L225 Difference]: With dead ends: 127330 [2019-12-27 03:11:48,171 INFO L226 Difference]: Without dead ends: 127330 [2019-12-27 03:11:48,174 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:11:51,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127330 states. [2019-12-27 03:11:53,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127330 to 126190. [2019-12-27 03:11:53,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126190 states. [2019-12-27 03:11:54,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126190 states to 126190 states and 441366 transitions. [2019-12-27 03:11:54,387 INFO L78 Accepts]: Start accepts. Automaton has 126190 states and 441366 transitions. Word has length 11 [2019-12-27 03:11:54,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:11:54,387 INFO L462 AbstractCegarLoop]: Abstraction has 126190 states and 441366 transitions. [2019-12-27 03:11:54,387 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:11:54,387 INFO L276 IsEmpty]: Start isEmpty. Operand 126190 states and 441366 transitions. [2019-12-27 03:11:54,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 03:11:54,390 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:11:54,391 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:11:54,391 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:11:54,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:11:54,391 INFO L82 PathProgramCache]: Analyzing trace with hash 216920818, now seen corresponding path program 1 times [2019-12-27 03:11:54,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:11:54,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812801153] [2019-12-27 03:11:54,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:11:54,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:11:54,432 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:11:54,433 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812801153] [2019-12-27 03:11:54,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:11:54,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:11:54,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557073357] [2019-12-27 03:11:54,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:11:54,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:11:54,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:11:54,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:11:54,435 INFO L87 Difference]: Start difference. First operand 126190 states and 441366 transitions. Second operand 3 states. [2019-12-27 03:11:54,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:11:54,478 INFO L93 Difference]: Finished difference Result 7755 states and 18817 transitions. [2019-12-27 03:11:54,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:11:54,479 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-27 03:11:54,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:11:54,493 INFO L225 Difference]: With dead ends: 7755 [2019-12-27 03:11:54,493 INFO L226 Difference]: Without dead ends: 7755 [2019-12-27 03:11:54,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:11:54,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7755 states. [2019-12-27 03:11:54,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7755 to 7715. [2019-12-27 03:11:54,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7715 states. [2019-12-27 03:11:54,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7715 states to 7715 states and 18737 transitions. [2019-12-27 03:11:54,648 INFO L78 Accepts]: Start accepts. Automaton has 7715 states and 18737 transitions. Word has length 11 [2019-12-27 03:11:54,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:11:54,649 INFO L462 AbstractCegarLoop]: Abstraction has 7715 states and 18737 transitions. [2019-12-27 03:11:54,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:11:54,650 INFO L276 IsEmpty]: Start isEmpty. Operand 7715 states and 18737 transitions. [2019-12-27 03:11:54,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 03:11:54,655 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:11:54,656 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] [2019-12-27 03:11:54,656 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:11:54,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:11:54,656 INFO L82 PathProgramCache]: Analyzing trace with hash -468341505, now seen corresponding path program 1 times [2019-12-27 03:11:54,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:11:54,657 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355698931] [2019-12-27 03:11:54,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:11:54,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:11:54,884 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:11:54,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355698931] [2019-12-27 03:11:54,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:11:54,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 03:11:54,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720976825] [2019-12-27 03:11:54,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 03:11:54,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:11:54,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 03:11:54,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:11:54,887 INFO L87 Difference]: Start difference. First operand 7715 states and 18737 transitions. Second operand 7 states. [2019-12-27 03:11:55,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:11:55,905 INFO L93 Difference]: Finished difference Result 9139 states and 21753 transitions. [2019-12-27 03:11:55,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 03:11:55,905 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-12-27 03:11:55,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:11:55,917 INFO L225 Difference]: With dead ends: 9139 [2019-12-27 03:11:55,917 INFO L226 Difference]: Without dead ends: 9139 [2019-12-27 03:11:55,917 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-27 03:11:55,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9139 states. [2019-12-27 03:11:56,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9139 to 8897. [2019-12-27 03:11:56,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8897 states. [2019-12-27 03:11:56,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8897 states to 8897 states and 21286 transitions. [2019-12-27 03:11:56,036 INFO L78 Accepts]: Start accepts. Automaton has 8897 states and 21286 transitions. Word has length 22 [2019-12-27 03:11:56,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:11:56,036 INFO L462 AbstractCegarLoop]: Abstraction has 8897 states and 21286 transitions. [2019-12-27 03:11:56,036 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 03:11:56,036 INFO L276 IsEmpty]: Start isEmpty. Operand 8897 states and 21286 transitions. [2019-12-27 03:11:56,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 03:11:56,040 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:11:56,041 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] [2019-12-27 03:11:56,041 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:11:56,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:11:56,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1753070628, now seen corresponding path program 1 times [2019-12-27 03:11:56,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:11:56,042 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618660088] [2019-12-27 03:11:56,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:11:56,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:11:56,109 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:11:56,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618660088] [2019-12-27 03:11:56,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:11:56,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:11:56,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780046461] [2019-12-27 03:11:56,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:11:56,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:11:56,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:11:56,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:11:56,112 INFO L87 Difference]: Start difference. First operand 8897 states and 21286 transitions. Second operand 4 states. [2019-12-27 03:11:56,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:11:56,135 INFO L93 Difference]: Finished difference Result 3410 states and 7630 transitions. [2019-12-27 03:11:56,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 03:11:56,135 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-12-27 03:11:56,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:11:56,139 INFO L225 Difference]: With dead ends: 3410 [2019-12-27 03:11:56,140 INFO L226 Difference]: Without dead ends: 3410 [2019-12-27 03:11:56,140 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:11:56,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3410 states. [2019-12-27 03:11:56,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3410 to 3334. [2019-12-27 03:11:56,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3334 states. [2019-12-27 03:11:56,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3334 states to 3334 states and 7489 transitions. [2019-12-27 03:11:56,181 INFO L78 Accepts]: Start accepts. Automaton has 3334 states and 7489 transitions. Word has length 34 [2019-12-27 03:11:56,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:11:56,182 INFO L462 AbstractCegarLoop]: Abstraction has 3334 states and 7489 transitions. [2019-12-27 03:11:56,182 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:11:56,182 INFO L276 IsEmpty]: Start isEmpty. Operand 3334 states and 7489 transitions. [2019-12-27 03:11:56,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-27 03:11:56,192 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:11:56,192 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:11:56,192 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:11:56,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:11:56,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1776556996, now seen corresponding path program 1 times [2019-12-27 03:11:56,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:11:56,193 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958094648] [2019-12-27 03:11:56,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:11:56,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:11:56,341 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:11:56,341 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958094648] [2019-12-27 03:11:56,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:11:56,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:11:56,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594664437] [2019-12-27 03:11:56,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:11:56,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:11:56,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:11:56,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:11:56,344 INFO L87 Difference]: Start difference. First operand 3334 states and 7489 transitions. Second operand 3 states. [2019-12-27 03:11:56,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:11:56,375 INFO L93 Difference]: Finished difference Result 3334 states and 7414 transitions. [2019-12-27 03:11:56,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:11:56,376 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2019-12-27 03:11:56,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:11:56,379 INFO L225 Difference]: With dead ends: 3334 [2019-12-27 03:11:56,380 INFO L226 Difference]: Without dead ends: 3334 [2019-12-27 03:11:56,380 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:11:56,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3334 states. [2019-12-27 03:11:56,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3334 to 3334. [2019-12-27 03:11:56,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3334 states. [2019-12-27 03:11:56,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3334 states to 3334 states and 7414 transitions. [2019-12-27 03:11:56,424 INFO L78 Accepts]: Start accepts. Automaton has 3334 states and 7414 transitions. Word has length 93 [2019-12-27 03:11:56,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:11:56,425 INFO L462 AbstractCegarLoop]: Abstraction has 3334 states and 7414 transitions. [2019-12-27 03:11:56,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:11:56,425 INFO L276 IsEmpty]: Start isEmpty. Operand 3334 states and 7414 transitions. [2019-12-27 03:11:56,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-27 03:11:56,431 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:11:56,432 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:11:56,432 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:11:56,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:11:56,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1261390719, now seen corresponding path program 1 times [2019-12-27 03:11:56,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:11:56,433 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428231830] [2019-12-27 03:11:56,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:11:56,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:11:56,606 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:11:56,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428231830] [2019-12-27 03:11:56,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:11:56,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 03:11:56,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634699281] [2019-12-27 03:11:56,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 03:11:56,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:11:56,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 03:11:56,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:11:56,608 INFO L87 Difference]: Start difference. First operand 3334 states and 7414 transitions. Second operand 7 states. [2019-12-27 03:11:57,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:11:57,781 INFO L93 Difference]: Finished difference Result 4159 states and 9153 transitions. [2019-12-27 03:11:57,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 03:11:57,781 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-12-27 03:11:57,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:11:57,785 INFO L225 Difference]: With dead ends: 4159 [2019-12-27 03:11:57,785 INFO L226 Difference]: Without dead ends: 4159 [2019-12-27 03:11:57,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-12-27 03:11:57,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4159 states. [2019-12-27 03:11:57,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4159 to 3820. [2019-12-27 03:11:57,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3820 states. [2019-12-27 03:11:57,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3820 states to 3820 states and 8475 transitions. [2019-12-27 03:11:57,838 INFO L78 Accepts]: Start accepts. Automaton has 3820 states and 8475 transitions. Word has length 94 [2019-12-27 03:11:57,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:11:57,839 INFO L462 AbstractCegarLoop]: Abstraction has 3820 states and 8475 transitions. [2019-12-27 03:11:57,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 03:11:57,839 INFO L276 IsEmpty]: Start isEmpty. Operand 3820 states and 8475 transitions. [2019-12-27 03:11:57,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-27 03:11:57,846 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:11:57,847 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:11:57,847 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:11:57,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:11:57,847 INFO L82 PathProgramCache]: Analyzing trace with hash 870783717, now seen corresponding path program 2 times [2019-12-27 03:11:57,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:11:57,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305121838] [2019-12-27 03:11:57,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:11:57,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:11:58,003 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:11:58,004 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305121838] [2019-12-27 03:11:58,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:11:58,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 03:11:58,004 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426570218] [2019-12-27 03:11:58,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 03:11:58,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:11:58,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 03:11:58,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:11:58,006 INFO L87 Difference]: Start difference. First operand 3820 states and 8475 transitions. Second operand 6 states. [2019-12-27 03:11:58,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:11:58,861 INFO L93 Difference]: Finished difference Result 4363 states and 9567 transitions. [2019-12-27 03:11:58,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 03:11:58,861 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-12-27 03:11:58,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:11:58,867 INFO L225 Difference]: With dead ends: 4363 [2019-12-27 03:11:58,867 INFO L226 Difference]: Without dead ends: 4363 [2019-12-27 03:11:58,868 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 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:11:58,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4363 states. [2019-12-27 03:11:58,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4363 to 3979. [2019-12-27 03:11:58,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3979 states. [2019-12-27 03:11:58,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3979 states to 3979 states and 8803 transitions. [2019-12-27 03:11:58,908 INFO L78 Accepts]: Start accepts. Automaton has 3979 states and 8803 transitions. Word has length 94 [2019-12-27 03:11:58,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:11:58,908 INFO L462 AbstractCegarLoop]: Abstraction has 3979 states and 8803 transitions. [2019-12-27 03:11:58,908 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 03:11:58,908 INFO L276 IsEmpty]: Start isEmpty. Operand 3979 states and 8803 transitions. [2019-12-27 03:11:58,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-27 03:11:58,915 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:11:58,916 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:11:58,916 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:11:58,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:11:58,916 INFO L82 PathProgramCache]: Analyzing trace with hash -75332823, now seen corresponding path program 3 times [2019-12-27 03:11:58,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:11:58,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614525799] [2019-12-27 03:11:58,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:11:58,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:11:59,057 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:11:59,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614525799] [2019-12-27 03:11:59,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:11:59,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 03:11:59,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370793142] [2019-12-27 03:11:59,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:11:59,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:11:59,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:11:59,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:11:59,063 INFO L87 Difference]: Start difference. First operand 3979 states and 8803 transitions. Second operand 5 states. [2019-12-27 03:11:59,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:11:59,422 INFO L93 Difference]: Finished difference Result 4255 states and 9319 transitions. [2019-12-27 03:11:59,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 03:11:59,423 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-12-27 03:11:59,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:11:59,429 INFO L225 Difference]: With dead ends: 4255 [2019-12-27 03:11:59,429 INFO L226 Difference]: Without dead ends: 4255 [2019-12-27 03:11:59,429 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:11:59,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4255 states. [2019-12-27 03:11:59,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4255 to 4094. [2019-12-27 03:11:59,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4094 states. [2019-12-27 03:11:59,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4094 states to 4094 states and 9029 transitions. [2019-12-27 03:11:59,468 INFO L78 Accepts]: Start accepts. Automaton has 4094 states and 9029 transitions. Word has length 94 [2019-12-27 03:11:59,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:11:59,469 INFO L462 AbstractCegarLoop]: Abstraction has 4094 states and 9029 transitions. [2019-12-27 03:11:59,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:11:59,469 INFO L276 IsEmpty]: Start isEmpty. Operand 4094 states and 9029 transitions. [2019-12-27 03:11:59,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-27 03:11:59,474 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:11:59,475 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:11:59,475 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:11:59,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:11:59,475 INFO L82 PathProgramCache]: Analyzing trace with hash -391108213, now seen corresponding path program 4 times [2019-12-27 03:11:59,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:11:59,476 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591008490] [2019-12-27 03:11:59,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:11:59,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:11:59,730 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:11:59,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591008490] [2019-12-27 03:11:59,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:11:59,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 03:11:59,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158593334] [2019-12-27 03:11:59,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 03:11:59,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:11:59,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 03:11:59,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-27 03:11:59,733 INFO L87 Difference]: Start difference. First operand 4094 states and 9029 transitions. Second operand 10 states. [2019-12-27 03:12:01,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:12:01,417 INFO L93 Difference]: Finished difference Result 5871 states and 12861 transitions. [2019-12-27 03:12:01,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 03:12:01,417 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 94 [2019-12-27 03:12:01,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:12:01,424 INFO L225 Difference]: With dead ends: 5871 [2019-12-27 03:12:01,424 INFO L226 Difference]: Without dead ends: 5871 [2019-12-27 03:12:01,425 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-12-27 03:12:01,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5871 states. [2019-12-27 03:12:01,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5871 to 4315. [2019-12-27 03:12:01,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4315 states. [2019-12-27 03:12:01,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4315 states to 4315 states and 9576 transitions. [2019-12-27 03:12:01,471 INFO L78 Accepts]: Start accepts. Automaton has 4315 states and 9576 transitions. Word has length 94 [2019-12-27 03:12:01,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:12:01,471 INFO L462 AbstractCegarLoop]: Abstraction has 4315 states and 9576 transitions. [2019-12-27 03:12:01,471 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 03:12:01,472 INFO L276 IsEmpty]: Start isEmpty. Operand 4315 states and 9576 transitions. [2019-12-27 03:12:01,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-27 03:12:01,477 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:12:01,477 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:12:01,477 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:12:01,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:12:01,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1966199233, now seen corresponding path program 5 times [2019-12-27 03:12:01,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:12:01,478 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487835381] [2019-12-27 03:12:01,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:12:01,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:12:01,603 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:12:01,603 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487835381] [2019-12-27 03:12:01,603 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:12:01,604 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 03:12:01,604 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989500300] [2019-12-27 03:12:01,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 03:12:01,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:12:01,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 03:12:01,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:12:01,605 INFO L87 Difference]: Start difference. First operand 4315 states and 9576 transitions. Second operand 7 states. [2019-12-27 03:12:02,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:12:02,853 INFO L93 Difference]: Finished difference Result 6261 states and 13702 transitions. [2019-12-27 03:12:02,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 03:12:02,854 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-12-27 03:12:02,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:12:02,864 INFO L225 Difference]: With dead ends: 6261 [2019-12-27 03:12:02,864 INFO L226 Difference]: Without dead ends: 6261 [2019-12-27 03:12:02,864 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-12-27 03:12:02,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6261 states. [2019-12-27 03:12:02,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6261 to 4450. [2019-12-27 03:12:02,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4450 states. [2019-12-27 03:12:02,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4450 states to 4450 states and 9903 transitions. [2019-12-27 03:12:02,975 INFO L78 Accepts]: Start accepts. Automaton has 4450 states and 9903 transitions. Word has length 94 [2019-12-27 03:12:02,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:12:02,976 INFO L462 AbstractCegarLoop]: Abstraction has 4450 states and 9903 transitions. [2019-12-27 03:12:02,976 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 03:12:02,976 INFO L276 IsEmpty]: Start isEmpty. Operand 4450 states and 9903 transitions. [2019-12-27 03:12:02,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-27 03:12:02,988 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:12:02,988 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:12:02,988 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:12:02,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:12:02,989 INFO L82 PathProgramCache]: Analyzing trace with hash -518893889, now seen corresponding path program 6 times [2019-12-27 03:12:02,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:12:02,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773576870] [2019-12-27 03:12:02,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:12:03,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:12:03,206 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:12:03,206 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773576870] [2019-12-27 03:12:03,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:12:03,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 03:12:03,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117215587] [2019-12-27 03:12:03,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 03:12:03,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:12:03,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 03:12:03,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:12:03,209 INFO L87 Difference]: Start difference. First operand 4450 states and 9903 transitions. Second operand 7 states. [2019-12-27 03:12:04,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:12:04,377 INFO L93 Difference]: Finished difference Result 6356 states and 14013 transitions. [2019-12-27 03:12:04,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 03:12:04,377 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-12-27 03:12:04,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:12:04,385 INFO L225 Difference]: With dead ends: 6356 [2019-12-27 03:12:04,385 INFO L226 Difference]: Without dead ends: 6356 [2019-12-27 03:12:04,386 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-27 03:12:04,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6356 states. [2019-12-27 03:12:04,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6356 to 4421. [2019-12-27 03:12:04,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4421 states. [2019-12-27 03:12:04,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4421 states to 4421 states and 9845 transitions. [2019-12-27 03:12:04,438 INFO L78 Accepts]: Start accepts. Automaton has 4421 states and 9845 transitions. Word has length 94 [2019-12-27 03:12:04,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:12:04,438 INFO L462 AbstractCegarLoop]: Abstraction has 4421 states and 9845 transitions. [2019-12-27 03:12:04,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 03:12:04,439 INFO L276 IsEmpty]: Start isEmpty. Operand 4421 states and 9845 transitions. [2019-12-27 03:12:04,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-27 03:12:04,445 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:12:04,445 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:12:04,445 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:12:04,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:12:04,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1405936377, now seen corresponding path program 7 times [2019-12-27 03:12:04,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:12:04,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530948722] [2019-12-27 03:12:04,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:12:04,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:12:04,597 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:12:04,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530948722] [2019-12-27 03:12:04,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:12:04,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 03:12:04,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606333083] [2019-12-27 03:12:04,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 03:12:04,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:12:04,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 03:12:04,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-12-27 03:12:04,600 INFO L87 Difference]: Start difference. First operand 4421 states and 9845 transitions. Second operand 9 states. [2019-12-27 03:12:04,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:12:04,879 INFO L93 Difference]: Finished difference Result 6342 states and 13984 transitions. [2019-12-27 03:12:04,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 03:12:04,879 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 94 [2019-12-27 03:12:04,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:12:04,887 INFO L225 Difference]: With dead ends: 6342 [2019-12-27 03:12:04,887 INFO L226 Difference]: Without dead ends: 6313 [2019-12-27 03:12:04,888 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2019-12-27 03:12:04,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6313 states. [2019-12-27 03:12:04,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6313 to 6048. [2019-12-27 03:12:04,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6048 states. [2019-12-27 03:12:04,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6048 states to 6048 states and 13455 transitions. [2019-12-27 03:12:04,949 INFO L78 Accepts]: Start accepts. Automaton has 6048 states and 13455 transitions. Word has length 94 [2019-12-27 03:12:04,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:12:04,949 INFO L462 AbstractCegarLoop]: Abstraction has 6048 states and 13455 transitions. [2019-12-27 03:12:04,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 03:12:04,949 INFO L276 IsEmpty]: Start isEmpty. Operand 6048 states and 13455 transitions. [2019-12-27 03:12:04,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 03:12:04,957 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:12:04,957 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:12:04,957 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:12:04,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:12:04,958 INFO L82 PathProgramCache]: Analyzing trace with hash -808451493, now seen corresponding path program 1 times [2019-12-27 03:12:04,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:12:04,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819960611] [2019-12-27 03:12:04,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:12:04,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:12:05,349 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:12:05,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819960611] [2019-12-27 03:12:05,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:12:05,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-27 03:12:05,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717250149] [2019-12-27 03:12:05,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 03:12:05,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:12:05,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 03:12:05,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2019-12-27 03:12:05,351 INFO L87 Difference]: Start difference. First operand 6048 states and 13455 transitions. Second operand 20 states. [2019-12-27 03:12:07,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:12:07,722 INFO L93 Difference]: Finished difference Result 11544 states and 25717 transitions. [2019-12-27 03:12:07,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 03:12:07,723 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 95 [2019-12-27 03:12:07,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:12:07,734 INFO L225 Difference]: With dead ends: 11544 [2019-12-27 03:12:07,734 INFO L226 Difference]: Without dead ends: 11515 [2019-12-27 03:12:07,735 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=131, Invalid=925, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 03:12:07,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11515 states. [2019-12-27 03:12:07,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11515 to 7762. [2019-12-27 03:12:07,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7762 states. [2019-12-27 03:12:07,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7762 states to 7762 states and 17462 transitions. [2019-12-27 03:12:07,833 INFO L78 Accepts]: Start accepts. Automaton has 7762 states and 17462 transitions. Word has length 95 [2019-12-27 03:12:07,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:12:07,833 INFO L462 AbstractCegarLoop]: Abstraction has 7762 states and 17462 transitions. [2019-12-27 03:12:07,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 03:12:07,833 INFO L276 IsEmpty]: Start isEmpty. Operand 7762 states and 17462 transitions. [2019-12-27 03:12:07,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 03:12:07,842 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:12:07,843 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:12:07,843 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:12:07,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:12:07,843 INFO L82 PathProgramCache]: Analyzing trace with hash 880851843, now seen corresponding path program 2 times [2019-12-27 03:12:07,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:12:07,844 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447184218] [2019-12-27 03:12:07,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:12:07,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:12:07,939 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:12:07,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447184218] [2019-12-27 03:12:07,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:12:07,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 03:12:07,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663177750] [2019-12-27 03:12:07,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:12:07,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:12:07,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:12:07,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:12:07,941 INFO L87 Difference]: Start difference. First operand 7762 states and 17462 transitions. Second operand 5 states. [2019-12-27 03:12:08,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:12:08,351 INFO L93 Difference]: Finished difference Result 11535 states and 25909 transitions. [2019-12-27 03:12:08,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 03:12:08,351 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-12-27 03:12:08,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:12:08,364 INFO L225 Difference]: With dead ends: 11535 [2019-12-27 03:12:08,364 INFO L226 Difference]: Without dead ends: 11535 [2019-12-27 03:12:08,364 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:12:08,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11535 states. [2019-12-27 03:12:08,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11535 to 9585. [2019-12-27 03:12:08,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9585 states. [2019-12-27 03:12:08,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9585 states to 9585 states and 21405 transitions. [2019-12-27 03:12:08,476 INFO L78 Accepts]: Start accepts. Automaton has 9585 states and 21405 transitions. Word has length 95 [2019-12-27 03:12:08,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:12:08,476 INFO L462 AbstractCegarLoop]: Abstraction has 9585 states and 21405 transitions. [2019-12-27 03:12:08,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:12:08,476 INFO L276 IsEmpty]: Start isEmpty. Operand 9585 states and 21405 transitions. [2019-12-27 03:12:08,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 03:12:08,489 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:12:08,489 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:12:08,489 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:12:08,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:12:08,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1714824989, now seen corresponding path program 3 times [2019-12-27 03:12:08,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:12:08,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822276003] [2019-12-27 03:12:08,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:12:08,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:12:08,574 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:12:08,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822276003] [2019-12-27 03:12:08,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:12:08,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 03:12:08,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402234497] [2019-12-27 03:12:08,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:12:08,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:12:08,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:12:08,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:12:08,576 INFO L87 Difference]: Start difference. First operand 9585 states and 21405 transitions. Second operand 4 states. [2019-12-27 03:12:08,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:12:08,910 INFO L93 Difference]: Finished difference Result 17204 states and 38346 transitions. [2019-12-27 03:12:08,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 03:12:08,910 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-12-27 03:12:08,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:12:08,929 INFO L225 Difference]: With dead ends: 17204 [2019-12-27 03:12:08,929 INFO L226 Difference]: Without dead ends: 17204 [2019-12-27 03:12:08,929 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:12:08,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17204 states. [2019-12-27 03:12:09,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17204 to 13030. [2019-12-27 03:12:09,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13030 states. [2019-12-27 03:12:09,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13030 states to 13030 states and 29396 transitions. [2019-12-27 03:12:09,082 INFO L78 Accepts]: Start accepts. Automaton has 13030 states and 29396 transitions. Word has length 95 [2019-12-27 03:12:09,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:12:09,083 INFO L462 AbstractCegarLoop]: Abstraction has 13030 states and 29396 transitions. [2019-12-27 03:12:09,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:12:09,083 INFO L276 IsEmpty]: Start isEmpty. Operand 13030 states and 29396 transitions. [2019-12-27 03:12:09,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 03:12:09,099 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:12:09,099 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:12:09,100 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:12:09,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:12:09,100 INFO L82 PathProgramCache]: Analyzing trace with hash 900755581, now seen corresponding path program 4 times [2019-12-27 03:12:09,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:12:09,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723280076] [2019-12-27 03:12:09,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:12:09,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:12:09,189 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:12:09,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723280076] [2019-12-27 03:12:09,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:12:09,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 03:12:09,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842092724] [2019-12-27 03:12:09,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:12:09,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:12:09,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:12:09,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:12:09,191 INFO L87 Difference]: Start difference. First operand 13030 states and 29396 transitions. Second operand 4 states. [2019-12-27 03:12:09,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:12:09,457 INFO L93 Difference]: Finished difference Result 18477 states and 40955 transitions. [2019-12-27 03:12:09,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 03:12:09,457 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-12-27 03:12:09,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:12:09,474 INFO L225 Difference]: With dead ends: 18477 [2019-12-27 03:12:09,474 INFO L226 Difference]: Without dead ends: 18477 [2019-12-27 03:12:09,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:12:09,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18477 states. [2019-12-27 03:12:09,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18477 to 14187. [2019-12-27 03:12:09,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14187 states. [2019-12-27 03:12:09,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14187 states to 14187 states and 31905 transitions. [2019-12-27 03:12:09,642 INFO L78 Accepts]: Start accepts. Automaton has 14187 states and 31905 transitions. Word has length 95 [2019-12-27 03:12:09,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:12:09,642 INFO L462 AbstractCegarLoop]: Abstraction has 14187 states and 31905 transitions. [2019-12-27 03:12:09,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:12:09,642 INFO L276 IsEmpty]: Start isEmpty. Operand 14187 states and 31905 transitions. [2019-12-27 03:12:09,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 03:12:09,654 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:12:09,655 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:12:09,655 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:12:09,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:12:09,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1454974861, now seen corresponding path program 5 times [2019-12-27 03:12:09,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:12:09,655 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25638235] [2019-12-27 03:12:09,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:12:09,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:12:09,859 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:12:09,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25638235] [2019-12-27 03:12:09,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:12:09,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 03:12:09,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059346499] [2019-12-27 03:12:09,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 03:12:09,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:12:09,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 03:12:09,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-27 03:12:09,864 INFO L87 Difference]: Start difference. First operand 14187 states and 31905 transitions. Second operand 10 states. [2019-12-27 03:12:10,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:12:10,366 INFO L93 Difference]: Finished difference Result 23698 states and 53084 transitions. [2019-12-27 03:12:10,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 03:12:10,366 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 95 [2019-12-27 03:12:10,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:12:10,384 INFO L225 Difference]: With dead ends: 23698 [2019-12-27 03:12:10,384 INFO L226 Difference]: Without dead ends: 16117 [2019-12-27 03:12:10,384 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-12-27 03:12:10,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16117 states. [2019-12-27 03:12:10,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16117 to 14838. [2019-12-27 03:12:10,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14838 states. [2019-12-27 03:12:10,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14838 states to 14838 states and 33353 transitions. [2019-12-27 03:12:10,541 INFO L78 Accepts]: Start accepts. Automaton has 14838 states and 33353 transitions. Word has length 95 [2019-12-27 03:12:10,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:12:10,542 INFO L462 AbstractCegarLoop]: Abstraction has 14838 states and 33353 transitions. [2019-12-27 03:12:10,542 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 03:12:10,542 INFO L276 IsEmpty]: Start isEmpty. Operand 14838 states and 33353 transitions. [2019-12-27 03:12:10,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 03:12:10,555 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:12:10,555 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:12:10,555 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:12:10,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:12:10,556 INFO L82 PathProgramCache]: Analyzing trace with hash 24784493, now seen corresponding path program 6 times [2019-12-27 03:12:10,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:12:10,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3351067] [2019-12-27 03:12:10,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:12:10,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:12:10,738 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:12:10,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3351067] [2019-12-27 03:12:10,739 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:12:10,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 03:12:10,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93468019] [2019-12-27 03:12:10,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 03:12:10,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:12:10,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 03:12:10,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 03:12:10,740 INFO L87 Difference]: Start difference. First operand 14838 states and 33353 transitions. Second operand 8 states. [2019-12-27 03:12:11,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:12:11,888 INFO L93 Difference]: Finished difference Result 22137 states and 50134 transitions. [2019-12-27 03:12:11,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 03:12:11,889 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 95 [2019-12-27 03:12:11,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:12:11,913 INFO L225 Difference]: With dead ends: 22137 [2019-12-27 03:12:11,913 INFO L226 Difference]: Without dead ends: 22137 [2019-12-27 03:12:11,913 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2019-12-27 03:12:11,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22137 states. [2019-12-27 03:12:12,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22137 to 14800. [2019-12-27 03:12:12,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14800 states. [2019-12-27 03:12:12,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14800 states to 14800 states and 33268 transitions. [2019-12-27 03:12:12,108 INFO L78 Accepts]: Start accepts. Automaton has 14800 states and 33268 transitions. Word has length 95 [2019-12-27 03:12:12,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:12:12,109 INFO L462 AbstractCegarLoop]: Abstraction has 14800 states and 33268 transitions. [2019-12-27 03:12:12,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 03:12:12,109 INFO L276 IsEmpty]: Start isEmpty. Operand 14800 states and 33268 transitions. [2019-12-27 03:12:12,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 03:12:12,127 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:12:12,128 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:12:12,128 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:12:12,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:12:12,128 INFO L82 PathProgramCache]: Analyzing trace with hash -175048893, now seen corresponding path program 7 times [2019-12-27 03:12:12,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:12:12,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346098384] [2019-12-27 03:12:12,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:12:12,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:12:12,272 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:12:12,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346098384] [2019-12-27 03:12:12,273 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:12:12,273 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 03:12:12,273 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228269765] [2019-12-27 03:12:12,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 03:12:12,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:12:12,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 03:12:12,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:12:12,275 INFO L87 Difference]: Start difference. First operand 14800 states and 33268 transitions. Second operand 6 states. [2019-12-27 03:12:12,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:12:12,504 INFO L93 Difference]: Finished difference Result 20560 states and 45952 transitions. [2019-12-27 03:12:12,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 03:12:12,505 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-12-27 03:12:12,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:12:12,513 INFO L225 Difference]: With dead ends: 20560 [2019-12-27 03:12:12,514 INFO L226 Difference]: Without dead ends: 5756 [2019-12-27 03:12:12,514 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-12-27 03:12:12,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5756 states. [2019-12-27 03:12:12,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5756 to 5542. [2019-12-27 03:12:12,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5542 states. [2019-12-27 03:12:12,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5542 states to 5542 states and 12258 transitions. [2019-12-27 03:12:12,607 INFO L78 Accepts]: Start accepts. Automaton has 5542 states and 12258 transitions. Word has length 95 [2019-12-27 03:12:12,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:12:12,608 INFO L462 AbstractCegarLoop]: Abstraction has 5542 states and 12258 transitions. [2019-12-27 03:12:12,608 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 03:12:12,608 INFO L276 IsEmpty]: Start isEmpty. Operand 5542 states and 12258 transitions. [2019-12-27 03:12:12,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 03:12:12,617 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:12:12,618 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:12:12,618 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:12:12,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:12:12,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1693003594, now seen corresponding path program 1 times [2019-12-27 03:12:12,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:12:12,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012544076] [2019-12-27 03:12:12,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:12:12,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:12:12,965 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:12:12,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012544076] [2019-12-27 03:12:12,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:12:12,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 03:12:12,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618736245] [2019-12-27 03:12:12,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 03:12:12,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:12:12,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 03:12:12,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2019-12-27 03:12:12,969 INFO L87 Difference]: Start difference. First operand 5542 states and 12258 transitions. Second operand 15 states. [2019-12-27 03:12:13,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:12:13,973 INFO L93 Difference]: Finished difference Result 9620 states and 21069 transitions. [2019-12-27 03:12:13,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 03:12:13,979 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 96 [2019-12-27 03:12:13,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:12:13,989 INFO L225 Difference]: With dead ends: 9620 [2019-12-27 03:12:13,990 INFO L226 Difference]: Without dead ends: 9591 [2019-12-27 03:12:13,990 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=96, Invalid=606, Unknown=0, NotChecked=0, Total=702 [2019-12-27 03:12:14,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9591 states. [2019-12-27 03:12:14,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9591 to 8284. [2019-12-27 03:12:14,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8284 states. [2019-12-27 03:12:14,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8284 states to 8284 states and 18503 transitions. [2019-12-27 03:12:14,082 INFO L78 Accepts]: Start accepts. Automaton has 8284 states and 18503 transitions. Word has length 96 [2019-12-27 03:12:14,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:12:14,083 INFO L462 AbstractCegarLoop]: Abstraction has 8284 states and 18503 transitions. [2019-12-27 03:12:14,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 03:12:14,083 INFO L276 IsEmpty]: Start isEmpty. Operand 8284 states and 18503 transitions. [2019-12-27 03:12:14,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 03:12:14,094 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:12:14,094 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:12:14,094 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:12:14,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:12:14,095 INFO L82 PathProgramCache]: Analyzing trace with hash -998934237, now seen corresponding path program 1 times [2019-12-27 03:12:14,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:12:14,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874483827] [2019-12-27 03:12:14,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:12:14,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:12:14,179 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:12:14,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874483827] [2019-12-27 03:12:14,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:12:14,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 03:12:14,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020306941] [2019-12-27 03:12:14,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:12:14,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:12:14,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:12:14,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:12:14,181 INFO L87 Difference]: Start difference. First operand 8284 states and 18503 transitions. Second operand 5 states. [2019-12-27 03:12:14,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:12:14,526 INFO L93 Difference]: Finished difference Result 8312 states and 18533 transitions. [2019-12-27 03:12:14,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:12:14,526 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2019-12-27 03:12:14,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:12:14,540 INFO L225 Difference]: With dead ends: 8312 [2019-12-27 03:12:14,540 INFO L226 Difference]: Without dead ends: 8302 [2019-12-27 03:12:14,541 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 3 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:12:14,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8302 states. [2019-12-27 03:12:14,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8302 to 7856. [2019-12-27 03:12:14,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7856 states. [2019-12-27 03:12:14,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7856 states to 7856 states and 17612 transitions. [2019-12-27 03:12:14,701 INFO L78 Accepts]: Start accepts. Automaton has 7856 states and 17612 transitions. Word has length 96 [2019-12-27 03:12:14,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:12:14,701 INFO L462 AbstractCegarLoop]: Abstraction has 7856 states and 17612 transitions. [2019-12-27 03:12:14,702 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:12:14,702 INFO L276 IsEmpty]: Start isEmpty. Operand 7856 states and 17612 transitions. [2019-12-27 03:12:14,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 03:12:14,715 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:12:14,715 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:12:14,715 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:12:14,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:12:14,715 INFO L82 PathProgramCache]: Analyzing trace with hash 46562021, now seen corresponding path program 1 times [2019-12-27 03:12:14,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:12:14,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664607592] [2019-12-27 03:12:14,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:12:14,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:12:15,308 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:12:15,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664607592] [2019-12-27 03:12:15,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:12:15,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-12-27 03:12:15,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146632632] [2019-12-27 03:12:15,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-27 03:12:15,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:12:15,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-27 03:12:15,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2019-12-27 03:12:15,310 INFO L87 Difference]: Start difference. First operand 7856 states and 17612 transitions. Second operand 23 states. [2019-12-27 03:12:17,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:12:17,097 INFO L93 Difference]: Finished difference Result 10503 states and 23196 transitions. [2019-12-27 03:12:17,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 03:12:17,097 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 96 [2019-12-27 03:12:17,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:12:17,110 INFO L225 Difference]: With dead ends: 10503 [2019-12-27 03:12:17,110 INFO L226 Difference]: Without dead ends: 10474 [2019-12-27 03:12:17,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=170, Invalid=1236, Unknown=0, NotChecked=0, Total=1406 [2019-12-27 03:12:17,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10474 states. [2019-12-27 03:12:17,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10474 to 8888. [2019-12-27 03:12:17,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8888 states. [2019-12-27 03:12:17,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8888 states to 8888 states and 19887 transitions. [2019-12-27 03:12:17,209 INFO L78 Accepts]: Start accepts. Automaton has 8888 states and 19887 transitions. Word has length 96 [2019-12-27 03:12:17,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:12:17,209 INFO L462 AbstractCegarLoop]: Abstraction has 8888 states and 19887 transitions. [2019-12-27 03:12:17,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-27 03:12:17,209 INFO L276 IsEmpty]: Start isEmpty. Operand 8888 states and 19887 transitions. [2019-12-27 03:12:17,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 03:12:17,217 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:12:17,217 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:12:17,217 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:12:17,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:12:17,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1127270605, now seen corresponding path program 2 times [2019-12-27 03:12:17,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:12:17,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645975838] [2019-12-27 03:12:17,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:12:17,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:12:17,622 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:12:17,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645975838] [2019-12-27 03:12:17,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:12:17,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-27 03:12:17,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887026466] [2019-12-27 03:12:17,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 03:12:17,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:12:17,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 03:12:17,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2019-12-27 03:12:17,625 INFO L87 Difference]: Start difference. First operand 8888 states and 19887 transitions. Second operand 17 states. [2019-12-27 03:12:19,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:12:19,346 INFO L93 Difference]: Finished difference Result 17626 states and 39366 transitions. [2019-12-27 03:12:19,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 03:12:19,346 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 96 [2019-12-27 03:12:19,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:12:19,364 INFO L225 Difference]: With dead ends: 17626 [2019-12-27 03:12:19,364 INFO L226 Difference]: Without dead ends: 17597 [2019-12-27 03:12:19,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=111, Invalid=645, Unknown=0, NotChecked=0, Total=756 [2019-12-27 03:12:19,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17597 states. [2019-12-27 03:12:19,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17597 to 11565. [2019-12-27 03:12:19,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11565 states. [2019-12-27 03:12:19,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11565 states to 11565 states and 26106 transitions. [2019-12-27 03:12:19,513 INFO L78 Accepts]: Start accepts. Automaton has 11565 states and 26106 transitions. Word has length 96 [2019-12-27 03:12:19,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:12:19,514 INFO L462 AbstractCegarLoop]: Abstraction has 11565 states and 26106 transitions. [2019-12-27 03:12:19,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 03:12:19,514 INFO L276 IsEmpty]: Start isEmpty. Operand 11565 states and 26106 transitions. [2019-12-27 03:12:19,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-27 03:12:19,523 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:12:19,524 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:12:19,524 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:12:19,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:12:19,524 INFO L82 PathProgramCache]: Analyzing trace with hash 273024232, now seen corresponding path program 1 times [2019-12-27 03:12:19,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:12:19,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424713866] [2019-12-27 03:12:19,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:12:19,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:12:19,621 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:12:19,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424713866] [2019-12-27 03:12:19,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:12:19,622 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 03:12:19,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307023410] [2019-12-27 03:12:19,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 03:12:19,623 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:12:19,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 03:12:19,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:12:19,623 INFO L87 Difference]: Start difference. First operand 11565 states and 26106 transitions. Second operand 6 states. [2019-12-27 03:12:20,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:12:20,000 INFO L93 Difference]: Finished difference Result 11819 states and 26540 transitions. [2019-12-27 03:12:20,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 03:12:20,001 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-12-27 03:12:20,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:12:20,015 INFO L225 Difference]: With dead ends: 11819 [2019-12-27 03:12:20,015 INFO L226 Difference]: Without dead ends: 11695 [2019-12-27 03:12:20,016 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 3 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:12:20,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11695 states. [2019-12-27 03:12:20,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11695 to 11310. [2019-12-27 03:12:20,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11310 states. [2019-12-27 03:12:20,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11310 states to 11310 states and 25486 transitions. [2019-12-27 03:12:20,132 INFO L78 Accepts]: Start accepts. Automaton has 11310 states and 25486 transitions. Word has length 97 [2019-12-27 03:12:20,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:12:20,132 INFO L462 AbstractCegarLoop]: Abstraction has 11310 states and 25486 transitions. [2019-12-27 03:12:20,132 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 03:12:20,132 INFO L276 IsEmpty]: Start isEmpty. Operand 11310 states and 25486 transitions. [2019-12-27 03:12:20,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-27 03:12:20,143 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:12:20,143 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:12:20,143 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:12:20,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:12:20,143 INFO L82 PathProgramCache]: Analyzing trace with hash 160107278, now seen corresponding path program 1 times [2019-12-27 03:12:20,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:12:20,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467800620] [2019-12-27 03:12:20,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:12:20,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:12:20,186 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:12:20,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467800620] [2019-12-27 03:12:20,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:12:20,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:12:20,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544134403] [2019-12-27 03:12:20,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:12:20,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:12:20,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:12:20,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:12:20,189 INFO L87 Difference]: Start difference. First operand 11310 states and 25486 transitions. Second operand 3 states. [2019-12-27 03:12:20,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:12:20,305 INFO L93 Difference]: Finished difference Result 10989 states and 23404 transitions. [2019-12-27 03:12:20,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:12:20,306 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-12-27 03:12:20,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:12:20,323 INFO L225 Difference]: With dead ends: 10989 [2019-12-27 03:12:20,323 INFO L226 Difference]: Without dead ends: 10989 [2019-12-27 03:12:20,324 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:12:20,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10989 states. [2019-12-27 03:12:20,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10989 to 8652. [2019-12-27 03:12:20,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8652 states. [2019-12-27 03:12:20,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8652 states to 8652 states and 18890 transitions. [2019-12-27 03:12:20,504 INFO L78 Accepts]: Start accepts. Automaton has 8652 states and 18890 transitions. Word has length 97 [2019-12-27 03:12:20,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:12:20,505 INFO L462 AbstractCegarLoop]: Abstraction has 8652 states and 18890 transitions. [2019-12-27 03:12:20,505 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:12:20,505 INFO L276 IsEmpty]: Start isEmpty. Operand 8652 states and 18890 transitions. [2019-12-27 03:12:20,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-27 03:12:20,516 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:12:20,517 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:12:20,517 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:12:20,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:12:20,517 INFO L82 PathProgramCache]: Analyzing trace with hash -1635016551, now seen corresponding path program 1 times [2019-12-27 03:12:20,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:12:20,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916000378] [2019-12-27 03:12:20,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:12:20,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:12:20,755 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:12:20,756 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916000378] [2019-12-27 03:12:20,756 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:12:20,756 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 03:12:20,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448923904] [2019-12-27 03:12:20,757 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 03:12:20,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:12:20,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 03:12:20,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-12-27 03:12:20,759 INFO L87 Difference]: Start difference. First operand 8652 states and 18890 transitions. Second operand 11 states. [2019-12-27 03:12:22,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:12:22,145 INFO L93 Difference]: Finished difference Result 10232 states and 22016 transitions. [2019-12-27 03:12:22,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 03:12:22,145 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 97 [2019-12-27 03:12:22,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:12:22,157 INFO L225 Difference]: With dead ends: 10232 [2019-12-27 03:12:22,158 INFO L226 Difference]: Without dead ends: 9836 [2019-12-27 03:12:22,158 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-12-27 03:12:22,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9836 states. [2019-12-27 03:12:22,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9836 to 9165. [2019-12-27 03:12:22,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9165 states. [2019-12-27 03:12:22,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9165 states to 9165 states and 19871 transitions. [2019-12-27 03:12:22,261 INFO L78 Accepts]: Start accepts. Automaton has 9165 states and 19871 transitions. Word has length 97 [2019-12-27 03:12:22,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:12:22,261 INFO L462 AbstractCegarLoop]: Abstraction has 9165 states and 19871 transitions. [2019-12-27 03:12:22,261 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 03:12:22,261 INFO L276 IsEmpty]: Start isEmpty. Operand 9165 states and 19871 transitions. [2019-12-27 03:12:22,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-27 03:12:22,269 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:12:22,269 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:12:22,270 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:12:22,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:12:22,270 INFO L82 PathProgramCache]: Analyzing trace with hash 361616868, now seen corresponding path program 1 times [2019-12-27 03:12:22,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:12:22,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176451532] [2019-12-27 03:12:22,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:12:22,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:12:22,416 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:12:22,417 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176451532] [2019-12-27 03:12:22,417 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:12:22,417 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 03:12:22,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144167211] [2019-12-27 03:12:22,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:12:22,418 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:12:22,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:12:22,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:12:22,419 INFO L87 Difference]: Start difference. First operand 9165 states and 19871 transitions. Second operand 5 states. [2019-12-27 03:12:22,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:12:22,479 INFO L93 Difference]: Finished difference Result 6563 states and 13982 transitions. [2019-12-27 03:12:22,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 03:12:22,479 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-12-27 03:12:22,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:12:22,487 INFO L225 Difference]: With dead ends: 6563 [2019-12-27 03:12:22,488 INFO L226 Difference]: Without dead ends: 6563 [2019-12-27 03:12:22,488 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:12:22,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6563 states. [2019-12-27 03:12:22,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6563 to 6499. [2019-12-27 03:12:22,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6499 states. [2019-12-27 03:12:22,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6499 states to 6499 states and 13853 transitions. [2019-12-27 03:12:22,717 INFO L78 Accepts]: Start accepts. Automaton has 6499 states and 13853 transitions. Word has length 97 [2019-12-27 03:12:22,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:12:22,718 INFO L462 AbstractCegarLoop]: Abstraction has 6499 states and 13853 transitions. [2019-12-27 03:12:22,718 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:12:22,718 INFO L276 IsEmpty]: Start isEmpty. Operand 6499 states and 13853 transitions. [2019-12-27 03:12:22,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-27 03:12:22,727 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:12:22,727 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:12:22,727 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:12:22,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:12:22,728 INFO L82 PathProgramCache]: Analyzing trace with hash 953133656, now seen corresponding path program 1 times [2019-12-27 03:12:22,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:12:22,728 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701476303] [2019-12-27 03:12:22,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:12:22,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:12:22,949 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:12:22,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701476303] [2019-12-27 03:12:22,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:12:22,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 03:12:22,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836080288] [2019-12-27 03:12:22,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 03:12:22,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:12:22,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 03:12:22,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:12:22,952 INFO L87 Difference]: Start difference. First operand 6499 states and 13853 transitions. Second operand 7 states. [2019-12-27 03:12:23,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:12:23,059 INFO L93 Difference]: Finished difference Result 6490 states and 13836 transitions. [2019-12-27 03:12:23,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:12:23,059 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 98 [2019-12-27 03:12:23,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:12:23,067 INFO L225 Difference]: With dead ends: 6490 [2019-12-27 03:12:23,067 INFO L226 Difference]: Without dead ends: 6004 [2019-12-27 03:12:23,069 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-27 03:12:23,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6004 states. [2019-12-27 03:12:23,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6004 to 4369. [2019-12-27 03:12:23,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4369 states. [2019-12-27 03:12:23,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4369 states to 4369 states and 9300 transitions. [2019-12-27 03:12:23,147 INFO L78 Accepts]: Start accepts. Automaton has 4369 states and 9300 transitions. Word has length 98 [2019-12-27 03:12:23,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:12:23,147 INFO L462 AbstractCegarLoop]: Abstraction has 4369 states and 9300 transitions. [2019-12-27 03:12:23,147 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 03:12:23,147 INFO L276 IsEmpty]: Start isEmpty. Operand 4369 states and 9300 transitions. [2019-12-27 03:12:23,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-27 03:12:23,152 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:12:23,153 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:12:23,153 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:12:23,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:12:23,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1947027260, now seen corresponding path program 1 times [2019-12-27 03:12:23,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:12:23,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768609379] [2019-12-27 03:12:23,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:12:23,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:12:23,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:12:23,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768609379] [2019-12-27 03:12:23,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:12:23,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:12:23,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456879668] [2019-12-27 03:12:23,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:12:23,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:12:23,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:12:23,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:12:23,194 INFO L87 Difference]: Start difference. First operand 4369 states and 9300 transitions. Second operand 3 states. [2019-12-27 03:12:23,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:12:23,267 INFO L93 Difference]: Finished difference Result 3941 states and 7845 transitions. [2019-12-27 03:12:23,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:12:23,268 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-12-27 03:12:23,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:12:23,273 INFO L225 Difference]: With dead ends: 3941 [2019-12-27 03:12:23,273 INFO L226 Difference]: Without dead ends: 3941 [2019-12-27 03:12:23,273 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:12:23,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3941 states. [2019-12-27 03:12:23,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3941 to 3581. [2019-12-27 03:12:23,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3581 states. [2019-12-27 03:12:23,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3581 states to 3581 states and 7167 transitions. [2019-12-27 03:12:23,312 INFO L78 Accepts]: Start accepts. Automaton has 3581 states and 7167 transitions. Word has length 98 [2019-12-27 03:12:23,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:12:23,312 INFO L462 AbstractCegarLoop]: Abstraction has 3581 states and 7167 transitions. [2019-12-27 03:12:23,312 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:12:23,312 INFO L276 IsEmpty]: Start isEmpty. Operand 3581 states and 7167 transitions. [2019-12-27 03:12:23,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-27 03:12:23,314 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:12:23,315 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:12:23,315 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:12:23,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:12:23,315 INFO L82 PathProgramCache]: Analyzing trace with hash 272691207, now seen corresponding path program 1 times [2019-12-27 03:12:23,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:12:23,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553612150] [2019-12-27 03:12:23,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:12:23,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:12:23,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:12:23,512 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553612150] [2019-12-27 03:12:23,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:12:23,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 03:12:23,513 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839763460] [2019-12-27 03:12:23,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 03:12:23,513 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:12:23,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 03:12:23,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-27 03:12:23,514 INFO L87 Difference]: Start difference. First operand 3581 states and 7167 transitions. Second operand 11 states. [2019-12-27 03:12:23,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:12:23,982 INFO L93 Difference]: Finished difference Result 7113 states and 14245 transitions. [2019-12-27 03:12:23,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 03:12:23,983 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 98 [2019-12-27 03:12:23,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:12:23,989 INFO L225 Difference]: With dead ends: 7113 [2019-12-27 03:12:23,989 INFO L226 Difference]: Without dead ends: 4897 [2019-12-27 03:12:23,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2019-12-27 03:12:23,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4897 states. [2019-12-27 03:12:24,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4897 to 3627. [2019-12-27 03:12:24,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3627 states. [2019-12-27 03:12:24,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3627 states to 3627 states and 7222 transitions. [2019-12-27 03:12:24,027 INFO L78 Accepts]: Start accepts. Automaton has 3627 states and 7222 transitions. Word has length 98 [2019-12-27 03:12:24,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:12:24,028 INFO L462 AbstractCegarLoop]: Abstraction has 3627 states and 7222 transitions. [2019-12-27 03:12:24,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 03:12:24,028 INFO L276 IsEmpty]: Start isEmpty. Operand 3627 states and 7222 transitions. [2019-12-27 03:12:24,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-27 03:12:24,030 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:12:24,031 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:12:24,031 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:12:24,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:12:24,031 INFO L82 PathProgramCache]: Analyzing trace with hash 741591247, now seen corresponding path program 1 times [2019-12-27 03:12:24,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:12:24,031 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755596671] [2019-12-27 03:12:24,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:12:24,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:12:24,405 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:12:24,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755596671] [2019-12-27 03:12:24,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:12:24,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 03:12:24,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496094868] [2019-12-27 03:12:24,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 03:12:24,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:12:24,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 03:12:24,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2019-12-27 03:12:24,407 INFO L87 Difference]: Start difference. First operand 3627 states and 7222 transitions. Second operand 14 states. [2019-12-27 03:12:25,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:12:25,373 INFO L93 Difference]: Finished difference Result 5386 states and 10696 transitions. [2019-12-27 03:12:25,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 03:12:25,374 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 98 [2019-12-27 03:12:25,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:12:25,379 INFO L225 Difference]: With dead ends: 5386 [2019-12-27 03:12:25,379 INFO L226 Difference]: Without dead ends: 4270 [2019-12-27 03:12:25,380 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=463, Unknown=0, NotChecked=0, Total=552 [2019-12-27 03:12:25,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4270 states. [2019-12-27 03:12:25,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4270 to 3763. [2019-12-27 03:12:25,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3763 states. [2019-12-27 03:12:25,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3763 states to 3763 states and 7403 transitions. [2019-12-27 03:12:25,417 INFO L78 Accepts]: Start accepts. Automaton has 3763 states and 7403 transitions. Word has length 98 [2019-12-27 03:12:25,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:12:25,417 INFO L462 AbstractCegarLoop]: Abstraction has 3763 states and 7403 transitions. [2019-12-27 03:12:25,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 03:12:25,417 INFO L276 IsEmpty]: Start isEmpty. Operand 3763 states and 7403 transitions. [2019-12-27 03:12:25,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-27 03:12:25,420 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:12:25,420 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:12:25,420 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:12:25,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:12:25,421 INFO L82 PathProgramCache]: Analyzing trace with hash 402744400, now seen corresponding path program 1 times [2019-12-27 03:12:25,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:12:25,421 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290933250] [2019-12-27 03:12:25,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:12:25,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 03:12:25,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 03:12:25,566 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 03:12:25,566 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 03:12:25,570 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1393] [1393] ULTIMATE.startENTRY-->L822: Formula: (let ((.cse0 (store |v_#valid_48| 0 0))) (and (= 0 v_~y$r_buff0_thd2~0_754) (= 0 v_~y$w_buff0~0_354) (= v_~y$r_buff1_thd0~0_369 0) (= 0 v_~__unbuffered_cnt~0_79) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y~0_364 0) (= |v_#NULL.offset_7| 0) (= 0 v_~x~0_107) (= v_~y$w_buff1_used~0_638 0) (= v_~y$r_buff0_thd0~0_393 0) (= v_~y$read_delayed~0_7 0) (= v_~y$w_buff0_used~0_1402 0) (= v_~main$tmp_guard0~0_23 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1647~0.base_19| 4)) (= v_~y$r_buff1_thd1~0_311 0) (= v_~main$tmp_guard1~0_29 0) (= v_~weak$$choice2~0_312 0) (= 0 v_~y$read_delayed_var~0.base_7) (= (select .cse0 |v_ULTIMATE.start_main_~#t1647~0.base_19|) 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1647~0.base_19| 1) |v_#valid_46|) (= 0 |v_#NULL.base_7|) (= v_~y$w_buff1~0_285 0) (= v_~y$mem_tmp~0_229 0) (= v_~__unbuffered_p1_EBX~0_24 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1647~0.base_19|) (= 0 v_~__unbuffered_p1_EAX~0_36) (= v_~y$flush_delayed~0_258 0) (= 0 v_~weak$$choice0~0_214) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1647~0.base_19| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1647~0.base_19|) |v_ULTIMATE.start_main_~#t1647~0.offset_15| 0))) (= 0 |v_ULTIMATE.start_main_~#t1647~0.offset_15|) (< 0 |v_#StackHeapBarrier_13|) (= 0 v_~y$r_buff1_thd2~0_431) (= v_~y$r_buff0_thd1~0_259 0) (= 0 v_~__unbuffered_p0_EAX~0_38))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_#t~nondet76=|v_ULTIMATE.start_main_#t~nondet76_83|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite89=|v_ULTIMATE.start_main_#t~ite89_50|, ULTIMATE.start_main_#t~ite87=|v_ULTIMATE.start_main_#t~ite87_57|, ULTIMATE.start_main_#t~ite73=|v_ULTIMATE.start_main_#t~ite73_25|, ULTIMATE.start_main_#t~ite96=|v_ULTIMATE.start_main_#t~ite96_33|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ULTIMATE.start_main_#t~ite71=|v_ULTIMATE.start_main_#t~ite71_55|, ULTIMATE.start_main_#t~ite94=|v_ULTIMATE.start_main_#t~ite94_59|, ~y$mem_tmp~0=v_~y$mem_tmp~0_229, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_38, ULTIMATE.start_main_#t~ite92=|v_ULTIMATE.start_main_#t~ite92_31|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_36, ULTIMATE.start_main_#t~ite90=|v_ULTIMATE.start_main_#t~ite90_25|, ULTIMATE.start_main_~#t1648~0.offset=|v_ULTIMATE.start_main_~#t1648~0.offset_13|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_259, ~y$flush_delayed~0=v_~y$flush_delayed~0_258, #length=|v_#length_15|, ULTIMATE.start_main_~#t1648~0.base=|v_ULTIMATE.start_main_~#t1648~0.base_17|, ULTIMATE.start_main_#t~nondet68=|v_ULTIMATE.start_main_#t~nondet68_21|, ULTIMATE.start_main_#t~ite79=|v_ULTIMATE.start_main_#t~ite79_44|, ULTIMATE.start_main_#t~ite77=|v_ULTIMATE.start_main_#t~ite77_25|, ULTIMATE.start_main_#t~ite84=|v_ULTIMATE.start_main_#t~ite84_56|, ~weak$$choice0~0=v_~weak$$choice0~0_214, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite82=|v_ULTIMATE.start_main_#t~ite82_37|, ~y$w_buff1~0=v_~y$w_buff1~0_285, ULTIMATE.start_main_#t~ite80=|v_ULTIMATE.start_main_#t~ite80_54|, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_754, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_369, ~x~0=v_~x~0_107, ULTIMATE.start_main_#t~nondet75=|v_ULTIMATE.start_main_#t~nondet75_83|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t1647~0.offset=|v_ULTIMATE.start_main_~#t1647~0.offset_15|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_1402, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_29, ULTIMATE.start_main_#t~ite69=|v_ULTIMATE.start_main_#t~ite69_33|, ULTIMATE.start_main_#t~ite88=|v_ULTIMATE.start_main_#t~ite88_49|, ULTIMATE.start_main_#t~ite86=|v_ULTIMATE.start_main_#t~ite86_45|, ULTIMATE.start_main_#t~ite74=|v_ULTIMATE.start_main_#t~ite74_95|, ULTIMATE.start_main_#t~ite95=|v_ULTIMATE.start_main_#t~ite95_60|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_311, ULTIMATE.start_main_#t~ite72=|v_ULTIMATE.start_main_#t~ite72_31|, ULTIMATE.start_main_#t~ite93=|v_ULTIMATE.start_main_#t~ite93_29|, ULTIMATE.start_main_#t~ite70=|v_ULTIMATE.start_main_#t~ite70_27|, ULTIMATE.start_main_#t~ite91=|v_ULTIMATE.start_main_#t~ite91_30|, ~y$w_buff0~0=v_~y$w_buff0~0_354, ~y~0=v_~y~0_364, ULTIMATE.start_main_~#t1647~0.base=|v_ULTIMATE.start_main_~#t1647~0.base_19|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_24, ULTIMATE.start_main_#t~nondet67=|v_ULTIMATE.start_main_#t~nondet67_8|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_23, ULTIMATE.start_main_#t~ite78=|v_ULTIMATE.start_main_#t~ite78_23|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite97=|v_ULTIMATE.start_main_#t~ite97_49|, ULTIMATE.start_main_#t~ite85=|v_ULTIMATE.start_main_#t~ite85_52|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_431, ULTIMATE.start_main_#t~ite83=|v_ULTIMATE.start_main_#t~ite83_38|, ULTIMATE.start_main_#t~ite81=|v_ULTIMATE.start_main_#t~ite81_62|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_393, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_9|, ~weak$$choice2~0=v_~weak$$choice2~0_312, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_638} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet76, #NULL.offset, ULTIMATE.start_main_#t~ite89, ULTIMATE.start_main_#t~ite87, ULTIMATE.start_main_#t~ite73, ULTIMATE.start_main_#t~ite96, ~y$read_delayed~0, ULTIMATE.start_main_#t~ite71, ULTIMATE.start_main_#t~ite94, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_#t~ite92, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_#t~ite90, ULTIMATE.start_main_~#t1648~0.offset, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_~#t1648~0.base, ULTIMATE.start_main_#t~nondet68, ULTIMATE.start_main_#t~ite79, ULTIMATE.start_main_#t~ite77, ULTIMATE.start_main_#t~ite84, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite82, ~y$w_buff1~0, ULTIMATE.start_main_#t~ite80, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_#t~nondet75, ~y$read_delayed_var~0.offset, ULTIMATE.start_main_~#t1647~0.offset, ~y$w_buff0_used~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite69, ULTIMATE.start_main_#t~ite88, ULTIMATE.start_main_#t~ite86, ULTIMATE.start_main_#t~ite74, ULTIMATE.start_main_#t~ite95, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite72, ULTIMATE.start_main_#t~ite93, ULTIMATE.start_main_#t~ite70, ULTIMATE.start_main_#t~ite91, ~y$w_buff0~0, ~y~0, ULTIMATE.start_main_~#t1647~0.base, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet67, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite78, #NULL.base, ULTIMATE.start_main_#t~ite97, ULTIMATE.start_main_#t~ite85, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite83, ULTIMATE.start_main_#t~ite81, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 03:12:25,572 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1352] [1352] L822-1-->L824: Formula: (and (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1648~0.base_11| 1)) (= 0 |v_ULTIMATE.start_main_~#t1648~0.offset_10|) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t1648~0.base_11| 4) |v_#length_11|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1648~0.base_11|) (not (= 0 |v_ULTIMATE.start_main_~#t1648~0.base_11|)) (= |v_#memory_int_5| (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1648~0.base_11| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1648~0.base_11|) |v_ULTIMATE.start_main_~#t1648~0.offset_10| 1))) (= (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1648~0.base_11|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_6|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_#t~nondet67=|v_ULTIMATE.start_main_#t~nondet67_6|, ULTIMATE.start_main_~#t1648~0.offset=|v_ULTIMATE.start_main_~#t1648~0.offset_10|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_5|, #length=|v_#length_11|, ULTIMATE.start_main_~#t1648~0.base=|v_ULTIMATE.start_main_~#t1648~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet67, ULTIMATE.start_main_~#t1648~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1648~0.base] because there is no mapped edge [2019-12-27 03:12:25,573 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1320] [1320] L729-2-->L729-5: Formula: (let ((.cse0 (= |P0Thread1of1ForFork0_#t~ite4_Out-1699493649| |P0Thread1of1ForFork0_#t~ite3_Out-1699493649|)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1699493649 256))) (.cse1 (= (mod ~y$r_buff1_thd1~0_In-1699493649 256) 0))) (or (and .cse0 (or .cse1 .cse2) (= |P0Thread1of1ForFork0_#t~ite3_Out-1699493649| ~y~0_In-1699493649)) (and .cse0 (not .cse2) (= |P0Thread1of1ForFork0_#t~ite3_Out-1699493649| ~y$w_buff1~0_In-1699493649) (not .cse1)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1699493649, ~y$w_buff1~0=~y$w_buff1~0_In-1699493649, ~y~0=~y~0_In-1699493649, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1699493649} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1699493649, P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out-1699493649|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out-1699493649|, ~y$w_buff1~0=~y$w_buff1~0_In-1699493649, ~y~0=~y~0_In-1699493649, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1699493649} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-27 03:12:25,574 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1302] [1302] L730-->L730-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-580593048 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-580593048 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-580593048|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out-580593048| ~y$w_buff0_used~0_In-580593048)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-580593048, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-580593048} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-580593048|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-580593048, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-580593048} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 03:12:25,575 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1298] [1298] L731-->L731-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-1631602686 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-1631602686 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-1631602686 256))) (.cse2 (= (mod ~y$r_buff1_thd1~0_In-1631602686 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite6_Out-1631602686| ~y$w_buff1_used~0_In-1631602686) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P0Thread1of1ForFork0_#t~ite6_Out-1631602686| 0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1631602686, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1631602686, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1631602686, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1631602686} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1631602686|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1631602686, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1631602686, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1631602686, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1631602686} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 03:12:25,576 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1330] [1330] L732-->L732-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In238808425 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In238808425 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd1~0_In238808425 |P0Thread1of1ForFork0_#t~ite7_Out238808425|)) (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite7_Out238808425|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In238808425, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In238808425} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In238808425, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out238808425|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In238808425} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-27 03:12:25,577 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1295] [1295] L733-->L733-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In1154228678 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd1~0_In1154228678 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1154228678 256))) (.cse0 (= (mod ~y$r_buff1_thd1~0_In1154228678 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd1~0_In1154228678 |P0Thread1of1ForFork0_#t~ite8_Out1154228678|)) (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out1154228678|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1154228678, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1154228678, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1154228678, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1154228678} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1154228678, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1154228678, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1154228678|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1154228678, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1154228678} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 03:12:25,579 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1314] [1314] L739-2-->L739-5: Formula: (let ((.cse2 (= |P0Thread1of1ForFork0_#t~ite9_Out-319771764| |P0Thread1of1ForFork0_#t~ite10_Out-319771764|)) (.cse1 (= (mod ~y$w_buff1_used~0_In-319771764 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd1~0_In-319771764 256)))) (or (and (or .cse0 .cse1) .cse2 (= |P0Thread1of1ForFork0_#t~ite9_Out-319771764| ~y~0_In-319771764)) (and (= |P0Thread1of1ForFork0_#t~ite9_Out-319771764| ~y$w_buff1~0_In-319771764) .cse2 (not .cse1) (not .cse0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-319771764, ~y$w_buff1~0=~y$w_buff1~0_In-319771764, ~y~0=~y~0_In-319771764, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-319771764} OutVars{P0Thread1of1ForFork0_#t~ite10=|P0Thread1of1ForFork0_#t~ite10_Out-319771764|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-319771764, P0Thread1of1ForFork0_#t~ite9=|P0Thread1of1ForFork0_#t~ite9_Out-319771764|, ~y$w_buff1~0=~y$w_buff1~0_In-319771764, ~y~0=~y~0_In-319771764, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-319771764} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite10, P0Thread1of1ForFork0_#t~ite9] because there is no mapped edge [2019-12-27 03:12:25,580 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1261] [1261] P1ENTRY-->L4-3: Formula: (and (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_33 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_31|) (= v_~y$w_buff0_used~0_458 1) (= 1 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_31|) (= v_~y$w_buff0_used~0_459 v_~y$w_buff1_used~0_217) (= v_~x~0_34 1) (= v_~y$w_buff1~0_88 v_~y$w_buff0~0_113) (= v_P1Thread1of1ForFork1_~arg.base_31 |v_P1Thread1of1ForFork1_#in~arg.base_31|) (= |v_P1Thread1of1ForFork1_#in~arg.offset_31| v_P1Thread1of1ForFork1_~arg.offset_31) (= (mod v_~y$w_buff1_used~0_217 256) 0) (= 1 v_~y$w_buff0~0_112)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_459, ~y$w_buff0~0=v_~y$w_buff0~0_113, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_31|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_31|} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_33, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_31, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_458, ~y$w_buff1~0=v_~y$w_buff1~0_88, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_31|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_31, ~y$w_buff0~0=v_~y$w_buff0~0_112, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_31|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_31|, ~x~0=v_~x~0_34, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_217} 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, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 03:12:25,582 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1328] [1328] L771-2-->L771-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In694722407 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In694722407 256)))) (or (and (not .cse0) (= ~y$w_buff0~0_In694722407 |P1Thread1of1ForFork1_#t~ite17_Out694722407|) (not .cse1)) (and (= ~y$w_buff1~0_In694722407 |P1Thread1of1ForFork1_#t~ite17_Out694722407|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In694722407, ~y$w_buff1~0=~y$w_buff1~0_In694722407, ~y$w_buff0~0=~y$w_buff0~0_In694722407, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In694722407} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In694722407, ~y$w_buff1~0=~y$w_buff1~0_In694722407, ~y$w_buff0~0=~y$w_buff0~0_In694722407, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In694722407, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out694722407|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-27 03:12:25,582 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1231] [1231] L771-4-->L772: Formula: (= v_~y~0_57 |v_P1Thread1of1ForFork1_#t~ite17_10|) InVars {P1Thread1of1ForFork1_#t~ite17=|v_P1Thread1of1ForFork1_#t~ite17_10|} OutVars{P1Thread1of1ForFork1_#t~ite18=|v_P1Thread1of1ForFork1_#t~ite18_13|, ~y~0=v_~y~0_57, P1Thread1of1ForFork1_#t~ite17=|v_P1Thread1of1ForFork1_#t~ite17_9|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, ~y~0, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-27 03:12:25,590 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1292] [1292] L776-->L777: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_153 256))) (= v_~y$r_buff0_thd2~0_342 v_~y$r_buff0_thd2~0_341)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_342, ~weak$$choice2~0=v_~weak$$choice2~0_153} OutVars{P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_17|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_341, P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_14|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_10|, ~weak$$choice2~0=v_~weak$$choice2~0_153} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-27 03:12:25,592 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1312] [1312] L779-->L779-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In-1667990272 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite37_Out-1667990272| ~y$mem_tmp~0_In-1667990272) (not .cse0)) (and (= |P1Thread1of1ForFork1_#t~ite37_Out-1667990272| ~y~0_In-1667990272) .cse0))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-1667990272, ~y$flush_delayed~0=~y$flush_delayed~0_In-1667990272, ~y~0=~y~0_In-1667990272} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-1667990272, ~y$flush_delayed~0=~y$flush_delayed~0_In-1667990272, ~y~0=~y~0_In-1667990272, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-1667990272|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 03:12:25,594 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1306] [1306] L787-2-->L787-5: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1623643445 256))) (.cse2 (= (mod ~y$r_buff0_thd2~0_In-1623643445 256) 0)) (.cse1 (= |P1Thread1of1ForFork1_#t~ite41_Out-1623643445| |P1Thread1of1ForFork1_#t~ite40_Out-1623643445|))) (or (and (not .cse0) .cse1 (= ~y$w_buff0~0_In-1623643445 |P1Thread1of1ForFork1_#t~ite40_Out-1623643445|) (not .cse2)) (and (or .cse0 .cse2) .cse1 (= ~y$w_buff1~0_In-1623643445 |P1Thread1of1ForFork1_#t~ite40_Out-1623643445|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1623643445, ~y$w_buff1~0=~y$w_buff1~0_In-1623643445, ~y$w_buff0~0=~y$w_buff0~0_In-1623643445, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1623643445} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1623643445, ~y$w_buff1~0=~y$w_buff1~0_In-1623643445, P1Thread1of1ForFork1_#t~ite41=|P1Thread1of1ForFork1_#t~ite41_Out-1623643445|, P1Thread1of1ForFork1_#t~ite40=|P1Thread1of1ForFork1_#t~ite40_Out-1623643445|, ~y$w_buff0~0=~y$w_buff0~0_In-1623643445, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1623643445} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite41, P1Thread1of1ForFork1_#t~ite40] because there is no mapped edge [2019-12-27 03:12:25,604 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1227] [1227] L792-->L793: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_61 256))) (= v_~y$r_buff0_thd2~0_127 v_~y$r_buff0_thd2~0_126)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_127, ~weak$$choice2~0=v_~weak$$choice2~0_61} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_126, P1Thread1of1ForFork1_#t~ite56=|v_P1Thread1of1ForFork1_#t~ite56_11|, P1Thread1of1ForFork1_#t~ite55=|v_P1Thread1of1ForFork1_#t~ite55_11|, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_14|, ~weak$$choice2~0=v_~weak$$choice2~0_61} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite56, P1Thread1of1ForFork1_#t~ite55, P1Thread1of1ForFork1_#t~ite54] because there is no mapped edge [2019-12-27 03:12:25,605 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1321] [1321] L795-->L795-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In528644900 256)))) (or (and .cse0 (= ~y~0_In528644900 |P1Thread1of1ForFork1_#t~ite60_Out528644900|)) (and (not .cse0) (= ~y$mem_tmp~0_In528644900 |P1Thread1of1ForFork1_#t~ite60_Out528644900|)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In528644900, ~y$flush_delayed~0=~y$flush_delayed~0_In528644900, ~y~0=~y~0_In528644900} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In528644900, P1Thread1of1ForFork1_#t~ite60=|P1Thread1of1ForFork1_#t~ite60_Out528644900|, ~y$flush_delayed~0=~y$flush_delayed~0_In528644900, ~y~0=~y~0_In528644900} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite60] because there is no mapped edge [2019-12-27 03:12:25,609 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1313] [1313] L800-->L800-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In762787220 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In762787220 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite63_Out762787220| ~y$w_buff0_used~0_In762787220)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite63_Out762787220| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In762787220, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In762787220} OutVars{P1Thread1of1ForFork1_#t~ite63=|P1Thread1of1ForFork1_#t~ite63_Out762787220|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In762787220, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In762787220} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite63] because there is no mapped edge [2019-12-27 03:12:25,611 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1297] [1297] L740-->L740-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-928063661 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-928063661 256)))) (or (and (= ~y$w_buff0_used~0_In-928063661 |P0Thread1of1ForFork0_#t~ite11_Out-928063661|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P0Thread1of1ForFork0_#t~ite11_Out-928063661| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-928063661, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-928063661} OutVars{P0Thread1of1ForFork0_#t~ite11=|P0Thread1of1ForFork0_#t~ite11_Out-928063661|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-928063661, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-928063661} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-27 03:12:25,611 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1337] [1337] L801-->L801-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-1646253056 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-1646253056 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In-1646253056 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd2~0_In-1646253056 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite64_Out-1646253056| ~y$w_buff1_used~0_In-1646253056) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite64_Out-1646253056| 0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1646253056, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1646253056, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1646253056, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1646253056} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1646253056, P1Thread1of1ForFork1_#t~ite64=|P1Thread1of1ForFork1_#t~ite64_Out-1646253056|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1646253056, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1646253056, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1646253056} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite64] because there is no mapped edge [2019-12-27 03:12:25,612 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1316] [1316] L802-->L803: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In208751634 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In208751634 256)))) (or (and (not .cse0) (= 0 ~y$r_buff0_thd2~0_Out208751634) (not .cse1)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd2~0_In208751634 ~y$r_buff0_thd2~0_Out208751634)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In208751634, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In208751634} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In208751634, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out208751634, P1Thread1of1ForFork1_#t~ite65=|P1Thread1of1ForFork1_#t~ite65_Out208751634|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite65] because there is no mapped edge [2019-12-27 03:12:25,612 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1325] [1325] L803-->L803-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In1344537555 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In1344537555 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In1344537555 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1344537555 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite66_Out1344537555| 0)) (and (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite66_Out1344537555| ~y$r_buff1_thd2~0_In1344537555) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1344537555, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1344537555, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1344537555, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1344537555} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1344537555, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1344537555, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1344537555, P1Thread1of1ForFork1_#t~ite66=|P1Thread1of1ForFork1_#t~ite66_Out1344537555|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1344537555} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite66] because there is no mapped edge [2019-12-27 03:12:25,612 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1357] [1357] L803-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_49 1) v_~__unbuffered_cnt~0_48) (= v_~y$r_buff1_thd2~0_224 |v_P1Thread1of1ForFork1_#t~ite66_34|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49, P1Thread1of1ForFork1_#t~ite66=|v_P1Thread1of1ForFork1_#t~ite66_34|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_224, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, P1Thread1of1ForFork1_#t~ite66=|v_P1Thread1of1ForFork1_#t~ite66_33|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite66, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 03:12:25,612 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1310] [1310] L741-->L741-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd1~0_In-1644516057 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1644516057 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd1~0_In-1644516057 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-1644516057 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite12_Out-1644516057| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P0Thread1of1ForFork0_#t~ite12_Out-1644516057| ~y$w_buff1_used~0_In-1644516057) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1644516057, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1644516057, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1644516057, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1644516057} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1644516057, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1644516057, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1644516057, P0Thread1of1ForFork0_#t~ite12=|P0Thread1of1ForFork0_#t~ite12_Out-1644516057|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1644516057} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-27 03:12:25,613 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1304] [1304] L742-->L742-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In212804520 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In212804520 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite13_Out212804520|) (not .cse0) (not .cse1)) (and (= ~y$r_buff0_thd1~0_In212804520 |P0Thread1of1ForFork0_#t~ite13_Out212804520|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In212804520, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In212804520} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In212804520, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In212804520, P0Thread1of1ForFork0_#t~ite13=|P0Thread1of1ForFork0_#t~ite13_Out212804520|} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-27 03:12:25,614 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1338] [1338] L743-->L743-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd1~0_In1962592582 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In1962592582 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In1962592582 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd1~0_In1962592582 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite14_Out1962592582|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~y$r_buff1_thd1~0_In1962592582 |P0Thread1of1ForFork0_#t~ite14_Out1962592582|) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1962592582, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1962592582, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1962592582, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1962592582} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1962592582, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1962592582, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1962592582, P0Thread1of1ForFork0_#t~ite14=|P0Thread1of1ForFork0_#t~ite14_Out1962592582|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1962592582} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-27 03:12:25,614 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1340] [1340] L743-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~y$r_buff1_thd1~0_117 |v_P0Thread1of1ForFork0_#t~ite14_28|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_31 (+ v_~__unbuffered_cnt~0_32 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32, P0Thread1of1ForFork0_#t~ite14=|v_P0Thread1of1ForFork0_#t~ite14_28|} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_117, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, P0Thread1of1ForFork0_#t~ite14=|v_P0Thread1of1ForFork0_#t~ite14_27|} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-27 03:12:25,614 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1274] [1274] L824-1-->L830: Formula: (and (= v_~main$tmp_guard0~0_9 1) (= 2 v_~__unbuffered_cnt~0_26)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_26} OutVars{ULTIMATE.start_main_#t~nondet68=|v_ULTIMATE.start_main_#t~nondet68_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_26, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet68, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 03:12:25,615 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1336] [1336] L830-2-->L830-4: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-391571654 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-391571654 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite69_Out-391571654| ~y$w_buff1~0_In-391571654)) (and (= ~y~0_In-391571654 |ULTIMATE.start_main_#t~ite69_Out-391571654|) (or .cse0 .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-391571654, ~y~0=~y~0_In-391571654, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-391571654, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-391571654} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-391571654, ULTIMATE.start_main_#t~ite69=|ULTIMATE.start_main_#t~ite69_Out-391571654|, ~y~0=~y~0_In-391571654, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-391571654, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-391571654} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite69] because there is no mapped edge [2019-12-27 03:12:25,615 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1254] [1254] L830-4-->L831: Formula: (= v_~y~0_92 |v_ULTIMATE.start_main_#t~ite69_10|) InVars {ULTIMATE.start_main_#t~ite69=|v_ULTIMATE.start_main_#t~ite69_10|} OutVars{ULTIMATE.start_main_#t~ite70=|v_ULTIMATE.start_main_#t~ite70_13|, ULTIMATE.start_main_#t~ite69=|v_ULTIMATE.start_main_#t~ite69_9|, ~y~0=v_~y~0_92} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite70, ULTIMATE.start_main_#t~ite69, ~y~0] because there is no mapped edge [2019-12-27 03:12:25,615 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1311] [1311] L831-->L831-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1473134879 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-1473134879 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-1473134879 |ULTIMATE.start_main_#t~ite71_Out-1473134879|)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite71_Out-1473134879|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1473134879, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1473134879} OutVars{ULTIMATE.start_main_#t~ite71=|ULTIMATE.start_main_#t~ite71_Out-1473134879|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1473134879, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1473134879} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite71] because there is no mapped edge [2019-12-27 03:12:25,616 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1335] [1335] L832-->L832-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1030543201 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-1030543201 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1030543201 256))) (.cse3 (= (mod ~y$r_buff0_thd0~0_In-1030543201 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite72_Out-1030543201| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite72_Out-1030543201| ~y$w_buff1_used~0_In-1030543201) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1030543201, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1030543201, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1030543201, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1030543201} OutVars{ULTIMATE.start_main_#t~ite72=|ULTIMATE.start_main_#t~ite72_Out-1030543201|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1030543201, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1030543201, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1030543201, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1030543201} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite72] because there is no mapped edge [2019-12-27 03:12:25,617 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1300] [1300] L833-->L833-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1307524140 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1307524140 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite73_Out1307524140| ~y$r_buff0_thd0~0_In1307524140)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite73_Out1307524140| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1307524140, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1307524140} OutVars{ULTIMATE.start_main_#t~ite73=|ULTIMATE.start_main_#t~ite73_Out1307524140|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1307524140, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1307524140} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite73] because there is no mapped edge [2019-12-27 03:12:25,617 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1332] [1332] L834-->L834-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1883839200 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1883839200 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1883839200 256))) (.cse3 (= (mod ~y$r_buff1_thd0~0_In-1883839200 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite74_Out-1883839200| ~y$r_buff1_thd0~0_In-1883839200)) (and (= |ULTIMATE.start_main_#t~ite74_Out-1883839200| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1883839200, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1883839200, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1883839200, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1883839200} OutVars{ULTIMATE.start_main_#t~ite74=|ULTIMATE.start_main_#t~ite74_Out-1883839200|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1883839200, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1883839200, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1883839200, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1883839200} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite74] because there is no mapped edge [2019-12-27 03:12:25,632 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1296] [1296] L849-->L849-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In1700673706 256)))) (or (and (= ~y$mem_tmp~0_In1700673706 |ULTIMATE.start_main_#t~ite97_Out1700673706|) (not .cse0)) (and .cse0 (= |ULTIMATE.start_main_#t~ite97_Out1700673706| ~y~0_In1700673706)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In1700673706, ~y$flush_delayed~0=~y$flush_delayed~0_In1700673706, ~y~0=~y~0_In1700673706} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In1700673706, ~y$flush_delayed~0=~y$flush_delayed~0_In1700673706, ~y~0=~y~0_In1700673706, ULTIMATE.start_main_#t~ite97=|ULTIMATE.start_main_#t~ite97_Out1700673706|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite97] because there is no mapped edge [2019-12-27 03:12:25,632 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1388] [1388] L849-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (mod v_~main$tmp_guard1~0_26 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= v_~y~0_361 |v_ULTIMATE.start_main_#t~ite97_46|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 0) (= v_~y$flush_delayed~0_254 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|)) InVars {~main$tmp_guard1~0=v_~main$tmp_guard1~0_26, ULTIMATE.start_main_#t~ite97=|v_ULTIMATE.start_main_#t~ite97_46|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~y$flush_delayed~0=v_~y$flush_delayed~0_254, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_26, ~y~0=v_~y~0_361, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|, ULTIMATE.start_main_#t~ite97=|v_ULTIMATE.start_main_#t~ite97_45|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~y$flush_delayed~0, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression, ULTIMATE.start_main_#t~ite97] because there is no mapped edge [2019-12-27 03:12:25,801 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 03:12:25 BasicIcfg [2019-12-27 03:12:25,802 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 03:12:25,807 INFO L168 Benchmark]: Toolchain (without parser) took 72965.42 ms. Allocated memory was 145.2 MB in the beginning and 2.3 GB in the end (delta: 2.1 GB). Free memory was 101.1 MB in the beginning and 739.1 MB in the end (delta: -638.1 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-27 03:12:25,807 INFO L168 Benchmark]: CDTParser took 0.42 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 03:12:25,808 INFO L168 Benchmark]: CACSL2BoogieTranslator took 797.44 ms. Allocated memory was 145.2 MB in the beginning and 201.3 MB in the end (delta: 56.1 MB). Free memory was 100.9 MB in the beginning and 152.0 MB in the end (delta: -51.2 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. [2019-12-27 03:12:25,809 INFO L168 Benchmark]: Boogie Procedure Inliner took 90.57 ms. Allocated memory is still 201.3 MB. Free memory was 152.0 MB in the beginning and 148.0 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 7.1 GB. [2019-12-27 03:12:25,809 INFO L168 Benchmark]: Boogie Preprocessor took 46.81 ms. Allocated memory is still 201.3 MB. Free memory was 148.0 MB in the beginning and 145.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 03:12:25,812 INFO L168 Benchmark]: RCFGBuilder took 1319.75 ms. Allocated memory was 201.3 MB in the beginning and 234.9 MB in the end (delta: 33.6 MB). Free memory was 145.4 MB in the beginning and 189.7 MB in the end (delta: -44.3 MB). Peak memory consumption was 65.0 MB. Max. memory is 7.1 GB. [2019-12-27 03:12:25,812 INFO L168 Benchmark]: TraceAbstraction took 70702.39 ms. Allocated memory was 234.9 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 189.7 MB in the beginning and 739.1 MB in the end (delta: -549.4 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-27 03:12:25,816 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.42 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 797.44 ms. Allocated memory was 145.2 MB in the beginning and 201.3 MB in the end (delta: 56.1 MB). Free memory was 100.9 MB in the beginning and 152.0 MB in the end (delta: -51.2 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 90.57 ms. Allocated memory is still 201.3 MB. Free memory was 152.0 MB in the beginning and 148.0 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 46.81 ms. Allocated memory is still 201.3 MB. Free memory was 148.0 MB in the beginning and 145.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1319.75 ms. Allocated memory was 201.3 MB in the beginning and 234.9 MB in the end (delta: 33.6 MB). Free memory was 145.4 MB in the beginning and 189.7 MB in the end (delta: -44.3 MB). Peak memory consumption was 65.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 70702.39 ms. Allocated memory was 234.9 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 189.7 MB in the beginning and 739.1 MB in the end (delta: -549.4 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 7.5s, 244 ProgramPointsBefore, 155 ProgramPointsAfterwards, 326 TransitionsBefore, 192 TransitionsAfterwards, 49222 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 34 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 78 ConcurrentYvCompositions, 48 ChoiceCompositions, 16023 VarBasedMoverChecksPositive, 415 VarBasedMoverChecksNegative, 104 SemBasedMoverChecksPositive, 452 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.5s, 0 MoverChecksTotal, 282427 CheckedPairsTotal, 142 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L822] FCALL, FORK 0 pthread_create(&t1647, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L726] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L729] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L824] FCALL, FORK 0 pthread_create(&t1648, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L729] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L730] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L731] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L732] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L733] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L736] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L739] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L761] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L762] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L763] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L764] 2 y$r_buff0_thd2 = (_Bool)1 [L767] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L768] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L769] 2 y$flush_delayed = weak$$choice2 [L770] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L771] 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_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L772] 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_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L772] 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)) [L773] 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_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L773] 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)) [L774] 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_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L774] 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)) [L775] 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_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L775] 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)) [L777] 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_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L777] 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)) [L778] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=7, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L779] 2 y = y$flush_delayed ? y$mem_tmp : y [L780] 2 y$flush_delayed = (_Bool)0 [L783] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L784] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L785] 2 y$flush_delayed = weak$$choice2 [L786] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L787] EXPR 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_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L787] 2 y = !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) [L788] 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_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L788] 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)) [L789] 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_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L789] 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)) [L790] 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_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L790] 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)) [L791] 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_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L791] 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)) [L793] 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_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L793] 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)) [L794] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L795] 2 y = y$flush_delayed ? y$mem_tmp : y [L796] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L799] 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_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L799] 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) [L800] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L739] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L801] 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 [L740] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L741] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L742] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L830] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L831] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L832] 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 [L833] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L834] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L837] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L838] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L839] 0 y$flush_delayed = weak$$choice2 [L840] 0 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L841] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L841] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L842] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L842] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L843] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L843] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L844] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L844] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L845] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L845] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L846] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L847] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L847] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L848] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 238 locations, 2 error locations. Result: UNSAFE, OverallTime: 70.2s, OverallIterations: 33, TraceHistogramMax: 1, AutomataDifference: 30.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 9636 SDtfs, 9121 SDslu, 39683 SDs, 0 SdLazy, 17948 SolverSat, 550 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 459 GetRequests, 94 SyntacticMatches, 50 SemanticMatches, 315 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 774 ImplicationChecksByTransitivity, 4.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=126190occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 16.5s AutomataMinimizationTime, 32 MinimizatonAttempts, 47546 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 2761 NumberOfCodeBlocks, 2761 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 2631 ConstructedInterpolants, 0 QuantifiedInterpolants, 965253 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 32 InterpolantComputations, 32 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...