/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-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe010_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 18:12:05,544 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 18:12:05,548 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 18:12:05,566 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 18:12:05,567 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 18:12:05,569 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 18:12:05,571 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 18:12:05,581 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 18:12:05,583 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 18:12:05,584 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 18:12:05,585 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 18:12:05,587 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 18:12:05,588 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 18:12:05,590 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 18:12:05,593 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 18:12:05,594 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 18:12:05,595 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 18:12:05,598 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 18:12:05,600 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 18:12:05,605 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 18:12:05,609 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 18:12:05,610 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 18:12:05,612 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 18:12:05,613 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 18:12:05,615 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 18:12:05,615 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 18:12:05,615 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 18:12:05,617 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 18:12:05,618 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 18:12:05,619 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 18:12:05,620 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 18:12:05,620 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 18:12:05,621 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 18:12:05,622 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 18:12:05,623 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 18:12:05,624 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 18:12:05,625 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 18:12:05,625 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 18:12:05,626 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 18:12:05,628 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 18:12:05,629 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 18:12:05,630 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-MCR.epf [2019-12-27 18:12:05,663 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 18:12:05,663 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 18:12:05,667 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 18:12:05,667 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 18:12:05,667 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 18:12:05,667 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 18:12:05,668 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 18:12:05,670 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 18:12:05,670 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 18:12:05,670 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 18:12:05,670 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 18:12:05,671 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 18:12:05,671 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 18:12:05,671 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 18:12:05,671 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 18:12:05,671 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 18:12:05,671 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 18:12:05,672 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 18:12:05,672 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 18:12:05,672 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 18:12:05,672 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 18:12:05,672 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 18:12:05,675 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 18:12:05,676 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 18:12:05,676 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 18:12:05,676 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 18:12:05,676 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 18:12:05,676 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 18:12:05,676 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 18:12:05,677 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 18:12:05,677 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 18:12:05,950 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 18:12:05,964 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 18:12:05,967 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 18:12:05,968 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 18:12:05,969 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 18:12:05,970 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe010_power.oepc.i [2019-12-27 18:12:06,058 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a67f811b/ba79b461f8504446bd4c64fe841540a9/FLAGcf4eb1597 [2019-12-27 18:12:06,633 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 18:12:06,634 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe010_power.oepc.i [2019-12-27 18:12:06,649 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a67f811b/ba79b461f8504446bd4c64fe841540a9/FLAGcf4eb1597 [2019-12-27 18:12:06,884 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a67f811b/ba79b461f8504446bd4c64fe841540a9 [2019-12-27 18:12:06,895 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 18:12:06,897 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 18:12:06,898 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 18:12:06,898 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 18:12:06,902 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 18:12:06,903 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:12:06" (1/1) ... [2019-12-27 18:12:06,906 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15422b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:12:06, skipping insertion in model container [2019-12-27 18:12:06,906 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:12:06" (1/1) ... [2019-12-27 18:12:06,914 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 18:12:06,984 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 18:12:07,544 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 18:12:07,569 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 18:12:07,627 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 18:12:07,714 INFO L208 MainTranslator]: Completed translation [2019-12-27 18:12:07,714 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:12:07 WrapperNode [2019-12-27 18:12:07,714 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 18:12:07,715 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 18:12:07,715 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 18:12:07,716 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 18:12:07,725 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:12:07" (1/1) ... [2019-12-27 18:12:07,749 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:12:07" (1/1) ... [2019-12-27 18:12:07,787 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 18:12:07,787 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 18:12:07,788 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 18:12:07,788 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 18:12:07,798 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:12:07" (1/1) ... [2019-12-27 18:12:07,798 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:12:07" (1/1) ... [2019-12-27 18:12:07,803 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:12:07" (1/1) ... [2019-12-27 18:12:07,803 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:12:07" (1/1) ... [2019-12-27 18:12:07,815 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:12:07" (1/1) ... [2019-12-27 18:12:07,823 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:12:07" (1/1) ... [2019-12-27 18:12:07,832 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:12:07" (1/1) ... [2019-12-27 18:12:07,839 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 18:12:07,839 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 18:12:07,839 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 18:12:07,839 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 18:12:07,840 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:12:07" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 18:12:07,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 18:12:07,892 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 18:12:07,892 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 18:12:07,892 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 18:12:07,892 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 18:12:07,893 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 18:12:07,893 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 18:12:07,893 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 18:12:07,893 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 18:12:07,893 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 18:12:07,894 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 18:12:07,895 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 18:12:08,600 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 18:12:08,601 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 18:12:08,602 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:12:08 BoogieIcfgContainer [2019-12-27 18:12:08,602 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 18:12:08,604 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 18:12:08,604 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 18:12:08,607 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 18:12:08,607 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:12:06" (1/3) ... [2019-12-27 18:12:08,609 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42fee2fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:12:08, skipping insertion in model container [2019-12-27 18:12:08,609 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:12:07" (2/3) ... [2019-12-27 18:12:08,609 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42fee2fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:12:08, skipping insertion in model container [2019-12-27 18:12:08,610 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:12:08" (3/3) ... [2019-12-27 18:12:08,611 INFO L109 eAbstractionObserver]: Analyzing ICFG safe010_power.oepc.i [2019-12-27 18:12:08,622 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 18:12:08,623 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 18:12:08,631 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 18:12:08,632 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 18:12:08,666 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:08,666 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:08,666 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:08,667 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:08,667 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:08,667 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:08,668 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:08,668 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:08,668 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:08,669 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:08,669 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:08,669 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:08,669 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:08,670 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:08,670 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:08,670 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:08,671 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:08,671 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:08,671 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:08,671 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:08,671 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:08,672 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:08,672 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:08,672 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:08,672 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:08,673 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:08,673 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:08,673 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:08,673 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:08,674 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:08,674 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:08,674 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:08,674 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:08,675 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:08,675 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:08,675 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:08,676 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:08,676 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:08,676 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:08,676 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:08,677 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:08,677 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:08,677 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:08,677 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:08,678 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:08,678 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:08,678 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:08,679 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:08,679 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:08,679 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:08,679 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:08,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:08,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:08,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:08,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:08,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:08,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:08,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:08,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:08,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:08,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:08,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:08,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:08,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:08,687 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:08,687 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:08,687 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:08,688 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:08,688 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:08,688 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:08,688 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:08,688 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:08,689 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:08,689 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:08,689 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:08,689 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:08,692 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:08,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:08,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:08,693 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:08,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:08,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:08,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:08,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:08,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:08,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:08,710 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 18:12:08,727 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 18:12:08,727 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 18:12:08,727 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 18:12:08,727 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 18:12:08,728 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 18:12:08,728 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 18:12:08,728 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 18:12:08,728 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 18:12:08,761 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 146 places, 180 transitions [2019-12-27 18:12:08,763 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-12-27 18:12:08,846 INFO L132 PetriNetUnfolder]: 41/178 cut-off events. [2019-12-27 18:12:08,847 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 18:12:08,859 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 178 events. 41/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 248 event pairs. 0/135 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 18:12:08,876 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-12-27 18:12:08,918 INFO L132 PetriNetUnfolder]: 41/178 cut-off events. [2019-12-27 18:12:08,919 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 18:12:08,923 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 178 events. 41/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 248 event pairs. 0/135 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 18:12:08,936 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10418 [2019-12-27 18:12:08,938 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 18:12:13,889 WARN L192 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2019-12-27 18:12:14,024 INFO L206 etLargeBlockEncoding]: Checked pairs total: 46090 [2019-12-27 18:12:14,025 INFO L214 etLargeBlockEncoding]: Total number of compositions: 101 [2019-12-27 18:12:14,028 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 79 places, 91 transitions [2019-12-27 18:12:14,512 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8654 states. [2019-12-27 18:12:14,514 INFO L276 IsEmpty]: Start isEmpty. Operand 8654 states. [2019-12-27 18:12:14,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 18:12:14,521 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:12:14,521 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 18:12:14,522 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:12:14,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:12:14,529 INFO L82 PathProgramCache]: Analyzing trace with hash 722891, now seen corresponding path program 1 times [2019-12-27 18:12:14,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:12:14,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114850169] [2019-12-27 18:12:14,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:12:14,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:12:14,814 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 18:12:14,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114850169] [2019-12-27 18:12:14,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:12:14,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 18:12:14,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1151763369] [2019-12-27 18:12:14,820 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:12:14,825 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:12:14,838 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 18:12:14,838 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:12:14,844 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:12:14,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:12:14,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:12:14,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:12:14,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:12:14,864 INFO L87 Difference]: Start difference. First operand 8654 states. Second operand 3 states. [2019-12-27 18:12:15,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:12:15,137 INFO L93 Difference]: Finished difference Result 8604 states and 28108 transitions. [2019-12-27 18:12:15,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:12:15,139 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 18:12:15,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:12:15,352 INFO L225 Difference]: With dead ends: 8604 [2019-12-27 18:12:15,353 INFO L226 Difference]: Without dead ends: 8436 [2019-12-27 18:12:15,354 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 18:12:15,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8436 states. [2019-12-27 18:12:15,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8436 to 8436. [2019-12-27 18:12:15,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8436 states. [2019-12-27 18:12:15,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8436 states to 8436 states and 27590 transitions. [2019-12-27 18:12:15,798 INFO L78 Accepts]: Start accepts. Automaton has 8436 states and 27590 transitions. Word has length 3 [2019-12-27 18:12:15,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:12:15,799 INFO L462 AbstractCegarLoop]: Abstraction has 8436 states and 27590 transitions. [2019-12-27 18:12:15,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:12:15,799 INFO L276 IsEmpty]: Start isEmpty. Operand 8436 states and 27590 transitions. [2019-12-27 18:12:15,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 18:12:15,801 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:12:15,802 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:12:15,802 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:12:15,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:12:15,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1596153002, now seen corresponding path program 1 times [2019-12-27 18:12:15,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:12:15,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970229712] [2019-12-27 18:12:15,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:12:15,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:12:15,908 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 18:12:15,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970229712] [2019-12-27 18:12:15,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:12:15,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:12:15,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1394346990] [2019-12-27 18:12:15,910 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:12:15,912 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:12:15,915 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 18:12:15,915 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:12:15,915 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:12:15,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:12:15,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:12:15,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:12:15,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:12:15,918 INFO L87 Difference]: Start difference. First operand 8436 states and 27590 transitions. Second operand 4 states. [2019-12-27 18:12:16,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:12:16,378 INFO L93 Difference]: Finished difference Result 13130 states and 41153 transitions. [2019-12-27 18:12:16,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:12:16,379 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 18:12:16,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:12:16,583 INFO L225 Difference]: With dead ends: 13130 [2019-12-27 18:12:16,584 INFO L226 Difference]: Without dead ends: 13123 [2019-12-27 18:12:16,584 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 18:12:16,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13123 states. [2019-12-27 18:12:16,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13123 to 11988. [2019-12-27 18:12:16,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11988 states. [2019-12-27 18:12:17,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11988 states to 11988 states and 38075 transitions. [2019-12-27 18:12:17,003 INFO L78 Accepts]: Start accepts. Automaton has 11988 states and 38075 transitions. Word has length 11 [2019-12-27 18:12:17,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:12:17,003 INFO L462 AbstractCegarLoop]: Abstraction has 11988 states and 38075 transitions. [2019-12-27 18:12:17,004 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:12:17,004 INFO L276 IsEmpty]: Start isEmpty. Operand 11988 states and 38075 transitions. [2019-12-27 18:12:17,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 18:12:17,006 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:12:17,006 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:12:17,007 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:12:17,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:12:17,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1194917716, now seen corresponding path program 1 times [2019-12-27 18:12:17,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:12:17,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225545575] [2019-12-27 18:12:17,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:12:17,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:12:17,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:12:17,094 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225545575] [2019-12-27 18:12:17,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:12:17,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:12:17,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1585961753] [2019-12-27 18:12:17,095 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:12:17,096 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:12:17,098 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 18:12:17,098 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:12:17,098 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:12:17,098 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:12:17,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:12:17,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:12:17,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:12:17,099 INFO L87 Difference]: Start difference. First operand 11988 states and 38075 transitions. Second operand 4 states. [2019-12-27 18:12:17,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:12:17,976 INFO L93 Difference]: Finished difference Result 14736 states and 46267 transitions. [2019-12-27 18:12:17,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:12:17,977 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 18:12:17,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:12:18,022 INFO L225 Difference]: With dead ends: 14736 [2019-12-27 18:12:18,023 INFO L226 Difference]: Without dead ends: 14736 [2019-12-27 18:12:18,023 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 18:12:18,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14736 states. [2019-12-27 18:12:18,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14736 to 13160. [2019-12-27 18:12:18,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13160 states. [2019-12-27 18:12:18,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13160 states to 13160 states and 41689 transitions. [2019-12-27 18:12:18,451 INFO L78 Accepts]: Start accepts. Automaton has 13160 states and 41689 transitions. Word has length 11 [2019-12-27 18:12:18,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:12:18,454 INFO L462 AbstractCegarLoop]: Abstraction has 13160 states and 41689 transitions. [2019-12-27 18:12:18,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:12:18,455 INFO L276 IsEmpty]: Start isEmpty. Operand 13160 states and 41689 transitions. [2019-12-27 18:12:18,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 18:12:18,463 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:12:18,463 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:12:18,463 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:12:18,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:12:18,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1502155024, now seen corresponding path program 1 times [2019-12-27 18:12:18,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:12:18,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373700972] [2019-12-27 18:12:18,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:12:18,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:12:18,595 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 18:12:18,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373700972] [2019-12-27 18:12:18,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:12:18,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:12:18,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [911003544] [2019-12-27 18:12:18,599 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:12:18,602 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:12:18,606 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 29 states and 39 transitions. [2019-12-27 18:12:18,606 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:12:18,608 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:12:18,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:12:18,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:12:18,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:12:18,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:12:18,609 INFO L87 Difference]: Start difference. First operand 13160 states and 41689 transitions. Second operand 5 states. [2019-12-27 18:12:19,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:12:19,186 INFO L93 Difference]: Finished difference Result 17572 states and 54523 transitions. [2019-12-27 18:12:19,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 18:12:19,187 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-27 18:12:19,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:12:19,246 INFO L225 Difference]: With dead ends: 17572 [2019-12-27 18:12:19,246 INFO L226 Difference]: Without dead ends: 17565 [2019-12-27 18:12:19,247 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 18:12:19,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17565 states. [2019-12-27 18:12:19,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17565 to 13105. [2019-12-27 18:12:19,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13105 states. [2019-12-27 18:12:19,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13105 states to 13105 states and 41426 transitions. [2019-12-27 18:12:19,654 INFO L78 Accepts]: Start accepts. Automaton has 13105 states and 41426 transitions. Word has length 17 [2019-12-27 18:12:19,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:12:19,654 INFO L462 AbstractCegarLoop]: Abstraction has 13105 states and 41426 transitions. [2019-12-27 18:12:19,654 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:12:19,654 INFO L276 IsEmpty]: Start isEmpty. Operand 13105 states and 41426 transitions. [2019-12-27 18:12:19,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 18:12:19,666 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:12:19,667 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] [2019-12-27 18:12:19,667 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:12:19,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:12:19,667 INFO L82 PathProgramCache]: Analyzing trace with hash 933350131, now seen corresponding path program 1 times [2019-12-27 18:12:19,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:12:19,668 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561514539] [2019-12-27 18:12:19,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:12:19,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:12:19,711 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 18:12:19,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561514539] [2019-12-27 18:12:19,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:12:19,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:12:19,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1285564475] [2019-12-27 18:12:19,712 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:12:19,718 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:12:19,725 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 18:12:19,725 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:12:19,725 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:12:19,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:12:19,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:12:19,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:12:19,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:12:19,727 INFO L87 Difference]: Start difference. First operand 13105 states and 41426 transitions. Second operand 3 states. [2019-12-27 18:12:19,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:12:19,868 INFO L93 Difference]: Finished difference Result 16057 states and 50095 transitions. [2019-12-27 18:12:19,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:12:19,869 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-12-27 18:12:19,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:12:20,018 INFO L225 Difference]: With dead ends: 16057 [2019-12-27 18:12:20,018 INFO L226 Difference]: Without dead ends: 16057 [2019-12-27 18:12:20,018 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 18:12:20,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16057 states. [2019-12-27 18:12:20,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16057 to 14186. [2019-12-27 18:12:20,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14186 states. [2019-12-27 18:12:20,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14186 states to 14186 states and 44710 transitions. [2019-12-27 18:12:20,409 INFO L78 Accepts]: Start accepts. Automaton has 14186 states and 44710 transitions. Word has length 25 [2019-12-27 18:12:20,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:12:20,410 INFO L462 AbstractCegarLoop]: Abstraction has 14186 states and 44710 transitions. [2019-12-27 18:12:20,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:12:20,410 INFO L276 IsEmpty]: Start isEmpty. Operand 14186 states and 44710 transitions. [2019-12-27 18:12:20,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 18:12:20,422 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:12:20,422 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] [2019-12-27 18:12:20,422 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:12:20,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:12:20,423 INFO L82 PathProgramCache]: Analyzing trace with hash 933194542, now seen corresponding path program 1 times [2019-12-27 18:12:20,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:12:20,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387230873] [2019-12-27 18:12:20,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:12:20,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:12:20,497 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 18:12:20,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387230873] [2019-12-27 18:12:20,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:12:20,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:12:20,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1779024671] [2019-12-27 18:12:20,501 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:12:20,506 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:12:20,512 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 18:12:20,512 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:12:20,512 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:12:20,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:12:20,513 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:12:20,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:12:20,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:12:20,514 INFO L87 Difference]: Start difference. First operand 14186 states and 44710 transitions. Second operand 4 states. [2019-12-27 18:12:20,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:12:20,554 INFO L93 Difference]: Finished difference Result 2296 states and 5226 transitions. [2019-12-27 18:12:20,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 18:12:20,555 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 18:12:20,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:12:20,562 INFO L225 Difference]: With dead ends: 2296 [2019-12-27 18:12:20,562 INFO L226 Difference]: Without dead ends: 2019 [2019-12-27 18:12:20,562 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 18:12:20,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2019 states. [2019-12-27 18:12:20,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2019 to 2019. [2019-12-27 18:12:20,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2019 states. [2019-12-27 18:12:20,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2019 states to 2019 states and 4460 transitions. [2019-12-27 18:12:20,595 INFO L78 Accepts]: Start accepts. Automaton has 2019 states and 4460 transitions. Word has length 25 [2019-12-27 18:12:20,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:12:20,595 INFO L462 AbstractCegarLoop]: Abstraction has 2019 states and 4460 transitions. [2019-12-27 18:12:20,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:12:20,596 INFO L276 IsEmpty]: Start isEmpty. Operand 2019 states and 4460 transitions. [2019-12-27 18:12:20,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 18:12:20,599 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:12:20,599 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] [2019-12-27 18:12:20,600 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:12:20,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:12:20,600 INFO L82 PathProgramCache]: Analyzing trace with hash -568804126, now seen corresponding path program 1 times [2019-12-27 18:12:20,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:12:20,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49131935] [2019-12-27 18:12:20,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:12:20,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:12:20,684 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 18:12:20,687 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49131935] [2019-12-27 18:12:20,687 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:12:20,687 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 18:12:20,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1964510796] [2019-12-27 18:12:20,688 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:12:20,697 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:12:20,709 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 38 states and 37 transitions. [2019-12-27 18:12:20,710 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:12:20,710 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:12:20,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:12:20,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:12:20,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:12:20,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:12:20,712 INFO L87 Difference]: Start difference. First operand 2019 states and 4460 transitions. Second operand 5 states. [2019-12-27 18:12:20,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:12:20,759 INFO L93 Difference]: Finished difference Result 416 states and 758 transitions. [2019-12-27 18:12:20,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:12:20,761 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-27 18:12:20,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:12:20,761 INFO L225 Difference]: With dead ends: 416 [2019-12-27 18:12:20,761 INFO L226 Difference]: Without dead ends: 371 [2019-12-27 18:12:20,762 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:12:20,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2019-12-27 18:12:20,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 343. [2019-12-27 18:12:20,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-12-27 18:12:20,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 618 transitions. [2019-12-27 18:12:20,767 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 618 transitions. Word has length 37 [2019-12-27 18:12:20,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:12:20,768 INFO L462 AbstractCegarLoop]: Abstraction has 343 states and 618 transitions. [2019-12-27 18:12:20,768 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:12:20,768 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 618 transitions. [2019-12-27 18:12:20,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 18:12:20,770 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:12:20,770 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] [2019-12-27 18:12:20,770 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:12:20,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:12:20,770 INFO L82 PathProgramCache]: Analyzing trace with hash -506418728, now seen corresponding path program 1 times [2019-12-27 18:12:20,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:12:20,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4085202] [2019-12-27 18:12:20,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:12:20,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:12:20,869 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 18:12:20,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4085202] [2019-12-27 18:12:20,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:12:20,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:12:20,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2084391523] [2019-12-27 18:12:20,870 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:12:20,883 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:12:20,948 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 83 states and 112 transitions. [2019-12-27 18:12:20,948 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:12:20,973 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 18:12:20,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:12:20,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:12:20,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:12:20,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:12:20,974 INFO L87 Difference]: Start difference. First operand 343 states and 618 transitions. Second operand 5 states. [2019-12-27 18:12:21,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:12:21,127 INFO L93 Difference]: Finished difference Result 438 states and 765 transitions. [2019-12-27 18:12:21,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 18:12:21,127 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-12-27 18:12:21,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:12:21,129 INFO L225 Difference]: With dead ends: 438 [2019-12-27 18:12:21,129 INFO L226 Difference]: Without dead ends: 438 [2019-12-27 18:12:21,129 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:12:21,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2019-12-27 18:12:21,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 331. [2019-12-27 18:12:21,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2019-12-27 18:12:21,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 582 transitions. [2019-12-27 18:12:21,136 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 582 transitions. Word has length 52 [2019-12-27 18:12:21,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:12:21,136 INFO L462 AbstractCegarLoop]: Abstraction has 331 states and 582 transitions. [2019-12-27 18:12:21,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:12:21,137 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 582 transitions. [2019-12-27 18:12:21,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 18:12:21,138 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:12:21,139 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] [2019-12-27 18:12:21,139 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:12:21,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:12:21,139 INFO L82 PathProgramCache]: Analyzing trace with hash -156128935, now seen corresponding path program 1 times [2019-12-27 18:12:21,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:12:21,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118599858] [2019-12-27 18:12:21,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:12:21,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:12:21,250 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 18:12:21,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118599858] [2019-12-27 18:12:21,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:12:21,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 18:12:21,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1301892005] [2019-12-27 18:12:21,252 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:12:21,271 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:12:21,305 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 64 states and 73 transitions. [2019-12-27 18:12:21,305 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:12:21,309 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 18:12:21,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:12:21,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:12:21,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:12:21,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:12:21,310 INFO L87 Difference]: Start difference. First operand 331 states and 582 transitions. Second operand 5 states. [2019-12-27 18:12:21,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:12:21,481 INFO L93 Difference]: Finished difference Result 487 states and 864 transitions. [2019-12-27 18:12:21,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 18:12:21,483 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-12-27 18:12:21,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:12:21,484 INFO L225 Difference]: With dead ends: 487 [2019-12-27 18:12:21,484 INFO L226 Difference]: Without dead ends: 487 [2019-12-27 18:12:21,485 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 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 18:12:21,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2019-12-27 18:12:21,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 422. [2019-12-27 18:12:21,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2019-12-27 18:12:21,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 748 transitions. [2019-12-27 18:12:21,491 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 748 transitions. Word has length 53 [2019-12-27 18:12:21,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:12:21,491 INFO L462 AbstractCegarLoop]: Abstraction has 422 states and 748 transitions. [2019-12-27 18:12:21,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:12:21,492 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 748 transitions. [2019-12-27 18:12:21,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 18:12:21,493 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:12:21,493 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] [2019-12-27 18:12:21,493 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:12:21,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:12:21,494 INFO L82 PathProgramCache]: Analyzing trace with hash -2022513439, now seen corresponding path program 2 times [2019-12-27 18:12:21,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:12:21,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506273932] [2019-12-27 18:12:21,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:12:21,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:12:21,602 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 18:12:21,603 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506273932] [2019-12-27 18:12:21,603 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:12:21,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:12:21,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1891857888] [2019-12-27 18:12:21,604 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:12:21,617 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:12:21,647 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 72 states and 89 transitions. [2019-12-27 18:12:21,647 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:12:21,648 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:12:21,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:12:21,648 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:12:21,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:12:21,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:12:21,649 INFO L87 Difference]: Start difference. First operand 422 states and 748 transitions. Second operand 3 states. [2019-12-27 18:12:21,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:12:21,705 INFO L93 Difference]: Finished difference Result 422 states and 747 transitions. [2019-12-27 18:12:21,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:12:21,705 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-27 18:12:21,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:12:21,706 INFO L225 Difference]: With dead ends: 422 [2019-12-27 18:12:21,707 INFO L226 Difference]: Without dead ends: 422 [2019-12-27 18:12:21,707 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 18:12:21,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2019-12-27 18:12:21,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 331. [2019-12-27 18:12:21,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2019-12-27 18:12:21,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 581 transitions. [2019-12-27 18:12:21,712 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 581 transitions. Word has length 53 [2019-12-27 18:12:21,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:12:21,713 INFO L462 AbstractCegarLoop]: Abstraction has 331 states and 581 transitions. [2019-12-27 18:12:21,713 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:12:21,713 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 581 transitions. [2019-12-27 18:12:21,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 18:12:21,714 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:12:21,714 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] [2019-12-27 18:12:21,715 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:12:21,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:12:21,715 INFO L82 PathProgramCache]: Analyzing trace with hash -731863498, now seen corresponding path program 1 times [2019-12-27 18:12:21,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:12:21,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772570804] [2019-12-27 18:12:21,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:12:21,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:12:21,888 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 18:12:21,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772570804] [2019-12-27 18:12:21,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:12:21,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 18:12:21,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2019218885] [2019-12-27 18:12:21,889 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:12:21,903 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:12:21,927 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 65 states and 74 transitions. [2019-12-27 18:12:21,927 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:12:21,927 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:12:21,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 18:12:21,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:12:21,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 18:12:21,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:12:21,929 INFO L87 Difference]: Start difference. First operand 331 states and 581 transitions. Second operand 6 states. [2019-12-27 18:12:21,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:12:21,996 INFO L93 Difference]: Finished difference Result 510 states and 893 transitions. [2019-12-27 18:12:21,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 18:12:21,996 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-12-27 18:12:21,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:12:21,997 INFO L225 Difference]: With dead ends: 510 [2019-12-27 18:12:21,997 INFO L226 Difference]: Without dead ends: 221 [2019-12-27 18:12:21,998 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-12-27 18:12:21,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-12-27 18:12:22,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2019-12-27 18:12:22,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-12-27 18:12:22,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 391 transitions. [2019-12-27 18:12:22,002 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 391 transitions. Word has length 54 [2019-12-27 18:12:22,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:12:22,002 INFO L462 AbstractCegarLoop]: Abstraction has 221 states and 391 transitions. [2019-12-27 18:12:22,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 18:12:22,002 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 391 transitions. [2019-12-27 18:12:22,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 18:12:22,003 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:12:22,003 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] [2019-12-27 18:12:22,003 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:12:22,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:12:22,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1034362442, now seen corresponding path program 2 times [2019-12-27 18:12:22,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:12:22,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132149544] [2019-12-27 18:12:22,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:12:22,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:12:22,382 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 18:12:22,382 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132149544] [2019-12-27 18:12:22,382 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:12:22,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 18:12:22,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1797308880] [2019-12-27 18:12:22,383 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:12:22,407 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:12:22,501 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 91 states and 115 transitions. [2019-12-27 18:12:22,501 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:12:22,677 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 18:12:22,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 18:12:22,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:12:22,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 18:12:22,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2019-12-27 18:12:22,680 INFO L87 Difference]: Start difference. First operand 221 states and 391 transitions. Second operand 16 states. [2019-12-27 18:12:24,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:12:24,710 INFO L93 Difference]: Finished difference Result 566 states and 960 transitions. [2019-12-27 18:12:24,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-27 18:12:24,711 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 54 [2019-12-27 18:12:24,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:12:24,713 INFO L225 Difference]: With dead ends: 566 [2019-12-27 18:12:24,713 INFO L226 Difference]: Without dead ends: 533 [2019-12-27 18:12:24,715 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=284, Invalid=1356, Unknown=0, NotChecked=0, Total=1640 [2019-12-27 18:12:24,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2019-12-27 18:12:24,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 321. [2019-12-27 18:12:24,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2019-12-27 18:12:24,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 562 transitions. [2019-12-27 18:12:24,723 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 562 transitions. Word has length 54 [2019-12-27 18:12:24,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:12:24,723 INFO L462 AbstractCegarLoop]: Abstraction has 321 states and 562 transitions. [2019-12-27 18:12:24,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 18:12:24,723 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 562 transitions. [2019-12-27 18:12:24,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 18:12:24,724 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:12:24,724 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] [2019-12-27 18:12:24,725 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:12:24,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:12:24,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1326135034, now seen corresponding path program 3 times [2019-12-27 18:12:24,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:12:24,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145778281] [2019-12-27 18:12:24,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:12:24,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:12:25,115 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 18:12:25,116 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145778281] [2019-12-27 18:12:25,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:12:25,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 18:12:25,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [97377491] [2019-12-27 18:12:25,116 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:12:25,130 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:12:25,199 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 86 states and 114 transitions. [2019-12-27 18:12:25,199 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:12:25,264 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 18:12:25,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 18:12:25,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:12:25,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 18:12:25,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-12-27 18:12:25,266 INFO L87 Difference]: Start difference. First operand 321 states and 562 transitions. Second operand 15 states. [2019-12-27 18:12:26,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:12:26,134 INFO L93 Difference]: Finished difference Result 507 states and 855 transitions. [2019-12-27 18:12:26,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 18:12:26,134 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 54 [2019-12-27 18:12:26,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:12:26,136 INFO L225 Difference]: With dead ends: 507 [2019-12-27 18:12:26,136 INFO L226 Difference]: Without dead ends: 474 [2019-12-27 18:12:26,137 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=144, Invalid=612, Unknown=0, NotChecked=0, Total=756 [2019-12-27 18:12:26,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2019-12-27 18:12:26,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 331. [2019-12-27 18:12:26,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2019-12-27 18:12:26,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 580 transitions. [2019-12-27 18:12:26,143 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 580 transitions. Word has length 54 [2019-12-27 18:12:26,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:12:26,143 INFO L462 AbstractCegarLoop]: Abstraction has 331 states and 580 transitions. [2019-12-27 18:12:26,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 18:12:26,144 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 580 transitions. [2019-12-27 18:12:26,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 18:12:26,144 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:12:26,145 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] [2019-12-27 18:12:26,145 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:12:26,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:12:26,145 INFO L82 PathProgramCache]: Analyzing trace with hash 202960694, now seen corresponding path program 4 times [2019-12-27 18:12:26,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:12:26,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395701565] [2019-12-27 18:12:26,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:12:26,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:12:26,695 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 18:12:26,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395701565] [2019-12-27 18:12:26,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:12:26,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 18:12:26,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1723225687] [2019-12-27 18:12:26,696 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:12:26,710 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:12:26,745 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 106 states and 155 transitions. [2019-12-27 18:12:26,745 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:12:26,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:12:26,890 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 33 [2019-12-27 18:12:26,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:12:27,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:12:27,458 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 18:12:27,458 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-12-27 18:12:27,458 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:12:27,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-12-27 18:12:27,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=522, Unknown=0, NotChecked=0, Total=600 [2019-12-27 18:12:27,459 INFO L87 Difference]: Start difference. First operand 331 states and 580 transitions. Second operand 25 states. [2019-12-27 18:12:29,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:12:29,260 INFO L93 Difference]: Finished difference Result 485 states and 813 transitions. [2019-12-27 18:12:29,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 18:12:29,261 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 54 [2019-12-27 18:12:29,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:12:29,262 INFO L225 Difference]: With dead ends: 485 [2019-12-27 18:12:29,262 INFO L226 Difference]: Without dead ends: 452 [2019-12-27 18:12:29,264 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=257, Invalid=1303, Unknown=0, NotChecked=0, Total=1560 [2019-12-27 18:12:29,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2019-12-27 18:12:29,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 329. [2019-12-27 18:12:29,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-12-27 18:12:29,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 576 transitions. [2019-12-27 18:12:29,270 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 576 transitions. Word has length 54 [2019-12-27 18:12:29,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:12:29,270 INFO L462 AbstractCegarLoop]: Abstraction has 329 states and 576 transitions. [2019-12-27 18:12:29,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-12-27 18:12:29,271 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 576 transitions. [2019-12-27 18:12:29,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 18:12:29,272 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:12:29,272 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] [2019-12-27 18:12:29,272 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:12:29,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:12:29,272 INFO L82 PathProgramCache]: Analyzing trace with hash -91775718, now seen corresponding path program 5 times [2019-12-27 18:12:29,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:12:29,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111838987] [2019-12-27 18:12:29,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:12:29,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 18:12:29,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 18:12:29,388 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 18:12:29,388 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 18:12:29,393 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] ULTIMATE.startENTRY-->L779: Formula: (let ((.cse0 (store |v_#valid_47| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2009~0.base_24| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2009~0.base_24|) |v_ULTIMATE.start_main_~#t2009~0.offset_19| 0))) (= v_~y$r_buff1_thd0~0_329 0) (= v_~y$w_buff0_used~0_834 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t2009~0.base_24|) (= 0 v_~__unbuffered_cnt~0_61) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2009~0.base_24|)) (= 0 v_~weak$$choice0~0_14) (= v_~y$r_buff1_thd1~0_200 0) (= 0 v_~x~0_147) (= 0 |v_ULTIMATE.start_main_~#t2009~0.offset_19|) (= |v_#NULL.offset_3| 0) (= |v_#valid_45| (store .cse0 |v_ULTIMATE.start_main_~#t2009~0.base_24| 1)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t2009~0.base_24| 4)) (= v_~main$tmp_guard1~0_27 0) (= v_~y$read_delayed~0_6 0) (= 0 v_~__unbuffered_p1_EAX~0_29) (= 0 v_~y$r_buff1_thd2~0_208) (= 0 v_~y$r_buff0_thd2~0_162) (= v_~y$mem_tmp~0_19 0) (= v_~weak$$choice2~0_141 0) (= v_~y$w_buff1_used~0_547 0) (= v_~y$r_buff0_thd1~0_297 0) (= 0 v_~y$flush_delayed~0_36) (= v_~main$tmp_guard0~0_33 0) (= 0 |v_#NULL.base_3|) (= 0 v_~y$w_buff0~0_485) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~y$r_buff0_thd0~0_416 0) (= v_~y~0_146 0) (< 0 |v_#StackHeapBarrier_13|) (= v_~y$w_buff1~0_308 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_41|, ULTIMATE.start_main_~#t2009~0.offset=|v_ULTIMATE.start_main_~#t2009~0.offset_19|, #NULL.offset=|v_#NULL.offset_3|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_35|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_145|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_48|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_37|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_36|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$mem_tmp~0=v_~y$mem_tmp~0_19, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_29, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_297, ~y$flush_delayed~0=v_~y$flush_delayed~0_36, #length=|v_#length_13|, ULTIMATE.start_main_~#t2010~0.base=|v_ULTIMATE.start_main_~#t2010~0.base_19|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_36|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_38|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_21|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_27|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_41|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_44|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_38|, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_36|, ~y$w_buff1~0=v_~y$w_buff1~0_308, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_162, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_329, ~x~0=v_~x~0_147, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_834, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_36|, ULTIMATE.start_main_~#t2009~0.base=|v_ULTIMATE.start_main_~#t2009~0.base_24|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_33|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_27, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_43|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_33|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_42|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_34|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_200, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_34|, ~y$w_buff0~0=v_~y$w_buff0~0_485, ~y~0=v_~y~0_146, ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_29|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_21|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_33|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_53|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_27|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_33, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_35|, #NULL.base=|v_#NULL.base_3|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_40|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_208, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_37|, ULTIMATE.start_main_~#t2010~0.offset=|v_ULTIMATE.start_main_~#t2010~0.offset_16|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_416, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_14|, ~weak$$choice2~0=v_~weak$$choice2~0_141, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_547} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_~#t2009~0.offset, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_~#t2010~0.base, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_~#t2009~0.base, ULTIMATE.start_main_#t~ite25, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30, ~y$w_buff0~0, ~y~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t2010~0.offset, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 18:12:29,394 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [675] [675] L779-1-->L781: Formula: (and (= |v_ULTIMATE.start_main_~#t2010~0.offset_10| 0) (not (= |v_ULTIMATE.start_main_~#t2010~0.base_11| 0)) (= (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t2010~0.base_11| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t2010~0.base_11|) |v_ULTIMATE.start_main_~#t2010~0.offset_10| 1)) |v_#memory_int_7|) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2010~0.base_11|)) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t2010~0.base_11| 4) |v_#length_9|) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2010~0.base_11| 1)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t2010~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t2010~0.base=|v_ULTIMATE.start_main_~#t2010~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t2010~0.offset=|v_ULTIMATE.start_main_~#t2010~0.offset_10|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_6|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2010~0.base, ULTIMATE.start_main_~#t2010~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length] because there is no mapped edge [2019-12-27 18:12:29,395 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [638] [638] P0ENTRY-->L4-3: Formula: (and (= v_~y$w_buff1~0_121 v_~y$w_buff0~0_204) (= 2 v_~y$w_buff0~0_203) (= v_P0Thread1of1ForFork0_~arg.base_96 |v_P0Thread1of1ForFork0_#in~arg.base_96|) (= 0 (mod v_~y$w_buff1_used~0_210 256)) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_96|) (= v_P0Thread1of1ForFork0_~arg.offset_96 |v_P0Thread1of1ForFork0_#in~arg.offset_96|) (= v_~y$w_buff0_used~0_350 v_~y$w_buff1_used~0_210) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_100 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_96|) (= v_~y$w_buff0_used~0_349 1)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_96|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_350, ~y$w_buff0~0=v_~y$w_buff0~0_204, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_96|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_96|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_349, ~y$w_buff1~0=v_~y$w_buff1~0_121, ~y$w_buff0~0=v_~y$w_buff0~0_203, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_100, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_96|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_96, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_96|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_96, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_210} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 18:12:29,397 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [642] [642] L756-2-->L756-4: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In1038667487 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In1038667487 256)))) (or (and (= ~y$w_buff1~0_In1038667487 |P1Thread1of1ForFork1_#t~ite9_Out1038667487|) (not .cse0) (not .cse1)) (and (= ~y~0_In1038667487 |P1Thread1of1ForFork1_#t~ite9_Out1038667487|) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1038667487, ~y$w_buff1~0=~y$w_buff1~0_In1038667487, ~y~0=~y~0_In1038667487, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1038667487} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1038667487, ~y$w_buff1~0=~y$w_buff1~0_In1038667487, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out1038667487|, ~y~0=~y~0_In1038667487, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1038667487} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-27 18:12:29,397 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [621] [621] L756-4-->L757: Formula: (= v_~y~0_41 |v_P1Thread1of1ForFork1_#t~ite9_10|) InVars {P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_10|} OutVars{P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_9|, P1Thread1of1ForFork1_#t~ite10=|v_P1Thread1of1ForFork1_#t~ite10_15|, ~y~0=v_~y~0_41} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10, ~y~0] because there is no mapped edge [2019-12-27 18:12:29,397 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [646] [646] L757-->L757-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In2025365087 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In2025365087 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out2025365087| 0)) (and (= ~y$w_buff0_used~0_In2025365087 |P1Thread1of1ForFork1_#t~ite11_Out2025365087|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2025365087, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2025365087} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2025365087, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2025365087, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out2025365087|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 18:12:29,398 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L758-->L758-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In1010450994 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In1010450994 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1010450994 256))) (.cse1 (= (mod ~y$r_buff1_thd2~0_In1010450994 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite12_Out1010450994| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~y$w_buff1_used~0_In1010450994 |P1Thread1of1ForFork1_#t~ite12_Out1010450994|) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1010450994, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1010450994, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1010450994, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1010450994} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1010450994, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1010450994, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1010450994, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out1010450994|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1010450994} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 18:12:29,398 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L759-->L759-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In1087865659 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In1087865659 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite13_Out1087865659| ~y$r_buff0_thd2~0_In1087865659)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite13_Out1087865659| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1087865659, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1087865659} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1087865659, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1087865659, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out1087865659|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-27 18:12:29,399 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L760-->L760-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In1727692568 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In1727692568 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1727692568 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In1727692568 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite14_Out1727692568| ~y$r_buff1_thd2~0_In1727692568) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork1_#t~ite14_Out1727692568| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1727692568, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1727692568, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1727692568, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1727692568} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1727692568, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1727692568, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1727692568, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1727692568|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1727692568} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 18:12:29,399 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L760-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_39 1) v_~__unbuffered_cnt~0_38) (= |v_P1Thread1of1ForFork1_#t~ite14_30| v_~y$r_buff1_thd2~0_91) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_30|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_91, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_29|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 18:12:29,399 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [655] [655] L737-->L737-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-97593368 256))) (.cse1 (= (mod ~y$r_buff0_thd1~0_In-97593368 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out-97593368| ~y$w_buff0_used~0_In-97593368)) (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out-97593368| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-97593368, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-97593368} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-97593368|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-97593368, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-97593368} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 18:12:29,400 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [641] [641] L738-->L738-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd1~0_In-1956089634 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1956089634 256))) (.cse2 (= (mod ~y$r_buff0_thd1~0_In-1956089634 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1956089634 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite6_Out-1956089634| ~y$w_buff1_used~0_In-1956089634) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-1956089634|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1956089634, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1956089634, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1956089634, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1956089634} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1956089634|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1956089634, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1956089634, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1956089634, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1956089634} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 18:12:29,401 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L739-->L740: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In1478994887 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1478994887 256)))) (or (and (= ~y$r_buff0_thd1~0_Out1478994887 ~y$r_buff0_thd1~0_In1478994887) (or .cse0 .cse1)) (and (not .cse0) (= 0 ~y$r_buff0_thd1~0_Out1478994887) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1478994887, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1478994887} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1478994887, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1478994887|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out1478994887} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 18:12:29,401 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L740-->L740-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In202327589 256))) (.cse2 (= (mod ~y$r_buff0_thd1~0_In202327589 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd1~0_In202327589 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In202327589 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite8_Out202327589| ~y$r_buff1_thd1~0_In202327589)) (and (= |P0Thread1of1ForFork0_#t~ite8_Out202327589| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In202327589, ~y$w_buff0_used~0=~y$w_buff0_used~0_In202327589, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In202327589, ~y$w_buff1_used~0=~y$w_buff1_used~0_In202327589} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In202327589, ~y$w_buff0_used~0=~y$w_buff0_used~0_In202327589, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out202327589|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In202327589, ~y$w_buff1_used~0=~y$w_buff1_used~0_In202327589} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 18:12:29,401 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L740-2-->P0EXIT: Formula: (and (= v_~y$r_buff1_thd1~0_80 |v_P0Thread1of1ForFork0_#t~ite8_30|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_31 (+ v_~__unbuffered_cnt~0_32 1))) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_80, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_29|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 18:12:29,402 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [577] [577] L785-->L787-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_4 256) 0)) (or (= (mod v_~y$w_buff0_used~0_67 256) 0) (= 0 (mod v_~y$r_buff0_thd0~0_44 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_67, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_44, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_67, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_44, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 18:12:29,403 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [656] [656] L787-2-->L787-5: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In727695262 256) 0)) (.cse0 (= |ULTIMATE.start_main_#t~ite17_Out727695262| |ULTIMATE.start_main_#t~ite18_Out727695262|)) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In727695262 256)))) (or (and (= ~y~0_In727695262 |ULTIMATE.start_main_#t~ite17_Out727695262|) .cse0 (or .cse1 .cse2)) (and (not .cse1) .cse0 (= |ULTIMATE.start_main_#t~ite17_Out727695262| ~y$w_buff1~0_In727695262) (not .cse2)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In727695262, ~y~0=~y~0_In727695262, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In727695262, ~y$w_buff1_used~0=~y$w_buff1_used~0_In727695262} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out727695262|, ~y$w_buff1~0=~y$w_buff1~0_In727695262, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out727695262|, ~y~0=~y~0_In727695262, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In727695262, ~y$w_buff1_used~0=~y$w_buff1_used~0_In727695262} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18] because there is no mapped edge [2019-12-27 18:12:29,403 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L788-->L788-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1371308673 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1371308673 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite19_Out1371308673| 0) (not .cse1)) (and (= ~y$w_buff0_used~0_In1371308673 |ULTIMATE.start_main_#t~ite19_Out1371308673|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1371308673, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1371308673} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1371308673, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out1371308673|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1371308673} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-27 18:12:29,404 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L789-->L789-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In409921920 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In409921920 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In409921920 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In409921920 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite20_Out409921920| 0)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite20_Out409921920| ~y$w_buff1_used~0_In409921920)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In409921920, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In409921920, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In409921920, ~y$w_buff1_used~0=~y$w_buff1_used~0_In409921920} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In409921920, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In409921920, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out409921920|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In409921920, ~y$w_buff1_used~0=~y$w_buff1_used~0_In409921920} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 18:12:29,405 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L790-->L790-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1196627928 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In1196627928 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite21_Out1196627928| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite21_Out1196627928| ~y$r_buff0_thd0~0_In1196627928) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1196627928, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1196627928} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1196627928, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1196627928, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out1196627928|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 18:12:29,406 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L791-->L791-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-1733043920 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-1733043920 256))) (.cse2 (= (mod ~y$r_buff0_thd0~0_In-1733043920 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1733043920 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite22_Out-1733043920| ~y$r_buff1_thd0~0_In-1733043920)) (and (= |ULTIMATE.start_main_#t~ite22_Out-1733043920| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1733043920, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1733043920, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1733043920, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1733043920} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1733043920, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1733043920, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1733043920, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-1733043920|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1733043920} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 18:12:29,408 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L800-->L800-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1381135102 256)))) (or (and (= |ULTIMATE.start_main_#t~ite31_In-1381135102| |ULTIMATE.start_main_#t~ite31_Out-1381135102|) (not .cse0) (= ~y$w_buff1~0_In-1381135102 |ULTIMATE.start_main_#t~ite32_Out-1381135102|)) (and .cse0 (= |ULTIMATE.start_main_#t~ite31_Out-1381135102| ~y$w_buff1~0_In-1381135102) (= |ULTIMATE.start_main_#t~ite31_Out-1381135102| |ULTIMATE.start_main_#t~ite32_Out-1381135102|) (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-1381135102 256) 0))) (or (and (= (mod ~y$w_buff1_used~0_In-1381135102 256) 0) .cse1) (and (= 0 (mod ~y$r_buff1_thd0~0_In-1381135102 256)) .cse1) (= 0 (mod ~y$w_buff0_used~0_In-1381135102 256))))))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1381135102, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1381135102, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1381135102, ~weak$$choice2~0=~weak$$choice2~0_In-1381135102, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_In-1381135102|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1381135102, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1381135102} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1381135102, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1381135102, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1381135102, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out-1381135102|, ~weak$$choice2~0=~weak$$choice2~0_In-1381135102, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_Out-1381135102|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1381135102, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1381135102} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite32] because there is no mapped edge [2019-12-27 18:12:29,410 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [637] [637] L803-->L804: Formula: (and (= v_~y$r_buff0_thd0~0_162 v_~y$r_buff0_thd0~0_163) (not (= (mod v_~weak$$choice2~0_39 256) 0))) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_163, ~weak$$choice2~0=v_~weak$$choice2~0_39} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_9|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_11|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_18|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_162, ~weak$$choice2~0=v_~weak$$choice2~0_39} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39, ~y$r_buff0_thd0~0] because there is no mapped edge [2019-12-27 18:12:29,411 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L806-->L809-1: Formula: (and (= 0 v_~y$flush_delayed~0_24) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6| (mod v_~main$tmp_guard1~0_12 256)) (not (= 0 (mod v_~y$flush_delayed~0_25 256))) (= v_~y~0_106 v_~y$mem_tmp~0_13)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_13, ~y$flush_delayed~0=v_~y$flush_delayed~0_25, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_13, ~y$flush_delayed~0=v_~y$flush_delayed~0_24, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ~y~0=v_~y~0_106, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_22|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~y~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 18:12:29,411 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L809-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 18:12:29,480 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:12:29 BasicIcfg [2019-12-27 18:12:29,480 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 18:12:29,488 INFO L168 Benchmark]: Toolchain (without parser) took 22585.63 ms. Allocated memory was 146.3 MB in the beginning and 766.0 MB in the end (delta: 619.7 MB). Free memory was 101.6 MB in the beginning and 519.4 MB in the end (delta: -417.8 MB). Peak memory consumption was 201.9 MB. Max. memory is 7.1 GB. [2019-12-27 18:12:29,488 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 146.3 MB. Free memory was 121.4 MB in the beginning and 121.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 18:12:29,489 INFO L168 Benchmark]: CACSL2BoogieTranslator took 817.24 ms. Allocated memory was 146.3 MB in the beginning and 204.5 MB in the end (delta: 58.2 MB). Free memory was 101.4 MB in the beginning and 158.1 MB in the end (delta: -56.8 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2019-12-27 18:12:29,490 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.88 ms. Allocated memory is still 204.5 MB. Free memory was 158.1 MB in the beginning and 154.8 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-12-27 18:12:29,490 INFO L168 Benchmark]: Boogie Preprocessor took 51.38 ms. Allocated memory is still 204.5 MB. Free memory was 154.8 MB in the beginning and 152.9 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-27 18:12:29,491 INFO L168 Benchmark]: RCFGBuilder took 763.31 ms. Allocated memory is still 204.5 MB. Free memory was 152.9 MB in the beginning and 108.4 MB in the end (delta: 44.5 MB). Peak memory consumption was 44.5 MB. Max. memory is 7.1 GB. [2019-12-27 18:12:29,494 INFO L168 Benchmark]: TraceAbstraction took 20876.37 ms. Allocated memory was 204.5 MB in the beginning and 766.0 MB in the end (delta: 561.5 MB). Free memory was 108.4 MB in the beginning and 519.4 MB in the end (delta: -411.1 MB). Peak memory consumption was 150.5 MB. Max. memory is 7.1 GB. [2019-12-27 18:12:29,500 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.25 ms. Allocated memory is still 146.3 MB. Free memory was 121.4 MB in the beginning and 121.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 817.24 ms. Allocated memory was 146.3 MB in the beginning and 204.5 MB in the end (delta: 58.2 MB). Free memory was 101.4 MB in the beginning and 158.1 MB in the end (delta: -56.8 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 71.88 ms. Allocated memory is still 204.5 MB. Free memory was 158.1 MB in the beginning and 154.8 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 51.38 ms. Allocated memory is still 204.5 MB. Free memory was 154.8 MB in the beginning and 152.9 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 763.31 ms. Allocated memory is still 204.5 MB. Free memory was 152.9 MB in the beginning and 108.4 MB in the end (delta: 44.5 MB). Peak memory consumption was 44.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 20876.37 ms. Allocated memory was 204.5 MB in the beginning and 766.0 MB in the end (delta: 561.5 MB). Free memory was 108.4 MB in the beginning and 519.4 MB in the end (delta: -411.1 MB). Peak memory consumption was 150.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.2s, 146 ProgramPointsBefore, 79 ProgramPointsAfterwards, 180 TransitionsBefore, 91 TransitionsAfterwards, 10418 CoEnabledTransitionPairs, 7 FixpointIterations, 28 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 25 ChoiceCompositions, 3678 VarBasedMoverChecksPositive, 231 VarBasedMoverChecksNegative, 69 SemBasedMoverChecksPositive, 221 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 46090 CheckedPairsTotal, 101 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L779] FCALL, FORK 0 pthread_create(&t2009, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L781] FCALL, FORK 0 pthread_create(&t2010, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L727] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L728] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L729] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L730] 1 y$r_buff0_thd1 = (_Bool)1 [L733] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L750] 2 __unbuffered_p1_EAX = x [L753] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] 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) [L756] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L758] 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 [L759] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L737] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L738] 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 [L783] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L788] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L789] 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 [L790] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L791] 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 [L794] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L795] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L796] 0 y$flush_delayed = weak$$choice2 [L797] 0 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=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=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, 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=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] 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) [L799] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, 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=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L799] 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)) [L800] 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)) [L801] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, 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=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L801] 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)) [L802] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, 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=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L802] 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)) [L804] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, 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=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L804] 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)) [L805] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=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=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 140 locations, 2 error locations. Result: UNSAFE, OverallTime: 20.6s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 8.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1452 SDtfs, 1480 SDslu, 4433 SDs, 0 SdLazy, 3338 SolverSat, 183 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 185 GetRequests, 30 SyntacticMatches, 12 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 687 ImplicationChecksByTransitivity, 4.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14186occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 9811 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 557 NumberOfCodeBlocks, 557 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 489 ConstructedInterpolants, 0 QuantifiedInterpolants, 128994 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...