/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-NoLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe010_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-28 04:30:47,747 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-28 04:30:47,750 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-28 04:30:47,769 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-28 04:30:47,770 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-28 04:30:47,772 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-28 04:30:47,774 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-28 04:30:47,782 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-28 04:30:47,786 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-28 04:30:47,789 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-28 04:30:47,791 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-28 04:30:47,793 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-28 04:30:47,794 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-28 04:30:47,795 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-28 04:30:47,798 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-28 04:30:47,799 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-28 04:30:47,801 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-28 04:30:47,802 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-28 04:30:47,803 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-28 04:30:47,808 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-28 04:30:47,812 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-28 04:30:47,816 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-28 04:30:47,818 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-28 04:30:47,818 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-28 04:30:47,820 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-28 04:30:47,821 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-28 04:30:47,821 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-28 04:30:47,823 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-28 04:30:47,824 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-28 04:30:47,825 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-28 04:30:47,825 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-28 04:30:47,827 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-28 04:30:47,827 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-28 04:30:47,829 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-28 04:30:47,830 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-28 04:30:47,830 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-28 04:30:47,831 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-28 04:30:47,831 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-28 04:30:47,831 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-28 04:30:47,832 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-28 04:30:47,833 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-28 04:30:47,834 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-NoLbe-MCR.epf [2019-12-28 04:30:47,850 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-28 04:30:47,850 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-28 04:30:47,852 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-28 04:30:47,852 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-28 04:30:47,852 INFO L138 SettingsManager]: * Use SBE=true [2019-12-28 04:30:47,852 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-28 04:30:47,853 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-28 04:30:47,853 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-28 04:30:47,853 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-28 04:30:47,853 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-28 04:30:47,853 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-28 04:30:47,853 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-28 04:30:47,854 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-28 04:30:47,854 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-28 04:30:47,854 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-28 04:30:47,854 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-28 04:30:47,854 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-28 04:30:47,855 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-28 04:30:47,855 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-28 04:30:47,855 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-28 04:30:47,855 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-28 04:30:47,855 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-28 04:30:47,856 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-28 04:30:47,856 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-28 04:30:47,856 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-28 04:30:47,856 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-28 04:30:47,857 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-28 04:30:47,857 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-28 04:30:47,857 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-28 04:30:47,859 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-28 04:30:47,859 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-28 04:30:47,859 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-28 04:30:48,126 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-28 04:30:48,140 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-28 04:30:48,144 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-28 04:30:48,145 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-28 04:30:48,146 INFO L275 PluginConnector]: CDTParser initialized [2019-12-28 04:30:48,146 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe010_rmo.opt.i [2019-12-28 04:30:48,208 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e003d0a8/787236cf104b434fabfcda399792d6d7/FLAG06d852ff9 [2019-12-28 04:30:48,734 INFO L306 CDTParser]: Found 1 translation units. [2019-12-28 04:30:48,735 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe010_rmo.opt.i [2019-12-28 04:30:48,755 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e003d0a8/787236cf104b434fabfcda399792d6d7/FLAG06d852ff9 [2019-12-28 04:30:49,087 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e003d0a8/787236cf104b434fabfcda399792d6d7 [2019-12-28 04:30:49,096 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-28 04:30:49,098 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-28 04:30:49,099 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-28 04:30:49,099 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-28 04:30:49,102 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-28 04:30:49,103 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 04:30:49" (1/1) ... [2019-12-28 04:30:49,106 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2717e766 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 04:30:49, skipping insertion in model container [2019-12-28 04:30:49,107 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 04:30:49" (1/1) ... [2019-12-28 04:30:49,119 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-28 04:30:49,188 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-28 04:30:49,760 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-28 04:30:49,773 INFO L203 MainTranslator]: Completed pre-run [2019-12-28 04:30:49,832 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-28 04:30:49,920 INFO L208 MainTranslator]: Completed translation [2019-12-28 04:30:49,920 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 04:30:49 WrapperNode [2019-12-28 04:30:49,920 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-28 04:30:49,921 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-28 04:30:49,921 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-28 04:30:49,923 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-28 04:30:49,933 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 04:30:49" (1/1) ... [2019-12-28 04:30:49,953 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 04:30:49" (1/1) ... [2019-12-28 04:30:49,990 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-28 04:30:49,991 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-28 04:30:49,991 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-28 04:30:49,991 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-28 04:30:50,001 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 04:30:49" (1/1) ... [2019-12-28 04:30:50,002 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 04:30:49" (1/1) ... [2019-12-28 04:30:50,006 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 04:30:49" (1/1) ... [2019-12-28 04:30:50,007 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 04:30:49" (1/1) ... [2019-12-28 04:30:50,016 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 04:30:49" (1/1) ... [2019-12-28 04:30:50,020 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 04:30:49" (1/1) ... [2019-12-28 04:30:50,024 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 04:30:49" (1/1) ... [2019-12-28 04:30:50,030 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-28 04:30:50,030 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-28 04:30:50,030 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-28 04:30:50,031 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-28 04:30:50,032 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 04:30:49" (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-28 04:30:50,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-28 04:30:50,091 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-28 04:30:50,091 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-28 04:30:50,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-28 04:30:50,092 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-28 04:30:50,092 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-28 04:30:50,092 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-28 04:30:50,092 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-28 04:30:50,092 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-28 04:30:50,093 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-28 04:30:50,093 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-28 04:30:50,095 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-28 04:30:50,808 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-28 04:30:50,808 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-28 04:30:50,809 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 04:30:50 BoogieIcfgContainer [2019-12-28 04:30:50,810 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-28 04:30:50,811 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-28 04:30:50,811 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-28 04:30:50,816 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-28 04:30:50,817 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 04:30:49" (1/3) ... [2019-12-28 04:30:50,819 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57042738 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 04:30:50, skipping insertion in model container [2019-12-28 04:30:50,819 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 04:30:49" (2/3) ... [2019-12-28 04:30:50,820 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57042738 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 04:30:50, skipping insertion in model container [2019-12-28 04:30:50,820 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 04:30:50" (3/3) ... [2019-12-28 04:30:50,824 INFO L109 eAbstractionObserver]: Analyzing ICFG safe010_rmo.opt.i [2019-12-28 04:30:50,836 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-28 04:30:50,837 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-28 04:30:50,855 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-28 04:30:50,856 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-28 04:30:50,912 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:50,913 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:50,913 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:50,914 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:50,914 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:50,914 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:50,914 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:50,915 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:50,915 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:50,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:50,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:50,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:50,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:50,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:50,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:50,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:50,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:50,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:50,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:50,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:50,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:50,921 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:50,921 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:50,921 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:50,921 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:50,922 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:50,922 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:50,922 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:50,923 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:50,923 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:50,923 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:50,924 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:50,924 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:50,924 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:50,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:50,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:50,926 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:50,926 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:50,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:50,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:50,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:50,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:50,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:50,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:50,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:50,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:50,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:50,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:50,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:50,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:50,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:50,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:50,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:50,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:50,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:50,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:50,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:50,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:50,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:50,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:50,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:50,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:50,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:50,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:50,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:50,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:50,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:50,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:50,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:50,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:50,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:50,944 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:50,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:50,945 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:50,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:50,945 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:50,951 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:50,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:50,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:50,952 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:50,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:50,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:50,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:50,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:50,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:50,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 04:30:50,971 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-28 04:30:50,994 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-28 04:30:50,995 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-28 04:30:50,995 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-28 04:30:50,995 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-28 04:30:50,995 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-28 04:30:50,995 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-28 04:30:50,996 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-28 04:30:50,996 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-28 04:30:51,036 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 146 places, 180 transitions [2019-12-28 04:30:52,401 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 22510 states. [2019-12-28 04:30:52,403 INFO L276 IsEmpty]: Start isEmpty. Operand 22510 states. [2019-12-28 04:30:52,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-28 04:30:52,411 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 04:30:52,412 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] [2019-12-28 04:30:52,413 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 04:30:52,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 04:30:52,419 INFO L82 PathProgramCache]: Analyzing trace with hash 772326421, now seen corresponding path program 1 times [2019-12-28 04:30:52,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 04:30:52,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698373730] [2019-12-28 04:30:52,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 04:30:52,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 04:30:52,837 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-28 04:30:52,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698373730] [2019-12-28 04:30:52,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 04:30:52,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 04:30:52,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2119542269] [2019-12-28 04:30:52,844 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 04:30:52,850 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 04:30:52,873 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 34 states and 33 transitions. [2019-12-28 04:30:52,874 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 04:30:52,880 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 04:30:52,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 04:30:52,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 04:30:52,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 04:30:52,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 04:30:52,899 INFO L87 Difference]: Start difference. First operand 22510 states. Second operand 4 states. [2019-12-28 04:30:53,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 04:30:53,511 INFO L93 Difference]: Finished difference Result 23454 states and 91771 transitions. [2019-12-28 04:30:53,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 04:30:53,513 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-12-28 04:30:53,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 04:30:53,711 INFO L225 Difference]: With dead ends: 23454 [2019-12-28 04:30:53,712 INFO L226 Difference]: Without dead ends: 21278 [2019-12-28 04:30:53,714 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 04:30:54,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21278 states. [2019-12-28 04:30:55,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21278 to 21278. [2019-12-28 04:30:55,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21278 states. [2019-12-28 04:30:55,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21278 states to 21278 states and 83795 transitions. [2019-12-28 04:30:55,651 INFO L78 Accepts]: Start accepts. Automaton has 21278 states and 83795 transitions. Word has length 33 [2019-12-28 04:30:55,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 04:30:55,651 INFO L462 AbstractCegarLoop]: Abstraction has 21278 states and 83795 transitions. [2019-12-28 04:30:55,652 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 04:30:55,652 INFO L276 IsEmpty]: Start isEmpty. Operand 21278 states and 83795 transitions. [2019-12-28 04:30:55,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-28 04:30:55,658 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 04:30:55,658 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] [2019-12-28 04:30:55,659 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 04:30:55,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 04:30:55,659 INFO L82 PathProgramCache]: Analyzing trace with hash -2041424114, now seen corresponding path program 1 times [2019-12-28 04:30:55,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 04:30:55,660 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920991239] [2019-12-28 04:30:55,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 04:30:55,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 04:30:55,779 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-28 04:30:55,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920991239] [2019-12-28 04:30:55,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 04:30:55,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 04:30:55,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [380202948] [2019-12-28 04:30:55,781 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 04:30:55,786 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 04:30:55,795 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 45 states and 44 transitions. [2019-12-28 04:30:55,796 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 04:30:55,796 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 04:30:55,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 04:30:55,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 04:30:55,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 04:30:55,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 04:30:55,800 INFO L87 Difference]: Start difference. First operand 21278 states and 83795 transitions. Second operand 5 states. [2019-12-28 04:30:56,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 04:30:56,889 INFO L93 Difference]: Finished difference Result 34712 states and 129091 transitions. [2019-12-28 04:30:56,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 04:30:56,892 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-12-28 04:30:56,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 04:30:57,068 INFO L225 Difference]: With dead ends: 34712 [2019-12-28 04:30:57,068 INFO L226 Difference]: Without dead ends: 34568 [2019-12-28 04:30:57,069 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-28 04:30:57,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34568 states. [2019-12-28 04:30:59,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34568 to 33068. [2019-12-28 04:30:59,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33068 states. [2019-12-28 04:30:59,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33068 states to 33068 states and 123979 transitions. [2019-12-28 04:30:59,423 INFO L78 Accepts]: Start accepts. Automaton has 33068 states and 123979 transitions. Word has length 44 [2019-12-28 04:30:59,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 04:30:59,427 INFO L462 AbstractCegarLoop]: Abstraction has 33068 states and 123979 transitions. [2019-12-28 04:30:59,427 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 04:30:59,427 INFO L276 IsEmpty]: Start isEmpty. Operand 33068 states and 123979 transitions. [2019-12-28 04:30:59,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-28 04:30:59,432 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 04:30:59,432 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 04:30:59,432 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 04:30:59,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 04:30:59,433 INFO L82 PathProgramCache]: Analyzing trace with hash 865833508, now seen corresponding path program 1 times [2019-12-28 04:30:59,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 04:30:59,434 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300783321] [2019-12-28 04:30:59,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 04:30:59,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 04:30:59,518 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-28 04:30:59,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300783321] [2019-12-28 04:30:59,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 04:30:59,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 04:30:59,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [283219704] [2019-12-28 04:30:59,520 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 04:30:59,524 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 04:30:59,528 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 46 states and 45 transitions. [2019-12-28 04:30:59,528 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 04:30:59,529 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 04:30:59,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 04:30:59,530 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 04:30:59,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 04:30:59,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 04:30:59,531 INFO L87 Difference]: Start difference. First operand 33068 states and 123979 transitions. Second operand 5 states. [2019-12-28 04:31:00,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 04:31:00,136 INFO L93 Difference]: Finished difference Result 40220 states and 148648 transitions. [2019-12-28 04:31:00,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 04:31:00,137 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-12-28 04:31:00,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 04:31:00,254 INFO L225 Difference]: With dead ends: 40220 [2019-12-28 04:31:00,254 INFO L226 Difference]: Without dead ends: 40060 [2019-12-28 04:31:00,255 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-28 04:31:00,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40060 states. [2019-12-28 04:31:01,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40060 to 34641. [2019-12-28 04:31:01,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34641 states. [2019-12-28 04:31:03,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34641 states to 34641 states and 129275 transitions. [2019-12-28 04:31:03,434 INFO L78 Accepts]: Start accepts. Automaton has 34641 states and 129275 transitions. Word has length 45 [2019-12-28 04:31:03,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 04:31:03,434 INFO L462 AbstractCegarLoop]: Abstraction has 34641 states and 129275 transitions. [2019-12-28 04:31:03,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 04:31:03,434 INFO L276 IsEmpty]: Start isEmpty. Operand 34641 states and 129275 transitions. [2019-12-28 04:31:03,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-28 04:31:03,447 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 04:31:03,447 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-28 04:31:03,447 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 04:31:03,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 04:31:03,448 INFO L82 PathProgramCache]: Analyzing trace with hash -566493931, now seen corresponding path program 1 times [2019-12-28 04:31:03,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 04:31:03,449 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213513609] [2019-12-28 04:31:03,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 04:31:03,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 04:31:03,541 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-28 04:31:03,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213513609] [2019-12-28 04:31:03,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 04:31:03,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 04:31:03,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [840311142] [2019-12-28 04:31:03,542 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 04:31:03,549 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 04:31:03,560 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 91 states and 128 transitions. [2019-12-28 04:31:03,560 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 04:31:03,592 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-28 04:31:03,593 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 04:31:03,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 04:31:03,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 04:31:03,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-28 04:31:03,594 INFO L87 Difference]: Start difference. First operand 34641 states and 129275 transitions. Second operand 7 states. [2019-12-28 04:31:05,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 04:31:05,479 INFO L93 Difference]: Finished difference Result 62564 states and 231397 transitions. [2019-12-28 04:31:05,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-28 04:31:05,480 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-12-28 04:31:05,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 04:31:05,738 INFO L225 Difference]: With dead ends: 62564 [2019-12-28 04:31:05,739 INFO L226 Difference]: Without dead ends: 62412 [2019-12-28 04:31:05,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2019-12-28 04:31:06,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62412 states. [2019-12-28 04:31:07,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62412 to 33638. [2019-12-28 04:31:07,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33638 states. [2019-12-28 04:31:07,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33638 states to 33638 states and 125559 transitions. [2019-12-28 04:31:07,166 INFO L78 Accepts]: Start accepts. Automaton has 33638 states and 125559 transitions. Word has length 52 [2019-12-28 04:31:07,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 04:31:07,166 INFO L462 AbstractCegarLoop]: Abstraction has 33638 states and 125559 transitions. [2019-12-28 04:31:07,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 04:31:07,167 INFO L276 IsEmpty]: Start isEmpty. Operand 33638 states and 125559 transitions. [2019-12-28 04:31:07,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-28 04:31:07,199 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 04:31:07,200 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 04:31:07,200 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 04:31:07,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 04:31:07,200 INFO L82 PathProgramCache]: Analyzing trace with hash -885098341, now seen corresponding path program 1 times [2019-12-28 04:31:07,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 04:31:07,201 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576463177] [2019-12-28 04:31:07,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 04:31:07,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 04:31:07,302 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-28 04:31:07,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576463177] [2019-12-28 04:31:07,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 04:31:07,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 04:31:07,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [281157178] [2019-12-28 04:31:07,304 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 04:31:07,313 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 04:31:07,323 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 60 states and 59 transitions. [2019-12-28 04:31:07,323 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 04:31:07,323 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 04:31:07,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 04:31:07,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 04:31:07,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 04:31:07,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-28 04:31:07,325 INFO L87 Difference]: Start difference. First operand 33638 states and 125559 transitions. Second operand 6 states. [2019-12-28 04:31:08,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 04:31:08,034 INFO L93 Difference]: Finished difference Result 46462 states and 169180 transitions. [2019-12-28 04:31:08,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-28 04:31:08,034 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-12-28 04:31:08,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 04:31:08,165 INFO L225 Difference]: With dead ends: 46462 [2019-12-28 04:31:08,166 INFO L226 Difference]: Without dead ends: 46222 [2019-12-28 04:31:08,166 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-28 04:31:09,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46222 states. [2019-12-28 04:31:10,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46222 to 40305. [2019-12-28 04:31:10,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40305 states. [2019-12-28 04:31:10,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40305 states to 40305 states and 148525 transitions. [2019-12-28 04:31:10,495 INFO L78 Accepts]: Start accepts. Automaton has 40305 states and 148525 transitions. Word has length 59 [2019-12-28 04:31:10,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 04:31:10,495 INFO L462 AbstractCegarLoop]: Abstraction has 40305 states and 148525 transitions. [2019-12-28 04:31:10,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 04:31:10,496 INFO L276 IsEmpty]: Start isEmpty. Operand 40305 states and 148525 transitions. [2019-12-28 04:31:10,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-28 04:31:10,526 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 04:31:10,526 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 04:31:10,526 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 04:31:10,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 04:31:10,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1504066544, now seen corresponding path program 1 times [2019-12-28 04:31:10,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 04:31:10,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133316142] [2019-12-28 04:31:10,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 04:31:10,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 04:31:10,582 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-28 04:31:10,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133316142] [2019-12-28 04:31:10,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 04:31:10,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 04:31:10,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1691651670] [2019-12-28 04:31:10,583 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 04:31:10,595 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 04:31:10,607 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 62 states and 61 transitions. [2019-12-28 04:31:10,607 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 04:31:10,608 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 04:31:10,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 04:31:10,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 04:31:10,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 04:31:10,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 04:31:10,609 INFO L87 Difference]: Start difference. First operand 40305 states and 148525 transitions. Second operand 3 states. [2019-12-28 04:31:11,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 04:31:11,153 INFO L93 Difference]: Finished difference Result 50681 states and 183604 transitions. [2019-12-28 04:31:11,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 04:31:11,154 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-12-28 04:31:11,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 04:31:11,286 INFO L225 Difference]: With dead ends: 50681 [2019-12-28 04:31:11,287 INFO L226 Difference]: Without dead ends: 50681 [2019-12-28 04:31:11,287 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-28 04:31:11,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50681 states. [2019-12-28 04:31:13,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50681 to 44285. [2019-12-28 04:31:13,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44285 states. [2019-12-28 04:31:13,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44285 states to 44285 states and 162123 transitions. [2019-12-28 04:31:13,941 INFO L78 Accepts]: Start accepts. Automaton has 44285 states and 162123 transitions. Word has length 61 [2019-12-28 04:31:13,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 04:31:13,942 INFO L462 AbstractCegarLoop]: Abstraction has 44285 states and 162123 transitions. [2019-12-28 04:31:13,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 04:31:13,942 INFO L276 IsEmpty]: Start isEmpty. Operand 44285 states and 162123 transitions. [2019-12-28 04:31:13,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-28 04:31:13,978 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 04:31:13,978 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 04:31:13,978 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 04:31:13,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 04:31:13,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1371095923, now seen corresponding path program 1 times [2019-12-28 04:31:13,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 04:31:13,979 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583843131] [2019-12-28 04:31:13,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 04:31:14,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 04:31:14,145 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-28 04:31:14,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583843131] [2019-12-28 04:31:14,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 04:31:14,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 04:31:14,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [53874594] [2019-12-28 04:31:14,146 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 04:31:14,158 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 04:31:14,172 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 66 states and 65 transitions. [2019-12-28 04:31:14,173 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 04:31:14,173 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 04:31:14,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 04:31:14,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 04:31:14,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 04:31:14,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-28 04:31:14,174 INFO L87 Difference]: Start difference. First operand 44285 states and 162123 transitions. Second operand 7 states. [2019-12-28 04:31:15,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 04:31:15,213 INFO L93 Difference]: Finished difference Result 56327 states and 202003 transitions. [2019-12-28 04:31:15,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-28 04:31:15,213 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-28 04:31:15,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 04:31:15,331 INFO L225 Difference]: With dead ends: 56327 [2019-12-28 04:31:15,331 INFO L226 Difference]: Without dead ends: 56087 [2019-12-28 04:31:15,332 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2019-12-28 04:31:15,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56087 states. [2019-12-28 04:31:16,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56087 to 45548. [2019-12-28 04:31:16,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45548 states. [2019-12-28 04:31:16,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45548 states to 45548 states and 166407 transitions. [2019-12-28 04:31:16,589 INFO L78 Accepts]: Start accepts. Automaton has 45548 states and 166407 transitions. Word has length 65 [2019-12-28 04:31:16,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 04:31:16,590 INFO L462 AbstractCegarLoop]: Abstraction has 45548 states and 166407 transitions. [2019-12-28 04:31:16,590 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 04:31:16,590 INFO L276 IsEmpty]: Start isEmpty. Operand 45548 states and 166407 transitions. [2019-12-28 04:31:16,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-28 04:31:16,627 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 04:31:16,627 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 04:31:16,627 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 04:31:16,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 04:31:16,628 INFO L82 PathProgramCache]: Analyzing trace with hash -330249588, now seen corresponding path program 1 times [2019-12-28 04:31:16,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 04:31:16,628 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270369630] [2019-12-28 04:31:16,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 04:31:16,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 04:31:16,710 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-28 04:31:16,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270369630] [2019-12-28 04:31:16,710 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 04:31:16,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 04:31:16,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [123404228] [2019-12-28 04:31:16,711 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 04:31:16,724 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 04:31:16,746 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 87 states and 104 transitions. [2019-12-28 04:31:16,746 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 04:31:16,747 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 04:31:16,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 04:31:16,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 04:31:16,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 04:31:16,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 04:31:16,748 INFO L87 Difference]: Start difference. First operand 45548 states and 166407 transitions. Second operand 4 states. [2019-12-28 04:31:17,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 04:31:17,786 INFO L93 Difference]: Finished difference Result 70189 states and 254637 transitions. [2019-12-28 04:31:17,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 04:31:17,787 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-28 04:31:17,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 04:31:17,945 INFO L225 Difference]: With dead ends: 70189 [2019-12-28 04:31:17,945 INFO L226 Difference]: Without dead ends: 70189 [2019-12-28 04:31:17,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-28 04:31:18,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70189 states. [2019-12-28 04:31:21,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70189 to 54134. [2019-12-28 04:31:21,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54134 states. [2019-12-28 04:31:21,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54134 states to 54134 states and 197181 transitions. [2019-12-28 04:31:21,352 INFO L78 Accepts]: Start accepts. Automaton has 54134 states and 197181 transitions. Word has length 66 [2019-12-28 04:31:21,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 04:31:21,352 INFO L462 AbstractCegarLoop]: Abstraction has 54134 states and 197181 transitions. [2019-12-28 04:31:21,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 04:31:21,353 INFO L276 IsEmpty]: Start isEmpty. Operand 54134 states and 197181 transitions. [2019-12-28 04:31:21,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-28 04:31:21,391 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 04:31:21,391 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 04:31:21,391 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 04:31:21,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 04:31:21,392 INFO L82 PathProgramCache]: Analyzing trace with hash 434850924, now seen corresponding path program 1 times [2019-12-28 04:31:21,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 04:31:21,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435929851] [2019-12-28 04:31:21,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 04:31:21,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 04:31:21,500 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-28 04:31:21,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435929851] [2019-12-28 04:31:21,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 04:31:21,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 04:31:21,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [97658397] [2019-12-28 04:31:21,503 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 04:31:21,517 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 04:31:21,538 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 95 states and 122 transitions. [2019-12-28 04:31:21,539 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 04:31:21,573 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 04:31:21,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-28 04:31:21,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 04:31:21,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-28 04:31:21,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-28 04:31:21,575 INFO L87 Difference]: Start difference. First operand 54134 states and 197181 transitions. Second operand 9 states. [2019-12-28 04:31:26,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 04:31:26,752 INFO L93 Difference]: Finished difference Result 147915 states and 529666 transitions. [2019-12-28 04:31:26,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-28 04:31:26,753 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-28 04:31:26,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 04:31:27,109 INFO L225 Difference]: With dead ends: 147915 [2019-12-28 04:31:27,109 INFO L226 Difference]: Without dead ends: 147515 [2019-12-28 04:31:27,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 511 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=349, Invalid=1543, Unknown=0, NotChecked=0, Total=1892 [2019-12-28 04:31:27,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147515 states. [2019-12-28 04:31:29,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147515 to 55892. [2019-12-28 04:31:29,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55892 states. [2019-12-28 04:31:29,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55892 states to 55892 states and 203133 transitions. [2019-12-28 04:31:29,376 INFO L78 Accepts]: Start accepts. Automaton has 55892 states and 203133 transitions. Word has length 66 [2019-12-28 04:31:29,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 04:31:29,376 INFO L462 AbstractCegarLoop]: Abstraction has 55892 states and 203133 transitions. [2019-12-28 04:31:29,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-28 04:31:29,376 INFO L276 IsEmpty]: Start isEmpty. Operand 55892 states and 203133 transitions. [2019-12-28 04:31:29,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-28 04:31:29,443 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 04:31:29,443 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 04:31:29,444 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 04:31:29,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 04:31:29,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1137053182, now seen corresponding path program 1 times [2019-12-28 04:31:29,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 04:31:29,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490614166] [2019-12-28 04:31:29,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 04:31:29,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 04:31:29,551 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-28 04:31:29,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490614166] [2019-12-28 04:31:29,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 04:31:29,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 04:31:29,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1374027034] [2019-12-28 04:31:29,553 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 04:31:29,566 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 04:31:29,581 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 75 states and 80 transitions. [2019-12-28 04:31:29,582 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 04:31:29,675 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-28 04:31:29,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-28 04:31:29,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 04:31:29,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-28 04:31:29,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-12-28 04:31:29,677 INFO L87 Difference]: Start difference. First operand 55892 states and 203133 transitions. Second operand 9 states. [2019-12-28 04:31:31,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 04:31:31,338 INFO L93 Difference]: Finished difference Result 77509 states and 280461 transitions. [2019-12-28 04:31:31,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-28 04:31:31,339 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 68 [2019-12-28 04:31:31,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 04:31:31,501 INFO L225 Difference]: With dead ends: 77509 [2019-12-28 04:31:31,501 INFO L226 Difference]: Without dead ends: 76865 [2019-12-28 04:31:31,501 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-12-28 04:31:31,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76865 states. [2019-12-28 04:31:32,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76865 to 66742. [2019-12-28 04:31:32,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66742 states. [2019-12-28 04:31:36,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66742 states to 66742 states and 243149 transitions. [2019-12-28 04:31:36,378 INFO L78 Accepts]: Start accepts. Automaton has 66742 states and 243149 transitions. Word has length 68 [2019-12-28 04:31:36,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 04:31:36,378 INFO L462 AbstractCegarLoop]: Abstraction has 66742 states and 243149 transitions. [2019-12-28 04:31:36,378 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-28 04:31:36,378 INFO L276 IsEmpty]: Start isEmpty. Operand 66742 states and 243149 transitions. [2019-12-28 04:31:36,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-28 04:31:36,434 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 04:31:36,435 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 04:31:36,435 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 04:31:36,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 04:31:36,435 INFO L82 PathProgramCache]: Analyzing trace with hash 2098667199, now seen corresponding path program 1 times [2019-12-28 04:31:36,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 04:31:36,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343085015] [2019-12-28 04:31:36,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 04:31:36,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 04:31:36,548 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-28 04:31:36,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343085015] [2019-12-28 04:31:36,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 04:31:36,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 04:31:36,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [4351912] [2019-12-28 04:31:36,549 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 04:31:36,560 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 04:31:36,574 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 75 states and 80 transitions. [2019-12-28 04:31:36,574 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 04:31:36,623 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-28 04:31:36,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-28 04:31:36,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 04:31:36,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-28 04:31:36,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-12-28 04:31:36,624 INFO L87 Difference]: Start difference. First operand 66742 states and 243149 transitions. Second operand 10 states. [2019-12-28 04:31:37,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 04:31:37,864 INFO L93 Difference]: Finished difference Result 93753 states and 331633 transitions. [2019-12-28 04:31:37,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-28 04:31:37,864 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 68 [2019-12-28 04:31:37,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 04:31:38,073 INFO L225 Difference]: With dead ends: 93753 [2019-12-28 04:31:38,073 INFO L226 Difference]: Without dead ends: 93753 [2019-12-28 04:31:38,074 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-12-28 04:31:38,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93753 states. [2019-12-28 04:31:39,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93753 to 85811. [2019-12-28 04:31:39,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85811 states. [2019-12-28 04:31:39,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85811 states to 85811 states and 306247 transitions. [2019-12-28 04:31:39,934 INFO L78 Accepts]: Start accepts. Automaton has 85811 states and 306247 transitions. Word has length 68 [2019-12-28 04:31:39,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 04:31:39,935 INFO L462 AbstractCegarLoop]: Abstraction has 85811 states and 306247 transitions. [2019-12-28 04:31:39,935 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-28 04:31:39,935 INFO L276 IsEmpty]: Start isEmpty. Operand 85811 states and 306247 transitions. [2019-12-28 04:31:40,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-28 04:31:40,012 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 04:31:40,012 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 04:31:40,012 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 04:31:40,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 04:31:40,012 INFO L82 PathProgramCache]: Analyzing trace with hash -951535616, now seen corresponding path program 1 times [2019-12-28 04:31:40,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 04:31:40,013 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858388248] [2019-12-28 04:31:40,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 04:31:40,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 04:31:40,091 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-28 04:31:40,092 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858388248] [2019-12-28 04:31:40,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 04:31:40,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 04:31:40,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [105570511] [2019-12-28 04:31:40,093 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 04:31:40,103 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 04:31:40,116 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 75 states and 80 transitions. [2019-12-28 04:31:40,116 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 04:31:40,116 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 04:31:40,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 04:31:40,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 04:31:40,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 04:31:40,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 04:31:40,118 INFO L87 Difference]: Start difference. First operand 85811 states and 306247 transitions. Second operand 4 states. [2019-12-28 04:31:40,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 04:31:40,206 INFO L93 Difference]: Finished difference Result 19616 states and 61898 transitions. [2019-12-28 04:31:40,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 04:31:40,206 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-12-28 04:31:40,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 04:31:40,235 INFO L225 Difference]: With dead ends: 19616 [2019-12-28 04:31:40,235 INFO L226 Difference]: Without dead ends: 19138 [2019-12-28 04:31:40,235 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-28 04:31:40,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19138 states. [2019-12-28 04:31:40,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19138 to 19126. [2019-12-28 04:31:40,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19126 states. [2019-12-28 04:31:40,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19126 states to 19126 states and 60393 transitions. [2019-12-28 04:31:40,485 INFO L78 Accepts]: Start accepts. Automaton has 19126 states and 60393 transitions. Word has length 68 [2019-12-28 04:31:40,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 04:31:40,485 INFO L462 AbstractCegarLoop]: Abstraction has 19126 states and 60393 transitions. [2019-12-28 04:31:40,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 04:31:40,485 INFO L276 IsEmpty]: Start isEmpty. Operand 19126 states and 60393 transitions. [2019-12-28 04:31:40,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-12-28 04:31:40,501 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 04:31:40,501 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 04:31:40,502 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 04:31:40,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 04:31:40,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1837430218, now seen corresponding path program 1 times [2019-12-28 04:31:40,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 04:31:40,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657197012] [2019-12-28 04:31:40,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 04:31:40,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 04:31:40,559 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-28 04:31:40,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657197012] [2019-12-28 04:31:40,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 04:31:40,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 04:31:40,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1214034654] [2019-12-28 04:31:40,560 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 04:31:40,578 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 04:31:40,603 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 79 states and 78 transitions. [2019-12-28 04:31:40,603 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 04:31:40,603 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 04:31:40,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 04:31:40,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 04:31:40,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 04:31:40,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 04:31:40,605 INFO L87 Difference]: Start difference. First operand 19126 states and 60393 transitions. Second operand 4 states. [2019-12-28 04:31:40,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 04:31:40,897 INFO L93 Difference]: Finished difference Result 24550 states and 76649 transitions. [2019-12-28 04:31:40,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 04:31:40,897 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-12-28 04:31:40,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 04:31:40,938 INFO L225 Difference]: With dead ends: 24550 [2019-12-28 04:31:40,938 INFO L226 Difference]: Without dead ends: 24550 [2019-12-28 04:31:40,938 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-28 04:31:40,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24550 states. [2019-12-28 04:31:41,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24550 to 20038. [2019-12-28 04:31:41,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20038 states. [2019-12-28 04:31:41,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20038 states to 20038 states and 63051 transitions. [2019-12-28 04:31:41,388 INFO L78 Accepts]: Start accepts. Automaton has 20038 states and 63051 transitions. Word has length 78 [2019-12-28 04:31:41,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 04:31:41,388 INFO L462 AbstractCegarLoop]: Abstraction has 20038 states and 63051 transitions. [2019-12-28 04:31:41,388 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 04:31:41,388 INFO L276 IsEmpty]: Start isEmpty. Operand 20038 states and 63051 transitions. [2019-12-28 04:31:41,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-12-28 04:31:41,406 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 04:31:41,406 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 04:31:41,407 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 04:31:41,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 04:31:41,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1582693673, now seen corresponding path program 1 times [2019-12-28 04:31:41,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 04:31:41,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706382671] [2019-12-28 04:31:41,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 04:31:41,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 04:31:41,536 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-28 04:31:41,536 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706382671] [2019-12-28 04:31:41,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 04:31:41,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-28 04:31:41,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [906142222] [2019-12-28 04:31:41,537 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 04:31:41,579 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 04:31:41,607 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 79 states and 78 transitions. [2019-12-28 04:31:41,607 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 04:31:41,608 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 04:31:41,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 04:31:41,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 04:31:41,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 04:31:41,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-28 04:31:41,609 INFO L87 Difference]: Start difference. First operand 20038 states and 63051 transitions. Second operand 8 states. [2019-12-28 04:31:42,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 04:31:42,720 INFO L93 Difference]: Finished difference Result 23608 states and 73501 transitions. [2019-12-28 04:31:42,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-28 04:31:42,720 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 78 [2019-12-28 04:31:42,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 04:31:42,781 INFO L225 Difference]: With dead ends: 23608 [2019-12-28 04:31:42,781 INFO L226 Difference]: Without dead ends: 23560 [2019-12-28 04:31:42,782 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=165, Invalid=591, Unknown=0, NotChecked=0, Total=756 [2019-12-28 04:31:42,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23560 states. [2019-12-28 04:31:43,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23560 to 18103. [2019-12-28 04:31:43,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18103 states. [2019-12-28 04:31:43,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18103 states to 18103 states and 57288 transitions. [2019-12-28 04:31:43,331 INFO L78 Accepts]: Start accepts. Automaton has 18103 states and 57288 transitions. Word has length 78 [2019-12-28 04:31:43,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 04:31:43,332 INFO L462 AbstractCegarLoop]: Abstraction has 18103 states and 57288 transitions. [2019-12-28 04:31:43,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 04:31:43,332 INFO L276 IsEmpty]: Start isEmpty. Operand 18103 states and 57288 transitions. [2019-12-28 04:31:43,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-12-28 04:31:43,364 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 04:31:43,364 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 04:31:43,364 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 04:31:43,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 04:31:43,365 INFO L82 PathProgramCache]: Analyzing trace with hash -286863040, now seen corresponding path program 1 times [2019-12-28 04:31:43,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 04:31:43,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442228603] [2019-12-28 04:31:43,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 04:31:43,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 04:31:43,434 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-28 04:31:43,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442228603] [2019-12-28 04:31:43,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 04:31:43,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 04:31:43,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [242944458] [2019-12-28 04:31:43,436 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 04:31:43,466 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 04:31:43,497 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 85 states and 89 transitions. [2019-12-28 04:31:43,497 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 04:31:43,498 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 04:31:43,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 04:31:43,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 04:31:43,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 04:31:43,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 04:31:43,499 INFO L87 Difference]: Start difference. First operand 18103 states and 57288 transitions. Second operand 3 states. [2019-12-28 04:31:43,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 04:31:43,893 INFO L93 Difference]: Finished difference Result 18797 states and 59268 transitions. [2019-12-28 04:31:43,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 04:31:43,894 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-12-28 04:31:43,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 04:31:43,943 INFO L225 Difference]: With dead ends: 18797 [2019-12-28 04:31:43,943 INFO L226 Difference]: Without dead ends: 18797 [2019-12-28 04:31:43,946 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-28 04:31:43,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18797 states. [2019-12-28 04:31:44,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18797 to 18143. [2019-12-28 04:31:44,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18143 states. [2019-12-28 04:31:44,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18143 states to 18143 states and 57353 transitions. [2019-12-28 04:31:44,310 INFO L78 Accepts]: Start accepts. Automaton has 18143 states and 57353 transitions. Word has length 79 [2019-12-28 04:31:44,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 04:31:44,310 INFO L462 AbstractCegarLoop]: Abstraction has 18143 states and 57353 transitions. [2019-12-28 04:31:44,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 04:31:44,310 INFO L276 IsEmpty]: Start isEmpty. Operand 18143 states and 57353 transitions. [2019-12-28 04:31:44,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-28 04:31:44,334 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 04:31:44,334 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 04:31:44,334 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 04:31:44,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 04:31:44,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1882330754, now seen corresponding path program 1 times [2019-12-28 04:31:44,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 04:31:44,336 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125425023] [2019-12-28 04:31:44,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 04:31:44,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 04:31:44,417 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-28 04:31:44,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125425023] [2019-12-28 04:31:44,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 04:31:44,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 04:31:44,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1187226539] [2019-12-28 04:31:44,418 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 04:31:44,435 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 04:31:44,477 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 133 states and 184 transitions. [2019-12-28 04:31:44,478 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 04:31:44,525 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-28 04:31:44,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 04:31:44,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 04:31:44,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 04:31:44,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-28 04:31:44,526 INFO L87 Difference]: Start difference. First operand 18143 states and 57353 transitions. Second operand 7 states. [2019-12-28 04:31:44,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 04:31:44,968 INFO L93 Difference]: Finished difference Result 21311 states and 66483 transitions. [2019-12-28 04:31:44,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 04:31:44,969 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 80 [2019-12-28 04:31:44,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 04:31:45,009 INFO L225 Difference]: With dead ends: 21311 [2019-12-28 04:31:45,009 INFO L226 Difference]: Without dead ends: 21311 [2019-12-28 04:31:45,009 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-28 04:31:45,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21311 states. [2019-12-28 04:31:45,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21311 to 20288. [2019-12-28 04:31:45,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20288 states. [2019-12-28 04:31:45,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20288 states to 20288 states and 63599 transitions. [2019-12-28 04:31:45,406 INFO L78 Accepts]: Start accepts. Automaton has 20288 states and 63599 transitions. Word has length 80 [2019-12-28 04:31:45,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 04:31:45,406 INFO L462 AbstractCegarLoop]: Abstraction has 20288 states and 63599 transitions. [2019-12-28 04:31:45,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 04:31:45,406 INFO L276 IsEmpty]: Start isEmpty. Operand 20288 states and 63599 transitions. [2019-12-28 04:31:45,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-28 04:31:45,426 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 04:31:45,426 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 04:31:45,426 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 04:31:45,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 04:31:45,427 INFO L82 PathProgramCache]: Analyzing trace with hash 476976255, now seen corresponding path program 1 times [2019-12-28 04:31:45,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 04:31:45,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299239168] [2019-12-28 04:31:45,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 04:31:45,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 04:31:45,472 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-28 04:31:45,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299239168] [2019-12-28 04:31:45,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 04:31:45,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 04:31:45,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [891734997] [2019-12-28 04:31:45,474 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 04:31:45,489 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 04:31:45,518 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 133 states and 184 transitions. [2019-12-28 04:31:45,519 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 04:31:45,575 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-28 04:31:45,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 04:31:45,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 04:31:45,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 04:31:45,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-28 04:31:45,576 INFO L87 Difference]: Start difference. First operand 20288 states and 63599 transitions. Second operand 5 states. [2019-12-28 04:31:45,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 04:31:45,948 INFO L93 Difference]: Finished difference Result 21631 states and 67522 transitions. [2019-12-28 04:31:45,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 04:31:45,948 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2019-12-28 04:31:45,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 04:31:45,980 INFO L225 Difference]: With dead ends: 21631 [2019-12-28 04:31:45,981 INFO L226 Difference]: Without dead ends: 21631 [2019-12-28 04:31:45,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-28 04:31:46,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21631 states. [2019-12-28 04:31:46,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21631 to 20968. [2019-12-28 04:31:46,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20968 states. [2019-12-28 04:31:46,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20968 states to 20968 states and 65579 transitions. [2019-12-28 04:31:46,269 INFO L78 Accepts]: Start accepts. Automaton has 20968 states and 65579 transitions. Word has length 80 [2019-12-28 04:31:46,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 04:31:46,269 INFO L462 AbstractCegarLoop]: Abstraction has 20968 states and 65579 transitions. [2019-12-28 04:31:46,270 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 04:31:46,270 INFO L276 IsEmpty]: Start isEmpty. Operand 20968 states and 65579 transitions. [2019-12-28 04:31:46,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-28 04:31:46,289 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 04:31:46,289 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 04:31:46,289 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 04:31:46,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 04:31:46,290 INFO L82 PathProgramCache]: Analyzing trace with hash 286965984, now seen corresponding path program 1 times [2019-12-28 04:31:46,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 04:31:46,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43816408] [2019-12-28 04:31:46,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 04:31:46,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 04:31:46,385 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-28 04:31:46,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43816408] [2019-12-28 04:31:46,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 04:31:46,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 04:31:46,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [862008407] [2019-12-28 04:31:46,386 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 04:31:46,402 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 04:31:46,426 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 84 states and 85 transitions. [2019-12-28 04:31:46,426 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 04:31:46,426 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 04:31:46,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 04:31:46,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 04:31:46,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 04:31:46,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 04:31:46,427 INFO L87 Difference]: Start difference. First operand 20968 states and 65579 transitions. Second operand 6 states. [2019-12-28 04:31:47,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 04:31:47,271 INFO L93 Difference]: Finished difference Result 30049 states and 92393 transitions. [2019-12-28 04:31:47,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-28 04:31:47,271 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 81 [2019-12-28 04:31:47,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 04:31:47,315 INFO L225 Difference]: With dead ends: 30049 [2019-12-28 04:31:47,315 INFO L226 Difference]: Without dead ends: 29743 [2019-12-28 04:31:47,316 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-12-28 04:31:47,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29743 states. [2019-12-28 04:31:47,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29743 to 24004. [2019-12-28 04:31:47,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24004 states. [2019-12-28 04:31:47,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24004 states to 24004 states and 74941 transitions. [2019-12-28 04:31:47,681 INFO L78 Accepts]: Start accepts. Automaton has 24004 states and 74941 transitions. Word has length 81 [2019-12-28 04:31:47,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 04:31:47,681 INFO L462 AbstractCegarLoop]: Abstraction has 24004 states and 74941 transitions. [2019-12-28 04:31:47,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 04:31:47,681 INFO L276 IsEmpty]: Start isEmpty. Operand 24004 states and 74941 transitions. [2019-12-28 04:31:47,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-28 04:31:47,705 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 04:31:47,705 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 04:31:47,705 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 04:31:47,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 04:31:47,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1248580001, now seen corresponding path program 1 times [2019-12-28 04:31:47,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 04:31:47,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951791710] [2019-12-28 04:31:47,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 04:31:47,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 04:31:47,781 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-28 04:31:47,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951791710] [2019-12-28 04:31:47,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 04:31:47,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 04:31:47,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [597016492] [2019-12-28 04:31:47,782 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 04:31:47,798 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 04:31:47,820 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 84 states and 85 transitions. [2019-12-28 04:31:47,821 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 04:31:47,821 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 04:31:47,821 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 04:31:47,821 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 04:31:47,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 04:31:47,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-28 04:31:47,822 INFO L87 Difference]: Start difference. First operand 24004 states and 74941 transitions. Second operand 7 states. [2019-12-28 04:31:49,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 04:31:49,218 INFO L93 Difference]: Finished difference Result 41431 states and 125074 transitions. [2019-12-28 04:31:49,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-28 04:31:49,219 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 81 [2019-12-28 04:31:49,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 04:31:49,279 INFO L225 Difference]: With dead ends: 41431 [2019-12-28 04:31:49,279 INFO L226 Difference]: Without dead ends: 41359 [2019-12-28 04:31:49,279 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2019-12-28 04:31:49,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41359 states. [2019-12-28 04:31:49,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41359 to 25774. [2019-12-28 04:31:49,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25774 states. [2019-12-28 04:31:49,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25774 states to 25774 states and 79053 transitions. [2019-12-28 04:31:49,715 INFO L78 Accepts]: Start accepts. Automaton has 25774 states and 79053 transitions. Word has length 81 [2019-12-28 04:31:49,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 04:31:49,715 INFO L462 AbstractCegarLoop]: Abstraction has 25774 states and 79053 transitions. [2019-12-28 04:31:49,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 04:31:49,715 INFO L276 IsEmpty]: Start isEmpty. Operand 25774 states and 79053 transitions. [2019-12-28 04:31:49,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-28 04:31:49,736 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 04:31:49,736 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 04:31:49,736 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 04:31:49,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 04:31:49,736 INFO L82 PathProgramCache]: Analyzing trace with hash -1471857053, now seen corresponding path program 1 times [2019-12-28 04:31:49,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 04:31:49,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553519751] [2019-12-28 04:31:49,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 04:31:49,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 04:31:49,819 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-28 04:31:49,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553519751] [2019-12-28 04:31:49,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 04:31:49,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 04:31:49,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1159697815] [2019-12-28 04:31:49,821 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 04:31:49,836 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 04:31:49,861 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 84 states and 85 transitions. [2019-12-28 04:31:49,861 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 04:31:49,862 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 04:31:49,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 04:31:49,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 04:31:49,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 04:31:49,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-28 04:31:49,863 INFO L87 Difference]: Start difference. First operand 25774 states and 79053 transitions. Second operand 6 states. [2019-12-28 04:31:50,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 04:31:50,336 INFO L93 Difference]: Finished difference Result 39261 states and 120410 transitions. [2019-12-28 04:31:50,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 04:31:50,337 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 81 [2019-12-28 04:31:50,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 04:31:50,397 INFO L225 Difference]: With dead ends: 39261 [2019-12-28 04:31:50,397 INFO L226 Difference]: Without dead ends: 39261 [2019-12-28 04:31:50,398 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-28 04:31:50,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39261 states. [2019-12-28 04:31:50,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39261 to 25443. [2019-12-28 04:31:50,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25443 states. [2019-12-28 04:31:50,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25443 states to 25443 states and 77584 transitions. [2019-12-28 04:31:50,812 INFO L78 Accepts]: Start accepts. Automaton has 25443 states and 77584 transitions. Word has length 81 [2019-12-28 04:31:50,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 04:31:50,812 INFO L462 AbstractCegarLoop]: Abstraction has 25443 states and 77584 transitions. [2019-12-28 04:31:50,812 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 04:31:50,812 INFO L276 IsEmpty]: Start isEmpty. Operand 25443 states and 77584 transitions. [2019-12-28 04:31:50,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-28 04:31:50,833 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 04:31:50,833 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 04:31:50,833 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 04:31:50,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 04:31:50,834 INFO L82 PathProgramCache]: Analyzing trace with hash -991140637, now seen corresponding path program 1 times [2019-12-28 04:31:50,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 04:31:50,834 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036057083] [2019-12-28 04:31:50,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 04:31:50,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 04:31:50,924 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-28 04:31:50,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036057083] [2019-12-28 04:31:50,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 04:31:50,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 04:31:50,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1063092961] [2019-12-28 04:31:50,925 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 04:31:50,948 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 04:31:50,974 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 84 states and 85 transitions. [2019-12-28 04:31:50,974 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 04:31:50,974 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 04:31:50,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 04:31:50,975 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 04:31:50,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 04:31:50,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-28 04:31:50,975 INFO L87 Difference]: Start difference. First operand 25443 states and 77584 transitions. Second operand 7 states. [2019-12-28 04:31:51,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 04:31:51,947 INFO L93 Difference]: Finished difference Result 31623 states and 94793 transitions. [2019-12-28 04:31:51,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-28 04:31:51,947 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 81 [2019-12-28 04:31:51,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 04:31:51,997 INFO L225 Difference]: With dead ends: 31623 [2019-12-28 04:31:51,997 INFO L226 Difference]: Without dead ends: 31623 [2019-12-28 04:31:51,997 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-12-28 04:31:52,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31623 states. [2019-12-28 04:31:52,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31623 to 27378. [2019-12-28 04:31:52,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27378 states. [2019-12-28 04:31:52,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27378 states to 27378 states and 83347 transitions. [2019-12-28 04:31:52,570 INFO L78 Accepts]: Start accepts. Automaton has 27378 states and 83347 transitions. Word has length 81 [2019-12-28 04:31:52,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 04:31:52,570 INFO L462 AbstractCegarLoop]: Abstraction has 27378 states and 83347 transitions. [2019-12-28 04:31:52,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 04:31:52,570 INFO L276 IsEmpty]: Start isEmpty. Operand 27378 states and 83347 transitions. [2019-12-28 04:31:52,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-28 04:31:52,594 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 04:31:52,594 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 04:31:52,595 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 04:31:52,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 04:31:52,596 INFO L82 PathProgramCache]: Analyzing trace with hash 253623844, now seen corresponding path program 1 times [2019-12-28 04:31:52,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 04:31:52,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274233185] [2019-12-28 04:31:52,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 04:31:52,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 04:31:52,697 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-28 04:31:52,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274233185] [2019-12-28 04:31:52,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 04:31:52,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 04:31:52,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [974915702] [2019-12-28 04:31:52,698 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 04:31:52,714 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 04:31:52,738 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 84 states and 85 transitions. [2019-12-28 04:31:52,738 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 04:31:52,738 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 04:31:52,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 04:31:52,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 04:31:52,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 04:31:52,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-28 04:31:52,739 INFO L87 Difference]: Start difference. First operand 27378 states and 83347 transitions. Second operand 6 states. [2019-12-28 04:31:53,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 04:31:53,013 INFO L93 Difference]: Finished difference Result 27316 states and 83173 transitions. [2019-12-28 04:31:53,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 04:31:53,014 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 81 [2019-12-28 04:31:53,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 04:31:53,055 INFO L225 Difference]: With dead ends: 27316 [2019-12-28 04:31:53,055 INFO L226 Difference]: Without dead ends: 27316 [2019-12-28 04:31:53,056 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-28 04:31:53,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27316 states. [2019-12-28 04:31:53,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27316 to 27316. [2019-12-28 04:31:53,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27316 states. [2019-12-28 04:31:53,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27316 states to 27316 states and 83173 transitions. [2019-12-28 04:31:53,408 INFO L78 Accepts]: Start accepts. Automaton has 27316 states and 83173 transitions. Word has length 81 [2019-12-28 04:31:53,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 04:31:53,408 INFO L462 AbstractCegarLoop]: Abstraction has 27316 states and 83173 transitions. [2019-12-28 04:31:53,408 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 04:31:53,408 INFO L276 IsEmpty]: Start isEmpty. Operand 27316 states and 83173 transitions. [2019-12-28 04:31:53,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-28 04:31:53,430 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 04:31:53,430 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 04:31:53,430 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 04:31:53,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 04:31:53,431 INFO L82 PathProgramCache]: Analyzing trace with hash -305951838, now seen corresponding path program 1 times [2019-12-28 04:31:53,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 04:31:53,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894944504] [2019-12-28 04:31:53,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 04:31:53,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 04:31:53,508 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-28 04:31:53,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894944504] [2019-12-28 04:31:53,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 04:31:53,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 04:31:53,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1050994449] [2019-12-28 04:31:53,509 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 04:31:53,523 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 04:31:53,547 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 84 states and 85 transitions. [2019-12-28 04:31:53,547 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 04:31:53,547 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 04:31:53,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 04:31:53,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 04:31:53,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 04:31:53,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 04:31:53,548 INFO L87 Difference]: Start difference. First operand 27316 states and 83173 transitions. Second operand 6 states. [2019-12-28 04:31:54,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 04:31:54,353 INFO L93 Difference]: Finished difference Result 40573 states and 122560 transitions. [2019-12-28 04:31:54,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 04:31:54,354 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 81 [2019-12-28 04:31:54,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 04:31:54,413 INFO L225 Difference]: With dead ends: 40573 [2019-12-28 04:31:54,413 INFO L226 Difference]: Without dead ends: 40573 [2019-12-28 04:31:54,414 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-28 04:31:54,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40573 states. [2019-12-28 04:31:54,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40573 to 28894. [2019-12-28 04:31:54,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28894 states. [2019-12-28 04:31:54,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28894 states to 28894 states and 87912 transitions. [2019-12-28 04:31:54,855 INFO L78 Accepts]: Start accepts. Automaton has 28894 states and 87912 transitions. Word has length 81 [2019-12-28 04:31:54,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 04:31:54,856 INFO L462 AbstractCegarLoop]: Abstraction has 28894 states and 87912 transitions. [2019-12-28 04:31:54,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 04:31:54,856 INFO L276 IsEmpty]: Start isEmpty. Operand 28894 states and 87912 transitions. [2019-12-28 04:31:54,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-28 04:31:54,880 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 04:31:54,880 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 04:31:54,880 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 04:31:54,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 04:31:54,880 INFO L82 PathProgramCache]: Analyzing trace with hash 938812643, now seen corresponding path program 1 times [2019-12-28 04:31:54,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 04:31:54,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551280222] [2019-12-28 04:31:54,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 04:31:54,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 04:31:54,972 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-28 04:31:54,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551280222] [2019-12-28 04:31:54,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 04:31:54,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 04:31:54,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1162168198] [2019-12-28 04:31:54,973 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 04:31:54,987 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 04:31:55,010 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 84 states and 85 transitions. [2019-12-28 04:31:55,010 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 04:31:55,011 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 04:31:55,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 04:31:55,011 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 04:31:55,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 04:31:55,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-28 04:31:55,012 INFO L87 Difference]: Start difference. First operand 28894 states and 87912 transitions. Second operand 5 states. [2019-12-28 04:31:55,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 04:31:55,383 INFO L93 Difference]: Finished difference Result 28813 states and 87624 transitions. [2019-12-28 04:31:55,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 04:31:55,383 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-12-28 04:31:55,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 04:31:55,451 INFO L225 Difference]: With dead ends: 28813 [2019-12-28 04:31:55,451 INFO L226 Difference]: Without dead ends: 28813 [2019-12-28 04:31:55,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-28 04:31:55,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28813 states. [2019-12-28 04:31:56,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28813 to 28768. [2019-12-28 04:31:56,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28768 states. [2019-12-28 04:31:56,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28768 states to 28768 states and 87504 transitions. [2019-12-28 04:31:56,118 INFO L78 Accepts]: Start accepts. Automaton has 28768 states and 87504 transitions. Word has length 81 [2019-12-28 04:31:56,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 04:31:56,119 INFO L462 AbstractCegarLoop]: Abstraction has 28768 states and 87504 transitions. [2019-12-28 04:31:56,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 04:31:56,119 INFO L276 IsEmpty]: Start isEmpty. Operand 28768 states and 87504 transitions. [2019-12-28 04:31:56,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-28 04:31:56,157 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 04:31:56,157 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 04:31:56,157 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 04:31:56,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 04:31:56,158 INFO L82 PathProgramCache]: Analyzing trace with hash 1900426660, now seen corresponding path program 1 times [2019-12-28 04:31:56,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 04:31:56,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921420766] [2019-12-28 04:31:56,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 04:31:56,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 04:31:56,245 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-28 04:31:56,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921420766] [2019-12-28 04:31:56,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 04:31:56,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 04:31:56,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1677548635] [2019-12-28 04:31:56,246 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 04:31:56,262 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 04:31:56,286 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 84 states and 85 transitions. [2019-12-28 04:31:56,287 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 04:31:56,287 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 04:31:56,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 04:31:56,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 04:31:56,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 04:31:56,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-28 04:31:56,288 INFO L87 Difference]: Start difference. First operand 28768 states and 87504 transitions. Second operand 5 states. [2019-12-28 04:31:56,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 04:31:56,484 INFO L93 Difference]: Finished difference Result 40102 states and 121810 transitions. [2019-12-28 04:31:56,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 04:31:56,484 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-12-28 04:31:56,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 04:31:56,543 INFO L225 Difference]: With dead ends: 40102 [2019-12-28 04:31:56,544 INFO L226 Difference]: Without dead ends: 40102 [2019-12-28 04:31:56,544 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-28 04:31:56,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40102 states. [2019-12-28 04:31:56,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40102 to 25282. [2019-12-28 04:31:56,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25282 states. [2019-12-28 04:31:56,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25282 states to 25282 states and 75960 transitions. [2019-12-28 04:31:56,949 INFO L78 Accepts]: Start accepts. Automaton has 25282 states and 75960 transitions. Word has length 81 [2019-12-28 04:31:56,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 04:31:56,950 INFO L462 AbstractCegarLoop]: Abstraction has 25282 states and 75960 transitions. [2019-12-28 04:31:56,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 04:31:56,950 INFO L276 IsEmpty]: Start isEmpty. Operand 25282 states and 75960 transitions. [2019-12-28 04:31:56,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-28 04:31:56,969 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 04:31:56,969 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 04:31:56,970 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 04:31:56,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 04:31:56,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1913824220, now seen corresponding path program 1 times [2019-12-28 04:31:56,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 04:31:56,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776223179] [2019-12-28 04:31:56,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 04:31:56,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 04:31:57,039 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-28 04:31:57,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776223179] [2019-12-28 04:31:57,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 04:31:57,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 04:31:57,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1280011888] [2019-12-28 04:31:57,040 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 04:31:57,051 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 04:31:57,074 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 84 states and 85 transitions. [2019-12-28 04:31:57,075 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 04:31:57,075 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 04:31:57,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 04:31:57,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 04:31:57,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 04:31:57,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-28 04:31:57,076 INFO L87 Difference]: Start difference. First operand 25282 states and 75960 transitions. Second operand 5 states. [2019-12-28 04:31:57,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 04:31:57,117 INFO L93 Difference]: Finished difference Result 3064 states and 7430 transitions. [2019-12-28 04:31:57,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-28 04:31:57,118 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-12-28 04:31:57,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 04:31:57,121 INFO L225 Difference]: With dead ends: 3064 [2019-12-28 04:31:57,121 INFO L226 Difference]: Without dead ends: 2668 [2019-12-28 04:31:57,122 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-28 04:31:57,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2668 states. [2019-12-28 04:31:57,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2668 to 2424. [2019-12-28 04:31:57,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2424 states. [2019-12-28 04:31:57,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2424 states to 2424 states and 5875 transitions. [2019-12-28 04:31:57,155 INFO L78 Accepts]: Start accepts. Automaton has 2424 states and 5875 transitions. Word has length 81 [2019-12-28 04:31:57,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 04:31:57,156 INFO L462 AbstractCegarLoop]: Abstraction has 2424 states and 5875 transitions. [2019-12-28 04:31:57,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 04:31:57,156 INFO L276 IsEmpty]: Start isEmpty. Operand 2424 states and 5875 transitions. [2019-12-28 04:31:57,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-28 04:31:57,159 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 04:31:57,159 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 04:31:57,159 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 04:31:57,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 04:31:57,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1212257335, now seen corresponding path program 1 times [2019-12-28 04:31:57,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 04:31:57,161 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944072321] [2019-12-28 04:31:57,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 04:31:57,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 04:31:57,282 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-28 04:31:57,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944072321] [2019-12-28 04:31:57,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 04:31:57,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 04:31:57,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2054766518] [2019-12-28 04:31:57,283 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 04:31:57,298 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 04:31:57,363 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 132 states and 169 transitions. [2019-12-28 04:31:57,363 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 04:31:57,370 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-28 04:31:57,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 04:31:57,371 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 04:31:57,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 04:31:57,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-28 04:31:57,371 INFO L87 Difference]: Start difference. First operand 2424 states and 5875 transitions. Second operand 6 states. [2019-12-28 04:31:57,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 04:31:57,578 INFO L93 Difference]: Finished difference Result 2655 states and 6264 transitions. [2019-12-28 04:31:57,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 04:31:57,579 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-12-28 04:31:57,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 04:31:57,584 INFO L225 Difference]: With dead ends: 2655 [2019-12-28 04:31:57,584 INFO L226 Difference]: Without dead ends: 2610 [2019-12-28 04:31:57,585 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-28 04:31:57,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2610 states. [2019-12-28 04:31:57,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2610 to 2463. [2019-12-28 04:31:57,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2463 states. [2019-12-28 04:31:57,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2463 states to 2463 states and 5897 transitions. [2019-12-28 04:31:57,637 INFO L78 Accepts]: Start accepts. Automaton has 2463 states and 5897 transitions. Word has length 93 [2019-12-28 04:31:57,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 04:31:57,637 INFO L462 AbstractCegarLoop]: Abstraction has 2463 states and 5897 transitions. [2019-12-28 04:31:57,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 04:31:57,637 INFO L276 IsEmpty]: Start isEmpty. Operand 2463 states and 5897 transitions. [2019-12-28 04:31:57,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-28 04:31:57,641 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 04:31:57,642 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 04:31:57,642 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 04:31:57,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 04:31:57,642 INFO L82 PathProgramCache]: Analyzing trace with hash -419839496, now seen corresponding path program 1 times [2019-12-28 04:31:57,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 04:31:57,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645389273] [2019-12-28 04:31:57,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 04:31:57,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 04:31:57,736 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-28 04:31:57,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645389273] [2019-12-28 04:31:57,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 04:31:57,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 04:31:57,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [56108969] [2019-12-28 04:31:57,738 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 04:31:57,767 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 04:31:57,840 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 123 states and 151 transitions. [2019-12-28 04:31:57,840 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 04:31:57,878 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-28 04:31:57,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 04:31:57,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 04:31:57,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 04:31:57,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 04:31:57,880 INFO L87 Difference]: Start difference. First operand 2463 states and 5897 transitions. Second operand 6 states. [2019-12-28 04:31:58,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 04:31:58,450 INFO L93 Difference]: Finished difference Result 2955 states and 6901 transitions. [2019-12-28 04:31:58,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-28 04:31:58,451 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-12-28 04:31:58,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 04:31:58,456 INFO L225 Difference]: With dead ends: 2955 [2019-12-28 04:31:58,456 INFO L226 Difference]: Without dead ends: 2919 [2019-12-28 04:31:58,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-12-28 04:31:58,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2919 states. [2019-12-28 04:31:58,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2919 to 2534. [2019-12-28 04:31:58,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2534 states. [2019-12-28 04:31:58,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2534 states to 2534 states and 6039 transitions. [2019-12-28 04:31:58,504 INFO L78 Accepts]: Start accepts. Automaton has 2534 states and 6039 transitions. Word has length 93 [2019-12-28 04:31:58,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 04:31:58,504 INFO L462 AbstractCegarLoop]: Abstraction has 2534 states and 6039 transitions. [2019-12-28 04:31:58,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 04:31:58,504 INFO L276 IsEmpty]: Start isEmpty. Operand 2534 states and 6039 transitions. [2019-12-28 04:31:58,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-28 04:31:58,507 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 04:31:58,508 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 04:31:58,508 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 04:31:58,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 04:31:58,508 INFO L82 PathProgramCache]: Analyzing trace with hash 2092638256, now seen corresponding path program 2 times [2019-12-28 04:31:58,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 04:31:58,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785414129] [2019-12-28 04:31:58,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 04:31:58,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 04:31:58,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 04:31:58,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785414129] [2019-12-28 04:31:58,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 04:31:58,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 04:31:58,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [773600523] [2019-12-28 04:31:58,607 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 04:31:58,623 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 04:31:58,683 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 126 states and 150 transitions. [2019-12-28 04:31:58,684 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 04:31:58,787 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-28 04:31:58,788 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 04:31:58,788 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 04:31:58,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 04:31:58,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-28 04:31:58,789 INFO L87 Difference]: Start difference. First operand 2534 states and 6039 transitions. Second operand 8 states. [2019-12-28 04:31:59,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 04:31:59,272 INFO L93 Difference]: Finished difference Result 3366 states and 7918 transitions. [2019-12-28 04:31:59,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 04:31:59,272 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 93 [2019-12-28 04:31:59,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 04:31:59,278 INFO L225 Difference]: With dead ends: 3366 [2019-12-28 04:31:59,278 INFO L226 Difference]: Without dead ends: 3330 [2019-12-28 04:31:59,278 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-28 04:31:59,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3330 states. [2019-12-28 04:31:59,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3330 to 2810. [2019-12-28 04:31:59,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2810 states. [2019-12-28 04:31:59,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2810 states to 2810 states and 6664 transitions. [2019-12-28 04:31:59,309 INFO L78 Accepts]: Start accepts. Automaton has 2810 states and 6664 transitions. Word has length 93 [2019-12-28 04:31:59,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 04:31:59,309 INFO L462 AbstractCegarLoop]: Abstraction has 2810 states and 6664 transitions. [2019-12-28 04:31:59,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 04:31:59,309 INFO L276 IsEmpty]: Start isEmpty. Operand 2810 states and 6664 transitions. [2019-12-28 04:31:59,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-28 04:31:59,312 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 04:31:59,312 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 04:31:59,312 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 04:31:59,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 04:31:59,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1809487792, now seen corresponding path program 1 times [2019-12-28 04:31:59,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 04:31:59,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214577478] [2019-12-28 04:31:59,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 04:31:59,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 04:31:59,399 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-28 04:31:59,400 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214577478] [2019-12-28 04:31:59,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 04:31:59,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 04:31:59,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [474519309] [2019-12-28 04:31:59,400 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 04:31:59,416 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 04:31:59,488 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 126 states and 150 transitions. [2019-12-28 04:31:59,488 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 04:31:59,490 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-28 04:31:59,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 04:31:59,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 04:31:59,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 04:31:59,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-28 04:31:59,492 INFO L87 Difference]: Start difference. First operand 2810 states and 6664 transitions. Second operand 7 states. [2019-12-28 04:31:59,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 04:31:59,999 INFO L93 Difference]: Finished difference Result 5429 states and 13161 transitions. [2019-12-28 04:32:00,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-28 04:32:00,000 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2019-12-28 04:32:00,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 04:32:00,008 INFO L225 Difference]: With dead ends: 5429 [2019-12-28 04:32:00,008 INFO L226 Difference]: Without dead ends: 5429 [2019-12-28 04:32:00,012 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-12-28 04:32:00,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5429 states. [2019-12-28 04:32:00,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5429 to 2937. [2019-12-28 04:32:00,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2937 states. [2019-12-28 04:32:00,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2937 states to 2937 states and 6972 transitions. [2019-12-28 04:32:00,067 INFO L78 Accepts]: Start accepts. Automaton has 2937 states and 6972 transitions. Word has length 93 [2019-12-28 04:32:00,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 04:32:00,068 INFO L462 AbstractCegarLoop]: Abstraction has 2937 states and 6972 transitions. [2019-12-28 04:32:00,068 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 04:32:00,068 INFO L276 IsEmpty]: Start isEmpty. Operand 2937 states and 6972 transitions. [2019-12-28 04:32:00,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-28 04:32:00,072 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 04:32:00,072 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 04:32:00,072 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 04:32:00,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 04:32:00,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1240715023, now seen corresponding path program 1 times [2019-12-28 04:32:00,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 04:32:00,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346354646] [2019-12-28 04:32:00,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 04:32:00,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 04:32:00,240 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-28 04:32:00,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346354646] [2019-12-28 04:32:00,241 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 04:32:00,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 04:32:00,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [911783309] [2019-12-28 04:32:00,242 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 04:32:00,270 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 04:32:00,345 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 126 states and 150 transitions. [2019-12-28 04:32:00,345 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 04:32:00,349 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-28 04:32:00,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 04:32:00,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 04:32:00,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 04:32:00,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-28 04:32:00,351 INFO L87 Difference]: Start difference. First operand 2937 states and 6972 transitions. Second operand 6 states. [2019-12-28 04:32:00,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 04:32:00,437 INFO L93 Difference]: Finished difference Result 4592 states and 11122 transitions. [2019-12-28 04:32:00,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-28 04:32:00,438 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-12-28 04:32:00,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 04:32:00,446 INFO L225 Difference]: With dead ends: 4592 [2019-12-28 04:32:00,446 INFO L226 Difference]: Without dead ends: 4592 [2019-12-28 04:32:00,447 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-28 04:32:00,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4592 states. [2019-12-28 04:32:00,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4592 to 2900. [2019-12-28 04:32:00,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2900 states. [2019-12-28 04:32:00,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2900 states to 2900 states and 6836 transitions. [2019-12-28 04:32:00,517 INFO L78 Accepts]: Start accepts. Automaton has 2900 states and 6836 transitions. Word has length 93 [2019-12-28 04:32:00,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 04:32:00,517 INFO L462 AbstractCegarLoop]: Abstraction has 2900 states and 6836 transitions. [2019-12-28 04:32:00,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 04:32:00,518 INFO L276 IsEmpty]: Start isEmpty. Operand 2900 states and 6836 transitions. [2019-12-28 04:32:00,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-28 04:32:00,523 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 04:32:00,523 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 04:32:00,524 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 04:32:00,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 04:32:00,524 INFO L82 PathProgramCache]: Analyzing trace with hash -759998607, now seen corresponding path program 1 times [2019-12-28 04:32:00,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 04:32:00,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619684251] [2019-12-28 04:32:00,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 04:32:00,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 04:32:00,650 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-28 04:32:00,650 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619684251] [2019-12-28 04:32:00,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 04:32:00,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 04:32:00,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2090132875] [2019-12-28 04:32:00,651 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 04:32:00,667 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 04:32:00,727 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 126 states and 150 transitions. [2019-12-28 04:32:00,727 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 04:32:00,729 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-28 04:32:00,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 04:32:00,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 04:32:00,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 04:32:00,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-28 04:32:00,731 INFO L87 Difference]: Start difference. First operand 2900 states and 6836 transitions. Second operand 6 states. [2019-12-28 04:32:00,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 04:32:00,877 INFO L93 Difference]: Finished difference Result 2729 states and 6293 transitions. [2019-12-28 04:32:00,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 04:32:00,877 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-12-28 04:32:00,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 04:32:00,881 INFO L225 Difference]: With dead ends: 2729 [2019-12-28 04:32:00,881 INFO L226 Difference]: Without dead ends: 2729 [2019-12-28 04:32:00,882 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-28 04:32:00,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2729 states. [2019-12-28 04:32:00,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2729 to 1987. [2019-12-28 04:32:00,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1987 states. [2019-12-28 04:32:00,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1987 states to 1987 states and 4681 transitions. [2019-12-28 04:32:00,903 INFO L78 Accepts]: Start accepts. Automaton has 1987 states and 4681 transitions. Word has length 93 [2019-12-28 04:32:00,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 04:32:00,904 INFO L462 AbstractCegarLoop]: Abstraction has 1987 states and 4681 transitions. [2019-12-28 04:32:00,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 04:32:00,904 INFO L276 IsEmpty]: Start isEmpty. Operand 1987 states and 4681 transitions. [2019-12-28 04:32:00,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-28 04:32:00,905 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 04:32:00,906 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 04:32:00,906 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 04:32:00,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 04:32:00,906 INFO L82 PathProgramCache]: Analyzing trace with hash 469539040, now seen corresponding path program 1 times [2019-12-28 04:32:00,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 04:32:00,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286121522] [2019-12-28 04:32:00,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 04:32:00,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 04:32:01,011 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-28 04:32:01,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286121522] [2019-12-28 04:32:01,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 04:32:01,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 04:32:01,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1234458204] [2019-12-28 04:32:01,012 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 04:32:01,030 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 04:32:01,083 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 125 states and 148 transitions. [2019-12-28 04:32:01,083 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 04:32:01,110 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-28 04:32:01,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 04:32:01,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 04:32:01,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 04:32:01,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-28 04:32:01,112 INFO L87 Difference]: Start difference. First operand 1987 states and 4681 transitions. Second operand 7 states. [2019-12-28 04:32:01,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 04:32:01,376 INFO L93 Difference]: Finished difference Result 2215 states and 5077 transitions. [2019-12-28 04:32:01,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-28 04:32:01,376 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-12-28 04:32:01,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 04:32:01,380 INFO L225 Difference]: With dead ends: 2215 [2019-12-28 04:32:01,380 INFO L226 Difference]: Without dead ends: 2215 [2019-12-28 04:32:01,380 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-12-28 04:32:01,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2215 states. [2019-12-28 04:32:01,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2215 to 2019. [2019-12-28 04:32:01,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2019 states. [2019-12-28 04:32:01,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2019 states to 2019 states and 4705 transitions. [2019-12-28 04:32:01,409 INFO L78 Accepts]: Start accepts. Automaton has 2019 states and 4705 transitions. Word has length 95 [2019-12-28 04:32:01,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 04:32:01,409 INFO L462 AbstractCegarLoop]: Abstraction has 2019 states and 4705 transitions. [2019-12-28 04:32:01,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 04:32:01,410 INFO L276 IsEmpty]: Start isEmpty. Operand 2019 states and 4705 transitions. [2019-12-28 04:32:01,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-28 04:32:01,412 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 04:32:01,412 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 04:32:01,413 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 04:32:01,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 04:32:01,413 INFO L82 PathProgramCache]: Analyzing trace with hash 593612287, now seen corresponding path program 1 times [2019-12-28 04:32:01,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 04:32:01,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006205161] [2019-12-28 04:32:01,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 04:32:01,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 04:32:01,481 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-28 04:32:01,482 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006205161] [2019-12-28 04:32:01,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 04:32:01,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 04:32:01,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [513089513] [2019-12-28 04:32:01,482 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 04:32:01,499 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 04:32:01,558 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 125 states and 148 transitions. [2019-12-28 04:32:01,559 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 04:32:01,560 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-28 04:32:01,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 04:32:01,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 04:32:01,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 04:32:01,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 04:32:01,561 INFO L87 Difference]: Start difference. First operand 2019 states and 4705 transitions. Second operand 5 states. [2019-12-28 04:32:01,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 04:32:01,801 INFO L93 Difference]: Finished difference Result 2271 states and 5284 transitions. [2019-12-28 04:32:01,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 04:32:01,802 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-12-28 04:32:01,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 04:32:01,806 INFO L225 Difference]: With dead ends: 2271 [2019-12-28 04:32:01,806 INFO L226 Difference]: Without dead ends: 2253 [2019-12-28 04:32:01,807 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-28 04:32:01,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2253 states. [2019-12-28 04:32:01,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2253 to 2046. [2019-12-28 04:32:01,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2046 states. [2019-12-28 04:32:01,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2046 states to 2046 states and 4759 transitions. [2019-12-28 04:32:01,846 INFO L78 Accepts]: Start accepts. Automaton has 2046 states and 4759 transitions. Word has length 95 [2019-12-28 04:32:01,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 04:32:01,846 INFO L462 AbstractCegarLoop]: Abstraction has 2046 states and 4759 transitions. [2019-12-28 04:32:01,846 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 04:32:01,846 INFO L276 IsEmpty]: Start isEmpty. Operand 2046 states and 4759 transitions. [2019-12-28 04:32:01,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-28 04:32:01,849 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 04:32:01,850 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 04:32:01,850 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 04:32:01,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 04:32:01,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1838376768, now seen corresponding path program 1 times [2019-12-28 04:32:01,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 04:32:01,852 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336342172] [2019-12-28 04:32:01,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 04:32:01,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 04:32:01,931 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-28 04:32:01,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336342172] [2019-12-28 04:32:01,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 04:32:01,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 04:32:01,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [855203939] [2019-12-28 04:32:01,932 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 04:32:01,961 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 04:32:02,025 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 125 states and 148 transitions. [2019-12-28 04:32:02,025 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 04:32:02,026 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-28 04:32:02,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 04:32:02,027 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 04:32:02,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 04:32:02,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-28 04:32:02,027 INFO L87 Difference]: Start difference. First operand 2046 states and 4759 transitions. Second operand 6 states. [2019-12-28 04:32:02,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 04:32:02,179 INFO L93 Difference]: Finished difference Result 2123 states and 4906 transitions. [2019-12-28 04:32:02,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 04:32:02,179 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-12-28 04:32:02,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 04:32:02,183 INFO L225 Difference]: With dead ends: 2123 [2019-12-28 04:32:02,183 INFO L226 Difference]: Without dead ends: 2123 [2019-12-28 04:32:02,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-28 04:32:02,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2123 states. [2019-12-28 04:32:02,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2123 to 2020. [2019-12-28 04:32:02,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2020 states. [2019-12-28 04:32:02,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2020 states to 2020 states and 4707 transitions. [2019-12-28 04:32:02,215 INFO L78 Accepts]: Start accepts. Automaton has 2020 states and 4707 transitions. Word has length 95 [2019-12-28 04:32:02,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 04:32:02,215 INFO L462 AbstractCegarLoop]: Abstraction has 2020 states and 4707 transitions. [2019-12-28 04:32:02,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 04:32:02,215 INFO L276 IsEmpty]: Start isEmpty. Operand 2020 states and 4707 transitions. [2019-12-28 04:32:02,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-28 04:32:02,218 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 04:32:02,218 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 04:32:02,218 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 04:32:02,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 04:32:02,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1806431583, now seen corresponding path program 1 times [2019-12-28 04:32:02,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 04:32:02,219 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548545040] [2019-12-28 04:32:02,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 04:32:02,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 04:32:02,346 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-28 04:32:02,347 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548545040] [2019-12-28 04:32:02,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 04:32:02,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-28 04:32:02,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1181377934] [2019-12-28 04:32:02,347 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 04:32:02,361 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 04:32:02,407 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 134 states and 162 transitions. [2019-12-28 04:32:02,407 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 04:32:02,408 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 04:32:02,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 04:32:02,408 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 04:32:02,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 04:32:02,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-28 04:32:02,409 INFO L87 Difference]: Start difference. First operand 2020 states and 4707 transitions. Second operand 8 states. [2019-12-28 04:32:02,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 04:32:02,506 INFO L93 Difference]: Finished difference Result 3367 states and 7933 transitions. [2019-12-28 04:32:02,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 04:32:02,506 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 95 [2019-12-28 04:32:02,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 04:32:02,508 INFO L225 Difference]: With dead ends: 3367 [2019-12-28 04:32:02,508 INFO L226 Difference]: Without dead ends: 1535 [2019-12-28 04:32:02,509 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-12-28 04:32:02,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1535 states. [2019-12-28 04:32:02,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1535 to 1455. [2019-12-28 04:32:02,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1455 states. [2019-12-28 04:32:02,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1455 states to 1455 states and 3420 transitions. [2019-12-28 04:32:02,523 INFO L78 Accepts]: Start accepts. Automaton has 1455 states and 3420 transitions. Word has length 95 [2019-12-28 04:32:02,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 04:32:02,524 INFO L462 AbstractCegarLoop]: Abstraction has 1455 states and 3420 transitions. [2019-12-28 04:32:02,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 04:32:02,524 INFO L276 IsEmpty]: Start isEmpty. Operand 1455 states and 3420 transitions. [2019-12-28 04:32:02,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-28 04:32:02,525 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 04:32:02,525 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 04:32:02,525 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 04:32:02,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 04:32:02,525 INFO L82 PathProgramCache]: Analyzing trace with hash -2061196609, now seen corresponding path program 2 times [2019-12-28 04:32:02,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 04:32:02,526 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233952360] [2019-12-28 04:32:02,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 04:32:02,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 04:32:02,675 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-28 04:32:02,675 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233952360] [2019-12-28 04:32:02,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 04:32:02,676 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-28 04:32:02,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1338988191] [2019-12-28 04:32:02,676 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 04:32:02,687 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 04:32:02,798 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 163 states and 226 transitions. [2019-12-28 04:32:02,798 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 04:32:02,859 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-28 04:32:02,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-28 04:32:02,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 04:32:02,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-28 04:32:02,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2019-12-28 04:32:02,861 INFO L87 Difference]: Start difference. First operand 1455 states and 3420 transitions. Second operand 14 states. [2019-12-28 04:32:03,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 04:32:03,894 INFO L93 Difference]: Finished difference Result 2982 states and 7006 transitions. [2019-12-28 04:32:03,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-28 04:32:03,894 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 95 [2019-12-28 04:32:03,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 04:32:03,898 INFO L225 Difference]: With dead ends: 2982 [2019-12-28 04:32:03,899 INFO L226 Difference]: Without dead ends: 2343 [2019-12-28 04:32:03,900 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=174, Invalid=818, Unknown=0, NotChecked=0, Total=992 [2019-12-28 04:32:03,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2343 states. [2019-12-28 04:32:03,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2343 to 1857. [2019-12-28 04:32:03,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1857 states. [2019-12-28 04:32:03,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1857 states to 1857 states and 4296 transitions. [2019-12-28 04:32:03,920 INFO L78 Accepts]: Start accepts. Automaton has 1857 states and 4296 transitions. Word has length 95 [2019-12-28 04:32:03,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 04:32:03,920 INFO L462 AbstractCegarLoop]: Abstraction has 1857 states and 4296 transitions. [2019-12-28 04:32:03,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-28 04:32:03,920 INFO L276 IsEmpty]: Start isEmpty. Operand 1857 states and 4296 transitions. [2019-12-28 04:32:03,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-28 04:32:03,922 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 04:32:03,923 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 04:32:03,923 INFO L410 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 04:32:03,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 04:32:03,923 INFO L82 PathProgramCache]: Analyzing trace with hash 331051299, now seen corresponding path program 3 times [2019-12-28 04:32:03,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 04:32:03,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642444061] [2019-12-28 04:32:03,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 04:32:03,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-28 04:32:03,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-28 04:32:04,018 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-28 04:32:04,018 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-28 04:32:04,184 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.12 04:32:04 BasicIcfg [2019-12-28 04:32:04,184 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-28 04:32:04,186 INFO L168 Benchmark]: Toolchain (without parser) took 75088.41 ms. Allocated memory was 138.9 MB in the beginning and 3.1 GB in the end (delta: 3.0 GB). Free memory was 102.2 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 879.8 MB. Max. memory is 7.1 GB. [2019-12-28 04:32:04,187 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-28 04:32:04,187 INFO L168 Benchmark]: CACSL2BoogieTranslator took 822.06 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 101.8 MB in the beginning and 155.8 MB in the end (delta: -53.9 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. [2019-12-28 04:32:04,187 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.23 ms. Allocated memory is still 203.4 MB. Free memory was 155.8 MB in the beginning and 153.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-28 04:32:04,188 INFO L168 Benchmark]: Boogie Preprocessor took 39.27 ms. Allocated memory is still 203.4 MB. Free memory was 153.0 MB in the beginning and 150.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-28 04:32:04,188 INFO L168 Benchmark]: RCFGBuilder took 779.94 ms. Allocated memory is still 203.4 MB. Free memory was 150.3 MB in the beginning and 106.4 MB in the end (delta: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 7.1 GB. [2019-12-28 04:32:04,188 INFO L168 Benchmark]: TraceAbstraction took 73372.82 ms. Allocated memory was 203.4 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 105.7 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 818.8 MB. Max. memory is 7.1 GB. [2019-12-28 04:32:04,190 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.24 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 822.06 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 101.8 MB in the beginning and 155.8 MB in the end (delta: -53.9 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 69.23 ms. Allocated memory is still 203.4 MB. Free memory was 155.8 MB in the beginning and 153.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.27 ms. Allocated memory is still 203.4 MB. Free memory was 153.0 MB in the beginning and 150.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 779.94 ms. Allocated memory is still 203.4 MB. Free memory was 150.3 MB in the beginning and 106.4 MB in the end (delta: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 73372.82 ms. Allocated memory was 203.4 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 105.7 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 818.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L694] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L696] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L697] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L698] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L700] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L702] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L703] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L704] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L705] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L706] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L707] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L708] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L709] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L710] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L711] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L712] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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}] [L713] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L714] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L715] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L716] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L717] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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] [L718] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L778] 0 pthread_t t2019; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] FCALL, FORK 0 pthread_create(&t2019, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L780] 0 pthread_t t2020; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L781] FCALL, FORK 0 pthread_create(&t2020, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L722] 1 y$w_buff1 = y$w_buff0 [L723] 1 y$w_buff0 = 2 [L724] 1 y$w_buff1_used = y$w_buff0_used [L725] 1 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 1 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L727] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L728] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L729] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L730] 1 y$r_buff0_thd1 = (_Bool)1 [L733] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L750] 2 __unbuffered_p1_EAX = x [L753] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L737] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L756] 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, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L737] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L756] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L756] 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, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L756] 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) [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L739] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L739] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L740] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L743] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L757] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L757] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L758] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L758] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L759] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L759] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L760] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L760] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L763] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L783] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L788] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L788] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L789] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L789] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L790] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L790] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L791] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L791] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L794] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L795] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L796] 0 y$flush_delayed = weak$$choice2 [L797] 0 y$mem_tmp = y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, 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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, 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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L799] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, 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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L799] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L800] 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 [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, 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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L800] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L801] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, 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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L801] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L802] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, 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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L802] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L803] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, 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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L803] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L804] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, 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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L804] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L805] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, 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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L806] EXPR 0 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, 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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L806] 0 y = y$flush_delayed ? y$mem_tmp : y [L807] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, 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=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, 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=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, 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=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 140 locations, 2 error locations. Result: UNSAFE, OverallTime: 73.0s, OverallIterations: 38, TraceHistogramMax: 1, AutomataDifference: 30.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 10790 SDtfs, 13000 SDslu, 28296 SDs, 0 SdLazy, 13931 SolverSat, 755 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 528 GetRequests, 173 SyntacticMatches, 26 SemanticMatches, 329 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1065 ImplicationChecksByTransitivity, 4.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=85811occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 33.9s AutomataMinimizationTime, 37 MinimizatonAttempts, 269834 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 2947 NumberOfCodeBlocks, 2947 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 2815 ConstructedInterpolants, 0 QuantifiedInterpolants, 514027 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 37 InterpolantComputations, 37 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...