/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/safe010_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 22:22:43,719 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 22:22:43,722 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 22:22:43,742 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 22:22:43,742 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 22:22:43,744 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 22:22:43,746 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 22:22:43,759 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 22:22:43,761 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 22:22:43,761 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 22:22:43,764 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 22:22:43,766 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 22:22:43,766 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 22:22:43,770 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 22:22:43,773 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 22:22:43,775 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 22:22:43,776 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 22:22:43,779 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 22:22:43,780 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 22:22:43,785 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 22:22:43,786 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 22:22:43,787 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 22:22:43,788 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 22:22:43,789 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 22:22:43,791 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 22:22:43,791 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 22:22:43,791 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 22:22:43,792 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 22:22:43,792 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 22:22:43,793 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 22:22:43,793 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 22:22:43,794 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 22:22:43,795 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 22:22:43,796 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 22:22:43,796 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 22:22:43,797 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 22:22:43,797 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 22:22:43,798 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 22:22:43,799 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 22:22:43,800 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 22:22:43,800 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 22:22:43,801 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 22:22:43,821 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 22:22:43,821 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 22:22:43,823 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 22:22:43,823 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 22:22:43,824 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 22:22:43,824 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 22:22:43,824 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 22:22:43,824 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 22:22:43,824 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 22:22:43,825 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 22:22:43,826 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 22:22:43,826 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 22:22:43,826 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 22:22:43,827 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 22:22:43,827 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 22:22:43,827 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 22:22:43,827 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 22:22:43,827 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 22:22:43,828 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 22:22:43,828 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 22:22:43,828 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 22:22:43,828 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 22:22:43,828 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 22:22:43,829 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 22:22:43,829 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 22:22:43,829 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 22:22:43,829 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 22:22:43,829 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 22:22:43,829 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 22:22:43,830 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 22:22:43,831 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 22:22:43,831 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 22:22:44,089 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 22:22:44,101 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 22:22:44,105 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 22:22:44,106 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 22:22:44,107 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 22:22:44,107 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe010_power.oepc.i [2019-12-27 22:22:44,182 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f068ee489/9c27a804d838435aad4f0a9f7aff2ff5/FLAG07c92c659 [2019-12-27 22:22:44,755 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 22:22:44,755 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe010_power.oepc.i [2019-12-27 22:22:44,771 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f068ee489/9c27a804d838435aad4f0a9f7aff2ff5/FLAG07c92c659 [2019-12-27 22:22:45,026 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f068ee489/9c27a804d838435aad4f0a9f7aff2ff5 [2019-12-27 22:22:45,034 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 22:22:45,036 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 22:22:45,037 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 22:22:45,037 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 22:22:45,040 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 22:22:45,041 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 10:22:45" (1/1) ... [2019-12-27 22:22:45,043 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26ede25d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:22:45, skipping insertion in model container [2019-12-27 22:22:45,044 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 10:22:45" (1/1) ... [2019-12-27 22:22:45,051 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 22:22:45,109 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 22:22:45,574 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 22:22:45,596 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 22:22:45,678 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 22:22:45,753 INFO L208 MainTranslator]: Completed translation [2019-12-27 22:22:45,753 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:22:45 WrapperNode [2019-12-27 22:22:45,753 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 22:22:45,754 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 22:22:45,754 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 22:22:45,754 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 22:22:45,763 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:22:45" (1/1) ... [2019-12-27 22:22:45,782 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:22:45" (1/1) ... [2019-12-27 22:22:45,820 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 22:22:45,821 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 22:22:45,821 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 22:22:45,821 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 22:22:45,833 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:22:45" (1/1) ... [2019-12-27 22:22:45,837 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:22:45" (1/1) ... [2019-12-27 22:22:45,846 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:22:45" (1/1) ... [2019-12-27 22:22:45,846 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:22:45" (1/1) ... [2019-12-27 22:22:45,857 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:22:45" (1/1) ... [2019-12-27 22:22:45,861 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:22:45" (1/1) ... [2019-12-27 22:22:45,865 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:22:45" (1/1) ... [2019-12-27 22:22:45,870 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 22:22:45,870 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 22:22:45,870 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 22:22:45,871 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 22:22:45,871 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:22:45" (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 22:22:45,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 22:22:45,951 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 22:22:45,952 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 22:22:45,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 22:22:45,952 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 22:22:45,952 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 22:22:45,952 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 22:22:45,952 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 22:22:45,953 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 22:22:45,953 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 22:22:45,953 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 22:22:45,955 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 22:22:46,678 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 22:22:46,679 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 22:22:46,680 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 10:22:46 BoogieIcfgContainer [2019-12-27 22:22:46,681 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 22:22:46,682 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 22:22:46,682 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 22:22:46,685 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 22:22:46,686 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 10:22:45" (1/3) ... [2019-12-27 22:22:46,687 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@448f676d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 10:22:46, skipping insertion in model container [2019-12-27 22:22:46,687 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:22:45" (2/3) ... [2019-12-27 22:22:46,687 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@448f676d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 10:22:46, skipping insertion in model container [2019-12-27 22:22:46,688 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 10:22:46" (3/3) ... [2019-12-27 22:22:46,690 INFO L109 eAbstractionObserver]: Analyzing ICFG safe010_power.oepc.i [2019-12-27 22:22:46,700 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 22:22:46,700 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 22:22:46,708 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 22:22:46,710 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 22:22:46,744 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:46,744 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:46,745 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:46,745 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:46,745 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:46,746 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:46,746 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:46,746 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:46,747 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:46,747 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:46,747 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:46,748 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:46,748 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:46,748 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:46,748 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:46,749 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:46,749 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:46,749 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:46,749 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:46,749 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:46,750 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:46,750 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:46,750 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:46,751 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:46,751 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:46,751 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:46,751 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:46,752 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:46,752 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:46,752 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:46,753 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:46,753 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:46,753 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:46,753 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:46,754 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:46,754 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:46,754 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:46,755 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:46,755 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:46,755 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:46,756 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:46,756 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:46,756 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:46,756 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:46,757 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:46,757 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:46,757 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:46,757 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:46,758 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:46,758 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:46,758 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:46,759 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:46,759 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:46,759 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:46,759 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:46,760 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:46,760 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:46,760 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:46,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:46,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:46,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:46,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:46,762 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:46,762 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:46,766 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:46,766 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:46,766 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:46,767 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:46,767 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:46,767 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:46,767 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:46,768 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:46,768 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:46,768 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:46,768 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:46,768 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:46,771 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:46,772 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:46,772 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:46,772 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:46,772 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:46,773 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:46,773 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:46,773 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:46,773 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:46,774 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:46,789 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 22:22:46,808 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 22:22:46,808 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 22:22:46,808 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 22:22:46,808 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 22:22:46,808 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 22:22:46,809 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 22:22:46,809 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 22:22:46,809 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 22:22:46,828 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 146 places, 180 transitions [2019-12-27 22:22:46,830 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-12-27 22:22:46,933 INFO L132 PetriNetUnfolder]: 41/178 cut-off events. [2019-12-27 22:22:46,933 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 22:22:46,946 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 178 events. 41/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 248 event pairs. 0/135 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 22:22:46,964 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-12-27 22:22:47,007 INFO L132 PetriNetUnfolder]: 41/178 cut-off events. [2019-12-27 22:22:47,007 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 22:22:47,012 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 178 events. 41/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 248 event pairs. 0/135 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 22:22:47,025 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10418 [2019-12-27 22:22:47,027 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 22:22:50,237 WARN L192 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2019-12-27 22:22:50,358 INFO L206 etLargeBlockEncoding]: Checked pairs total: 54561 [2019-12-27 22:22:50,359 INFO L214 etLargeBlockEncoding]: Total number of compositions: 98 [2019-12-27 22:22:50,363 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 81 places, 94 transitions [2019-12-27 22:22:50,937 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 9482 states. [2019-12-27 22:22:50,940 INFO L276 IsEmpty]: Start isEmpty. Operand 9482 states. [2019-12-27 22:22:50,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 22:22:50,946 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:22:50,947 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 22:22:50,948 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:22:50,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:22:50,954 INFO L82 PathProgramCache]: Analyzing trace with hash 719045, now seen corresponding path program 1 times [2019-12-27 22:22:50,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:22:50,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840656907] [2019-12-27 22:22:50,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:22:51,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:22:51,174 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 22:22:51,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840656907] [2019-12-27 22:22:51,176 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:22:51,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 22:22:51,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [230467158] [2019-12-27 22:22:51,178 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:22:51,183 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:22:51,196 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 22:22:51,197 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:22:51,201 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:22:51,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:22:51,202 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:22:51,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:22:51,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:22:51,220 INFO L87 Difference]: Start difference. First operand 9482 states. Second operand 3 states. [2019-12-27 22:22:51,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:22:51,512 INFO L93 Difference]: Finished difference Result 9432 states and 30962 transitions. [2019-12-27 22:22:51,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:22:51,514 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 22:22:51,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:22:51,625 INFO L225 Difference]: With dead ends: 9432 [2019-12-27 22:22:51,625 INFO L226 Difference]: Without dead ends: 9250 [2019-12-27 22:22:51,626 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 22:22:51,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9250 states. [2019-12-27 22:22:52,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9250 to 9250. [2019-12-27 22:22:52,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9250 states. [2019-12-27 22:22:52,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9250 states to 9250 states and 30402 transitions. [2019-12-27 22:22:52,132 INFO L78 Accepts]: Start accepts. Automaton has 9250 states and 30402 transitions. Word has length 3 [2019-12-27 22:22:52,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:22:52,133 INFO L462 AbstractCegarLoop]: Abstraction has 9250 states and 30402 transitions. [2019-12-27 22:22:52,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:22:52,133 INFO L276 IsEmpty]: Start isEmpty. Operand 9250 states and 30402 transitions. [2019-12-27 22:22:52,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 22:22:52,136 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:22:52,136 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:22:52,138 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:22:52,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:22:52,138 INFO L82 PathProgramCache]: Analyzing trace with hash 616626766, now seen corresponding path program 1 times [2019-12-27 22:22:52,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:22:52,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757377332] [2019-12-27 22:22:52,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:22:52,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:22:52,273 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 22:22:52,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757377332] [2019-12-27 22:22:52,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:22:52,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:22:52,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1038170722] [2019-12-27 22:22:52,276 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:22:52,277 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:22:52,281 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 22:22:52,281 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:22:52,281 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:22:52,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:22:52,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:22:52,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:22:52,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:22:52,284 INFO L87 Difference]: Start difference. First operand 9250 states and 30402 transitions. Second operand 4 states. [2019-12-27 22:22:52,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:22:52,826 INFO L93 Difference]: Finished difference Result 14408 states and 45299 transitions. [2019-12-27 22:22:52,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:22:52,827 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 22:22:52,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:22:52,925 INFO L225 Difference]: With dead ends: 14408 [2019-12-27 22:22:52,925 INFO L226 Difference]: Without dead ends: 14401 [2019-12-27 22:22:52,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:22:53,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14401 states. [2019-12-27 22:22:53,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14401 to 13161. [2019-12-27 22:22:53,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13161 states. [2019-12-27 22:22:53,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13161 states to 13161 states and 42025 transitions. [2019-12-27 22:22:53,982 INFO L78 Accepts]: Start accepts. Automaton has 13161 states and 42025 transitions. Word has length 11 [2019-12-27 22:22:53,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:22:53,984 INFO L462 AbstractCegarLoop]: Abstraction has 13161 states and 42025 transitions. [2019-12-27 22:22:53,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:22:53,984 INFO L276 IsEmpty]: Start isEmpty. Operand 13161 states and 42025 transitions. [2019-12-27 22:22:53,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 22:22:53,987 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:22:53,987 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:22:53,987 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:22:53,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:22:53,988 INFO L82 PathProgramCache]: Analyzing trace with hash -887269812, now seen corresponding path program 1 times [2019-12-27 22:22:53,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:22:53,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000866692] [2019-12-27 22:22:53,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:22:54,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:22:54,053 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 22:22:54,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000866692] [2019-12-27 22:22:54,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:22:54,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:22:54,055 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1592726650] [2019-12-27 22:22:54,055 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:22:54,056 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:22:54,058 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 22:22:54,058 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:22:54,058 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:22:54,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:22:54,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:22:54,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:22:54,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:22:54,060 INFO L87 Difference]: Start difference. First operand 13161 states and 42025 transitions. Second operand 4 states. [2019-12-27 22:22:54,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:22:54,344 INFO L93 Difference]: Finished difference Result 16164 states and 50739 transitions. [2019-12-27 22:22:54,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:22:54,345 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 22:22:54,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:22:54,402 INFO L225 Difference]: With dead ends: 16164 [2019-12-27 22:22:54,402 INFO L226 Difference]: Without dead ends: 16164 [2019-12-27 22:22:54,403 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:22:54,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16164 states. [2019-12-27 22:22:54,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16164 to 14464. [2019-12-27 22:22:54,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14464 states. [2019-12-27 22:22:55,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14464 states to 14464 states and 45803 transitions. [2019-12-27 22:22:55,039 INFO L78 Accepts]: Start accepts. Automaton has 14464 states and 45803 transitions. Word has length 11 [2019-12-27 22:22:55,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:22:55,047 INFO L462 AbstractCegarLoop]: Abstraction has 14464 states and 45803 transitions. [2019-12-27 22:22:55,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:22:55,047 INFO L276 IsEmpty]: Start isEmpty. Operand 14464 states and 45803 transitions. [2019-12-27 22:22:55,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 22:22:55,057 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:22:55,057 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:22:55,057 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:22:55,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:22:55,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1340562840, now seen corresponding path program 1 times [2019-12-27 22:22:55,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:22:55,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764602688] [2019-12-27 22:22:55,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:22:55,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:22:55,192 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 22:22:55,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764602688] [2019-12-27 22:22:55,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:22:55,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:22:55,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [974619576] [2019-12-27 22:22:55,197 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:22:55,199 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:22:55,203 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 29 states and 39 transitions. [2019-12-27 22:22:55,203 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:22:55,205 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:22:55,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:22:55,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:22:55,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:22:55,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:22:55,206 INFO L87 Difference]: Start difference. First operand 14464 states and 45803 transitions. Second operand 5 states. [2019-12-27 22:22:55,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:22:55,876 INFO L93 Difference]: Finished difference Result 19369 states and 59796 transitions. [2019-12-27 22:22:55,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 22:22:55,877 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-27 22:22:55,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:22:55,924 INFO L225 Difference]: With dead ends: 19369 [2019-12-27 22:22:55,924 INFO L226 Difference]: Without dead ends: 19362 [2019-12-27 22:22:55,925 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 22:22:56,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19362 states. [2019-12-27 22:22:56,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19362 to 14438. [2019-12-27 22:22:56,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14438 states. [2019-12-27 22:22:56,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14438 states to 14438 states and 45411 transitions. [2019-12-27 22:22:56,400 INFO L78 Accepts]: Start accepts. Automaton has 14438 states and 45411 transitions. Word has length 17 [2019-12-27 22:22:56,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:22:56,401 INFO L462 AbstractCegarLoop]: Abstraction has 14438 states and 45411 transitions. [2019-12-27 22:22:56,401 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:22:56,401 INFO L276 IsEmpty]: Start isEmpty. Operand 14438 states and 45411 transitions. [2019-12-27 22:22:56,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 22:22:56,418 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:22:56,419 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:22:56,419 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:22:56,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:22:56,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1840046616, now seen corresponding path program 1 times [2019-12-27 22:22:56,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:22:56,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440678137] [2019-12-27 22:22:56,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:22:56,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:22:56,503 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 22:22:56,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440678137] [2019-12-27 22:22:56,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:22:56,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:22:56,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1781194256] [2019-12-27 22:22:56,504 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:22:56,511 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:22:56,516 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 22:22:56,516 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:22:56,516 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:22:56,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:22:56,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:22:56,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:22:56,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:22:56,518 INFO L87 Difference]: Start difference. First operand 14438 states and 45411 transitions. Second operand 3 states. [2019-12-27 22:22:56,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:22:56,905 INFO L93 Difference]: Finished difference Result 17602 states and 54691 transitions. [2019-12-27 22:22:56,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:22:56,906 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-12-27 22:22:56,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:22:56,952 INFO L225 Difference]: With dead ends: 17602 [2019-12-27 22:22:56,952 INFO L226 Difference]: Without dead ends: 17602 [2019-12-27 22:22:56,952 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 22:22:57,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17602 states. [2019-12-27 22:22:57,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17602 to 15582. [2019-12-27 22:22:57,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15582 states. [2019-12-27 22:22:57,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15582 states to 15582 states and 48928 transitions. [2019-12-27 22:22:57,402 INFO L78 Accepts]: Start accepts. Automaton has 15582 states and 48928 transitions. Word has length 25 [2019-12-27 22:22:57,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:22:57,403 INFO L462 AbstractCegarLoop]: Abstraction has 15582 states and 48928 transitions. [2019-12-27 22:22:57,403 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:22:57,403 INFO L276 IsEmpty]: Start isEmpty. Operand 15582 states and 48928 transitions. [2019-12-27 22:22:57,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 22:22:57,419 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:22:57,419 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:22:57,419 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:22:57,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:22:57,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1840202205, now seen corresponding path program 1 times [2019-12-27 22:22:57,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:22:57,421 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104629658] [2019-12-27 22:22:57,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:22:57,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:22:57,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:22:57,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104629658] [2019-12-27 22:22:57,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:22:57,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:22:57,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1063481495] [2019-12-27 22:22:57,493 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:22:57,497 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:22:57,502 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 22:22:57,502 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:22:57,502 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:22:57,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:22:57,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:22:57,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:22:57,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:22:57,504 INFO L87 Difference]: Start difference. First operand 15582 states and 48928 transitions. Second operand 4 states. [2019-12-27 22:22:57,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:22:57,539 INFO L93 Difference]: Finished difference Result 2444 states and 5542 transitions. [2019-12-27 22:22:57,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 22:22:57,539 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 22:22:57,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:22:57,543 INFO L225 Difference]: With dead ends: 2444 [2019-12-27 22:22:57,544 INFO L226 Difference]: Without dead ends: 2145 [2019-12-27 22:22:57,544 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:22:57,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2145 states. [2019-12-27 22:22:57,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2145 to 2145. [2019-12-27 22:22:57,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2145 states. [2019-12-27 22:22:57,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2145 states to 2145 states and 4722 transitions. [2019-12-27 22:22:57,581 INFO L78 Accepts]: Start accepts. Automaton has 2145 states and 4722 transitions. Word has length 25 [2019-12-27 22:22:57,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:22:57,582 INFO L462 AbstractCegarLoop]: Abstraction has 2145 states and 4722 transitions. [2019-12-27 22:22:57,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:22:57,582 INFO L276 IsEmpty]: Start isEmpty. Operand 2145 states and 4722 transitions. [2019-12-27 22:22:57,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 22:22:57,585 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:22:57,585 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:22:57,586 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:22:57,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:22:57,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1265486951, now seen corresponding path program 1 times [2019-12-27 22:22:57,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:22:57,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316191280] [2019-12-27 22:22:57,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:22:57,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:22:57,725 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 22:22:57,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316191280] [2019-12-27 22:22:57,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:22:57,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 22:22:57,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1177603899] [2019-12-27 22:22:57,726 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:22:57,734 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:22:57,745 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 38 states and 37 transitions. [2019-12-27 22:22:57,745 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:22:57,746 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:22:57,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:22:57,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:22:57,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:22:57,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:22:57,747 INFO L87 Difference]: Start difference. First operand 2145 states and 4722 transitions. Second operand 5 states. [2019-12-27 22:22:57,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:22:57,791 INFO L93 Difference]: Finished difference Result 443 states and 801 transitions. [2019-12-27 22:22:57,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:22:57,791 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-27 22:22:57,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:22:57,792 INFO L225 Difference]: With dead ends: 443 [2019-12-27 22:22:57,793 INFO L226 Difference]: Without dead ends: 372 [2019-12-27 22:22:57,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:22:57,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2019-12-27 22:22:57,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 344. [2019-12-27 22:22:57,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-12-27 22:22:57,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 620 transitions. [2019-12-27 22:22:57,799 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 620 transitions. Word has length 37 [2019-12-27 22:22:57,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:22:57,799 INFO L462 AbstractCegarLoop]: Abstraction has 344 states and 620 transitions. [2019-12-27 22:22:57,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:22:57,799 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 620 transitions. [2019-12-27 22:22:57,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 22:22:57,800 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:22:57,801 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 22:22:57,801 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:22:57,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:22:57,801 INFO L82 PathProgramCache]: Analyzing trace with hash -723762532, now seen corresponding path program 1 times [2019-12-27 22:22:57,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:22:57,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64257335] [2019-12-27 22:22:57,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:22:57,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:22:57,882 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 22:22:57,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64257335] [2019-12-27 22:22:57,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:22:57,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:22:57,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1448613110] [2019-12-27 22:22:57,883 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:22:57,896 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:22:57,999 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 83 states and 112 transitions. [2019-12-27 22:22:58,000 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:22:58,020 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 22:22:58,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:22:58,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:22:58,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:22:58,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:22:58,021 INFO L87 Difference]: Start difference. First operand 344 states and 620 transitions. Second operand 5 states. [2019-12-27 22:22:58,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:22:58,193 INFO L93 Difference]: Finished difference Result 439 states and 767 transitions. [2019-12-27 22:22:58,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 22:22:58,194 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-12-27 22:22:58,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:22:58,194 INFO L225 Difference]: With dead ends: 439 [2019-12-27 22:22:58,195 INFO L226 Difference]: Without dead ends: 439 [2019-12-27 22:22:58,195 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:22:58,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2019-12-27 22:22:58,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 332. [2019-12-27 22:22:58,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2019-12-27 22:22:58,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 584 transitions. [2019-12-27 22:22:58,202 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 584 transitions. Word has length 52 [2019-12-27 22:22:58,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:22:58,202 INFO L462 AbstractCegarLoop]: Abstraction has 332 states and 584 transitions. [2019-12-27 22:22:58,202 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:22:58,202 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 584 transitions. [2019-12-27 22:22:58,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 22:22:58,203 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:22:58,203 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 22:22:58,204 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:22:58,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:22:58,204 INFO L82 PathProgramCache]: Analyzing trace with hash -2146679471, now seen corresponding path program 1 times [2019-12-27 22:22:58,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:22:58,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146730834] [2019-12-27 22:22:58,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:22:58,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:22:58,292 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 22:22:58,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146730834] [2019-12-27 22:22:58,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:22:58,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 22:22:58,293 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1450970266] [2019-12-27 22:22:58,293 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:22:58,306 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:22:58,333 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 64 states and 73 transitions. [2019-12-27 22:22:58,333 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:22:58,336 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 22:22:58,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:22:58,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:22:58,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:22:58,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:22:58,337 INFO L87 Difference]: Start difference. First operand 332 states and 584 transitions. Second operand 5 states. [2019-12-27 22:22:58,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:22:58,535 INFO L93 Difference]: Finished difference Result 488 states and 866 transitions. [2019-12-27 22:22:58,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 22:22:58,535 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-12-27 22:22:58,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:22:58,536 INFO L225 Difference]: With dead ends: 488 [2019-12-27 22:22:58,536 INFO L226 Difference]: Without dead ends: 488 [2019-12-27 22:22:58,536 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:22:58,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2019-12-27 22:22:58,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 423. [2019-12-27 22:22:58,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2019-12-27 22:22:58,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 750 transitions. [2019-12-27 22:22:58,545 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 750 transitions. Word has length 53 [2019-12-27 22:22:58,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:22:58,545 INFO L462 AbstractCegarLoop]: Abstraction has 423 states and 750 transitions. [2019-12-27 22:22:58,545 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:22:58,546 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 750 transitions. [2019-12-27 22:22:58,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 22:22:58,547 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:22:58,547 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 22:22:58,547 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:22:58,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:22:58,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1496527321, now seen corresponding path program 2 times [2019-12-27 22:22:58,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:22:58,549 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657675818] [2019-12-27 22:22:58,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:22:58,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:22:58,651 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 22:22:58,652 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657675818] [2019-12-27 22:22:58,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:22:58,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:22:58,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1747155310] [2019-12-27 22:22:58,653 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:22:58,666 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:22:58,698 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 72 states and 89 transitions. [2019-12-27 22:22:58,698 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:22:58,699 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:22:58,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:22:58,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:22:58,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:22:58,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:22:58,700 INFO L87 Difference]: Start difference. First operand 423 states and 750 transitions. Second operand 3 states. [2019-12-27 22:22:58,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:22:58,751 INFO L93 Difference]: Finished difference Result 423 states and 749 transitions. [2019-12-27 22:22:58,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:22:58,752 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-27 22:22:58,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:22:58,752 INFO L225 Difference]: With dead ends: 423 [2019-12-27 22:22:58,753 INFO L226 Difference]: Without dead ends: 423 [2019-12-27 22:22:58,753 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 22:22:58,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2019-12-27 22:22:58,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 332. [2019-12-27 22:22:58,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2019-12-27 22:22:58,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 583 transitions. [2019-12-27 22:22:58,759 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 583 transitions. Word has length 53 [2019-12-27 22:22:58,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:22:58,759 INFO L462 AbstractCegarLoop]: Abstraction has 332 states and 583 transitions. [2019-12-27 22:22:58,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:22:58,759 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 583 transitions. [2019-12-27 22:22:58,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:22:58,760 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:22:58,761 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 22:22:58,761 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:22:58,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:22:58,761 INFO L82 PathProgramCache]: Analyzing trace with hash -826251112, now seen corresponding path program 1 times [2019-12-27 22:22:58,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:22:58,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443200629] [2019-12-27 22:22:58,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:22:58,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:22:58,918 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 22:22:58,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443200629] [2019-12-27 22:22:58,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:22:58,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 22:22:58,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1606589480] [2019-12-27 22:22:58,919 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:22:58,933 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:22:58,959 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 65 states and 74 transitions. [2019-12-27 22:22:58,959 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:22:58,960 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:22:58,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 22:22:58,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:22:58,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 22:22:58,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:22:58,961 INFO L87 Difference]: Start difference. First operand 332 states and 583 transitions. Second operand 7 states. [2019-12-27 22:22:59,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:22:59,054 INFO L93 Difference]: Finished difference Result 536 states and 942 transitions. [2019-12-27 22:22:59,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 22:22:59,055 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-27 22:22:59,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:22:59,056 INFO L225 Difference]: With dead ends: 536 [2019-12-27 22:22:59,056 INFO L226 Difference]: Without dead ends: 246 [2019-12-27 22:22:59,056 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-12-27 22:22:59,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2019-12-27 22:22:59,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 222. [2019-12-27 22:22:59,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-12-27 22:22:59,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 393 transitions. [2019-12-27 22:22:59,060 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 393 transitions. Word has length 54 [2019-12-27 22:22:59,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:22:59,060 INFO L462 AbstractCegarLoop]: Abstraction has 222 states and 393 transitions. [2019-12-27 22:22:59,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 22:22:59,061 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 393 transitions. [2019-12-27 22:22:59,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:22:59,061 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:22:59,062 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 22:22:59,062 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:22:59,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:22:59,062 INFO L82 PathProgramCache]: Analyzing trace with hash -2130111720, now seen corresponding path program 2 times [2019-12-27 22:22:59,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:22:59,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110326735] [2019-12-27 22:22:59,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:22:59,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:22:59,320 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 22:22:59,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110326735] [2019-12-27 22:22:59,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:22:59,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 22:22:59,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1195811441] [2019-12-27 22:22:59,321 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:22:59,335 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:22:59,376 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 91 states and 115 transitions. [2019-12-27 22:22:59,376 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:22:59,520 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 22:22:59,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 22:22:59,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:22:59,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 22:22:59,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-12-27 22:22:59,521 INFO L87 Difference]: Start difference. First operand 222 states and 393 transitions. Second operand 15 states. [2019-12-27 22:23:01,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:23:01,284 INFO L93 Difference]: Finished difference Result 568 states and 964 transitions. [2019-12-27 22:23:01,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-27 22:23:01,285 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 54 [2019-12-27 22:23:01,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:23:01,286 INFO L225 Difference]: With dead ends: 568 [2019-12-27 22:23:01,287 INFO L226 Difference]: Without dead ends: 534 [2019-12-27 22:23:01,288 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=267, Invalid=1293, Unknown=0, NotChecked=0, Total=1560 [2019-12-27 22:23:01,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2019-12-27 22:23:01,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 322. [2019-12-27 22:23:01,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2019-12-27 22:23:01,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 564 transitions. [2019-12-27 22:23:01,294 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 564 transitions. Word has length 54 [2019-12-27 22:23:01,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:23:01,294 INFO L462 AbstractCegarLoop]: Abstraction has 322 states and 564 transitions. [2019-12-27 22:23:01,294 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 22:23:01,295 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 564 transitions. [2019-12-27 22:23:01,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:23:01,296 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:23:01,296 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 22:23:01,296 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:23:01,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:23:01,296 INFO L82 PathProgramCache]: Analyzing trace with hash -688648962, now seen corresponding path program 3 times [2019-12-27 22:23:01,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:23:01,297 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048255577] [2019-12-27 22:23:01,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:23:01,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:23:02,026 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 22:23:02,027 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048255577] [2019-12-27 22:23:02,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:23:02,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-27 22:23:02,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [58382963] [2019-12-27 22:23:02,028 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:23:02,051 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:23:02,130 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 86 states and 114 transitions. [2019-12-27 22:23:02,130 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:23:02,485 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 22:23:02,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-12-27 22:23:02,485 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:23:02,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-12-27 22:23:02,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=497, Unknown=0, NotChecked=0, Total=600 [2019-12-27 22:23:02,486 INFO L87 Difference]: Start difference. First operand 322 states and 564 transitions. Second operand 25 states. [2019-12-27 22:23:03,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:23:03,996 INFO L93 Difference]: Finished difference Result 629 states and 1074 transitions. [2019-12-27 22:23:03,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 22:23:03,997 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 54 [2019-12-27 22:23:03,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:23:03,998 INFO L225 Difference]: With dead ends: 629 [2019-12-27 22:23:03,998 INFO L226 Difference]: Without dead ends: 595 [2019-12-27 22:23:03,999 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 10 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=218, Invalid=1114, Unknown=0, NotChecked=0, Total=1332 [2019-12-27 22:23:04,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2019-12-27 22:23:04,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 341. [2019-12-27 22:23:04,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-12-27 22:23:04,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 601 transitions. [2019-12-27 22:23:04,005 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 601 transitions. Word has length 54 [2019-12-27 22:23:04,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:23:04,006 INFO L462 AbstractCegarLoop]: Abstraction has 341 states and 601 transitions. [2019-12-27 22:23:04,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-12-27 22:23:04,006 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 601 transitions. [2019-12-27 22:23:04,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:23:04,007 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:23:04,007 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 22:23:04,007 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:23:04,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:23:04,008 INFO L82 PathProgramCache]: Analyzing trace with hash 932780242, now seen corresponding path program 4 times [2019-12-27 22:23:04,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:23:04,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926901704] [2019-12-27 22:23:04,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:23:04,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:23:04,484 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 22:23:04,484 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926901704] [2019-12-27 22:23:04,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:23:04,484 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 22:23:04,485 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1388043519] [2019-12-27 22:23:04,485 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:23:04,498 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:23:04,531 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 106 states and 155 transitions. [2019-12-27 22:23:04,531 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:23:04,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:23:04,902 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 22:23:04,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-27 22:23:04,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:23:04,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-27 22:23:04,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2019-12-27 22:23:04,904 INFO L87 Difference]: Start difference. First operand 341 states and 601 transitions. Second operand 23 states. [2019-12-27 22:23:06,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:23:06,504 INFO L93 Difference]: Finished difference Result 496 states and 836 transitions. [2019-12-27 22:23:06,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 22:23:06,504 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 54 [2019-12-27 22:23:06,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:23:06,505 INFO L225 Difference]: With dead ends: 496 [2019-12-27 22:23:06,505 INFO L226 Difference]: Without dead ends: 462 [2019-12-27 22:23:06,506 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=226, Invalid=1106, Unknown=0, NotChecked=0, Total=1332 [2019-12-27 22:23:06,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2019-12-27 22:23:06,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 330. [2019-12-27 22:23:06,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2019-12-27 22:23:06,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 578 transitions. [2019-12-27 22:23:06,512 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 578 transitions. Word has length 54 [2019-12-27 22:23:06,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:23:06,512 INFO L462 AbstractCegarLoop]: Abstraction has 330 states and 578 transitions. [2019-12-27 22:23:06,513 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-27 22:23:06,513 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 578 transitions. [2019-12-27 22:23:06,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:23:06,514 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:23:06,514 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 22:23:06,514 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:23:06,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:23:06,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1187524996, now seen corresponding path program 5 times [2019-12-27 22:23:06,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:23:06,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194392833] [2019-12-27 22:23:06,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:23:06,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 22:23:06,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 22:23:06,631 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 22:23:06,631 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 22:23:06,635 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] ULTIMATE.startENTRY-->L779: Formula: (let ((.cse0 (store |v_#valid_47| 0 0))) (and (= 0 v_~y$w_buff0~0_26) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t2009~0.base_24| 4)) (= v_~x~0_11 0) (= 0 v_~y$read_delayed_var~0.offset_7) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t2009~0.base_24|) (= 0 v_~weak$$choice0~0_9) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2009~0.base_24|)) (= 0 v_~__unbuffered_p1_EAX~0_11) (= 0 v_~y$r_buff1_thd1~0_20) (= 0 |v_ULTIMATE.start_main_~#t2009~0.offset_19|) (= v_~y$read_delayed~0_7 0) (= |v_#NULL.offset_3| 0) (= v_~main$tmp_guard0~0_12 0) (= |v_#valid_45| (store .cse0 |v_ULTIMATE.start_main_~#t2009~0.base_24| 1)) (= 0 v_~y$w_buff1~0_25) (= v_~y$w_buff0_used~0_103 0) (= v_~y~0_29 0) (= 0 v_~y$r_buff1_thd0~0_50) (= 0 v_~y$read_delayed_var~0.base_7) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2009~0.base_24| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2009~0.base_24|) |v_ULTIMATE.start_main_~#t2009~0.offset_19| 0)) |v_#memory_int_9|) (= 0 v_~weak$$choice2~0_35) (= 0 v_~y$r_buff1_thd2~0_17) (= v_~y$mem_tmp~0_12 0) (= 0 |v_#NULL.base_3|) (= v_~y$w_buff1_used~0_66 0) (= v_~y$r_buff0_thd1~0_27 0) (= v_~main$tmp_guard1~0_13 0) (= v_~y$r_buff0_thd2~0_21 0) (= v_~y$r_buff0_thd0~0_76 0) (= 0 v_~y$flush_delayed~0_17) (= 0 v_~__unbuffered_cnt~0_16) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_10|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_18|, ULTIMATE.start_main_~#t2009~0.offset=|v_ULTIMATE.start_main_~#t2009~0.offset_19|, #NULL.offset=|v_#NULL.offset_3|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_14|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_12|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_17|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_12|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_17|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$mem_tmp~0=v_~y$mem_tmp~0_12, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_11, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_27, ~y$flush_delayed~0=v_~y$flush_delayed~0_17, #length=|v_#length_11|, ULTIMATE.start_main_~#t2010~0.base=|v_ULTIMATE.start_main_~#t2010~0.base_20|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_15|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_15|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_10|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_14|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_17|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_17|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_15|, ~weak$$choice0~0=v_~weak$$choice0~0_9, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_17|, ~y$w_buff1~0=v_~y$w_buff1~0_25, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_21, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_50, ~x~0=v_~x~0_11, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_103, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_17|, ULTIMATE.start_main_~#t2009~0.base=|v_ULTIMATE.start_main_~#t2009~0.base_24|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_14|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_16|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_12|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_15|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_14|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_20, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_15|, ~y$w_buff0~0=v_~y$w_buff0~0_26, ~y~0=v_~y~0_29, ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_14|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_10|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_12|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_15|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_14|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_12, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_16|, #NULL.base=|v_#NULL.base_3|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_17|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_17, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_18|, ULTIMATE.start_main_~#t2010~0.offset=|v_ULTIMATE.start_main_~#t2010~0.offset_17|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_76, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_9|, ~weak$$choice2~0=v_~weak$$choice2~0_35, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_66} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_~#t2009~0.offset, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_~#t2010~0.base, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_~#t2009~0.base, ULTIMATE.start_main_#t~ite25, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30, ~y$w_buff0~0, ~y~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t2010~0.offset, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 22:23:06,636 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [673] [673] L779-1-->L781: Formula: (and (= |v_ULTIMATE.start_main_~#t2010~0.offset_10| 0) (not (= |v_ULTIMATE.start_main_~#t2010~0.base_11| 0)) (= (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t2010~0.base_11| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t2010~0.base_11|) |v_ULTIMATE.start_main_~#t2010~0.offset_10| 1)) |v_#memory_int_7|) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2010~0.base_11|)) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t2010~0.base_11| 4) |v_#length_9|) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2010~0.base_11| 1)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t2010~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t2010~0.base=|v_ULTIMATE.start_main_~#t2010~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t2010~0.offset=|v_ULTIMATE.start_main_~#t2010~0.offset_10|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_6|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2010~0.base, ULTIMATE.start_main_~#t2010~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length] because there is no mapped edge [2019-12-27 22:23:06,637 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [638] [638] P0ENTRY-->L4-3: Formula: (and (= (mod v_~y$w_buff1_used~0_57 256) 0) (= 2 v_~y$w_buff0~0_16) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (= v_~y$w_buff0~0_17 v_~y$w_buff1~0_16) (= v_P0Thread1of1ForFork0_~arg.offset_4 |v_P0Thread1of1ForFork0_#in~arg.offset_4|) (= 1 v_~y$w_buff0_used~0_91) (= v_~y$w_buff1_used~0_57 v_~y$w_buff0_used~0_92) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_8 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (= v_P0Thread1of1ForFork0_~arg.base_4 |v_P0Thread1of1ForFork0_#in~arg.base_4|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_92, ~y$w_buff0~0=v_~y$w_buff0~0_17, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_91, ~y$w_buff1~0=v_~y$w_buff1~0_16, ~y$w_buff0~0=v_~y$w_buff0~0_16, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_8, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_4, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_4, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_57} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 22:23:06,639 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [642] [642] L756-2-->L756-4: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-1838594371 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In-1838594371 256)))) (or (and (not .cse0) (= ~y$w_buff1~0_In-1838594371 |P1Thread1of1ForFork1_#t~ite9_Out-1838594371|) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite9_Out-1838594371| ~y~0_In-1838594371)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1838594371, ~y$w_buff1~0=~y$w_buff1~0_In-1838594371, ~y~0=~y~0_In-1838594371, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1838594371} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1838594371, ~y$w_buff1~0=~y$w_buff1~0_In-1838594371, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-1838594371|, ~y~0=~y~0_In-1838594371, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1838594371} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-27 22:23:06,639 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [621] [621] L756-4-->L757: Formula: (= |v_P1Thread1of1ForFork1_#t~ite9_8| v_~y~0_19) InVars {P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_8|} OutVars{P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_7|, P1Thread1of1ForFork1_#t~ite10=|v_P1Thread1of1ForFork1_#t~ite10_7|, ~y~0=v_~y~0_19} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10, ~y~0] because there is no mapped edge [2019-12-27 22:23:06,639 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [646] [646] L757-->L757-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-290652379 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-290652379 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite11_Out-290652379|)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In-290652379 |P1Thread1of1ForFork1_#t~ite11_Out-290652379|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-290652379, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-290652379} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-290652379, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-290652379, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-290652379|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 22:23:06,640 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L758-->L758-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-831298511 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-831298511 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-831298511 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In-831298511 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite12_Out-831298511| ~y$w_buff1_used~0_In-831298511) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P1Thread1of1ForFork1_#t~ite12_Out-831298511| 0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-831298511, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-831298511, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-831298511, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-831298511} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-831298511, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-831298511, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-831298511, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-831298511|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-831298511} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 22:23:06,640 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L759-->L759-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1178604955 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In1178604955 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite13_Out1178604955| 0)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite13_Out1178604955| ~y$r_buff0_thd2~0_In1178604955)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1178604955, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1178604955} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1178604955, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1178604955, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out1178604955|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-27 22:23:06,641 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L760-->L760-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1823770630 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In1823770630 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In1823770630 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In1823770630 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd2~0_In1823770630 |P1Thread1of1ForFork1_#t~ite14_Out1823770630|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork1_#t~ite14_Out1823770630|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1823770630, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1823770630, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1823770630, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1823770630} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1823770630, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1823770630, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1823770630, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1823770630|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1823770630} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 22:23:06,641 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L760-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y$r_buff1_thd2~0_13 |v_P1Thread1of1ForFork1_#t~ite14_8|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_8|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_13, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_7|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 22:23:06,641 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [655] [655] L737-->L737-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-595123666 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-595123666 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out-595123666| ~y$w_buff0_used~0_In-595123666)) (and (not .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out-595123666| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-595123666, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-595123666} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-595123666|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-595123666, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-595123666} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 22:23:06,642 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [641] [641] L738-->L738-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1456456221 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd1~0_In-1456456221 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-1456456221 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd1~0_In-1456456221 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-1456456221 |P0Thread1of1ForFork0_#t~ite6_Out-1456456221|)) (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-1456456221|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1456456221, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1456456221, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1456456221, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1456456221} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1456456221|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1456456221, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1456456221, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1456456221, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1456456221} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 22:23:06,642 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L739-->L740: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1274355768 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd1~0_In1274355768 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 ~y$r_buff0_thd1~0_Out1274355768)) (and (= ~y$r_buff0_thd1~0_Out1274355768 ~y$r_buff0_thd1~0_In1274355768) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1274355768, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1274355768} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1274355768, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1274355768|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out1274355768} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 22:23:06,643 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L740-->L740-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-1702211929 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd1~0_In-1702211929 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In-1702211929 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd1~0_In-1702211929 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite8_Out-1702211929| ~y$r_buff1_thd1~0_In-1702211929)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P0Thread1of1ForFork0_#t~ite8_Out-1702211929| 0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1702211929, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1702211929, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1702211929, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1702211929} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1702211929, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1702211929, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1702211929|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1702211929, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1702211929} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 22:23:06,643 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [667] [667] L740-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_7 (+ v_~__unbuffered_cnt~0_8 1)) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~y$r_buff1_thd1~0_14)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_14, 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_7} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 22:23:06,643 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [577] [577] L785-->L787-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_4 256) 0)) (or (= (mod v_~y$w_buff0_used~0_67 256) 0) (= 0 (mod v_~y$r_buff0_thd0~0_44 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_67, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_44, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_67, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_44, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 22:23:06,643 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [656] [656] L787-2-->L787-5: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd0~0_In-1025051734 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1025051734 256))) (.cse1 (= |ULTIMATE.start_main_#t~ite18_Out-1025051734| |ULTIMATE.start_main_#t~ite17_Out-1025051734|))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite17_Out-1025051734| ~y$w_buff1~0_In-1025051734) .cse1 (not .cse2)) (and (= |ULTIMATE.start_main_#t~ite17_Out-1025051734| ~y~0_In-1025051734) (or .cse2 .cse0) .cse1))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1025051734, ~y~0=~y~0_In-1025051734, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1025051734, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1025051734} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out-1025051734|, ~y$w_buff1~0=~y$w_buff1~0_In-1025051734, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out-1025051734|, ~y~0=~y~0_In-1025051734, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1025051734, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1025051734} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18] because there is no mapped edge [2019-12-27 22:23:06,644 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L788-->L788-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In890552277 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In890552277 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite19_Out890552277|) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In890552277 |ULTIMATE.start_main_#t~ite19_Out890552277|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In890552277, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In890552277} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In890552277, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out890552277|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In890552277} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-27 22:23:06,644 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L789-->L789-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-286021796 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-286021796 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-286021796 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In-286021796 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite20_Out-286021796| 0)) (and (= |ULTIMATE.start_main_#t~ite20_Out-286021796| ~y$w_buff1_used~0_In-286021796) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-286021796, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-286021796, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-286021796, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-286021796} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-286021796, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-286021796, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-286021796|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-286021796, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-286021796} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 22:23:06,645 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L790-->L790-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In543079109 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In543079109 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite21_Out543079109| ~y$r_buff0_thd0~0_In543079109)) (and (= 0 |ULTIMATE.start_main_#t~ite21_Out543079109|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In543079109, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In543079109} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In543079109, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In543079109, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out543079109|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 22:23:06,646 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L791-->L791-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd0~0_In565734485 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In565734485 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In565734485 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In565734485 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite22_Out565734485| ~y$r_buff1_thd0~0_In565734485) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite22_Out565734485| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In565734485, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In565734485, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In565734485, ~y$w_buff1_used~0=~y$w_buff1_used~0_In565734485} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In565734485, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In565734485, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In565734485, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out565734485|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In565734485} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 22:23:06,648 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L800-->L800-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In472027451 256)))) (or (and .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In472027451 256)))) (or (and .cse1 (= (mod ~y$r_buff1_thd0~0_In472027451 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In472027451 256)) (and .cse1 (= (mod ~y$w_buff1_used~0_In472027451 256) 0)))) (= |ULTIMATE.start_main_#t~ite32_Out472027451| |ULTIMATE.start_main_#t~ite31_Out472027451|) (= ~y$w_buff1~0_In472027451 |ULTIMATE.start_main_#t~ite31_Out472027451|)) (and (= ~y$w_buff1~0_In472027451 |ULTIMATE.start_main_#t~ite32_Out472027451|) (= |ULTIMATE.start_main_#t~ite31_In472027451| |ULTIMATE.start_main_#t~ite31_Out472027451|) (not .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In472027451, ~y$w_buff0_used~0=~y$w_buff0_used~0_In472027451, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In472027451, ~weak$$choice2~0=~weak$$choice2~0_In472027451, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_In472027451|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In472027451, ~y$w_buff1_used~0=~y$w_buff1_used~0_In472027451} OutVars{~y$w_buff1~0=~y$w_buff1~0_In472027451, ~y$w_buff0_used~0=~y$w_buff0_used~0_In472027451, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In472027451, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out472027451|, ~weak$$choice2~0=~weak$$choice2~0_In472027451, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_Out472027451|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In472027451, ~y$w_buff1_used~0=~y$w_buff1_used~0_In472027451} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite32] because there is no mapped edge [2019-12-27 22:23:06,650 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [637] [637] L803-->L804: Formula: (and (not (= (mod v_~weak$$choice2~0_27 256) 0)) (= v_~y$r_buff0_thd0~0_66 v_~y$r_buff0_thd0~0_65)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_66, ~weak$$choice2~0=v_~weak$$choice2~0_27} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_9|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_9|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_8|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_65, ~weak$$choice2~0=v_~weak$$choice2~0_27} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39, ~y$r_buff0_thd0~0] because there is no mapped edge [2019-12-27 22:23:06,651 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L806-->L809-1: Formula: (and (= 0 v_~y$flush_delayed~0_10) (= v_~y~0_23 v_~y$mem_tmp~0_7) (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (not (= 0 (mod v_~y$flush_delayed~0_11 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_11, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_10, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~y~0=v_~y~0_23, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_10|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~y~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 22:23:06,651 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L809-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 22:23:06,712 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 10:23:06 BasicIcfg [2019-12-27 22:23:06,712 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 22:23:06,714 INFO L168 Benchmark]: Toolchain (without parser) took 21679.22 ms. Allocated memory was 138.9 MB in the beginning and 850.4 MB in the end (delta: 711.5 MB). Free memory was 100.8 MB in the beginning and 520.5 MB in the end (delta: -419.8 MB). Peak memory consumption was 291.7 MB. Max. memory is 7.1 GB. [2019-12-27 22:23:06,715 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 138.9 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 22:23:06,716 INFO L168 Benchmark]: CACSL2BoogieTranslator took 717.06 ms. Allocated memory was 138.9 MB in the beginning and 203.9 MB in the end (delta: 65.0 MB). Free memory was 100.6 MB in the beginning and 158.6 MB in the end (delta: -58.0 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. [2019-12-27 22:23:06,716 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.52 ms. Allocated memory is still 203.9 MB. Free memory was 158.6 MB in the beginning and 155.3 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-12-27 22:23:06,717 INFO L168 Benchmark]: Boogie Preprocessor took 49.14 ms. Allocated memory is still 203.9 MB. Free memory was 155.3 MB in the beginning and 153.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 22:23:06,717 INFO L168 Benchmark]: RCFGBuilder took 810.45 ms. Allocated memory is still 203.9 MB. Free memory was 153.3 MB in the beginning and 109.0 MB in the end (delta: 44.3 MB). Peak memory consumption was 44.3 MB. Max. memory is 7.1 GB. [2019-12-27 22:23:06,718 INFO L168 Benchmark]: TraceAbstraction took 20030.66 ms. Allocated memory was 203.9 MB in the beginning and 850.4 MB in the end (delta: 646.4 MB). Free memory was 108.3 MB in the beginning and 520.5 MB in the end (delta: -412.2 MB). Peak memory consumption was 234.3 MB. Max. memory is 7.1 GB. [2019-12-27 22:23:06,722 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.21 ms. Allocated memory is still 138.9 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 717.06 ms. Allocated memory was 138.9 MB in the beginning and 203.9 MB in the end (delta: 65.0 MB). Free memory was 100.6 MB in the beginning and 158.6 MB in the end (delta: -58.0 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 66.52 ms. Allocated memory is still 203.9 MB. Free memory was 158.6 MB in the beginning and 155.3 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 49.14 ms. Allocated memory is still 203.9 MB. Free memory was 155.3 MB in the beginning and 153.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 810.45 ms. Allocated memory is still 203.9 MB. Free memory was 153.3 MB in the beginning and 109.0 MB in the end (delta: 44.3 MB). Peak memory consumption was 44.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 20030.66 ms. Allocated memory was 203.9 MB in the beginning and 850.4 MB in the end (delta: 646.4 MB). Free memory was 108.3 MB in the beginning and 520.5 MB in the end (delta: -412.2 MB). Peak memory consumption was 234.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.5s, 146 ProgramPointsBefore, 81 ProgramPointsAfterwards, 180 TransitionsBefore, 94 TransitionsAfterwards, 10418 CoEnabledTransitionPairs, 8 FixpointIterations, 28 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 24 ChoiceCompositions, 3312 VarBasedMoverChecksPositive, 143 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 54561 CheckedPairsTotal, 98 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L779] FCALL, FORK 0 pthread_create(&t2009, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L781] FCALL, FORK 0 pthread_create(&t2010, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L727] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L728] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L729] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L730] 1 y$r_buff0_thd1 = (_Bool)1 [L733] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L750] 2 __unbuffered_p1_EAX = x [L753] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L756] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L758] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L759] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L737] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L738] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L783] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L788] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L789] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L790] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L791] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L794] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L795] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L796] 0 y$flush_delayed = weak$$choice2 [L797] 0 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L799] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L799] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L800] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L801] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L801] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L802] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L802] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L804] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L804] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L805] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 140 locations, 2 error locations. Result: UNSAFE, OverallTime: 19.8s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 8.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1517 SDtfs, 1603 SDslu, 4609 SDs, 0 SdLazy, 3707 SolverSat, 182 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 198 GetRequests, 37 SyntacticMatches, 12 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 854 ImplicationChecksByTransitivity, 4.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15582occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 10797 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 557 NumberOfCodeBlocks, 557 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 489 ConstructedInterpolants, 0 QuantifiedInterpolants, 126715 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...