/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi001_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 17:40:44,747 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 17:40:44,749 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 17:40:44,761 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 17:40:44,762 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 17:40:44,763 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 17:40:44,764 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 17:40:44,766 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 17:40:44,768 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 17:40:44,769 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 17:40:44,770 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 17:40:44,771 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 17:40:44,771 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 17:40:44,772 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 17:40:44,773 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 17:40:44,774 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 17:40:44,775 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 17:40:44,776 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 17:40:44,778 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 17:40:44,780 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 17:40:44,781 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 17:40:44,783 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 17:40:44,784 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 17:40:44,785 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 17:40:44,787 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 17:40:44,787 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 17:40:44,788 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 17:40:44,789 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 17:40:44,789 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 17:40:44,790 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 17:40:44,790 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 17:40:44,791 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 17:40:44,792 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 17:40:44,793 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 17:40:44,794 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 17:40:44,794 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 17:40:44,795 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 17:40:44,795 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 17:40:44,795 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 17:40:44,796 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 17:40:44,797 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 17:40:44,797 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 17:40:44,812 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 17:40:44,812 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 17:40:44,813 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 17:40:44,813 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 17:40:44,813 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 17:40:44,814 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 17:40:44,814 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 17:40:44,814 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 17:40:44,814 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 17:40:44,814 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 17:40:44,815 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 17:40:44,815 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 17:40:44,815 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 17:40:44,815 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 17:40:44,815 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 17:40:44,816 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 17:40:44,816 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 17:40:44,816 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 17:40:44,816 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 17:40:44,816 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 17:40:44,817 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 17:40:44,817 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 17:40:44,817 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 17:40:44,817 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 17:40:44,817 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 17:40:44,818 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 17:40:44,818 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 17:40:44,818 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 17:40:44,818 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 17:40:44,818 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 17:40:44,819 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 17:40:45,144 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 17:40:45,157 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 17:40:45,160 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 17:40:45,162 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 17:40:45,162 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 17:40:45,163 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi001_power.opt.i [2019-12-27 17:40:45,225 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e388f060e/e3e80b319c424d678883065f6c8facfc/FLAG928377b42 [2019-12-27 17:40:45,805 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 17:40:45,806 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi001_power.opt.i [2019-12-27 17:40:45,834 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e388f060e/e3e80b319c424d678883065f6c8facfc/FLAG928377b42 [2019-12-27 17:40:46,010 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e388f060e/e3e80b319c424d678883065f6c8facfc [2019-12-27 17:40:46,019 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 17:40:46,020 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 17:40:46,021 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 17:40:46,022 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 17:40:46,025 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 17:40:46,026 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:40:46" (1/1) ... [2019-12-27 17:40:46,029 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1548a6b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:40:46, skipping insertion in model container [2019-12-27 17:40:46,029 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:40:46" (1/1) ... [2019-12-27 17:40:46,036 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 17:40:46,095 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 17:40:46,646 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:40:46,661 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 17:40:46,731 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:40:46,812 INFO L208 MainTranslator]: Completed translation [2019-12-27 17:40:46,813 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:40:46 WrapperNode [2019-12-27 17:40:46,813 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 17:40:46,814 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 17:40:46,814 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 17:40:46,814 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 17:40:46,826 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:40:46" (1/1) ... [2019-12-27 17:40:46,846 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:40:46" (1/1) ... [2019-12-27 17:40:46,885 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 17:40:46,885 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 17:40:46,885 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 17:40:46,885 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 17:40:46,894 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:40:46" (1/1) ... [2019-12-27 17:40:46,894 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:40:46" (1/1) ... [2019-12-27 17:40:46,899 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:40:46" (1/1) ... [2019-12-27 17:40:46,900 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:40:46" (1/1) ... [2019-12-27 17:40:46,909 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:40:46" (1/1) ... [2019-12-27 17:40:46,914 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:40:46" (1/1) ... [2019-12-27 17:40:46,918 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:40:46" (1/1) ... [2019-12-27 17:40:46,923 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 17:40:46,923 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 17:40:46,923 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 17:40:46,924 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 17:40:46,924 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:40:46" (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 17:40:46,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 17:40:46,992 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 17:40:46,993 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 17:40:46,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 17:40:46,993 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 17:40:46,994 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 17:40:46,994 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 17:40:46,995 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 17:40:46,995 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 17:40:46,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 17:40:46,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 17:40:46,998 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 17:40:47,679 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 17:40:47,680 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 17:40:47,681 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:40:47 BoogieIcfgContainer [2019-12-27 17:40:47,682 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 17:40:47,683 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 17:40:47,683 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 17:40:47,686 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 17:40:47,687 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 05:40:46" (1/3) ... [2019-12-27 17:40:47,688 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53222ae2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:40:47, skipping insertion in model container [2019-12-27 17:40:47,688 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:40:46" (2/3) ... [2019-12-27 17:40:47,689 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53222ae2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:40:47, skipping insertion in model container [2019-12-27 17:40:47,689 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:40:47" (3/3) ... [2019-12-27 17:40:47,691 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi001_power.opt.i [2019-12-27 17:40:47,702 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 17:40:47,702 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 17:40:47,713 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 17:40:47,714 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 17:40:47,752 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:47,752 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:47,752 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:47,753 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:47,753 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:47,754 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:47,754 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:47,754 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:47,754 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:47,755 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:47,755 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:47,755 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:47,756 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:47,756 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:47,756 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:47,756 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:47,757 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:47,757 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:47,757 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:47,758 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:47,758 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:47,758 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:47,758 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:47,760 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:47,760 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:47,761 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:47,761 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:47,761 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:47,761 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:47,761 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:47,763 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:47,764 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:47,764 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:47,764 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:47,764 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:47,764 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:47,765 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:47,766 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:47,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:47,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:47,770 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:47,770 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:47,770 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:47,771 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:47,771 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:47,771 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:47,773 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:47,773 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:47,773 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:47,774 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:47,774 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:47,774 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:47,775 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:47,775 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:47,776 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:47,776 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:47,776 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:47,776 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:47,777 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:47,777 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:47,778 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:47,778 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:47,778 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:47,778 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:47,782 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:47,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:47,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:47,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:47,784 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:47,784 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:47,785 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:47,785 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:47,785 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:47,785 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:47,789 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:47,790 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:47,790 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:47,790 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:47,790 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:47,790 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:47,791 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:47,792 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:47,792 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:47,792 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:47,792 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:47,793 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:47,810 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 17:40:47,832 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 17:40:47,832 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 17:40:47,832 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 17:40:47,833 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 17:40:47,833 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 17:40:47,833 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 17:40:47,833 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 17:40:47,833 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 17:40:47,860 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 182 transitions [2019-12-27 17:40:47,862 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-27 17:40:48,008 INFO L132 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-27 17:40:48,008 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:40:48,020 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 256 event pairs. 0/137 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 17:40:48,038 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-27 17:40:48,085 INFO L132 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-27 17:40:48,086 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:40:48,091 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 256 event pairs. 0/137 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 17:40:48,104 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10378 [2019-12-27 17:40:48,105 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 17:40:52,229 WARN L192 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-27 17:40:52,394 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-27 17:40:52,432 INFO L206 etLargeBlockEncoding]: Checked pairs total: 46553 [2019-12-27 17:40:52,432 INFO L214 etLargeBlockEncoding]: Total number of compositions: 101 [2019-12-27 17:40:52,437 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 78 places, 90 transitions [2019-12-27 17:40:52,893 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8413 states. [2019-12-27 17:40:52,895 INFO L276 IsEmpty]: Start isEmpty. Operand 8413 states. [2019-12-27 17:40:52,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 17:40:52,903 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:40:52,904 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 17:40:52,905 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:40:52,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:40:52,913 INFO L82 PathProgramCache]: Analyzing trace with hash 698534967, now seen corresponding path program 1 times [2019-12-27 17:40:52,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:40:52,929 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359107373] [2019-12-27 17:40:52,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:40:53,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:40:53,218 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 17:40:53,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359107373] [2019-12-27 17:40:53,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:40:53,221 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 17:40:53,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [277471849] [2019-12-27 17:40:53,224 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:40:53,231 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:40:53,248 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 17:40:53,249 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:40:53,254 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:40:53,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:40:53,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:40:53,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:40:53,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:40:53,275 INFO L87 Difference]: Start difference. First operand 8413 states. Second operand 3 states. [2019-12-27 17:40:53,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:40:53,537 INFO L93 Difference]: Finished difference Result 8365 states and 27377 transitions. [2019-12-27 17:40:53,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:40:53,539 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 17:40:53,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:40:53,646 INFO L225 Difference]: With dead ends: 8365 [2019-12-27 17:40:53,647 INFO L226 Difference]: Without dead ends: 8196 [2019-12-27 17:40:53,648 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 17:40:53,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8196 states. [2019-12-27 17:40:54,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8196 to 8196. [2019-12-27 17:40:54,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8196 states. [2019-12-27 17:40:54,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8196 states to 8196 states and 26857 transitions. [2019-12-27 17:40:54,120 INFO L78 Accepts]: Start accepts. Automaton has 8196 states and 26857 transitions. Word has length 5 [2019-12-27 17:40:54,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:40:54,121 INFO L462 AbstractCegarLoop]: Abstraction has 8196 states and 26857 transitions. [2019-12-27 17:40:54,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:40:54,121 INFO L276 IsEmpty]: Start isEmpty. Operand 8196 states and 26857 transitions. [2019-12-27 17:40:54,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 17:40:54,126 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:40:54,127 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:40:54,127 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:40:54,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:40:54,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1108629868, now seen corresponding path program 1 times [2019-12-27 17:40:54,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:40:54,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942451791] [2019-12-27 17:40:54,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:40:54,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:40:54,219 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 17:40:54,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942451791] [2019-12-27 17:40:54,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:40:54,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:40:54,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1137169584] [2019-12-27 17:40:54,220 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:40:54,222 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:40:54,228 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 35 transitions. [2019-12-27 17:40:54,229 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:40:54,267 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:40:54,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:40:54,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:40:54,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:40:54,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:40:54,270 INFO L87 Difference]: Start difference. First operand 8196 states and 26857 transitions. Second operand 5 states. [2019-12-27 17:40:54,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:40:54,687 INFO L93 Difference]: Finished difference Result 13084 states and 41046 transitions. [2019-12-27 17:40:54,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:40:54,688 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-12-27 17:40:54,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:40:54,771 INFO L225 Difference]: With dead ends: 13084 [2019-12-27 17:40:54,772 INFO L226 Difference]: Without dead ends: 13077 [2019-12-27 17:40:54,773 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:40:54,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13077 states. [2019-12-27 17:40:55,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13077 to 11568. [2019-12-27 17:40:55,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11568 states. [2019-12-27 17:40:55,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11568 states to 11568 states and 36838 transitions. [2019-12-27 17:40:55,820 INFO L78 Accepts]: Start accepts. Automaton has 11568 states and 36838 transitions. Word has length 11 [2019-12-27 17:40:55,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:40:55,820 INFO L462 AbstractCegarLoop]: Abstraction has 11568 states and 36838 transitions. [2019-12-27 17:40:55,820 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:40:55,820 INFO L276 IsEmpty]: Start isEmpty. Operand 11568 states and 36838 transitions. [2019-12-27 17:40:55,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 17:40:55,831 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:40:55,831 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:40:55,831 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:40:55,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:40:55,832 INFO L82 PathProgramCache]: Analyzing trace with hash 531606898, now seen corresponding path program 1 times [2019-12-27 17:40:55,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:40:55,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104713122] [2019-12-27 17:40:55,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:40:55,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:40:55,914 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 17:40:55,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104713122] [2019-12-27 17:40:55,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:40:55,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:40:55,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1411103153] [2019-12-27 17:40:55,915 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:40:55,917 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:40:55,919 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 17:40:55,919 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:40:55,920 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:40:55,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:40:55,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:40:55,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:40:55,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:40:55,921 INFO L87 Difference]: Start difference. First operand 11568 states and 36838 transitions. Second operand 4 states. [2019-12-27 17:40:56,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:40:56,193 INFO L93 Difference]: Finished difference Result 14627 states and 46118 transitions. [2019-12-27 17:40:56,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:40:56,194 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 17:40:56,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:40:56,239 INFO L225 Difference]: With dead ends: 14627 [2019-12-27 17:40:56,239 INFO L226 Difference]: Without dead ends: 14627 [2019-12-27 17:40:56,239 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 17:40:56,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14627 states. [2019-12-27 17:40:56,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14627 to 12851. [2019-12-27 17:40:56,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12851 states. [2019-12-27 17:40:56,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12851 states to 12851 states and 40863 transitions. [2019-12-27 17:40:56,789 INFO L78 Accepts]: Start accepts. Automaton has 12851 states and 40863 transitions. Word has length 11 [2019-12-27 17:40:56,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:40:56,789 INFO L462 AbstractCegarLoop]: Abstraction has 12851 states and 40863 transitions. [2019-12-27 17:40:56,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:40:56,790 INFO L276 IsEmpty]: Start isEmpty. Operand 12851 states and 40863 transitions. [2019-12-27 17:40:56,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 17:40:56,793 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:40:56,793 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 17:40:56,794 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:40:56,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:40:56,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1151367975, now seen corresponding path program 1 times [2019-12-27 17:40:56,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:40:56,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495995954] [2019-12-27 17:40:56,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:40:56,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:40:56,891 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 17:40:56,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495995954] [2019-12-27 17:40:56,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:40:56,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:40:56,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1835291924] [2019-12-27 17:40:56,893 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:40:56,897 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:40:56,905 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 34 states and 49 transitions. [2019-12-27 17:40:56,905 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:40:56,905 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:40:56,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:40:56,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:40:56,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:40:56,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:40:56,907 INFO L87 Difference]: Start difference. First operand 12851 states and 40863 transitions. Second operand 5 states. [2019-12-27 17:40:57,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:40:57,340 INFO L93 Difference]: Finished difference Result 17501 states and 54434 transitions. [2019-12-27 17:40:57,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 17:40:57,341 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-27 17:40:57,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:40:57,382 INFO L225 Difference]: With dead ends: 17501 [2019-12-27 17:40:57,382 INFO L226 Difference]: Without dead ends: 17494 [2019-12-27 17:40:57,383 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 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 17:40:57,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17494 states. [2019-12-27 17:40:57,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17494 to 12893. [2019-12-27 17:40:57,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12893 states. [2019-12-27 17:40:58,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12893 states to 12893 states and 40855 transitions. [2019-12-27 17:40:58,646 INFO L78 Accepts]: Start accepts. Automaton has 12893 states and 40855 transitions. Word has length 17 [2019-12-27 17:40:58,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:40:58,646 INFO L462 AbstractCegarLoop]: Abstraction has 12893 states and 40855 transitions. [2019-12-27 17:40:58,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:40:58,647 INFO L276 IsEmpty]: Start isEmpty. Operand 12893 states and 40855 transitions. [2019-12-27 17:40:58,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 17:40:58,662 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:40:58,662 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 17:40:58,662 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:40:58,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:40:58,662 INFO L82 PathProgramCache]: Analyzing trace with hash -2101636237, now seen corresponding path program 1 times [2019-12-27 17:40:58,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:40:58,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130085463] [2019-12-27 17:40:58,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:40:58,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:40:58,709 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 17:40:58,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130085463] [2019-12-27 17:40:58,710 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:40:58,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:40:58,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1149038922] [2019-12-27 17:40:58,710 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:40:58,715 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:40:58,724 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 17:40:58,725 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:40:58,725 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:40:58,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:40:58,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:40:58,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:40:58,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:40:58,726 INFO L87 Difference]: Start difference. First operand 12893 states and 40855 transitions. Second operand 3 states. [2019-12-27 17:40:58,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:40:58,860 INFO L93 Difference]: Finished difference Result 15714 states and 49940 transitions. [2019-12-27 17:40:58,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:40:58,860 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-12-27 17:40:58,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:40:58,892 INFO L225 Difference]: With dead ends: 15714 [2019-12-27 17:40:58,892 INFO L226 Difference]: Without dead ends: 15714 [2019-12-27 17:40:58,892 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 17:40:58,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15714 states. [2019-12-27 17:40:59,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15714 to 14811. [2019-12-27 17:40:59,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14811 states. [2019-12-27 17:40:59,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14811 states to 14811 states and 47249 transitions. [2019-12-27 17:40:59,308 INFO L78 Accepts]: Start accepts. Automaton has 14811 states and 47249 transitions. Word has length 25 [2019-12-27 17:40:59,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:40:59,311 INFO L462 AbstractCegarLoop]: Abstraction has 14811 states and 47249 transitions. [2019-12-27 17:40:59,312 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:40:59,312 INFO L276 IsEmpty]: Start isEmpty. Operand 14811 states and 47249 transitions. [2019-12-27 17:40:59,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 17:40:59,329 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:40:59,329 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 17:40:59,329 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:40:59,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:40:59,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1939096541, now seen corresponding path program 1 times [2019-12-27 17:40:59,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:40:59,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634063274] [2019-12-27 17:40:59,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:40:59,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:40:59,436 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 17:40:59,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634063274] [2019-12-27 17:40:59,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:40:59,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:40:59,438 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [229739008] [2019-12-27 17:40:59,438 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:40:59,444 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:40:59,452 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 17:40:59,452 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:40:59,452 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:40:59,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:40:59,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:40:59,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:40:59,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:40:59,454 INFO L87 Difference]: Start difference. First operand 14811 states and 47249 transitions. Second operand 4 states. [2019-12-27 17:40:59,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:40:59,489 INFO L93 Difference]: Finished difference Result 2380 states and 5507 transitions. [2019-12-27 17:40:59,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 17:40:59,489 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 17:40:59,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:40:59,492 INFO L225 Difference]: With dead ends: 2380 [2019-12-27 17:40:59,493 INFO L226 Difference]: Without dead ends: 2094 [2019-12-27 17:40:59,493 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 17:40:59,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2094 states. [2019-12-27 17:40:59,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2094 to 2094. [2019-12-27 17:40:59,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2094 states. [2019-12-27 17:40:59,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2094 states to 2094 states and 4716 transitions. [2019-12-27 17:40:59,527 INFO L78 Accepts]: Start accepts. Automaton has 2094 states and 4716 transitions. Word has length 25 [2019-12-27 17:40:59,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:40:59,528 INFO L462 AbstractCegarLoop]: Abstraction has 2094 states and 4716 transitions. [2019-12-27 17:40:59,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:40:59,530 INFO L276 IsEmpty]: Start isEmpty. Operand 2094 states and 4716 transitions. [2019-12-27 17:40:59,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 17:40:59,534 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:40:59,534 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 17:40:59,534 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:40:59,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:40:59,535 INFO L82 PathProgramCache]: Analyzing trace with hash -673430796, now seen corresponding path program 1 times [2019-12-27 17:40:59,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:40:59,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360184266] [2019-12-27 17:40:59,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:40:59,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:40:59,657 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 17:40:59,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360184266] [2019-12-27 17:40:59,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:40:59,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 17:40:59,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [90225547] [2019-12-27 17:40:59,659 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:40:59,669 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:40:59,693 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 62 states and 85 transitions. [2019-12-27 17:40:59,693 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:40:59,713 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:40:59,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:40:59,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:40:59,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:40:59,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:40:59,714 INFO L87 Difference]: Start difference. First operand 2094 states and 4716 transitions. Second operand 6 states. [2019-12-27 17:40:59,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:40:59,767 INFO L93 Difference]: Finished difference Result 429 states and 783 transitions. [2019-12-27 17:40:59,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:40:59,767 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2019-12-27 17:40:59,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:40:59,768 INFO L225 Difference]: With dead ends: 429 [2019-12-27 17:40:59,768 INFO L226 Difference]: Without dead ends: 383 [2019-12-27 17:40:59,769 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-27 17:40:59,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2019-12-27 17:40:59,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 348. [2019-12-27 17:40:59,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-12-27 17:40:59,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 628 transitions. [2019-12-27 17:40:59,776 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 628 transitions. Word has length 37 [2019-12-27 17:40:59,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:40:59,776 INFO L462 AbstractCegarLoop]: Abstraction has 348 states and 628 transitions. [2019-12-27 17:40:59,776 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:40:59,776 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 628 transitions. [2019-12-27 17:40:59,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 17:40:59,780 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:40:59,780 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 17:40:59,780 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:40:59,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:40:59,781 INFO L82 PathProgramCache]: Analyzing trace with hash 939573543, now seen corresponding path program 1 times [2019-12-27 17:40:59,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:40:59,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481669110] [2019-12-27 17:40:59,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:40:59,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:40:59,886 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 17:40:59,886 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481669110] [2019-12-27 17:40:59,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:40:59,887 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:40:59,887 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1079156245] [2019-12-27 17:40:59,887 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:40:59,904 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:40:59,939 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 83 states and 112 transitions. [2019-12-27 17:40:59,940 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:40:59,940 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:40:59,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:40:59,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:40:59,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:40:59,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:40:59,941 INFO L87 Difference]: Start difference. First operand 348 states and 628 transitions. Second operand 3 states. [2019-12-27 17:40:59,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:40:59,982 INFO L93 Difference]: Finished difference Result 352 states and 622 transitions. [2019-12-27 17:40:59,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:40:59,985 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 17:40:59,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:40:59,986 INFO L225 Difference]: With dead ends: 352 [2019-12-27 17:40:59,986 INFO L226 Difference]: Without dead ends: 352 [2019-12-27 17:40:59,986 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 17:40:59,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2019-12-27 17:40:59,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 344. [2019-12-27 17:40:59,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-12-27 17:40:59,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 614 transitions. [2019-12-27 17:40:59,996 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 614 transitions. Word has length 52 [2019-12-27 17:40:59,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:40:59,996 INFO L462 AbstractCegarLoop]: Abstraction has 344 states and 614 transitions. [2019-12-27 17:40:59,997 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:40:59,997 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 614 transitions. [2019-12-27 17:40:59,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 17:40:59,997 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:40:59,998 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 17:40:59,998 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:40:59,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:40:59,998 INFO L82 PathProgramCache]: Analyzing trace with hash 933754688, now seen corresponding path program 1 times [2019-12-27 17:40:59,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:40:59,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501389101] [2019-12-27 17:40:59,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:41:00,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:41:00,056 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 17:41:00,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501389101] [2019-12-27 17:41:00,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:41:00,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:41:00,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1497507999] [2019-12-27 17:41:00,058 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:41:00,074 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:41:00,107 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 83 states and 112 transitions. [2019-12-27 17:41:00,107 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:41:00,108 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:41:00,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:41:00,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:41:00,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:41:00,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:41:00,109 INFO L87 Difference]: Start difference. First operand 344 states and 614 transitions. Second operand 3 states. [2019-12-27 17:41:00,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:41:00,122 INFO L93 Difference]: Finished difference Result 344 states and 601 transitions. [2019-12-27 17:41:00,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:41:00,122 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 17:41:00,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:41:00,123 INFO L225 Difference]: With dead ends: 344 [2019-12-27 17:41:00,123 INFO L226 Difference]: Without dead ends: 344 [2019-12-27 17:41:00,123 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 17:41:00,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2019-12-27 17:41:00,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 344. [2019-12-27 17:41:00,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-12-27 17:41:00,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 601 transitions. [2019-12-27 17:41:00,128 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 601 transitions. Word has length 52 [2019-12-27 17:41:00,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:41:00,129 INFO L462 AbstractCegarLoop]: Abstraction has 344 states and 601 transitions. [2019-12-27 17:41:00,129 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:41:00,129 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 601 transitions. [2019-12-27 17:41:00,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 17:41:00,130 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:41:00,130 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 17:41:00,130 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:41:00,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:41:00,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1595558797, now seen corresponding path program 1 times [2019-12-27 17:41:00,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:41:00,132 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045138049] [2019-12-27 17:41:00,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:41:00,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:41:00,395 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 17:41:00,396 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045138049] [2019-12-27 17:41:00,396 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:41:00,396 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 17:41:00,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [996932791] [2019-12-27 17:41:00,397 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:41:00,410 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:41:00,445 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 87 states and 119 transitions. [2019-12-27 17:41:00,445 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:41:00,550 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 17:41:00,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 17:41:00,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:41:00,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 17:41:00,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-27 17:41:00,551 INFO L87 Difference]: Start difference. First operand 344 states and 601 transitions. Second operand 12 states. [2019-12-27 17:41:01,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:41:01,280 INFO L93 Difference]: Finished difference Result 547 states and 920 transitions. [2019-12-27 17:41:01,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 17:41:01,281 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 53 [2019-12-27 17:41:01,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:41:01,281 INFO L225 Difference]: With dead ends: 547 [2019-12-27 17:41:01,282 INFO L226 Difference]: Without dead ends: 547 [2019-12-27 17:41:01,282 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 8 SyntacticMatches, 8 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=126, Invalid=380, Unknown=0, NotChecked=0, Total=506 [2019-12-27 17:41:01,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2019-12-27 17:41:01,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 397. [2019-12-27 17:41:01,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-12-27 17:41:01,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 679 transitions. [2019-12-27 17:41:01,289 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 679 transitions. Word has length 53 [2019-12-27 17:41:01,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:41:01,289 INFO L462 AbstractCegarLoop]: Abstraction has 397 states and 679 transitions. [2019-12-27 17:41:01,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 17:41:01,289 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 679 transitions. [2019-12-27 17:41:01,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 17:41:01,290 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:41:01,291 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 17:41:01,291 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:41:01,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:41:01,291 INFO L82 PathProgramCache]: Analyzing trace with hash 165214383, now seen corresponding path program 2 times [2019-12-27 17:41:01,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:41:01,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064711729] [2019-12-27 17:41:01,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:41:01,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:41:01,374 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 17:41:01,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064711729] [2019-12-27 17:41:01,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:41:01,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:41:01,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [592317182] [2019-12-27 17:41:01,375 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:41:01,389 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:41:01,425 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 79 states and 102 transitions. [2019-12-27 17:41:01,425 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:41:01,425 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:41:01,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:41:01,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:41:01,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:41:01,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:41:01,427 INFO L87 Difference]: Start difference. First operand 397 states and 679 transitions. Second operand 3 states. [2019-12-27 17:41:01,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:41:01,464 INFO L93 Difference]: Finished difference Result 396 states and 677 transitions. [2019-12-27 17:41:01,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:41:01,464 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-27 17:41:01,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:41:01,465 INFO L225 Difference]: With dead ends: 396 [2019-12-27 17:41:01,465 INFO L226 Difference]: Without dead ends: 396 [2019-12-27 17:41:01,466 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 17:41:01,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2019-12-27 17:41:01,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 332. [2019-12-27 17:41:01,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2019-12-27 17:41:01,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 565 transitions. [2019-12-27 17:41:01,473 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 565 transitions. Word has length 53 [2019-12-27 17:41:01,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:41:01,474 INFO L462 AbstractCegarLoop]: Abstraction has 332 states and 565 transitions. [2019-12-27 17:41:01,475 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:41:01,475 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 565 transitions. [2019-12-27 17:41:01,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 17:41:01,476 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:41:01,476 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 17:41:01,476 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:41:01,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:41:01,477 INFO L82 PathProgramCache]: Analyzing trace with hash -798816837, now seen corresponding path program 1 times [2019-12-27 17:41:01,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:41:01,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382760548] [2019-12-27 17:41:01,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:41:01,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:41:01,855 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 17:41:01,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382760548] [2019-12-27 17:41:01,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:41:01,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 17:41:01,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [853933987] [2019-12-27 17:41:01,856 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:41:01,866 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:41:01,896 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 88 states and 119 transitions. [2019-12-27 17:41:01,896 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:41:02,028 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 17:41:02,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 17:41:02,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:41:02,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 17:41:02,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-12-27 17:41:02,030 INFO L87 Difference]: Start difference. First operand 332 states and 565 transitions. Second operand 16 states. [2019-12-27 17:41:03,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:41:03,343 INFO L93 Difference]: Finished difference Result 776 states and 1302 transitions. [2019-12-27 17:41:03,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 17:41:03,349 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 54 [2019-12-27 17:41:03,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:41:03,350 INFO L225 Difference]: With dead ends: 776 [2019-12-27 17:41:03,350 INFO L226 Difference]: Without dead ends: 318 [2019-12-27 17:41:03,351 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 5 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=246, Invalid=876, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 17:41:03,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-12-27 17:41:03,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 250. [2019-12-27 17:41:03,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-12-27 17:41:03,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 417 transitions. [2019-12-27 17:41:03,355 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 417 transitions. Word has length 54 [2019-12-27 17:41:03,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:41:03,355 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 417 transitions. [2019-12-27 17:41:03,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 17:41:03,355 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 417 transitions. [2019-12-27 17:41:03,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 17:41:03,356 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:41:03,356 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 17:41:03,356 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:41:03,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:41:03,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1642640547, now seen corresponding path program 2 times [2019-12-27 17:41:03,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:41:03,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766948881] [2019-12-27 17:41:03,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:41:03,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:41:03,506 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 17:41:03,507 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766948881] [2019-12-27 17:41:03,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:41:03,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:41:03,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1962476263] [2019-12-27 17:41:03,508 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:41:03,533 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:41:03,568 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 73 states and 90 transitions. [2019-12-27 17:41:03,568 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:41:03,592 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 17:41:03,593 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 17:41:03,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:41:03,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 17:41:03,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 17:41:03,594 INFO L87 Difference]: Start difference. First operand 250 states and 417 transitions. Second operand 8 states. [2019-12-27 17:41:03,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:41:03,725 INFO L93 Difference]: Finished difference Result 346 states and 557 transitions. [2019-12-27 17:41:03,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 17:41:03,726 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2019-12-27 17:41:03,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:41:03,727 INFO L225 Difference]: With dead ends: 346 [2019-12-27 17:41:03,727 INFO L226 Difference]: Without dead ends: 206 [2019-12-27 17:41:03,728 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-12-27 17:41:03,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-12-27 17:41:03,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 182. [2019-12-27 17:41:03,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-12-27 17:41:03,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 297 transitions. [2019-12-27 17:41:03,731 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 297 transitions. Word has length 54 [2019-12-27 17:41:03,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:41:03,731 INFO L462 AbstractCegarLoop]: Abstraction has 182 states and 297 transitions. [2019-12-27 17:41:03,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 17:41:03,732 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 297 transitions. [2019-12-27 17:41:03,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 17:41:03,733 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:41:03,733 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 17:41:03,733 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:41:03,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:41:03,734 INFO L82 PathProgramCache]: Analyzing trace with hash -1731930561, now seen corresponding path program 3 times [2019-12-27 17:41:03,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:41:03,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521746562] [2019-12-27 17:41:03,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:41:03,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 17:41:03,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 17:41:03,848 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 17:41:03,849 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 17:41:03,853 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] ULTIMATE.startENTRY-->L789: Formula: (let ((.cse0 (store |v_#valid_42| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= v_~z~0_122 0) (= v_~y$mem_tmp~0_21 0) (= v_~y$r_buff1_thd1~0_178 0) (= 0 v_~__unbuffered_p1_EBX~0_131) (= v_~weak$$choice2~0_120 0) (= v_~__unbuffered_p1_EAX~0_131 0) (= v_~y$r_buff0_thd0~0_347 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1603~0.base_19| 4)) (= 0 v_~y$r_buff1_thd2~0_171) (= v_~x~0_94 0) (= 0 v_~weak$$choice0~0_15) (= v_~y$read_delayed~0_6 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1603~0.base_19|)) (= 0 v_~y$r_buff0_thd2~0_225) (= v_~main$tmp_guard0~0_28 0) (= 0 v_~__unbuffered_cnt~0_63) (= v_~y$r_buff0_thd1~0_109 0) (= v_~y$w_buff0_used~0_663 0) (= |v_#valid_40| (store .cse0 |v_ULTIMATE.start_main_~#t1603~0.base_19| 1)) (= v_~y$w_buff1~0_180 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1603~0.base_19| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1603~0.base_19|) |v_ULTIMATE.start_main_~#t1603~0.offset_14| 0)) |v_#memory_int_15|) (= 0 v_~y$flush_delayed~0_36) (= |v_#NULL.offset_5| 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1603~0.base_19|) (= v_~y~0_158 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~y$r_buff1_thd0~0_274 0) (= 0 v_~y$w_buff0~0_245) (= v_~main$tmp_guard1~0_25 0) (= v_~y$w_buff1_used~0_350 0) (= 0 |v_ULTIMATE.start_main_~#t1603~0.offset_14|) (= 0 |v_#NULL.base_5|) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_44|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_25|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_33|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_47|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_37|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_30|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$mem_tmp~0=v_~y$mem_tmp~0_21, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_131, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_109, ~y$flush_delayed~0=v_~y$flush_delayed~0_36, #length=|v_#length_15|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_30|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_27|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_23|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_23|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_28|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_46|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_26|, ~weak$$choice0~0=v_~weak$$choice0~0_15, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_27|, ~y$w_buff1~0=v_~y$w_buff1~0_180, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_225, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_7|, ULTIMATE.start_main_~#t1603~0.base=|v_ULTIMATE.start_main_~#t1603~0.base_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_274, ~x~0=v_~x~0_94, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t1604~0.offset=|v_ULTIMATE.start_main_~#t1604~0.offset_13|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_663, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_25|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_25|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_25, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_44|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_25|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_45|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_35|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_178, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_42|, ULTIMATE.start_main_~#t1604~0.base=|v_ULTIMATE.start_main_~#t1604~0.base_16|, ~y$w_buff0~0=v_~y$w_buff0~0_245, ~y~0=v_~y~0_158, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_131, ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_31|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_23|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_23|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_33|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_30|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_28, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_29|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_34|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_171, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_15|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_16|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_347, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_16|, ULTIMATE.start_main_~#t1603~0.offset=|v_ULTIMATE.start_main_~#t1603~0.offset_14|, ~z~0=v_~z~0_122, ~weak$$choice2~0=v_~weak$$choice2~0_120, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_350} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, #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_#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, ULTIMATE.start_main_~#t1603~0.base, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ULTIMATE.start_main_~#t1604~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, 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, ULTIMATE.start_main_~#t1604~0.base, ~y$w_buff0~0, ~y~0, ~__unbuffered_p1_EBX~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_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_~#t1603~0.offset, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 17:41:03,854 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L789-1-->L791: Formula: (and (= (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1604~0.base_11| 1) |v_#valid_23|) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t1604~0.base_11| 4) |v_#length_11|) (= |v_ULTIMATE.start_main_~#t1604~0.offset_10| 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1604~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1604~0.base_11|) |v_ULTIMATE.start_main_~#t1604~0.offset_10| 1)) |v_#memory_int_11|) (not (= |v_ULTIMATE.start_main_~#t1604~0.base_11| 0)) (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1604~0.base_11|)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1604~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t1604~0.offset=|v_ULTIMATE.start_main_~#t1604~0.offset_10|, ULTIMATE.start_main_~#t1604~0.base=|v_ULTIMATE.start_main_~#t1604~0.base_11|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1604~0.offset, ULTIMATE.start_main_~#t1604~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length] because there is no mapped edge [2019-12-27 17:41:03,854 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [589] [589] P1ENTRY-->L4-3: Formula: (and (= 0 (mod v_~y$w_buff1_used~0_47 256)) (= |v_P1Thread1of1ForFork1_#in~arg.offset_7| v_P1Thread1of1ForFork1_~arg.offset_7) (= v_P1Thread1of1ForFork1_~arg.base_7 |v_P1Thread1of1ForFork1_#in~arg.base_7|) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_9 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_7|) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_7| 1) (= 1 v_~y$w_buff0_used~0_86) (= 2 v_~y$w_buff0~0_19) (= v_~y$w_buff0~0_20 v_~y$w_buff1~0_21) (= v_~y$w_buff1_used~0_47 v_~y$w_buff0_used~0_87)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_87, ~y$w_buff0~0=v_~y$w_buff0~0_20, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_7|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_7|} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_9, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_86, ~y$w_buff1~0=v_~y$w_buff1~0_21, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_7|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_7, ~y$w_buff0~0=v_~y$w_buff0~0_19, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_7|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_7|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_47} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, P1Thread1of1ForFork1_~arg.offset, ~y$w_buff0_used~0, ~y$w_buff1~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~y$w_buff0~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 17:41:03,858 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L732-2-->L732-5: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd1~0_In-1477548441 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In-1477548441 256) 0)) (.cse1 (= |P0Thread1of1ForFork0_#t~ite3_Out-1477548441| |P0Thread1of1ForFork0_#t~ite4_Out-1477548441|))) (or (and (= |P0Thread1of1ForFork0_#t~ite3_Out-1477548441| ~y$w_buff1~0_In-1477548441) (not .cse0) .cse1 (not .cse2)) (and (= |P0Thread1of1ForFork0_#t~ite3_Out-1477548441| ~y~0_In-1477548441) (or .cse0 .cse2) .cse1))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1477548441, ~y$w_buff1~0=~y$w_buff1~0_In-1477548441, ~y~0=~y~0_In-1477548441, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1477548441} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1477548441, P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out-1477548441|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out-1477548441|, ~y$w_buff1~0=~y$w_buff1~0_In-1477548441, ~y~0=~y~0_In-1477548441, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1477548441} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-27 17:41:03,862 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [655] [655] L733-->L733-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In1407118541 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In1407118541 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out1407118541| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out1407118541| ~y$w_buff0_used~0_In1407118541)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1407118541, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1407118541} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1407118541|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1407118541, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1407118541} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 17:41:03,863 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [653] [653] L734-->L734-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In42577289 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd1~0_In42577289 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd1~0_In42577289 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In42577289 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out42577289|)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out42577289| ~y$w_buff1_used~0_In42577289) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In42577289, ~y$w_buff0_used~0=~y$w_buff0_used~0_In42577289, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In42577289, ~y$w_buff1_used~0=~y$w_buff1_used~0_In42577289} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out42577289|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In42577289, ~y$w_buff0_used~0=~y$w_buff0_used~0_In42577289, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In42577289, ~y$w_buff1_used~0=~y$w_buff1_used~0_In42577289} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 17:41:03,863 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [656] [656] L735-->L735-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In612412972 256))) (.cse1 (= (mod ~y$r_buff0_thd1~0_In612412972 256) 0))) (or (and (= ~y$r_buff0_thd1~0_In612412972 |P0Thread1of1ForFork0_#t~ite7_Out612412972|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite7_Out612412972|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In612412972, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In612412972} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In612412972, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out612412972|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In612412972} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-27 17:41:03,864 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L736-->L736-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In996026070 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd1~0_In996026070 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In996026070 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In996026070 256)))) (or (and (= ~y$r_buff1_thd1~0_In996026070 |P0Thread1of1ForFork0_#t~ite8_Out996026070|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out996026070|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In996026070, ~y$w_buff0_used~0=~y$w_buff0_used~0_In996026070, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In996026070, ~y$w_buff1_used~0=~y$w_buff1_used~0_In996026070} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In996026070, ~y$w_buff0_used~0=~y$w_buff0_used~0_In996026070, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out996026070|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In996026070, ~y$w_buff1_used~0=~y$w_buff1_used~0_In996026070} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 17:41:03,864 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L736-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_31 (+ v_~__unbuffered_cnt~0_32 1)) (= v_~y$r_buff1_thd1~0_125 |v_P0Thread1of1ForFork0_#t~ite8_32|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_125, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_31|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 17:41:03,865 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L767-->L767-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-556414540 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-556414540 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite11_Out-556414540|)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-556414540 |P1Thread1of1ForFork1_#t~ite11_Out-556414540|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-556414540, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-556414540} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-556414540, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-556414540, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-556414540|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 17:41:03,865 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L768-->L768-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In-458874988 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-458874988 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd2~0_In-458874988 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In-458874988 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite12_Out-458874988| ~y$w_buff1_used~0_In-458874988) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite12_Out-458874988| 0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-458874988, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-458874988, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-458874988, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-458874988} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-458874988, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-458874988, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-458874988, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-458874988|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-458874988} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 17:41:03,866 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [661] [661] L769-->L770: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1278481605 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-1278481605 256) 0))) (or (and (not .cse0) (not .cse1) (= ~y$r_buff0_thd2~0_Out-1278481605 0)) (and (= ~y$r_buff0_thd2~0_Out-1278481605 ~y$r_buff0_thd2~0_In-1278481605) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1278481605, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1278481605} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1278481605, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out-1278481605, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-1278481605|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-27 17:41:03,866 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [667] [667] L770-->L770-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1478759461 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In1478759461 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In1478759461 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In1478759461 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite14_Out1478759461| ~y$r_buff1_thd2~0_In1478759461)) (and (= 0 |P1Thread1of1ForFork1_#t~ite14_Out1478759461|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1478759461, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1478759461, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1478759461, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1478759461} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1478759461, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1478759461, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1478759461, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1478759461|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1478759461} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 17:41:03,866 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L770-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_48 1) v_~__unbuffered_cnt~0_47) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= v_~y$r_buff1_thd2~0_144 |v_P1Thread1of1ForFork1_#t~ite14_32|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_32|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_144, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_31|, 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 17:41:03,867 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [636] [636] L795-->L797-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_5 256))) (or (= 0 (mod v_~y$r_buff0_thd0~0_132 256)) (= 0 (mod v_~y$w_buff0_used~0_236 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_236, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_132, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_236, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_132, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 17:41:03,867 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L797-2-->L797-4: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In179177799 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In179177799 256)))) (or (and (or .cse0 .cse1) (= ~y~0_In179177799 |ULTIMATE.start_main_#t~ite17_Out179177799|)) (and (not .cse0) (= ~y$w_buff1~0_In179177799 |ULTIMATE.start_main_#t~ite17_Out179177799|) (not .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In179177799, ~y~0=~y~0_In179177799, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In179177799, ~y$w_buff1_used~0=~y$w_buff1_used~0_In179177799} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out179177799|, ~y$w_buff1~0=~y$w_buff1~0_In179177799, ~y~0=~y~0_In179177799, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In179177799, ~y$w_buff1_used~0=~y$w_buff1_used~0_In179177799} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17] because there is no mapped edge [2019-12-27 17:41:03,867 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [619] [619] L797-4-->L798: Formula: (= v_~y~0_44 |v_ULTIMATE.start_main_#t~ite17_8|) InVars {ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_8|} OutVars{ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_7|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_7|, ~y~0=v_~y~0_44} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ~y~0] because there is no mapped edge [2019-12-27 17:41:03,867 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [666] [666] L798-->L798-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In1481730367 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1481730367 256)))) (or (and (= ~y$w_buff0_used~0_In1481730367 |ULTIMATE.start_main_#t~ite19_Out1481730367|) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite19_Out1481730367| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1481730367, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1481730367} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1481730367, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out1481730367|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1481730367} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-27 17:41:03,868 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L799-->L799-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In-1956436533 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-1956436533 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-1956436533 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd0~0_In-1956436533 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite20_Out-1956436533| ~y$w_buff1_used~0_In-1956436533)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite20_Out-1956436533| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1956436533, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1956436533, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1956436533, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1956436533} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1956436533, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1956436533, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-1956436533|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1956436533, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1956436533} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 17:41:03,868 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L800-->L800-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-725041900 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-725041900 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite21_Out-725041900|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In-725041900 |ULTIMATE.start_main_#t~ite21_Out-725041900|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-725041900, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-725041900} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-725041900, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-725041900, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-725041900|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 17:41:03,869 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L801-->L801-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd0~0_In-2059140037 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-2059140037 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-2059140037 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-2059140037 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite22_Out-2059140037| ~y$r_buff1_thd0~0_In-2059140037) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite22_Out-2059140037| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2059140037, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2059140037, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2059140037, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2059140037} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2059140037, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2059140037, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2059140037, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-2059140037|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2059140037} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 17:41:03,874 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] L812-->L812-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In885519070 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite37_In885519070| |ULTIMATE.start_main_#t~ite37_Out885519070|) (= ~y$w_buff1_used~0_In885519070 |ULTIMATE.start_main_#t~ite38_Out885519070|)) (and (= ~y$w_buff1_used~0_In885519070 |ULTIMATE.start_main_#t~ite37_Out885519070|) .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In885519070 256) 0))) (or (and (= 0 (mod ~y$w_buff1_used~0_In885519070 256)) .cse1) (= 0 (mod ~y$w_buff0_used~0_In885519070 256)) (and (= 0 (mod ~y$r_buff1_thd0~0_In885519070 256)) .cse1))) (= |ULTIMATE.start_main_#t~ite38_Out885519070| |ULTIMATE.start_main_#t~ite37_Out885519070|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In885519070, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In885519070, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_In885519070|, ~weak$$choice2~0=~weak$$choice2~0_In885519070, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In885519070, ~y$w_buff1_used~0=~y$w_buff1_used~0_In885519070} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In885519070, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In885519070, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out885519070|, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out885519070|, ~weak$$choice2~0=~weak$$choice2~0_In885519070, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In885519070, ~y$w_buff1_used~0=~y$w_buff1_used~0_In885519070} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-27 17:41:03,874 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [607] [607] L813-->L814: Formula: (and (= v_~y$r_buff0_thd0~0_98 v_~y$r_buff0_thd0~0_97) (not (= 0 (mod v_~weak$$choice2~0_26 256)))) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_98, ~weak$$choice2~0=v_~weak$$choice2~0_26} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_6|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_10|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_97, ~weak$$choice2~0=v_~weak$$choice2~0_26} 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 17:41:03,875 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L816-->L819-1: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7| (mod v_~main$tmp_guard1~0_16 256)) (not (= (mod v_~y$flush_delayed~0_27 256) 0)) (= v_~y~0_114 v_~y$mem_tmp~0_17) (= 0 v_~y$flush_delayed~0_26)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_17, ~y$flush_delayed~0=v_~y$flush_delayed~0_27, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_17, ~y$flush_delayed~0=v_~y$flush_delayed~0_26, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~y~0=v_~y~0_114, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_18|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} 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 17:41:03,876 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [674] [674] L819-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 17:41:04,001 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 05:41:03 BasicIcfg [2019-12-27 17:41:04,001 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 17:41:04,004 INFO L168 Benchmark]: Toolchain (without parser) took 17984.13 ms. Allocated memory was 142.1 MB in the beginning and 834.7 MB in the end (delta: 692.6 MB). Free memory was 98.8 MB in the beginning and 545.5 MB in the end (delta: -446.6 MB). Peak memory consumption was 245.9 MB. Max. memory is 7.1 GB. [2019-12-27 17:41:04,005 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 142.1 MB. Free memory was 118.4 MB in the beginning and 118.2 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 17:41:04,007 INFO L168 Benchmark]: CACSL2BoogieTranslator took 792.09 ms. Allocated memory was 142.1 MB in the beginning and 199.2 MB in the end (delta: 57.1 MB). Free memory was 98.6 MB in the beginning and 153.6 MB in the end (delta: -55.0 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. [2019-12-27 17:41:04,008 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.04 ms. Allocated memory is still 199.2 MB. Free memory was 153.6 MB in the beginning and 150.0 MB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 7.1 GB. [2019-12-27 17:41:04,009 INFO L168 Benchmark]: Boogie Preprocessor took 37.74 ms. Allocated memory is still 199.2 MB. Free memory was 150.0 MB in the beginning and 147.9 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2019-12-27 17:41:04,009 INFO L168 Benchmark]: RCFGBuilder took 758.50 ms. Allocated memory is still 199.2 MB. Free memory was 147.9 MB in the beginning and 103.1 MB in the end (delta: 44.8 MB). Peak memory consumption was 44.8 MB. Max. memory is 7.1 GB. [2019-12-27 17:41:04,010 INFO L168 Benchmark]: TraceAbstraction took 16318.38 ms. Allocated memory was 199.2 MB in the beginning and 834.7 MB in the end (delta: 635.4 MB). Free memory was 102.4 MB in the beginning and 545.5 MB in the end (delta: -443.1 MB). Peak memory consumption was 192.3 MB. Max. memory is 7.1 GB. [2019-12-27 17:41:04,020 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 142.1 MB. Free memory was 118.4 MB in the beginning and 118.2 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 792.09 ms. Allocated memory was 142.1 MB in the beginning and 199.2 MB in the end (delta: 57.1 MB). Free memory was 98.6 MB in the beginning and 153.6 MB in the end (delta: -55.0 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 71.04 ms. Allocated memory is still 199.2 MB. Free memory was 153.6 MB in the beginning and 150.0 MB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.74 ms. Allocated memory is still 199.2 MB. Free memory was 150.0 MB in the beginning and 147.9 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 758.50 ms. Allocated memory is still 199.2 MB. Free memory was 147.9 MB in the beginning and 103.1 MB in the end (delta: 44.8 MB). Peak memory consumption was 44.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16318.38 ms. Allocated memory was 199.2 MB in the beginning and 834.7 MB in the end (delta: 635.4 MB). Free memory was 102.4 MB in the beginning and 545.5 MB in the end (delta: -443.1 MB). Peak memory consumption was 192.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.5s, 148 ProgramPointsBefore, 78 ProgramPointsAfterwards, 182 TransitionsBefore, 90 TransitionsAfterwards, 10378 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 25 ChoiceCompositions, 3838 VarBasedMoverChecksPositive, 191 VarBasedMoverChecksNegative, 62 SemBasedMoverChecksPositive, 187 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.2s, 0 MoverChecksTotal, 46553 CheckedPairsTotal, 101 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L789] FCALL, FORK 0 pthread_create(&t1603, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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, z=0] [L791] FCALL, FORK 0 pthread_create(&t1604, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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, z=0] [L751] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L752] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L753] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L754] 2 y$r_buff0_thd2 = (_Bool)1 [L757] 2 z = 1 [L760] 2 __unbuffered_p1_EAX = z [L763] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L726] 1 x = 1 [L729] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L732] 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=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L732] 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) [L766] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L733] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L734] 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 [L735] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L766] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L767] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L768] 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 [L793] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, 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=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L798] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L799] 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 [L800] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L801] 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 [L804] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L805] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L806] 0 y$flush_delayed = weak$$choice2 [L807] 0 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L808] 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, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L808] 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) [L809] 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, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L809] 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)) [L810] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] 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)) [L811] 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, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L811] 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)) [L812] 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)) [L814] 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, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L814] 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)) [L815] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 16.0s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1382 SDtfs, 1658 SDslu, 2841 SDs, 0 SdLazy, 1768 SolverSat, 143 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 135 GetRequests, 28 SyntacticMatches, 16 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14811occurred 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.8s AutomataMinimizationTime, 13 MinimizatonAttempts, 9138 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 503 NumberOfCodeBlocks, 503 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 436 ConstructedInterpolants, 0 QuantifiedInterpolants, 69836 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...