/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-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi000_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 21:49:14,615 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 21:49:14,618 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 21:49:14,633 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 21:49:14,633 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 21:49:14,635 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 21:49:14,637 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 21:49:14,647 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 21:49:14,649 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 21:49:14,650 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 21:49:14,652 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 21:49:14,654 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 21:49:14,654 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 21:49:14,658 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 21:49:14,660 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 21:49:14,661 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 21:49:14,664 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 21:49:14,666 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 21:49:14,668 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 21:49:14,673 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 21:49:14,677 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 21:49:14,679 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 21:49:14,682 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 21:49:14,683 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 21:49:14,685 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 21:49:14,685 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 21:49:14,685 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 21:49:14,687 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 21:49:14,687 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 21:49:14,689 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 21:49:14,689 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 21:49:14,690 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 21:49:14,690 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 21:49:14,691 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 21:49:14,692 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 21:49:14,692 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 21:49:14,693 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 21:49:14,693 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 21:49:14,693 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 21:49:14,694 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 21:49:14,695 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 21:49:14,695 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-VariableLbe-MCR.epf [2019-12-27 21:49:14,710 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 21:49:14,710 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 21:49:14,711 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 21:49:14,711 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 21:49:14,711 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 21:49:14,712 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 21:49:14,712 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 21:49:14,712 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 21:49:14,712 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 21:49:14,712 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 21:49:14,713 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 21:49:14,713 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 21:49:14,713 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 21:49:14,713 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 21:49:14,713 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 21:49:14,713 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 21:49:14,714 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 21:49:14,714 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 21:49:14,714 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 21:49:14,714 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 21:49:14,714 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 21:49:14,715 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 21:49:14,715 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 21:49:14,715 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 21:49:14,715 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 21:49:14,715 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 21:49:14,716 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 21:49:14,716 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 21:49:14,716 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 21:49:14,716 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 21:49:14,716 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 21:49:14,717 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 21:49:15,007 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 21:49:15,028 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 21:49:15,032 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 21:49:15,034 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 21:49:15,036 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 21:49:15,037 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi000_pso.opt.i [2019-12-27 21:49:15,100 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2bdb923c/0daf384485c54cecb045034835da309c/FLAG65eb9e726 [2019-12-27 21:49:15,661 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 21:49:15,662 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi000_pso.opt.i [2019-12-27 21:49:15,678 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2bdb923c/0daf384485c54cecb045034835da309c/FLAG65eb9e726 [2019-12-27 21:49:15,930 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2bdb923c/0daf384485c54cecb045034835da309c [2019-12-27 21:49:15,938 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 21:49:15,940 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 21:49:15,941 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 21:49:15,942 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 21:49:15,945 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 21:49:15,946 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:49:15" (1/1) ... [2019-12-27 21:49:15,950 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76f1d1d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:49:15, skipping insertion in model container [2019-12-27 21:49:15,950 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:49:15" (1/1) ... [2019-12-27 21:49:15,959 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 21:49:16,010 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 21:49:16,487 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:49:16,502 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 21:49:16,566 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:49:16,644 INFO L208 MainTranslator]: Completed translation [2019-12-27 21:49:16,645 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:49:16 WrapperNode [2019-12-27 21:49:16,645 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 21:49:16,646 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 21:49:16,646 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 21:49:16,646 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 21:49:16,655 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:49:16" (1/1) ... [2019-12-27 21:49:16,676 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:49:16" (1/1) ... [2019-12-27 21:49:16,714 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 21:49:16,715 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 21:49:16,715 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 21:49:16,715 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 21:49:16,724 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:49:16" (1/1) ... [2019-12-27 21:49:16,724 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:49:16" (1/1) ... [2019-12-27 21:49:16,729 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:49:16" (1/1) ... [2019-12-27 21:49:16,729 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:49:16" (1/1) ... [2019-12-27 21:49:16,739 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:49:16" (1/1) ... [2019-12-27 21:49:16,743 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:49:16" (1/1) ... [2019-12-27 21:49:16,747 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:49:16" (1/1) ... [2019-12-27 21:49:16,752 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 21:49:16,752 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 21:49:16,752 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 21:49:16,752 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 21:49:16,753 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:49:16" (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 21:49:16,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 21:49:16,825 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 21:49:16,825 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 21:49:16,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 21:49:16,825 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 21:49:16,826 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 21:49:16,826 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 21:49:16,826 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 21:49:16,826 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 21:49:16,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 21:49:16,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 21:49:16,828 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 21:49:17,566 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 21:49:17,567 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 21:49:17,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:49:17 BoogieIcfgContainer [2019-12-27 21:49:17,569 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 21:49:17,570 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 21:49:17,570 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 21:49:17,573 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 21:49:17,574 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 09:49:15" (1/3) ... [2019-12-27 21:49:17,575 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20f2d91d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:49:17, skipping insertion in model container [2019-12-27 21:49:17,575 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:49:16" (2/3) ... [2019-12-27 21:49:17,575 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20f2d91d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:49:17, skipping insertion in model container [2019-12-27 21:49:17,576 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:49:17" (3/3) ... [2019-12-27 21:49:17,580 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi000_pso.opt.i [2019-12-27 21:49:17,591 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 21:49:17,592 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 21:49:17,601 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 21:49:17,602 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 21:49:17,644 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:17,645 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:17,645 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:17,646 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:17,646 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:17,646 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:17,647 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:17,647 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:17,647 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:17,647 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:17,648 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:17,648 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:17,648 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:17,649 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:17,649 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:17,649 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:17,649 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:17,650 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:17,650 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:17,650 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:17,650 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:17,651 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:17,652 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:17,652 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:17,652 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:17,653 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:17,653 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:17,653 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:17,654 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:17,654 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:17,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:17,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:17,656 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:17,656 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:17,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:17,657 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:17,658 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:17,658 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:17,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:17,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:17,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:17,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:17,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:17,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:17,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:17,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:17,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:17,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:17,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:17,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:17,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:17,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:17,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:17,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:17,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:17,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:17,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:17,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:17,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:17,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:17,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:17,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:17,670 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:17,670 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:17,675 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:17,676 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:17,676 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:17,676 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:17,677 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:17,677 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:17,677 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:17,677 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:17,678 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:17,678 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:17,685 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:17,685 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:17,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:17,686 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:17,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:17,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:17,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:17,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:17,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:17,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:17,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:17,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:17,705 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 21:49:17,725 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 21:49:17,725 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 21:49:17,726 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 21:49:17,726 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 21:49:17,726 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 21:49:17,726 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 21:49:17,726 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 21:49:17,727 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 21:49:17,749 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-27 21:49:17,751 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-27 21:49:17,864 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-27 21:49:17,864 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:49:17,882 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 254 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 21:49:17,899 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-27 21:49:17,981 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-27 21:49:17,985 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:49:17,992 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 254 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 21:49:18,006 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10378 [2019-12-27 21:49:18,007 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 21:49:20,710 WARN L192 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-27 21:49:20,845 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-27 21:49:20,862 INFO L206 etLargeBlockEncoding]: Checked pairs total: 51265 [2019-12-27 21:49:20,862 INFO L214 etLargeBlockEncoding]: Total number of compositions: 96 [2019-12-27 21:49:20,866 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 81 places, 94 transitions [2019-12-27 21:49:21,362 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 9480 states. [2019-12-27 21:49:21,364 INFO L276 IsEmpty]: Start isEmpty. Operand 9480 states. [2019-12-27 21:49:21,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 21:49:21,371 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:49:21,372 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 21:49:21,373 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:49:21,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:49:21,379 INFO L82 PathProgramCache]: Analyzing trace with hash 691080428, now seen corresponding path program 1 times [2019-12-27 21:49:21,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:49:21,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035913639] [2019-12-27 21:49:21,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:49:21,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:49:21,614 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 21:49:21,616 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035913639] [2019-12-27 21:49:21,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:49:21,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 21:49:21,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1200750357] [2019-12-27 21:49:21,619 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:49:21,624 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:49:21,640 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 21:49:21,640 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:49:21,644 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:49:21,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:49:21,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:49:21,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:49:21,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:49:21,664 INFO L87 Difference]: Start difference. First operand 9480 states. Second operand 3 states. [2019-12-27 21:49:22,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:49:22,001 INFO L93 Difference]: Finished difference Result 9416 states and 31128 transitions. [2019-12-27 21:49:22,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:49:22,003 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 21:49:22,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:49:22,094 INFO L225 Difference]: With dead ends: 9416 [2019-12-27 21:49:22,094 INFO L226 Difference]: Without dead ends: 9234 [2019-12-27 21:49:22,095 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 21:49:22,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9234 states. [2019-12-27 21:49:22,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9234 to 9234. [2019-12-27 21:49:22,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9234 states. [2019-12-27 21:49:22,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9234 states to 9234 states and 30568 transitions. [2019-12-27 21:49:22,669 INFO L78 Accepts]: Start accepts. Automaton has 9234 states and 30568 transitions. Word has length 5 [2019-12-27 21:49:22,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:49:22,670 INFO L462 AbstractCegarLoop]: Abstraction has 9234 states and 30568 transitions. [2019-12-27 21:49:22,670 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:49:22,670 INFO L276 IsEmpty]: Start isEmpty. Operand 9234 states and 30568 transitions. [2019-12-27 21:49:22,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 21:49:22,673 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:49:22,673 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:49:22,674 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:49:22,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:49:22,674 INFO L82 PathProgramCache]: Analyzing trace with hash -530442671, now seen corresponding path program 1 times [2019-12-27 21:49:22,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:49:22,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077635525] [2019-12-27 21:49:22,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:49:22,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:49:22,862 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 21:49:22,862 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077635525] [2019-12-27 21:49:22,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:49:22,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:49:22,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1013818459] [2019-12-27 21:49:22,863 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:49:22,864 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:49:22,868 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 35 transitions. [2019-12-27 21:49:22,868 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:49:22,917 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:49:22,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:49:22,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:49:22,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:49:22,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:49:22,920 INFO L87 Difference]: Start difference. First operand 9234 states and 30568 transitions. Second operand 5 states. [2019-12-27 21:49:23,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:49:23,492 INFO L93 Difference]: Finished difference Result 14362 states and 45554 transitions. [2019-12-27 21:49:23,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:49:23,493 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-12-27 21:49:23,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:49:23,592 INFO L225 Difference]: With dead ends: 14362 [2019-12-27 21:49:23,592 INFO L226 Difference]: Without dead ends: 14355 [2019-12-27 21:49:23,593 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:49:23,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14355 states. [2019-12-27 21:49:24,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14355 to 13038. [2019-12-27 21:49:24,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13038 states. [2019-12-27 21:49:24,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13038 states to 13038 states and 41962 transitions. [2019-12-27 21:49:24,345 INFO L78 Accepts]: Start accepts. Automaton has 13038 states and 41962 transitions. Word has length 11 [2019-12-27 21:49:24,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:49:24,346 INFO L462 AbstractCegarLoop]: Abstraction has 13038 states and 41962 transitions. [2019-12-27 21:49:24,346 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:49:24,346 INFO L276 IsEmpty]: Start isEmpty. Operand 13038 states and 41962 transitions. [2019-12-27 21:49:24,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 21:49:24,354 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:49:24,354 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:49:24,354 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:49:24,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:49:24,355 INFO L82 PathProgramCache]: Analyzing trace with hash -963171175, now seen corresponding path program 1 times [2019-12-27 21:49:24,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:49:24,356 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334628990] [2019-12-27 21:49:24,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:49:24,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:49:24,410 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 21:49:24,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334628990] [2019-12-27 21:49:24,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:49:24,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:49:24,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [215751066] [2019-12-27 21:49:24,411 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:49:24,413 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:49:24,415 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 21:49:24,415 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:49:24,415 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:49:24,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:49:24,416 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:49:24,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:49:24,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:49:24,417 INFO L87 Difference]: Start difference. First operand 13038 states and 41962 transitions. Second operand 3 states. [2019-12-27 21:49:24,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:49:24,440 INFO L93 Difference]: Finished difference Result 1778 states and 4038 transitions. [2019-12-27 21:49:24,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:49:24,441 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-27 21:49:24,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:49:24,447 INFO L225 Difference]: With dead ends: 1778 [2019-12-27 21:49:24,448 INFO L226 Difference]: Without dead ends: 1778 [2019-12-27 21:49:24,449 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:49:24,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1778 states. [2019-12-27 21:49:24,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1778 to 1778. [2019-12-27 21:49:24,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1778 states. [2019-12-27 21:49:24,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1778 states to 1778 states and 4038 transitions. [2019-12-27 21:49:24,500 INFO L78 Accepts]: Start accepts. Automaton has 1778 states and 4038 transitions. Word has length 11 [2019-12-27 21:49:24,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:49:24,501 INFO L462 AbstractCegarLoop]: Abstraction has 1778 states and 4038 transitions. [2019-12-27 21:49:24,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:49:24,501 INFO L276 IsEmpty]: Start isEmpty. Operand 1778 states and 4038 transitions. [2019-12-27 21:49:24,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 21:49:24,503 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:49:24,503 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:49:24,503 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:49:24,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:49:24,504 INFO L82 PathProgramCache]: Analyzing trace with hash 966140781, now seen corresponding path program 1 times [2019-12-27 21:49:24,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:49:24,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664328235] [2019-12-27 21:49:24,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:49:24,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:49:24,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 21:49:24,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664328235] [2019-12-27 21:49:24,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:49:24,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:49:24,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [830996458] [2019-12-27 21:49:24,596 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:49:24,600 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:49:24,608 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 48 states and 71 transitions. [2019-12-27 21:49:24,608 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:49:24,631 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:49:24,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:49:24,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:49:24,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:49:24,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:49:24,633 INFO L87 Difference]: Start difference. First operand 1778 states and 4038 transitions. Second operand 5 states. [2019-12-27 21:49:24,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:49:24,654 INFO L93 Difference]: Finished difference Result 371 states and 689 transitions. [2019-12-27 21:49:24,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:49:24,654 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-12-27 21:49:24,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:49:24,655 INFO L225 Difference]: With dead ends: 371 [2019-12-27 21:49:24,655 INFO L226 Difference]: Without dead ends: 371 [2019-12-27 21:49:24,656 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:49:24,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2019-12-27 21:49:24,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 336. [2019-12-27 21:49:24,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-12-27 21:49:24,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 624 transitions. [2019-12-27 21:49:24,663 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 624 transitions. Word has length 23 [2019-12-27 21:49:24,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:49:24,664 INFO L462 AbstractCegarLoop]: Abstraction has 336 states and 624 transitions. [2019-12-27 21:49:24,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:49:24,664 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 624 transitions. [2019-12-27 21:49:24,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 21:49:24,666 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:49:24,666 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 21:49:24,666 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:49:24,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:49:24,666 INFO L82 PathProgramCache]: Analyzing trace with hash -813009935, now seen corresponding path program 1 times [2019-12-27 21:49:24,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:49:24,667 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758240502] [2019-12-27 21:49:24,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:49:24,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:49:24,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:49:24,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758240502] [2019-12-27 21:49:24,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:49:24,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:49:24,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1300818307] [2019-12-27 21:49:24,746 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:49:24,765 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:49:25,136 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 76 states and 98 transitions. [2019-12-27 21:49:25,136 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:49:25,137 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:49:25,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:49:25,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:49:25,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:49:25,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:49:25,138 INFO L87 Difference]: Start difference. First operand 336 states and 624 transitions. Second operand 3 states. [2019-12-27 21:49:25,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:49:25,199 INFO L93 Difference]: Finished difference Result 345 states and 638 transitions. [2019-12-27 21:49:25,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:49:25,199 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 21:49:25,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:49:25,201 INFO L225 Difference]: With dead ends: 345 [2019-12-27 21:49:25,201 INFO L226 Difference]: Without dead ends: 345 [2019-12-27 21:49:25,201 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 21:49:25,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2019-12-27 21:49:25,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 341. [2019-12-27 21:49:25,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-12-27 21:49:25,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 634 transitions. [2019-12-27 21:49:25,208 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 634 transitions. Word has length 52 [2019-12-27 21:49:25,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:49:25,209 INFO L462 AbstractCegarLoop]: Abstraction has 341 states and 634 transitions. [2019-12-27 21:49:25,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:49:25,209 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 634 transitions. [2019-12-27 21:49:25,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 21:49:25,211 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:49:25,211 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 21:49:25,211 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:49:25,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:49:25,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1499321922, now seen corresponding path program 1 times [2019-12-27 21:49:25,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:49:25,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019076610] [2019-12-27 21:49:25,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:49:25,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:49:25,307 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 21:49:25,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019076610] [2019-12-27 21:49:25,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:49:25,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:49:25,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [478707666] [2019-12-27 21:49:25,309 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:49:25,328 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:49:25,364 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 76 states and 98 transitions. [2019-12-27 21:49:25,364 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:49:25,365 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:49:25,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:49:25,366 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:49:25,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:49:25,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:49:25,367 INFO L87 Difference]: Start difference. First operand 341 states and 634 transitions. Second operand 3 states. [2019-12-27 21:49:25,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:49:25,417 INFO L93 Difference]: Finished difference Result 345 states and 628 transitions. [2019-12-27 21:49:25,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:49:25,418 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 21:49:25,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:49:25,419 INFO L225 Difference]: With dead ends: 345 [2019-12-27 21:49:25,419 INFO L226 Difference]: Without dead ends: 345 [2019-12-27 21:49:25,420 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 21:49:25,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2019-12-27 21:49:25,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 341. [2019-12-27 21:49:25,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-12-27 21:49:25,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 624 transitions. [2019-12-27 21:49:25,428 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 624 transitions. Word has length 52 [2019-12-27 21:49:25,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:49:25,431 INFO L462 AbstractCegarLoop]: Abstraction has 341 states and 624 transitions. [2019-12-27 21:49:25,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:49:25,431 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 624 transitions. [2019-12-27 21:49:25,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 21:49:25,433 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:49:25,433 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 21:49:25,433 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:49:25,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:49:25,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1504614149, now seen corresponding path program 1 times [2019-12-27 21:49:25,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:49:25,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134387843] [2019-12-27 21:49:25,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:49:25,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:49:25,553 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 21:49:25,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134387843] [2019-12-27 21:49:25,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:49:25,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:49:25,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [658207901] [2019-12-27 21:49:25,554 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:49:25,570 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:49:25,603 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 76 states and 98 transitions. [2019-12-27 21:49:25,604 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:49:25,605 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:49:25,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:49:25,605 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:49:25,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:49:25,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:49:25,606 INFO L87 Difference]: Start difference. First operand 341 states and 624 transitions. Second operand 3 states. [2019-12-27 21:49:25,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:49:25,621 INFO L93 Difference]: Finished difference Result 328 states and 585 transitions. [2019-12-27 21:49:25,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:49:25,621 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 21:49:25,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:49:25,622 INFO L225 Difference]: With dead ends: 328 [2019-12-27 21:49:25,622 INFO L226 Difference]: Without dead ends: 328 [2019-12-27 21:49:25,623 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 2 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 21:49:25,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2019-12-27 21:49:25,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2019-12-27 21:49:25,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-12-27 21:49:25,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 585 transitions. [2019-12-27 21:49:25,630 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 585 transitions. Word has length 52 [2019-12-27 21:49:25,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:49:25,631 INFO L462 AbstractCegarLoop]: Abstraction has 328 states and 585 transitions. [2019-12-27 21:49:25,631 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:49:25,631 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 585 transitions. [2019-12-27 21:49:25,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 21:49:25,633 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:49:25,633 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 21:49:25,633 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:49:25,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:49:25,633 INFO L82 PathProgramCache]: Analyzing trace with hash -820511471, now seen corresponding path program 1 times [2019-12-27 21:49:25,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:49:25,634 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259610626] [2019-12-27 21:49:25,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:49:25,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:49:25,774 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 21:49:25,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259610626] [2019-12-27 21:49:25,776 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:49:25,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:49:25,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1873148487] [2019-12-27 21:49:25,776 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:49:25,793 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:49:25,867 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 83 states and 111 transitions. [2019-12-27 21:49:25,868 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:49:25,880 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 21:49:25,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:49:25,880 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:49:25,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:49:25,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:49:25,881 INFO L87 Difference]: Start difference. First operand 328 states and 585 transitions. Second operand 5 states. [2019-12-27 21:49:26,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:49:26,069 INFO L93 Difference]: Finished difference Result 459 states and 819 transitions. [2019-12-27 21:49:26,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:49:26,069 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-12-27 21:49:26,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:49:26,070 INFO L225 Difference]: With dead ends: 459 [2019-12-27 21:49:26,070 INFO L226 Difference]: Without dead ends: 459 [2019-12-27 21:49:26,071 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 4 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 21:49:26,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2019-12-27 21:49:26,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 363. [2019-12-27 21:49:26,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2019-12-27 21:49:26,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 652 transitions. [2019-12-27 21:49:26,078 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 652 transitions. Word has length 53 [2019-12-27 21:49:26,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:49:26,079 INFO L462 AbstractCegarLoop]: Abstraction has 363 states and 652 transitions. [2019-12-27 21:49:26,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:49:26,079 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 652 transitions. [2019-12-27 21:49:26,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 21:49:26,080 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:49:26,080 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 21:49:26,081 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:49:26,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:49:26,081 INFO L82 PathProgramCache]: Analyzing trace with hash 305711121, now seen corresponding path program 2 times [2019-12-27 21:49:26,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:49:26,082 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946586511] [2019-12-27 21:49:26,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:49:26,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:49:26,328 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 21:49:26,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946586511] [2019-12-27 21:49:26,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:49:26,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 21:49:26,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1469803889] [2019-12-27 21:49:26,330 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:49:26,352 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:49:26,387 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 87 states and 119 transitions. [2019-12-27 21:49:26,387 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:49:26,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 21:49:26,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:49:26,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:49:26,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:49:26,503 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 21:49:26,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 21:49:26,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:49:26,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 21:49:26,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-27 21:49:26,504 INFO L87 Difference]: Start difference. First operand 363 states and 652 transitions. Second operand 10 states. [2019-12-27 21:49:27,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:49:27,557 INFO L93 Difference]: Finished difference Result 621 states and 1093 transitions. [2019-12-27 21:49:27,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 21:49:27,557 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 53 [2019-12-27 21:49:27,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:49:27,559 INFO L225 Difference]: With dead ends: 621 [2019-12-27 21:49:27,559 INFO L226 Difference]: Without dead ends: 621 [2019-12-27 21:49:27,560 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2019-12-27 21:49:27,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2019-12-27 21:49:27,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 363. [2019-12-27 21:49:27,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2019-12-27 21:49:27,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 648 transitions. [2019-12-27 21:49:27,568 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 648 transitions. Word has length 53 [2019-12-27 21:49:27,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:49:27,569 INFO L462 AbstractCegarLoop]: Abstraction has 363 states and 648 transitions. [2019-12-27 21:49:27,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 21:49:27,569 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 648 transitions. [2019-12-27 21:49:27,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 21:49:27,570 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:49:27,570 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 21:49:27,570 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:49:27,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:49:27,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1624929181, now seen corresponding path program 3 times [2019-12-27 21:49:27,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:49:27,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471257223] [2019-12-27 21:49:27,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:49:27,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:49:27,701 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 21:49:27,701 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471257223] [2019-12-27 21:49:27,702 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:49:27,702 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:49:27,702 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [142149740] [2019-12-27 21:49:27,702 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:49:27,720 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:49:27,754 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 82 states and 103 transitions. [2019-12-27 21:49:27,754 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:49:27,759 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:49:27,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:49:27,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:49:27,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:49:27,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:49:27,760 INFO L87 Difference]: Start difference. First operand 363 states and 648 transitions. Second operand 6 states. [2019-12-27 21:49:27,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:49:27,832 INFO L93 Difference]: Finished difference Result 611 states and 1074 transitions. [2019-12-27 21:49:27,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:49:27,833 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-12-27 21:49:27,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:49:27,835 INFO L225 Difference]: With dead ends: 611 [2019-12-27 21:49:27,835 INFO L226 Difference]: Without dead ends: 265 [2019-12-27 21:49:27,835 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:49:27,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2019-12-27 21:49:27,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 241. [2019-12-27 21:49:27,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-12-27 21:49:27,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 407 transitions. [2019-12-27 21:49:27,842 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 407 transitions. Word has length 53 [2019-12-27 21:49:27,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:49:27,842 INFO L462 AbstractCegarLoop]: Abstraction has 241 states and 407 transitions. [2019-12-27 21:49:27,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:49:27,842 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 407 transitions. [2019-12-27 21:49:27,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 21:49:27,843 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:49:27,843 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:49:27,844 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:49:27,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:49:27,844 INFO L82 PathProgramCache]: Analyzing trace with hash -92518571, now seen corresponding path program 4 times [2019-12-27 21:49:27,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:49:27,845 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497225464] [2019-12-27 21:49:27,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:49:27,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:49:27,915 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 21:49:27,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497225464] [2019-12-27 21:49:27,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:49:27,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:49:27,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1766543343] [2019-12-27 21:49:27,916 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:49:27,934 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:49:27,964 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 85 states and 105 transitions. [2019-12-27 21:49:27,964 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:49:27,964 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:49:27,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:49:27,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:49:27,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:49:27,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:49:27,965 INFO L87 Difference]: Start difference. First operand 241 states and 407 transitions. Second operand 3 states. [2019-12-27 21:49:28,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:49:28,015 INFO L93 Difference]: Finished difference Result 240 states and 405 transitions. [2019-12-27 21:49:28,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:49:28,016 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-27 21:49:28,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:49:28,018 INFO L225 Difference]: With dead ends: 240 [2019-12-27 21:49:28,018 INFO L226 Difference]: Without dead ends: 240 [2019-12-27 21:49:28,018 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 21:49:28,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2019-12-27 21:49:28,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 197. [2019-12-27 21:49:28,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-12-27 21:49:28,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 332 transitions. [2019-12-27 21:49:28,023 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 332 transitions. Word has length 53 [2019-12-27 21:49:28,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:49:28,024 INFO L462 AbstractCegarLoop]: Abstraction has 197 states and 332 transitions. [2019-12-27 21:49:28,024 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:49:28,024 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 332 transitions. [2019-12-27 21:49:28,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 21:49:28,025 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:49:28,025 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 21:49:28,025 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:49:28,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:49:28,025 INFO L82 PathProgramCache]: Analyzing trace with hash 599019040, now seen corresponding path program 1 times [2019-12-27 21:49:28,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:49:28,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879845528] [2019-12-27 21:49:28,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:49:28,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:49:28,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:49:28,163 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 21:49:28,163 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 21:49:28,167 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] ULTIMATE.startENTRY-->L787: Formula: (let ((.cse0 (store |v_#valid_44| 0 0))) (and (= v_~x$w_buff1_used~0_59 0) (= v_~x$r_buff1_thd1~0_19 0) (= v_~x$flush_delayed~0_15 0) (= v_~main$tmp_guard0~0_9 0) (= 0 v_~__unbuffered_p1_EAX~0_12) (= |v_#NULL.offset_6| 0) (= 0 v_~x$w_buff1~0_21) (= v_~main$tmp_guard1~0_11 0) (= v_~x~0_27 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1591~0.base_18|) 0) (= 0 v_~x$w_buff0~0_24) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1591~0.base_18| 4)) (= 0 v_~x$r_buff0_thd0~0_77) (= |v_ULTIMATE.start_main_~#t1591~0.offset_13| 0) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice2~0_33) (= 0 v_~weak$$choice0~0_7) (= v_~x$mem_tmp~0_10 0) (= 0 v_~x$read_delayed~0_7) (= v_~x$r_buff1_thd0~0_48 0) (= v_~y~0_13 0) (= v_~x$r_buff1_thd2~0_19 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1591~0.base_18| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1591~0.base_18|) |v_ULTIMATE.start_main_~#t1591~0.offset_13| 0)) |v_#memory_int_15|) (= |v_#valid_42| (store .cse0 |v_ULTIMATE.start_main_~#t1591~0.base_18| 1)) (= 0 v_~x$r_buff0_thd1~0_21) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1591~0.base_18|) (= 0 v_~x$r_buff0_thd2~0_28) (= 0 v_~x$w_buff0_used~0_99) (= 0 v_~x$read_delayed_var~0.offset_7) (= v_~__unbuffered_p1_EBX~0_12 0) (= 0 v_~__unbuffered_cnt~0_16) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_24, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_13|, ~x$flush_delayed~0=v_~x$flush_delayed~0_15, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_10|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_19, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_8|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_13|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_8|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_13|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_12, ULTIMATE.start_main_~#t1592~0.base=|v_ULTIMATE.start_main_~#t1592~0.base_16|, #length=|v_#length_15|, ULTIMATE.start_main_~#t1592~0.offset=|v_ULTIMATE.start_main_~#t1592~0.offset_13|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_77, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_10|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_11|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_6|, ~x$w_buff1~0=v_~x$w_buff1~0_21, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_10|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_59, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_19, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_13|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_13|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_11|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_13|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, ~x~0=v_~x~0_27, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_21, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_10|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_10|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_11|, ~x$mem_tmp~0=v_~x$mem_tmp~0_10, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_8|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_11|, ULTIMATE.start_main_~#t1591~0.base=|v_ULTIMATE.start_main_~#t1591~0.base_18|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_10|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_11|, ~y~0=v_~y~0_13, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_12, ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_10|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_6|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_8|, ULTIMATE.start_main_~#t1591~0.offset=|v_ULTIMATE.start_main_~#t1591~0.offset_13|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_11|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_10|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_48, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_28, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_10|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_13|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_99, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_6|, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~ite28, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_#t~ite26, ~x$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t1592~0.base, #length, ULTIMATE.start_main_~#t1592~0.offset, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~nondet15, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_~#t1591~0.base, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_~#t1591~0.offset, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 21:49:28,168 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L787-1-->L789: Formula: (and (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1592~0.base_10|)) (not (= |v_ULTIMATE.start_main_~#t1592~0.base_10| 0)) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1592~0.base_10| 1)) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t1592~0.base_10| 4)) (= 0 |v_ULTIMATE.start_main_~#t1592~0.offset_9|) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1592~0.base_10| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1592~0.base_10|) |v_ULTIMATE.start_main_~#t1592~0.offset_9| 1))) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1592~0.base_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t1592~0.base=|v_ULTIMATE.start_main_~#t1592~0.base_10|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_3|, ULTIMATE.start_main_~#t1592~0.offset=|v_ULTIMATE.start_main_~#t1592~0.offset_9|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1592~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_~#t1592~0.offset, #length] because there is no mapped edge [2019-12-27 21:49:28,169 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L4-->L764: Formula: (and (not (= P1Thread1of1ForFork1___VERIFIER_assert_~expression_In-2066738227 0)) (= ~x$r_buff1_thd0~0_Out-2066738227 ~x$r_buff0_thd0~0_In-2066738227) (= ~x$r_buff0_thd2~0_Out-2066738227 1) (= ~__unbuffered_p1_EAX~0_Out-2066738227 ~y~0_Out-2066738227) (= ~y~0_Out-2066738227 ~__unbuffered_p1_EBX~0_Out-2066738227) (= ~x$r_buff1_thd2~0_Out-2066738227 ~x$r_buff0_thd2~0_In-2066738227) (= ~x$r_buff0_thd1~0_In-2066738227 ~x$r_buff1_thd1~0_Out-2066738227) (= ~y~0_Out-2066738227 1)) InVars {P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In-2066738227, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2066738227, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-2066738227, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2066738227} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In-2066738227, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2066738227, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-2066738227, ~__unbuffered_p1_EBX~0=~__unbuffered_p1_EBX~0_Out-2066738227, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_Out-2066738227, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_Out-2066738227, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_Out-2066738227, ~y~0=~y~0_Out-2066738227, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-2066738227, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out-2066738227} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0, ~__unbuffered_p1_EAX~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 21:49:28,171 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L730-2-->L730-4: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd1~0_In189646673 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In189646673 256)))) (or (and (not .cse0) (= ~x$w_buff1~0_In189646673 |P0Thread1of1ForFork0_#t~ite3_Out189646673|) (not .cse1)) (and (or .cse1 .cse0) (= ~x~0_In189646673 |P0Thread1of1ForFork0_#t~ite3_Out189646673|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In189646673, ~x$w_buff1_used~0=~x$w_buff1_used~0_In189646673, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In189646673, ~x~0=~x~0_In189646673} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out189646673|, ~x$w_buff1~0=~x$w_buff1~0_In189646673, ~x$w_buff1_used~0=~x$w_buff1_used~0_In189646673, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In189646673, ~x~0=~x~0_In189646673} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3] because there is no mapped edge [2019-12-27 21:49:28,172 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [587] [587] L730-4-->L731: Formula: (= v_~x~0_15 |v_P0Thread1of1ForFork0_#t~ite3_8|) InVars {P0Thread1of1ForFork0_#t~ite3=|v_P0Thread1of1ForFork0_#t~ite3_8|} OutVars{P0Thread1of1ForFork0_#t~ite3=|v_P0Thread1of1ForFork0_#t~ite3_7|, P0Thread1of1ForFork0_#t~ite4=|v_P0Thread1of1ForFork0_#t~ite4_7|, ~x~0=v_~x~0_15} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4, ~x~0] because there is no mapped edge [2019-12-27 21:49:28,172 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L731-->L731-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In2019989812 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In2019989812 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out2019989812|) (not .cse0) (not .cse1)) (and (= ~x$w_buff0_used~0_In2019989812 |P0Thread1of1ForFork0_#t~ite5_Out2019989812|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In2019989812, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2019989812} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out2019989812|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In2019989812, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2019989812} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 21:49:28,172 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L732-->L732-2: Formula: (let ((.cse3 (= (mod ~x$r_buff1_thd1~0_In1038958579 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In1038958579 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In1038958579 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1038958579 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out1038958579|)) (and (or .cse3 .cse2) (= ~x$w_buff1_used~0_In1038958579 |P0Thread1of1ForFork0_#t~ite6_Out1038958579|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1038958579, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1038958579, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1038958579, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1038958579} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1038958579|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1038958579, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1038958579, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1038958579, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1038958579} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 21:49:28,173 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L733-->L733-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In1477563570 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In1477563570 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite7_Out1477563570|) (not .cse0) (not .cse1)) (and (= ~x$r_buff0_thd1~0_In1477563570 |P0Thread1of1ForFork0_#t~ite7_Out1477563570|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1477563570, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1477563570} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1477563570, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1477563570|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1477563570} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-27 21:49:28,174 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L765-->L765-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-975336722 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-975336722 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-975336722 |P1Thread1of1ForFork1_#t~ite11_Out-975336722|)) (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite11_Out-975336722|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-975336722, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-975336722} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-975336722|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-975336722, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-975336722} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 21:49:28,175 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L766-->L766-2: Formula: (let ((.cse2 (= (mod ~x$r_buff0_thd2~0_In-1456779556 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In-1456779556 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1456779556 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In-1456779556 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In-1456779556 |P1Thread1of1ForFork1_#t~ite12_Out-1456779556|) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork1_#t~ite12_Out-1456779556| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1456779556, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1456779556, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1456779556, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1456779556} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1456779556, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1456779556, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-1456779556|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1456779556, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1456779556} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 21:49:28,175 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L767-->L768: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1948291326 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In1948291326 256)))) (or (and (not .cse0) (not .cse1) (= 0 ~x$r_buff0_thd2~0_Out1948291326)) (and (= ~x$r_buff0_thd2~0_In1948291326 ~x$r_buff0_thd2~0_Out1948291326) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1948291326, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1948291326} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out1948291326|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1948291326, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1948291326} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 21:49:28,175 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [662] [662] L768-->L768-2: Formula: (let ((.cse3 (= (mod ~x$r_buff1_thd2~0_In-1558708994 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In-1558708994 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1558708994 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-1558708994 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd2~0_In-1558708994 |P1Thread1of1ForFork1_#t~ite14_Out-1558708994|)) (and (= |P1Thread1of1ForFork1_#t~ite14_Out-1558708994| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1558708994, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1558708994, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1558708994, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1558708994} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1558708994, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1558708994, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1558708994, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-1558708994|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1558708994} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 21:49:28,176 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [664] [664] L768-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd2~0_14 |v_P1Thread1of1ForFork1_#t~ite14_8|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_9 (+ v_~__unbuffered_cnt~0_10 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_8|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_14, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_7|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 21:49:28,176 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L734-->L734-2: Formula: (let ((.cse2 (= (mod ~x$r_buff0_thd1~0_In-1537133100 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In-1537133100 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd1~0_In-1537133100 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1537133100 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite8_Out-1537133100| ~x$r_buff1_thd1~0_In-1537133100) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork0_#t~ite8_Out-1537133100| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1537133100, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1537133100, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1537133100, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1537133100} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1537133100, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1537133100|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1537133100, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1537133100, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1537133100} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 21:49:28,176 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L734-2-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= v_~x$r_buff1_thd1~0_14 |v_P0Thread1of1ForFork0_#t~ite8_8|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_14} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-27 21:49:28,177 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [591] [591] L789-1-->L795: Formula: (and (= v_~main$tmp_guard0~0_4 1) (= v_~__unbuffered_cnt~0_7 2)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_7} OutVars{ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_7, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 21:49:28,177 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L795-2-->L795-4: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In611159268 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In611159268 256) 0))) (or (and (= ~x$w_buff1~0_In611159268 |ULTIMATE.start_main_#t~ite17_Out611159268|) (not .cse0) (not .cse1)) (and (= ~x~0_In611159268 |ULTIMATE.start_main_#t~ite17_Out611159268|) (or .cse0 .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In611159268, ~x$w_buff1_used~0=~x$w_buff1_used~0_In611159268, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In611159268, ~x~0=~x~0_In611159268} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out611159268|, ~x$w_buff1~0=~x$w_buff1~0_In611159268, ~x$w_buff1_used~0=~x$w_buff1_used~0_In611159268, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In611159268, ~x~0=~x~0_In611159268} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17] because there is no mapped edge [2019-12-27 21:49:28,177 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [624] [624] L795-4-->L796: Formula: (= v_~x~0_18 |v_ULTIMATE.start_main_#t~ite17_7|) InVars {ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_7|} OutVars{ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_6|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_6|, ~x~0=v_~x~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ~x~0] because there is no mapped edge [2019-12-27 21:49:28,178 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [656] [656] L796-->L796-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1135792330 256))) (.cse0 (= (mod ~x$r_buff0_thd0~0_In-1135792330 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite19_Out-1135792330| ~x$w_buff0_used~0_In-1135792330)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite19_Out-1135792330| 0) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1135792330, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1135792330} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1135792330, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-1135792330|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1135792330} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-27 21:49:28,178 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L797-->L797-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-330128943 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-330128943 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-330128943 256))) (.cse2 (= (mod ~x$r_buff0_thd0~0_In-330128943 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite20_Out-330128943| ~x$w_buff1_used~0_In-330128943) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite20_Out-330128943|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-330128943, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-330128943, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-330128943, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-330128943} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-330128943, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-330128943, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-330128943|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-330128943, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-330128943} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 21:49:28,179 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L798-->L798-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-2078732582 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-2078732582 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite21_Out-2078732582| ~x$r_buff0_thd0~0_In-2078732582) (or .cse0 .cse1)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite21_Out-2078732582| 0) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2078732582, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2078732582} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2078732582, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-2078732582|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2078732582} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 21:49:28,179 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [655] [655] L799-->L799-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff1_used~0_In-1237640335 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In-1237640335 256))) (.cse1 (= (mod ~x$r_buff0_thd0~0_In-1237640335 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1237640335 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite22_Out-1237640335| 0)) (and (= |ULTIMATE.start_main_#t~ite22_Out-1237640335| ~x$r_buff1_thd0~0_In-1237640335) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1237640335, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1237640335, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1237640335, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1237640335} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1237640335, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1237640335, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1237640335, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-1237640335|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1237640335} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 21:49:28,184 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L811-->L812: Formula: (and (= v_~x$r_buff0_thd0~0_69 v_~x$r_buff0_thd0~0_70) (not (= (mod v_~weak$$choice2~0_28 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_70, ~weak$$choice2~0=v_~weak$$choice2~0_28} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_69, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_8|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_7|, ~weak$$choice2~0=v_~weak$$choice2~0_28} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 21:49:28,185 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L814-->L817-1: Formula: (and (= 0 v_~x$flush_delayed~0_9) (= (mod v_~main$tmp_guard1~0_6 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|) (not (= 0 (mod v_~x$flush_delayed~0_10 256))) (= v_~x$mem_tmp~0_6 v_~x~0_22)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_10, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_6, ~x$mem_tmp~0=v_~x$mem_tmp~0_6} OutVars{~x$flush_delayed~0=v_~x$flush_delayed~0_9, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_6, ~x$mem_tmp~0=v_~x$mem_tmp~0_6, ~x~0=v_~x~0_22, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_8|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[~x$flush_delayed~0, ~x~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 21:49:28,186 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L817-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 21:49:28,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 09:49:28 BasicIcfg [2019-12-27 21:49:28,308 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 21:49:28,310 INFO L168 Benchmark]: Toolchain (without parser) took 12369.80 ms. Allocated memory was 138.9 MB in the beginning and 541.6 MB in the end (delta: 402.7 MB). Free memory was 101.8 MB in the beginning and 221.2 MB in the end (delta: -119.4 MB). Peak memory consumption was 283.3 MB. Max. memory is 7.1 GB. [2019-12-27 21:49:28,310 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 138.9 MB. Free memory is still 121.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 21:49:28,312 INFO L168 Benchmark]: CACSL2BoogieTranslator took 704.09 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 101.4 MB in the beginning and 157.5 MB in the end (delta: -56.1 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. [2019-12-27 21:49:28,312 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.84 ms. Allocated memory is still 203.4 MB. Free memory was 157.5 MB in the beginning and 154.6 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-27 21:49:28,313 INFO L168 Benchmark]: Boogie Preprocessor took 36.90 ms. Allocated memory is still 203.4 MB. Free memory was 154.6 MB in the beginning and 152.7 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-27 21:49:28,314 INFO L168 Benchmark]: RCFGBuilder took 816.59 ms. Allocated memory is still 203.4 MB. Free memory was 152.7 MB in the beginning and 108.6 MB in the end (delta: 44.1 MB). Peak memory consumption was 44.1 MB. Max. memory is 7.1 GB. [2019-12-27 21:49:28,315 INFO L168 Benchmark]: TraceAbstraction took 10737.80 ms. Allocated memory was 203.4 MB in the beginning and 541.6 MB in the end (delta: 338.2 MB). Free memory was 107.6 MB in the beginning and 221.2 MB in the end (delta: -113.5 MB). Peak memory consumption was 224.6 MB. Max. memory is 7.1 GB. [2019-12-27 21:49:28,320 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 138.9 MB. Free memory is still 121.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 704.09 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 101.4 MB in the beginning and 157.5 MB in the end (delta: -56.1 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.84 ms. Allocated memory is still 203.4 MB. Free memory was 157.5 MB in the beginning and 154.6 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 36.90 ms. Allocated memory is still 203.4 MB. Free memory was 154.6 MB in the beginning and 152.7 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 816.59 ms. Allocated memory is still 203.4 MB. Free memory was 152.7 MB in the beginning and 108.6 MB in the end (delta: 44.1 MB). Peak memory consumption was 44.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10737.80 ms. Allocated memory was 203.4 MB in the beginning and 541.6 MB in the end (delta: 338.2 MB). Free memory was 107.6 MB in the beginning and 221.2 MB in the end (delta: -113.5 MB). Peak memory consumption was 224.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.1s, 147 ProgramPointsBefore, 81 ProgramPointsAfterwards, 181 TransitionsBefore, 94 TransitionsAfterwards, 10378 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 24 ChoiceCompositions, 3733 VarBasedMoverChecksPositive, 156 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 51265 CheckedPairsTotal, 96 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L787] FCALL, FORK 0 pthread_create(&t1591, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L789] FCALL, FORK 0 pthread_create(&t1592, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L744] 2 x$w_buff1 = x$w_buff0 [L745] 2 x$w_buff0 = 2 [L746] 2 x$w_buff1_used = x$w_buff0_used [L747] 2 x$w_buff0_used = (_Bool)1 [L724] 1 y = 2 [L727] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L730] 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L731] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L764] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L732] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L764] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L765] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L766] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L733] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L795] 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L796] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L797] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L798] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L799] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L802] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L803] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L804] 0 x$flush_delayed = weak$$choice2 [L805] 0 x$mem_tmp = x VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L806] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L806] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L807] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L807] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L808] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L808] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L809] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L809] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L810] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L810] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L812] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L812] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L813] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 10.4s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1100 SDtfs, 738 SDslu, 1621 SDs, 0 SdLazy, 921 SolverSat, 81 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 80 GetRequests, 26 SyntacticMatches, 13 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13038occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 1781 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 472 NumberOfCodeBlocks, 472 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 407 ConstructedInterpolants, 0 QuantifiedInterpolants, 56440 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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...