./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/safe029_rmo.oepc_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/pthread-wmm/safe029_rmo.oepc_false-unreach-call.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a697edfe042240cd4f596c03e6214ca7451405ac ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-13 05:27:59,937 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-13 05:27:59,939 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-13 05:27:59,952 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-13 05:27:59,952 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-13 05:27:59,953 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-13 05:27:59,954 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-13 05:27:59,957 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-13 05:27:59,959 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-13 05:27:59,960 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-13 05:27:59,962 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-13 05:27:59,962 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-13 05:27:59,963 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-13 05:27:59,965 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-13 05:27:59,966 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-13 05:27:59,967 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-13 05:27:59,968 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-13 05:27:59,970 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-13 05:27:59,972 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-13 05:27:59,974 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-13 05:27:59,976 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-13 05:27:59,977 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-13 05:27:59,980 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-13 05:27:59,980 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-13 05:27:59,981 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-13 05:27:59,982 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-13 05:27:59,983 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-13 05:27:59,984 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-13 05:27:59,985 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-13 05:27:59,987 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-13 05:27:59,987 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-13 05:27:59,988 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-13 05:27:59,988 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-13 05:27:59,989 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-13 05:27:59,990 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-13 05:27:59,991 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-13 05:27:59,992 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-13 05:28:00,008 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-13 05:28:00,008 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-13 05:28:00,010 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-13 05:28:00,010 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-13 05:28:00,010 INFO L133 SettingsManager]: * Use SBE=true [2019-01-13 05:28:00,011 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-13 05:28:00,011 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-13 05:28:00,011 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-13 05:28:00,012 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-13 05:28:00,012 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-13 05:28:00,012 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-13 05:28:00,012 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-13 05:28:00,012 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-13 05:28:00,013 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-13 05:28:00,013 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-13 05:28:00,013 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-13 05:28:00,013 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-13 05:28:00,013 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-13 05:28:00,015 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-13 05:28:00,015 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-13 05:28:00,015 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-13 05:28:00,016 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 05:28:00,016 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-13 05:28:00,016 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-13 05:28:00,016 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-13 05:28:00,016 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-13 05:28:00,017 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-13 05:28:00,018 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-13 05:28:00,018 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a697edfe042240cd4f596c03e6214ca7451405ac [2019-01-13 05:28:00,055 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-13 05:28:00,069 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-13 05:28:00,073 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-13 05:28:00,074 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-13 05:28:00,075 INFO L276 PluginConnector]: CDTParser initialized [2019-01-13 05:28:00,076 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/safe029_rmo.oepc_false-unreach-call.i [2019-01-13 05:28:00,139 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82fd8f1d1/5dabd7df30204e4e8b56d6e0f715eea2/FLAG95fbea788 [2019-01-13 05:28:00,703 INFO L307 CDTParser]: Found 1 translation units. [2019-01-13 05:28:00,704 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/safe029_rmo.oepc_false-unreach-call.i [2019-01-13 05:28:00,720 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82fd8f1d1/5dabd7df30204e4e8b56d6e0f715eea2/FLAG95fbea788 [2019-01-13 05:28:01,108 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82fd8f1d1/5dabd7df30204e4e8b56d6e0f715eea2 [2019-01-13 05:28:01,112 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-13 05:28:01,113 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-13 05:28:01,114 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-13 05:28:01,114 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-13 05:28:01,118 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-13 05:28:01,119 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 05:28:01" (1/1) ... [2019-01-13 05:28:01,122 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@273e19e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:28:01, skipping insertion in model container [2019-01-13 05:28:01,122 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 05:28:01" (1/1) ... [2019-01-13 05:28:01,132 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-13 05:28:01,178 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-13 05:28:01,617 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 05:28:01,631 INFO L191 MainTranslator]: Completed pre-run [2019-01-13 05:28:01,795 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 05:28:01,896 INFO L195 MainTranslator]: Completed translation [2019-01-13 05:28:01,897 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:28:01 WrapperNode [2019-01-13 05:28:01,897 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-13 05:28:01,898 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-13 05:28:01,899 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-13 05:28:01,899 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-13 05:28:01,913 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:28:01" (1/1) ... [2019-01-13 05:28:01,951 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:28:01" (1/1) ... [2019-01-13 05:28:02,020 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-13 05:28:02,021 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-13 05:28:02,021 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-13 05:28:02,021 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-13 05:28:02,039 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:28:01" (1/1) ... [2019-01-13 05:28:02,039 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:28:01" (1/1) ... [2019-01-13 05:28:02,055 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:28:01" (1/1) ... [2019-01-13 05:28:02,055 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:28:01" (1/1) ... [2019-01-13 05:28:02,076 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:28:01" (1/1) ... [2019-01-13 05:28:02,081 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:28:01" (1/1) ... [2019-01-13 05:28:02,092 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:28:01" (1/1) ... [2019-01-13 05:28:02,097 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-13 05:28:02,097 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-13 05:28:02,098 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-13 05:28:02,098 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-13 05:28:02,099 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:28:01" (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-01-13 05:28:02,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-13 05:28:02,171 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-01-13 05:28:02,171 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-13 05:28:02,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-13 05:28:02,172 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-01-13 05:28:02,172 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-01-13 05:28:02,172 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-01-13 05:28:02,172 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-01-13 05:28:02,174 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-01-13 05:28:02,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-13 05:28:02,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-13 05:28:02,176 WARN L204 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-01-13 05:28:03,515 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-13 05:28:03,516 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-13 05:28:03,518 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 05:28:03 BoogieIcfgContainer [2019-01-13 05:28:03,518 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-13 05:28:03,519 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-13 05:28:03,520 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-13 05:28:03,523 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-13 05:28:03,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.01 05:28:01" (1/3) ... [2019-01-13 05:28:03,524 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cf69360 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 05:28:03, skipping insertion in model container [2019-01-13 05:28:03,524 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:28:01" (2/3) ... [2019-01-13 05:28:03,525 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cf69360 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 05:28:03, skipping insertion in model container [2019-01-13 05:28:03,525 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 05:28:03" (3/3) ... [2019-01-13 05:28:03,527 INFO L112 eAbstractionObserver]: Analyzing ICFG safe029_rmo.oepc_false-unreach-call.i [2019-01-13 05:28:03,573 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:28:03,573 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:28:03,573 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:28:03,573 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:28:03,574 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:28:03,574 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:28:03,574 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:28:03,574 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:28:03,575 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:28:03,575 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:28:03,575 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:28:03,575 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:28:03,575 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:28:03,576 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:28:03,576 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:28:03,576 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:28:03,576 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:28:03,576 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:28:03,577 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:28:03,578 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:28:03,578 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:28:03,578 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:28:03,579 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:28:03,579 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:28:03,580 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:28:03,580 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:28:03,580 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:28:03,580 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:28:03,580 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:28:03,582 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:28:03,582 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:28:03,582 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:28:03,582 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:28:03,583 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:28:03,583 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:28:03,583 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:28:03,583 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:28:03,583 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:28:03,585 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:28:03,586 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:28:03,586 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:28:03,586 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:28:03,586 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:28:03,586 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:28:03,587 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:28:03,588 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:28:03,588 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:28:03,588 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:28:03,588 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:28:03,589 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:28:03,590 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:28:03,590 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:28:03,590 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:28:03,590 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:28:03,590 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:28:03,591 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:28:03,591 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:28:03,591 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:28:03,591 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:28:03,592 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:28:03,593 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:28:03,594 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:28:03,594 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:28:03,594 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:28:03,595 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:28:03,595 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:28:03,595 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:28:03,595 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:28:03,595 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:28:03,595 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:28:03,596 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:28:03,596 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:28:03,612 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-01-13 05:28:03,612 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-13 05:28:03,620 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-13 05:28:03,639 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-13 05:28:03,668 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-13 05:28:03,669 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-13 05:28:03,669 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-13 05:28:03,669 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-13 05:28:03,669 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-13 05:28:03,669 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-13 05:28:03,670 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-13 05:28:03,670 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-13 05:28:03,671 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-13 05:28:03,685 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 140places, 178 transitions [2019-01-13 05:28:05,493 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25102 states. [2019-01-13 05:28:05,495 INFO L276 IsEmpty]: Start isEmpty. Operand 25102 states. [2019-01-13 05:28:05,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-13 05:28:05,504 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:28:05,505 INFO L402 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] [2019-01-13 05:28:05,508 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:28:05,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:28:05,515 INFO L82 PathProgramCache]: Analyzing trace with hash 2024635459, now seen corresponding path program 1 times [2019-01-13 05:28:05,517 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:28:05,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:28:05,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:28:05,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:28:05,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:28:05,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:28:05,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:28:05,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:28:05,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 05:28:05,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 05:28:05,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 05:28:05,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 05:28:05,921 INFO L87 Difference]: Start difference. First operand 25102 states. Second operand 4 states. [2019-01-13 05:28:06,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:28:06,798 INFO L93 Difference]: Finished difference Result 45394 states and 177648 transitions. [2019-01-13 05:28:06,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 05:28:06,800 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-01-13 05:28:06,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:28:07,201 INFO L225 Difference]: With dead ends: 45394 [2019-01-13 05:28:07,202 INFO L226 Difference]: Without dead ends: 40634 [2019-01-13 05:28:07,204 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 05:28:07,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40634 states. [2019-01-13 05:28:08,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40634 to 23668. [2019-01-13 05:28:08,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23668 states. [2019-01-13 05:28:08,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23668 states to 23668 states and 92565 transitions. [2019-01-13 05:28:08,874 INFO L78 Accepts]: Start accepts. Automaton has 23668 states and 92565 transitions. Word has length 31 [2019-01-13 05:28:08,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:28:08,874 INFO L480 AbstractCegarLoop]: Abstraction has 23668 states and 92565 transitions. [2019-01-13 05:28:08,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 05:28:08,875 INFO L276 IsEmpty]: Start isEmpty. Operand 23668 states and 92565 transitions. [2019-01-13 05:28:08,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-01-13 05:28:08,883 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:28:08,883 INFO L402 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] [2019-01-13 05:28:08,883 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:28:08,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:28:08,884 INFO L82 PathProgramCache]: Analyzing trace with hash -1263924681, now seen corresponding path program 1 times [2019-01-13 05:28:08,884 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:28:08,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:28:08,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:28:08,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:28:08,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:28:08,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:28:09,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:28:09,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:28:09,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 05:28:09,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 05:28:09,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 05:28:09,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 05:28:09,118 INFO L87 Difference]: Start difference. First operand 23668 states and 92565 transitions. Second operand 5 states. [2019-01-13 05:28:11,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:28:11,913 INFO L93 Difference]: Finished difference Result 64836 states and 241395 transitions. [2019-01-13 05:28:11,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 05:28:11,914 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-01-13 05:28:11,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:28:12,257 INFO L225 Difference]: With dead ends: 64836 [2019-01-13 05:28:12,257 INFO L226 Difference]: Without dead ends: 64676 [2019-01-13 05:28:12,258 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-13 05:28:12,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64676 states. [2019-01-13 05:28:13,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64676 to 37148. [2019-01-13 05:28:13,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37148 states. [2019-01-13 05:28:14,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37148 states to 37148 states and 138310 transitions. [2019-01-13 05:28:14,111 INFO L78 Accepts]: Start accepts. Automaton has 37148 states and 138310 transitions. Word has length 42 [2019-01-13 05:28:14,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:28:14,113 INFO L480 AbstractCegarLoop]: Abstraction has 37148 states and 138310 transitions. [2019-01-13 05:28:14,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 05:28:14,113 INFO L276 IsEmpty]: Start isEmpty. Operand 37148 states and 138310 transitions. [2019-01-13 05:28:14,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-01-13 05:28:14,118 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:28:14,118 INFO L402 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] [2019-01-13 05:28:14,118 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:28:14,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:28:14,119 INFO L82 PathProgramCache]: Analyzing trace with hash 555727520, now seen corresponding path program 1 times [2019-01-13 05:28:14,119 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:28:14,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:28:14,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:28:14,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:28:14,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:28:14,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:28:14,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:28:14,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:28:14,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 05:28:14,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 05:28:14,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 05:28:14,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 05:28:14,260 INFO L87 Difference]: Start difference. First operand 37148 states and 138310 transitions. Second operand 4 states. [2019-01-13 05:28:14,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:28:14,381 INFO L93 Difference]: Finished difference Result 12370 states and 41203 transitions. [2019-01-13 05:28:14,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 05:28:14,382 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2019-01-13 05:28:14,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:28:14,411 INFO L225 Difference]: With dead ends: 12370 [2019-01-13 05:28:14,412 INFO L226 Difference]: Without dead ends: 11849 [2019-01-13 05:28:14,412 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-01-13 05:28:14,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11849 states. [2019-01-13 05:28:14,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11849 to 11849. [2019-01-13 05:28:14,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11849 states. [2019-01-13 05:28:14,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11849 states to 11849 states and 39648 transitions. [2019-01-13 05:28:14,699 INFO L78 Accepts]: Start accepts. Automaton has 11849 states and 39648 transitions. Word has length 43 [2019-01-13 05:28:14,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:28:14,699 INFO L480 AbstractCegarLoop]: Abstraction has 11849 states and 39648 transitions. [2019-01-13 05:28:14,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 05:28:14,701 INFO L276 IsEmpty]: Start isEmpty. Operand 11849 states and 39648 transitions. [2019-01-13 05:28:14,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-13 05:28:14,709 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:28:14,709 INFO L402 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] [2019-01-13 05:28:14,710 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:28:14,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:28:14,710 INFO L82 PathProgramCache]: Analyzing trace with hash -2022717967, now seen corresponding path program 1 times [2019-01-13 05:28:14,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:28:14,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:28:14,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:28:14,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:28:14,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:28:14,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:28:14,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:28:14,898 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:28:14,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 05:28:14,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 05:28:14,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 05:28:14,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 05:28:14,900 INFO L87 Difference]: Start difference. First operand 11849 states and 39648 transitions. Second operand 4 states. [2019-01-13 05:28:15,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:28:15,497 INFO L93 Difference]: Finished difference Result 17025 states and 55723 transitions. [2019-01-13 05:28:15,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 05:28:15,498 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-01-13 05:28:15,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:28:15,538 INFO L225 Difference]: With dead ends: 17025 [2019-01-13 05:28:15,539 INFO L226 Difference]: Without dead ends: 17025 [2019-01-13 05:28:15,539 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 05:28:15,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17025 states. [2019-01-13 05:28:15,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17025 to 12885. [2019-01-13 05:28:15,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12885 states. [2019-01-13 05:28:15,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12885 states to 12885 states and 42750 transitions. [2019-01-13 05:28:15,938 INFO L78 Accepts]: Start accepts. Automaton has 12885 states and 42750 transitions. Word has length 56 [2019-01-13 05:28:15,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:28:15,939 INFO L480 AbstractCegarLoop]: Abstraction has 12885 states and 42750 transitions. [2019-01-13 05:28:15,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 05:28:15,940 INFO L276 IsEmpty]: Start isEmpty. Operand 12885 states and 42750 transitions. [2019-01-13 05:28:15,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-13 05:28:15,949 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:28:15,949 INFO L402 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] [2019-01-13 05:28:15,950 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:28:15,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:28:15,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1977003375, now seen corresponding path program 1 times [2019-01-13 05:28:15,950 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:28:15,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:28:15,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:28:15,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:28:15,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:28:15,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:28:16,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:28:16,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:28:16,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 05:28:16,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 05:28:16,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 05:28:16,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 05:28:16,080 INFO L87 Difference]: Start difference. First operand 12885 states and 42750 transitions. Second operand 4 states. [2019-01-13 05:28:17,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:28:17,163 INFO L93 Difference]: Finished difference Result 18380 states and 60007 transitions. [2019-01-13 05:28:17,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 05:28:17,165 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-01-13 05:28:17,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:28:17,204 INFO L225 Difference]: With dead ends: 18380 [2019-01-13 05:28:17,204 INFO L226 Difference]: Without dead ends: 18380 [2019-01-13 05:28:17,205 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-01-13 05:28:17,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18380 states. [2019-01-13 05:28:17,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18380 to 16341. [2019-01-13 05:28:17,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16341 states. [2019-01-13 05:28:18,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16341 states to 16341 states and 53832 transitions. [2019-01-13 05:28:18,008 INFO L78 Accepts]: Start accepts. Automaton has 16341 states and 53832 transitions. Word has length 56 [2019-01-13 05:28:18,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:28:18,008 INFO L480 AbstractCegarLoop]: Abstraction has 16341 states and 53832 transitions. [2019-01-13 05:28:18,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 05:28:18,008 INFO L276 IsEmpty]: Start isEmpty. Operand 16341 states and 53832 transitions. [2019-01-13 05:28:18,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-13 05:28:18,018 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:28:18,018 INFO L402 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] [2019-01-13 05:28:18,018 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:28:18,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:28:18,019 INFO L82 PathProgramCache]: Analyzing trace with hash -964654224, now seen corresponding path program 1 times [2019-01-13 05:28:18,020 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:28:18,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:28:18,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:28:18,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:28:18,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:28:18,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:28:18,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:28:18,284 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:28:18,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 05:28:18,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 05:28:18,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 05:28:18,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 05:28:18,285 INFO L87 Difference]: Start difference. First operand 16341 states and 53832 transitions. Second operand 6 states. [2019-01-13 05:28:18,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:28:18,979 INFO L93 Difference]: Finished difference Result 17857 states and 58003 transitions. [2019-01-13 05:28:18,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 05:28:18,980 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-01-13 05:28:18,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:28:19,019 INFO L225 Difference]: With dead ends: 17857 [2019-01-13 05:28:19,020 INFO L226 Difference]: Without dead ends: 17857 [2019-01-13 05:28:19,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-01-13 05:28:19,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17857 states. [2019-01-13 05:28:19,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17857 to 16903. [2019-01-13 05:28:19,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16903 states. [2019-01-13 05:28:19,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16903 states to 16903 states and 55361 transitions. [2019-01-13 05:28:19,346 INFO L78 Accepts]: Start accepts. Automaton has 16903 states and 55361 transitions. Word has length 56 [2019-01-13 05:28:19,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:28:19,347 INFO L480 AbstractCegarLoop]: Abstraction has 16903 states and 55361 transitions. [2019-01-13 05:28:19,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 05:28:19,347 INFO L276 IsEmpty]: Start isEmpty. Operand 16903 states and 55361 transitions. [2019-01-13 05:28:19,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-13 05:28:19,355 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:28:19,355 INFO L402 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] [2019-01-13 05:28:19,355 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:28:19,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:28:19,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1258057231, now seen corresponding path program 1 times [2019-01-13 05:28:19,356 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:28:19,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:28:19,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:28:19,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:28:19,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:28:19,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:28:19,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:28:19,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:28:19,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 05:28:19,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 05:28:19,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 05:28:19,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-13 05:28:19,501 INFO L87 Difference]: Start difference. First operand 16903 states and 55361 transitions. Second operand 6 states. [2019-01-13 05:28:20,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:28:20,457 INFO L93 Difference]: Finished difference Result 23475 states and 75946 transitions. [2019-01-13 05:28:20,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-13 05:28:20,458 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-01-13 05:28:20,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:28:20,500 INFO L225 Difference]: With dead ends: 23475 [2019-01-13 05:28:20,500 INFO L226 Difference]: Without dead ends: 23443 [2019-01-13 05:28:20,500 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-01-13 05:28:20,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23443 states. [2019-01-13 05:28:20,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23443 to 18807. [2019-01-13 05:28:20,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18807 states. [2019-01-13 05:28:21,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18807 states to 18807 states and 61305 transitions. [2019-01-13 05:28:21,346 INFO L78 Accepts]: Start accepts. Automaton has 18807 states and 61305 transitions. Word has length 56 [2019-01-13 05:28:21,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:28:21,347 INFO L480 AbstractCegarLoop]: Abstraction has 18807 states and 61305 transitions. [2019-01-13 05:28:21,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 05:28:21,347 INFO L276 IsEmpty]: Start isEmpty. Operand 18807 states and 61305 transitions. [2019-01-13 05:28:21,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-01-13 05:28:21,370 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:28:21,370 INFO L402 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] [2019-01-13 05:28:21,370 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:28:21,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:28:21,371 INFO L82 PathProgramCache]: Analyzing trace with hash -2076609247, now seen corresponding path program 1 times [2019-01-13 05:28:21,371 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:28:21,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:28:21,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:28:21,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:28:21,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:28:21,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:28:21,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:28:21,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:28:21,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 05:28:21,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 05:28:21,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 05:28:21,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-13 05:28:21,882 INFO L87 Difference]: Start difference. First operand 18807 states and 61305 transitions. Second operand 7 states. [2019-01-13 05:28:23,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:28:23,026 INFO L93 Difference]: Finished difference Result 24535 states and 79153 transitions. [2019-01-13 05:28:23,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-13 05:28:23,026 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 70 [2019-01-13 05:28:23,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:28:23,075 INFO L225 Difference]: With dead ends: 24535 [2019-01-13 05:28:23,075 INFO L226 Difference]: Without dead ends: 24471 [2019-01-13 05:28:23,076 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-01-13 05:28:23,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24471 states. [2019-01-13 05:28:23,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24471 to 20899. [2019-01-13 05:28:23,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20899 states. [2019-01-13 05:28:23,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20899 states to 20899 states and 67710 transitions. [2019-01-13 05:28:23,408 INFO L78 Accepts]: Start accepts. Automaton has 20899 states and 67710 transitions. Word has length 70 [2019-01-13 05:28:23,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:28:23,409 INFO L480 AbstractCegarLoop]: Abstraction has 20899 states and 67710 transitions. [2019-01-13 05:28:23,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 05:28:23,409 INFO L276 IsEmpty]: Start isEmpty. Operand 20899 states and 67710 transitions. [2019-01-13 05:28:23,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-01-13 05:28:23,433 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:28:23,433 INFO L402 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] [2019-01-13 05:28:23,433 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:28:23,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:28:23,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1643744653, now seen corresponding path program 1 times [2019-01-13 05:28:23,434 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:28:23,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:28:23,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:28:23,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:28:23,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:28:23,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:28:23,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:28:23,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:28:23,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 05:28:23,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 05:28:23,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 05:28:23,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 05:28:23,521 INFO L87 Difference]: Start difference. First operand 20899 states and 67710 transitions. Second operand 3 states. [2019-01-13 05:28:23,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:28:23,739 INFO L93 Difference]: Finished difference Result 24947 states and 79522 transitions. [2019-01-13 05:28:23,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 05:28:23,739 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-01-13 05:28:23,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:28:23,788 INFO L225 Difference]: With dead ends: 24947 [2019-01-13 05:28:23,789 INFO L226 Difference]: Without dead ends: 24947 [2019-01-13 05:28:23,789 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-01-13 05:28:23,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24947 states. [2019-01-13 05:28:24,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24947 to 22467. [2019-01-13 05:28:24,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22467 states. [2019-01-13 05:28:24,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22467 states to 22467 states and 72190 transitions. [2019-01-13 05:28:24,163 INFO L78 Accepts]: Start accepts. Automaton has 22467 states and 72190 transitions. Word has length 72 [2019-01-13 05:28:24,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:28:24,164 INFO L480 AbstractCegarLoop]: Abstraction has 22467 states and 72190 transitions. [2019-01-13 05:28:24,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 05:28:24,164 INFO L276 IsEmpty]: Start isEmpty. Operand 22467 states and 72190 transitions. [2019-01-13 05:28:24,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-01-13 05:28:24,192 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:28:24,192 INFO L402 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] [2019-01-13 05:28:24,193 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:28:24,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:28:24,193 INFO L82 PathProgramCache]: Analyzing trace with hash -671189007, now seen corresponding path program 1 times [2019-01-13 05:28:24,193 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:28:24,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:28:24,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:28:24,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:28:24,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:28:24,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:28:24,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:28:24,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:28:24,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 05:28:24,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 05:28:24,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 05:28:24,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 05:28:24,327 INFO L87 Difference]: Start difference. First operand 22467 states and 72190 transitions. Second operand 4 states. [2019-01-13 05:28:25,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:28:25,043 INFO L93 Difference]: Finished difference Result 34667 states and 110116 transitions. [2019-01-13 05:28:25,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 05:28:25,044 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-01-13 05:28:25,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:28:25,104 INFO L225 Difference]: With dead ends: 34667 [2019-01-13 05:28:25,104 INFO L226 Difference]: Without dead ends: 34471 [2019-01-13 05:28:25,104 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 05:28:25,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34471 states. [2019-01-13 05:28:25,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34471 to 29099. [2019-01-13 05:28:25,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29099 states. [2019-01-13 05:28:25,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29099 states to 29099 states and 93336 transitions. [2019-01-13 05:28:25,697 INFO L78 Accepts]: Start accepts. Automaton has 29099 states and 93336 transitions. Word has length 76 [2019-01-13 05:28:25,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:28:25,697 INFO L480 AbstractCegarLoop]: Abstraction has 29099 states and 93336 transitions. [2019-01-13 05:28:25,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 05:28:25,697 INFO L276 IsEmpty]: Start isEmpty. Operand 29099 states and 93336 transitions. [2019-01-13 05:28:25,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-01-13 05:28:25,736 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:28:25,736 INFO L402 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] [2019-01-13 05:28:25,737 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:28:25,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:28:25,737 INFO L82 PathProgramCache]: Analyzing trace with hash 573575474, now seen corresponding path program 1 times [2019-01-13 05:28:25,737 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:28:25,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:28:25,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:28:25,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:28:25,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:28:25,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:28:26,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:28:26,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:28:26,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 05:28:26,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 05:28:26,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 05:28:26,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-13 05:28:26,213 INFO L87 Difference]: Start difference. First operand 29099 states and 93336 transitions. Second operand 6 states. [2019-01-13 05:28:27,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:28:27,620 INFO L93 Difference]: Finished difference Result 52152 states and 164833 transitions. [2019-01-13 05:28:27,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-13 05:28:27,621 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 76 [2019-01-13 05:28:27,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:28:27,717 INFO L225 Difference]: With dead ends: 52152 [2019-01-13 05:28:27,717 INFO L226 Difference]: Without dead ends: 51912 [2019-01-13 05:28:27,718 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-01-13 05:28:27,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51912 states. [2019-01-13 05:28:28,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51912 to 43712. [2019-01-13 05:28:28,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43712 states. [2019-01-13 05:28:28,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43712 states to 43712 states and 140003 transitions. [2019-01-13 05:28:28,455 INFO L78 Accepts]: Start accepts. Automaton has 43712 states and 140003 transitions. Word has length 76 [2019-01-13 05:28:28,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:28:28,455 INFO L480 AbstractCegarLoop]: Abstraction has 43712 states and 140003 transitions. [2019-01-13 05:28:28,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 05:28:28,455 INFO L276 IsEmpty]: Start isEmpty. Operand 43712 states and 140003 transitions. [2019-01-13 05:28:28,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-01-13 05:28:28,499 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:28:28,499 INFO L402 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] [2019-01-13 05:28:28,499 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:28:28,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:28:28,500 INFO L82 PathProgramCache]: Analyzing trace with hash -270896397, now seen corresponding path program 1 times [2019-01-13 05:28:28,500 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:28:28,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:28:28,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:28:28,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:28:28,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:28:28,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:28:28,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:28:28,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:28:28,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 05:28:28,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 05:28:28,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 05:28:28,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-13 05:28:28,690 INFO L87 Difference]: Start difference. First operand 43712 states and 140003 transitions. Second operand 5 states. [2019-01-13 05:28:28,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:28:28,825 INFO L93 Difference]: Finished difference Result 5456 states and 14431 transitions. [2019-01-13 05:28:28,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 05:28:28,826 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2019-01-13 05:28:28,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:28:28,835 INFO L225 Difference]: With dead ends: 5456 [2019-01-13 05:28:28,835 INFO L226 Difference]: Without dead ends: 4832 [2019-01-13 05:28:28,836 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-13 05:28:28,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4832 states. [2019-01-13 05:28:28,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4832 to 4684. [2019-01-13 05:28:28,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4684 states. [2019-01-13 05:28:28,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4684 states to 4684 states and 12409 transitions. [2019-01-13 05:28:28,912 INFO L78 Accepts]: Start accepts. Automaton has 4684 states and 12409 transitions. Word has length 76 [2019-01-13 05:28:28,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:28:28,913 INFO L480 AbstractCegarLoop]: Abstraction has 4684 states and 12409 transitions. [2019-01-13 05:28:28,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 05:28:28,913 INFO L276 IsEmpty]: Start isEmpty. Operand 4684 states and 12409 transitions. [2019-01-13 05:28:28,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-01-13 05:28:28,921 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:28:28,922 INFO L402 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] [2019-01-13 05:28:28,922 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:28:28,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:28:28,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1415378869, now seen corresponding path program 1 times [2019-01-13 05:28:28,922 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:28:28,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:28:28,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:28:28,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:28:28,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:28:28,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:28:29,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:28:29,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:28:29,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 05:28:29,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 05:28:29,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 05:28:29,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 05:28:29,051 INFO L87 Difference]: Start difference. First operand 4684 states and 12409 transitions. Second operand 5 states. [2019-01-13 05:28:29,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:28:29,306 INFO L93 Difference]: Finished difference Result 5468 states and 14247 transitions. [2019-01-13 05:28:29,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 05:28:29,306 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2019-01-13 05:28:29,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:28:29,314 INFO L225 Difference]: With dead ends: 5468 [2019-01-13 05:28:29,315 INFO L226 Difference]: Without dead ends: 5440 [2019-01-13 05:28:29,315 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-13 05:28:29,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5440 states. [2019-01-13 05:28:29,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5440 to 5316. [2019-01-13 05:28:29,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5316 states. [2019-01-13 05:28:29,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5316 states to 5316 states and 13901 transitions. [2019-01-13 05:28:29,373 INFO L78 Accepts]: Start accepts. Automaton has 5316 states and 13901 transitions. Word has length 89 [2019-01-13 05:28:29,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:28:29,373 INFO L480 AbstractCegarLoop]: Abstraction has 5316 states and 13901 transitions. [2019-01-13 05:28:29,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 05:28:29,374 INFO L276 IsEmpty]: Start isEmpty. Operand 5316 states and 13901 transitions. [2019-01-13 05:28:29,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-01-13 05:28:29,382 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:28:29,382 INFO L402 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] [2019-01-13 05:28:29,382 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:28:29,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:28:29,383 INFO L82 PathProgramCache]: Analyzing trace with hash -282188276, now seen corresponding path program 1 times [2019-01-13 05:28:29,383 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:28:29,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:28:29,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:28:29,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:28:29,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:28:29,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:28:29,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:28:29,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:28:29,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 05:28:29,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 05:28:29,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 05:28:29,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 05:28:29,514 INFO L87 Difference]: Start difference. First operand 5316 states and 13901 transitions. Second operand 3 states. [2019-01-13 05:28:29,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:28:29,734 INFO L93 Difference]: Finished difference Result 5440 states and 14174 transitions. [2019-01-13 05:28:29,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 05:28:29,736 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-01-13 05:28:29,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:28:29,745 INFO L225 Difference]: With dead ends: 5440 [2019-01-13 05:28:29,745 INFO L226 Difference]: Without dead ends: 5440 [2019-01-13 05:28:29,746 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-01-13 05:28:29,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5440 states. [2019-01-13 05:28:29,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5440 to 5384. [2019-01-13 05:28:29,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5384 states. [2019-01-13 05:28:29,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5384 states to 5384 states and 14051 transitions. [2019-01-13 05:28:29,803 INFO L78 Accepts]: Start accepts. Automaton has 5384 states and 14051 transitions. Word has length 89 [2019-01-13 05:28:29,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:28:29,803 INFO L480 AbstractCegarLoop]: Abstraction has 5384 states and 14051 transitions. [2019-01-13 05:28:29,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 05:28:29,804 INFO L276 IsEmpty]: Start isEmpty. Operand 5384 states and 14051 transitions. [2019-01-13 05:28:29,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-13 05:28:29,811 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:28:29,811 INFO L402 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] [2019-01-13 05:28:29,811 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:28:29,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:28:29,812 INFO L82 PathProgramCache]: Analyzing trace with hash -827167888, now seen corresponding path program 1 times [2019-01-13 05:28:29,812 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:28:29,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:28:29,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:28:29,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:28:29,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:28:29,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:28:29,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:28:29,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:28:29,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 05:28:29,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 05:28:30,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 05:28:30,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-13 05:28:30,000 INFO L87 Difference]: Start difference. First operand 5384 states and 14051 transitions. Second operand 4 states. [2019-01-13 05:28:30,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:28:30,589 INFO L93 Difference]: Finished difference Result 9734 states and 25760 transitions. [2019-01-13 05:28:30,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 05:28:30,590 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-01-13 05:28:30,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:28:30,603 INFO L225 Difference]: With dead ends: 9734 [2019-01-13 05:28:30,603 INFO L226 Difference]: Without dead ends: 9706 [2019-01-13 05:28:30,604 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-13 05:28:30,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9706 states. [2019-01-13 05:28:30,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9706 to 5140. [2019-01-13 05:28:30,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5140 states. [2019-01-13 05:28:30,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5140 states to 5140 states and 13376 transitions. [2019-01-13 05:28:30,681 INFO L78 Accepts]: Start accepts. Automaton has 5140 states and 13376 transitions. Word has length 91 [2019-01-13 05:28:30,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:28:30,681 INFO L480 AbstractCegarLoop]: Abstraction has 5140 states and 13376 transitions. [2019-01-13 05:28:30,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 05:28:30,681 INFO L276 IsEmpty]: Start isEmpty. Operand 5140 states and 13376 transitions. [2019-01-13 05:28:30,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-13 05:28:30,687 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:28:30,687 INFO L402 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] [2019-01-13 05:28:30,687 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:28:30,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:28:30,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1904621007, now seen corresponding path program 1 times [2019-01-13 05:28:30,688 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:28:30,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:28:30,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:28:30,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:28:30,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:28:30,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:28:30,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:28:30,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:28:30,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 05:28:30,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 05:28:30,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 05:28:30,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-13 05:28:30,896 INFO L87 Difference]: Start difference. First operand 5140 states and 13376 transitions. Second operand 6 states. [2019-01-13 05:28:31,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:28:31,273 INFO L93 Difference]: Finished difference Result 5643 states and 14543 transitions. [2019-01-13 05:28:31,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 05:28:31,274 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2019-01-13 05:28:31,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:28:31,282 INFO L225 Difference]: With dead ends: 5643 [2019-01-13 05:28:31,282 INFO L226 Difference]: Without dead ends: 5643 [2019-01-13 05:28:31,283 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-13 05:28:31,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5643 states. [2019-01-13 05:28:31,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5643 to 5222. [2019-01-13 05:28:31,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5222 states. [2019-01-13 05:28:31,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5222 states to 5222 states and 13576 transitions. [2019-01-13 05:28:31,340 INFO L78 Accepts]: Start accepts. Automaton has 5222 states and 13576 transitions. Word has length 91 [2019-01-13 05:28:31,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:28:31,341 INFO L480 AbstractCegarLoop]: Abstraction has 5222 states and 13576 transitions. [2019-01-13 05:28:31,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 05:28:31,341 INFO L276 IsEmpty]: Start isEmpty. Operand 5222 states and 13576 transitions. [2019-01-13 05:28:31,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-13 05:28:31,350 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:28:31,350 INFO L402 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] [2019-01-13 05:28:31,350 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:28:31,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:28:31,351 INFO L82 PathProgramCache]: Analyzing trace with hash -935039984, now seen corresponding path program 1 times [2019-01-13 05:28:31,351 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:28:31,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:28:31,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:28:31,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:28:31,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:28:31,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:28:31,787 WARN L181 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2019-01-13 05:28:31,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:28:31,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:28:31,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 05:28:31,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 05:28:31,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 05:28:31,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-13 05:28:31,957 INFO L87 Difference]: Start difference. First operand 5222 states and 13576 transitions. Second operand 7 states. [2019-01-13 05:28:32,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:28:32,351 INFO L93 Difference]: Finished difference Result 5203 states and 13406 transitions. [2019-01-13 05:28:32,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-13 05:28:32,352 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2019-01-13 05:28:32,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:28:32,360 INFO L225 Difference]: With dead ends: 5203 [2019-01-13 05:28:32,360 INFO L226 Difference]: Without dead ends: 5178 [2019-01-13 05:28:32,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2019-01-13 05:28:32,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5178 states. [2019-01-13 05:28:32,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5178 to 4801. [2019-01-13 05:28:32,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4801 states. [2019-01-13 05:28:32,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4801 states to 4801 states and 12542 transitions. [2019-01-13 05:28:32,414 INFO L78 Accepts]: Start accepts. Automaton has 4801 states and 12542 transitions. Word has length 91 [2019-01-13 05:28:32,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:28:32,414 INFO L480 AbstractCegarLoop]: Abstraction has 4801 states and 12542 transitions. [2019-01-13 05:28:32,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 05:28:32,414 INFO L276 IsEmpty]: Start isEmpty. Operand 4801 states and 12542 transitions. [2019-01-13 05:28:32,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-13 05:28:32,420 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:28:32,420 INFO L402 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] [2019-01-13 05:28:32,420 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:28:32,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:28:32,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1383736623, now seen corresponding path program 1 times [2019-01-13 05:28:32,421 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:28:32,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:28:32,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:28:32,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:28:32,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:28:32,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:28:32,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:28:32,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:28:32,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 05:28:32,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 05:28:32,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 05:28:32,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 05:28:32,581 INFO L87 Difference]: Start difference. First operand 4801 states and 12542 transitions. Second operand 6 states. [2019-01-13 05:28:32,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:28:32,840 INFO L93 Difference]: Finished difference Result 4393 states and 11483 transitions. [2019-01-13 05:28:32,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 05:28:32,841 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2019-01-13 05:28:32,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:28:32,848 INFO L225 Difference]: With dead ends: 4393 [2019-01-13 05:28:32,848 INFO L226 Difference]: Without dead ends: 4393 [2019-01-13 05:28:32,849 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-13 05:28:32,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4393 states. [2019-01-13 05:28:32,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4393 to 4259. [2019-01-13 05:28:32,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4259 states. [2019-01-13 05:28:32,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4259 states to 4259 states and 11187 transitions. [2019-01-13 05:28:32,894 INFO L78 Accepts]: Start accepts. Automaton has 4259 states and 11187 transitions. Word has length 91 [2019-01-13 05:28:32,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:28:32,894 INFO L480 AbstractCegarLoop]: Abstraction has 4259 states and 11187 transitions. [2019-01-13 05:28:32,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 05:28:32,894 INFO L276 IsEmpty]: Start isEmpty. Operand 4259 states and 11187 transitions. [2019-01-13 05:28:32,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-13 05:28:32,899 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:28:32,899 INFO L402 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] [2019-01-13 05:28:32,900 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:28:32,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:28:32,900 INFO L82 PathProgramCache]: Analyzing trace with hash -82841607, now seen corresponding path program 1 times [2019-01-13 05:28:32,900 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:28:32,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:28:32,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:28:32,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:28:32,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:28:32,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:28:33,412 WARN L181 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 10 [2019-01-13 05:28:33,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:28:33,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:28:33,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 05:28:33,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 05:28:33,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 05:28:33,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-13 05:28:33,429 INFO L87 Difference]: Start difference. First operand 4259 states and 11187 transitions. Second operand 6 states. [2019-01-13 05:28:33,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:28:33,796 INFO L93 Difference]: Finished difference Result 5737 states and 14773 transitions. [2019-01-13 05:28:33,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 05:28:33,797 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2019-01-13 05:28:33,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:28:33,805 INFO L225 Difference]: With dead ends: 5737 [2019-01-13 05:28:33,805 INFO L226 Difference]: Without dead ends: 5705 [2019-01-13 05:28:33,805 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-13 05:28:33,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5705 states. [2019-01-13 05:28:33,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5705 to 4600. [2019-01-13 05:28:33,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4600 states. [2019-01-13 05:28:33,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4600 states to 4600 states and 11989 transitions. [2019-01-13 05:28:33,866 INFO L78 Accepts]: Start accepts. Automaton has 4600 states and 11989 transitions. Word has length 91 [2019-01-13 05:28:33,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:28:33,866 INFO L480 AbstractCegarLoop]: Abstraction has 4600 states and 11989 transitions. [2019-01-13 05:28:33,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 05:28:33,867 INFO L276 IsEmpty]: Start isEmpty. Operand 4600 states and 11989 transitions. [2019-01-13 05:28:33,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-13 05:28:33,872 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:28:33,872 INFO L402 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] [2019-01-13 05:28:33,873 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:28:33,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:28:33,874 INFO L82 PathProgramCache]: Analyzing trace with hash -365992071, now seen corresponding path program 1 times [2019-01-13 05:28:33,874 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:28:33,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:28:33,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:28:33,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:28:33,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:28:33,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:28:34,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:28:34,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:28:34,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 05:28:34,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 05:28:34,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 05:28:34,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-13 05:28:34,480 INFO L87 Difference]: Start difference. First operand 4600 states and 11989 transitions. Second operand 7 states. [2019-01-13 05:28:34,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:28:34,977 INFO L93 Difference]: Finished difference Result 8360 states and 22331 transitions. [2019-01-13 05:28:34,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-13 05:28:34,978 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2019-01-13 05:28:34,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:28:34,989 INFO L225 Difference]: With dead ends: 8360 [2019-01-13 05:28:34,989 INFO L226 Difference]: Without dead ends: 8360 [2019-01-13 05:28:34,990 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-01-13 05:28:34,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8360 states. [2019-01-13 05:28:35,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8360 to 5036. [2019-01-13 05:28:35,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5036 states. [2019-01-13 05:28:35,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5036 states to 5036 states and 13135 transitions. [2019-01-13 05:28:35,075 INFO L78 Accepts]: Start accepts. Automaton has 5036 states and 13135 transitions. Word has length 91 [2019-01-13 05:28:35,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:28:35,075 INFO L480 AbstractCegarLoop]: Abstraction has 5036 states and 13135 transitions. [2019-01-13 05:28:35,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 05:28:35,075 INFO L276 IsEmpty]: Start isEmpty. Operand 5036 states and 13135 transitions. [2019-01-13 05:28:35,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-13 05:28:35,083 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:28:35,083 INFO L402 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] [2019-01-13 05:28:35,083 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:28:35,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:28:35,084 INFO L82 PathProgramCache]: Analyzing trace with hash 878772410, now seen corresponding path program 1 times [2019-01-13 05:28:35,084 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:28:35,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:28:35,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:28:35,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:28:35,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:28:35,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:28:35,582 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 6 [2019-01-13 05:28:35,844 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 6 [2019-01-13 05:28:35,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:28:35,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:28:35,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 05:28:35,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 05:28:35,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 05:28:35,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-13 05:28:35,861 INFO L87 Difference]: Start difference. First operand 5036 states and 13135 transitions. Second operand 6 states. [2019-01-13 05:28:36,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:28:36,348 INFO L93 Difference]: Finished difference Result 7806 states and 20863 transitions. [2019-01-13 05:28:36,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 05:28:36,349 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2019-01-13 05:28:36,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:28:36,359 INFO L225 Difference]: With dead ends: 7806 [2019-01-13 05:28:36,359 INFO L226 Difference]: Without dead ends: 7806 [2019-01-13 05:28:36,359 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-13 05:28:36,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7806 states. [2019-01-13 05:28:36,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7806 to 4716. [2019-01-13 05:28:36,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4716 states. [2019-01-13 05:28:36,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4716 states to 4716 states and 12277 transitions. [2019-01-13 05:28:36,424 INFO L78 Accepts]: Start accepts. Automaton has 4716 states and 12277 transitions. Word has length 91 [2019-01-13 05:28:36,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:28:36,425 INFO L480 AbstractCegarLoop]: Abstraction has 4716 states and 12277 transitions. [2019-01-13 05:28:36,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 05:28:36,425 INFO L276 IsEmpty]: Start isEmpty. Operand 4716 states and 12277 transitions. [2019-01-13 05:28:36,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-13 05:28:36,430 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:28:36,430 INFO L402 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] [2019-01-13 05:28:36,431 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:28:36,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:28:36,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1359488826, now seen corresponding path program 1 times [2019-01-13 05:28:36,431 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:28:36,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:28:36,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:28:36,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:28:36,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:28:36,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:28:36,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:28:36,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:28:36,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 05:28:36,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 05:28:36,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 05:28:36,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 05:28:36,642 INFO L87 Difference]: Start difference. First operand 4716 states and 12277 transitions. Second operand 6 states. [2019-01-13 05:28:36,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:28:36,890 INFO L93 Difference]: Finished difference Result 4076 states and 10405 transitions. [2019-01-13 05:28:36,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 05:28:36,892 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2019-01-13 05:28:36,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:28:36,898 INFO L225 Difference]: With dead ends: 4076 [2019-01-13 05:28:36,898 INFO L226 Difference]: Without dead ends: 4076 [2019-01-13 05:28:36,899 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-01-13 05:28:36,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4076 states. [2019-01-13 05:28:36,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4076 to 3489. [2019-01-13 05:28:36,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3489 states. [2019-01-13 05:28:36,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3489 states to 3489 states and 9041 transitions. [2019-01-13 05:28:36,939 INFO L78 Accepts]: Start accepts. Automaton has 3489 states and 9041 transitions. Word has length 91 [2019-01-13 05:28:36,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:28:36,940 INFO L480 AbstractCegarLoop]: Abstraction has 3489 states and 9041 transitions. [2019-01-13 05:28:36,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 05:28:36,940 INFO L276 IsEmpty]: Start isEmpty. Operand 3489 states and 9041 transitions. [2019-01-13 05:28:36,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-13 05:28:36,944 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:28:36,944 INFO L402 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-01-13 05:28:36,944 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:28:36,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:28:36,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1413527866, now seen corresponding path program 1 times [2019-01-13 05:28:36,945 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:28:36,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:28:36,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:28:36,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:28:36,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:28:36,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:28:37,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:28:37,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:28:37,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 05:28:37,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 05:28:37,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 05:28:37,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-13 05:28:37,122 INFO L87 Difference]: Start difference. First operand 3489 states and 9041 transitions. Second operand 6 states. [2019-01-13 05:28:37,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:28:37,552 INFO L93 Difference]: Finished difference Result 3702 states and 9446 transitions. [2019-01-13 05:28:37,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 05:28:37,553 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-01-13 05:28:37,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:28:37,559 INFO L225 Difference]: With dead ends: 3702 [2019-01-13 05:28:37,559 INFO L226 Difference]: Without dead ends: 3657 [2019-01-13 05:28:37,560 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-13 05:28:37,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3657 states. [2019-01-13 05:28:37,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3657 to 3597. [2019-01-13 05:28:37,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3597 states. [2019-01-13 05:28:37,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3597 states to 3597 states and 9246 transitions. [2019-01-13 05:28:37,597 INFO L78 Accepts]: Start accepts. Automaton has 3597 states and 9246 transitions. Word has length 93 [2019-01-13 05:28:37,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:28:37,597 INFO L480 AbstractCegarLoop]: Abstraction has 3597 states and 9246 transitions. [2019-01-13 05:28:37,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 05:28:37,597 INFO L276 IsEmpty]: Start isEmpty. Operand 3597 states and 9246 transitions. [2019-01-13 05:28:37,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-13 05:28:37,601 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:28:37,601 INFO L402 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-01-13 05:28:37,601 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:28:37,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:28:37,602 INFO L82 PathProgramCache]: Analyzing trace with hash -522132421, now seen corresponding path program 1 times [2019-01-13 05:28:37,602 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:28:37,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:28:37,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:28:37,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:28:37,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:28:37,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:28:37,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:28:37,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:28:37,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 05:28:37,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 05:28:37,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 05:28:37,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-13 05:28:37,899 INFO L87 Difference]: Start difference. First operand 3597 states and 9246 transitions. Second operand 7 states. [2019-01-13 05:28:39,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:28:39,835 INFO L93 Difference]: Finished difference Result 5508 states and 13847 transitions. [2019-01-13 05:28:39,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-13 05:28:39,836 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2019-01-13 05:28:39,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:28:39,844 INFO L225 Difference]: With dead ends: 5508 [2019-01-13 05:28:39,844 INFO L226 Difference]: Without dead ends: 5476 [2019-01-13 05:28:39,844 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-01-13 05:28:39,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5476 states. [2019-01-13 05:28:39,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5476 to 4226. [2019-01-13 05:28:39,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4226 states. [2019-01-13 05:28:39,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4226 states to 4226 states and 10779 transitions. [2019-01-13 05:28:39,895 INFO L78 Accepts]: Start accepts. Automaton has 4226 states and 10779 transitions. Word has length 93 [2019-01-13 05:28:39,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:28:39,895 INFO L480 AbstractCegarLoop]: Abstraction has 4226 states and 10779 transitions. [2019-01-13 05:28:39,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 05:28:39,895 INFO L276 IsEmpty]: Start isEmpty. Operand 4226 states and 10779 transitions. [2019-01-13 05:28:39,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-13 05:28:39,900 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:28:39,900 INFO L402 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-01-13 05:28:39,900 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:28:39,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:28:39,901 INFO L82 PathProgramCache]: Analyzing trace with hash 722632060, now seen corresponding path program 1 times [2019-01-13 05:28:39,901 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:28:39,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:28:39,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:28:39,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:28:39,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:28:39,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:28:40,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:28:40,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:28:40,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 05:28:40,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 05:28:40,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 05:28:40,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 05:28:40,036 INFO L87 Difference]: Start difference. First operand 4226 states and 10779 transitions. Second operand 6 states. [2019-01-13 05:28:40,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:28:40,184 INFO L93 Difference]: Finished difference Result 4301 states and 10863 transitions. [2019-01-13 05:28:40,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 05:28:40,185 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-01-13 05:28:40,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:28:40,190 INFO L225 Difference]: With dead ends: 4301 [2019-01-13 05:28:40,190 INFO L226 Difference]: Without dead ends: 4301 [2019-01-13 05:28:40,191 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-01-13 05:28:40,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4301 states. [2019-01-13 05:28:40,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4301 to 4171. [2019-01-13 05:28:40,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4171 states. [2019-01-13 05:28:40,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4171 states to 4171 states and 10618 transitions. [2019-01-13 05:28:40,235 INFO L78 Accepts]: Start accepts. Automaton has 4171 states and 10618 transitions. Word has length 93 [2019-01-13 05:28:40,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:28:40,235 INFO L480 AbstractCegarLoop]: Abstraction has 4171 states and 10618 transitions. [2019-01-13 05:28:40,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 05:28:40,235 INFO L276 IsEmpty]: Start isEmpty. Operand 4171 states and 10618 transitions. [2019-01-13 05:28:40,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-13 05:28:40,240 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:28:40,240 INFO L402 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-01-13 05:28:40,240 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:28:40,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:28:40,241 INFO L82 PathProgramCache]: Analyzing trace with hash -192366660, now seen corresponding path program 1 times [2019-01-13 05:28:40,241 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:28:40,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:28:40,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:28:40,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:28:40,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:28:40,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:28:40,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:28:40,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:28:40,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 05:28:40,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 05:28:40,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 05:28:40,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 05:28:40,470 INFO L87 Difference]: Start difference. First operand 4171 states and 10618 transitions. Second operand 5 states. [2019-01-13 05:28:40,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:28:40,705 INFO L93 Difference]: Finished difference Result 4715 states and 11962 transitions. [2019-01-13 05:28:40,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 05:28:40,706 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-01-13 05:28:40,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:28:40,714 INFO L225 Difference]: With dead ends: 4715 [2019-01-13 05:28:40,714 INFO L226 Difference]: Without dead ends: 4683 [2019-01-13 05:28:40,714 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-13 05:28:40,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4683 states. [2019-01-13 05:28:40,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4683 to 3650. [2019-01-13 05:28:40,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3650 states. [2019-01-13 05:28:40,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3650 states to 3650 states and 9341 transitions. [2019-01-13 05:28:40,760 INFO L78 Accepts]: Start accepts. Automaton has 3650 states and 9341 transitions. Word has length 93 [2019-01-13 05:28:40,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:28:40,760 INFO L480 AbstractCegarLoop]: Abstraction has 3650 states and 9341 transitions. [2019-01-13 05:28:40,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 05:28:40,761 INFO L276 IsEmpty]: Start isEmpty. Operand 3650 states and 9341 transitions. [2019-01-13 05:28:40,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-13 05:28:40,765 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:28:40,765 INFO L402 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-01-13 05:28:40,765 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:28:40,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:28:40,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1052397821, now seen corresponding path program 1 times [2019-01-13 05:28:40,766 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:28:40,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:28:40,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:28:40,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:28:40,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:28:40,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:28:40,986 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-13 05:28:41,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:28:41,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:28:41,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 05:28:41,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 05:28:41,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 05:28:41,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-13 05:28:41,524 INFO L87 Difference]: Start difference. First operand 3650 states and 9341 transitions. Second operand 7 states. [2019-01-13 05:28:42,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:28:42,075 INFO L93 Difference]: Finished difference Result 5475 states and 14168 transitions. [2019-01-13 05:28:42,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 05:28:42,076 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2019-01-13 05:28:42,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:28:42,080 INFO L225 Difference]: With dead ends: 5475 [2019-01-13 05:28:42,080 INFO L226 Difference]: Without dead ends: 1974 [2019-01-13 05:28:42,081 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-01-13 05:28:42,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1974 states. [2019-01-13 05:28:42,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1974 to 1974. [2019-01-13 05:28:42,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1974 states. [2019-01-13 05:28:42,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1974 states to 1974 states and 5105 transitions. [2019-01-13 05:28:42,104 INFO L78 Accepts]: Start accepts. Automaton has 1974 states and 5105 transitions. Word has length 93 [2019-01-13 05:28:42,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:28:42,104 INFO L480 AbstractCegarLoop]: Abstraction has 1974 states and 5105 transitions. [2019-01-13 05:28:42,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 05:28:42,104 INFO L276 IsEmpty]: Start isEmpty. Operand 1974 states and 5105 transitions. [2019-01-13 05:28:42,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-13 05:28:42,107 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:28:42,107 INFO L402 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-01-13 05:28:42,107 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:28:42,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:28:42,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1042938802, now seen corresponding path program 1 times [2019-01-13 05:28:42,108 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:28:42,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:28:42,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:28:42,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:28:42,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:28:42,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:28:42,960 WARN L181 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 9 [2019-01-13 05:28:42,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:28:42,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:28:42,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 05:28:42,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 05:28:42,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 05:28:42,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-13 05:28:42,990 INFO L87 Difference]: Start difference. First operand 1974 states and 5105 transitions. Second operand 7 states. [2019-01-13 05:28:44,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:28:44,117 INFO L93 Difference]: Finished difference Result 1988 states and 5137 transitions. [2019-01-13 05:28:44,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 05:28:44,119 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2019-01-13 05:28:44,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:28:44,122 INFO L225 Difference]: With dead ends: 1988 [2019-01-13 05:28:44,122 INFO L226 Difference]: Without dead ends: 1988 [2019-01-13 05:28:44,123 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-13 05:28:44,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1988 states. [2019-01-13 05:28:44,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1988 to 1950. [2019-01-13 05:28:44,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1950 states. [2019-01-13 05:28:44,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1950 states to 1950 states and 5057 transitions. [2019-01-13 05:28:44,144 INFO L78 Accepts]: Start accepts. Automaton has 1950 states and 5057 transitions. Word has length 93 [2019-01-13 05:28:44,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:28:44,144 INFO L480 AbstractCegarLoop]: Abstraction has 1950 states and 5057 transitions. [2019-01-13 05:28:44,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 05:28:44,145 INFO L276 IsEmpty]: Start isEmpty. Operand 1950 states and 5057 transitions. [2019-01-13 05:28:44,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-13 05:28:44,147 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:28:44,147 INFO L402 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-01-13 05:28:44,147 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:28:44,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:28:44,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1157749772, now seen corresponding path program 2 times [2019-01-13 05:28:44,148 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:28:44,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:28:44,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:28:44,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:28:44,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:28:44,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:28:44,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:28:44,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:28:44,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-13 05:28:44,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 05:28:44,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 05:28:44,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-01-13 05:28:44,395 INFO L87 Difference]: Start difference. First operand 1950 states and 5057 transitions. Second operand 8 states. [2019-01-13 05:28:44,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:28:44,933 INFO L93 Difference]: Finished difference Result 2282 states and 5776 transitions. [2019-01-13 05:28:44,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-13 05:28:44,934 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 93 [2019-01-13 05:28:44,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:28:44,938 INFO L225 Difference]: With dead ends: 2282 [2019-01-13 05:28:44,938 INFO L226 Difference]: Without dead ends: 2253 [2019-01-13 05:28:44,939 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2019-01-13 05:28:44,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2253 states. [2019-01-13 05:28:44,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2253 to 1942. [2019-01-13 05:28:44,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1942 states. [2019-01-13 05:28:44,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1942 states to 1942 states and 5031 transitions. [2019-01-13 05:28:44,963 INFO L78 Accepts]: Start accepts. Automaton has 1942 states and 5031 transitions. Word has length 93 [2019-01-13 05:28:44,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:28:44,964 INFO L480 AbstractCegarLoop]: Abstraction has 1942 states and 5031 transitions. [2019-01-13 05:28:44,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 05:28:44,964 INFO L276 IsEmpty]: Start isEmpty. Operand 1942 states and 5031 transitions. [2019-01-13 05:28:44,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-13 05:28:44,966 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:28:44,966 INFO L402 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-01-13 05:28:44,967 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:28:44,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:28:44,967 INFO L82 PathProgramCache]: Analyzing trace with hash -777910515, now seen corresponding path program 2 times [2019-01-13 05:28:44,967 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:28:44,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:28:44,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:28:44,969 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 05:28:44,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:28:44,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:28:45,196 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-13 05:28:45,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:28:45,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:28:45,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-01-13 05:28:45,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-13 05:28:45,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-13 05:28:45,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-01-13 05:28:45,331 INFO L87 Difference]: Start difference. First operand 1942 states and 5031 transitions. Second operand 12 states. [2019-01-13 05:28:46,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:28:46,112 INFO L93 Difference]: Finished difference Result 3699 states and 9678 transitions. [2019-01-13 05:28:46,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-13 05:28:46,114 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 93 [2019-01-13 05:28:46,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:28:46,118 INFO L225 Difference]: With dead ends: 3699 [2019-01-13 05:28:46,119 INFO L226 Difference]: Without dead ends: 2563 [2019-01-13 05:28:46,119 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2019-01-13 05:28:46,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2563 states. [2019-01-13 05:28:46,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2563 to 2411. [2019-01-13 05:28:46,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2411 states. [2019-01-13 05:28:46,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2411 states to 2411 states and 6104 transitions. [2019-01-13 05:28:46,146 INFO L78 Accepts]: Start accepts. Automaton has 2411 states and 6104 transitions. Word has length 93 [2019-01-13 05:28:46,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:28:46,147 INFO L480 AbstractCegarLoop]: Abstraction has 2411 states and 6104 transitions. [2019-01-13 05:28:46,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-13 05:28:46,147 INFO L276 IsEmpty]: Start isEmpty. Operand 2411 states and 6104 transitions. [2019-01-13 05:28:46,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-13 05:28:46,150 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:28:46,150 INFO L402 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-01-13 05:28:46,150 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:28:46,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:28:46,151 INFO L82 PathProgramCache]: Analyzing trace with hash 45507955, now seen corresponding path program 3 times [2019-01-13 05:28:46,151 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:28:46,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:28:46,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:28:46,152 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 05:28:46,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:28:46,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 05:28:46,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 05:28:46,232 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-13 05:28:46,400 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-01-13 05:28:46,404 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.01 05:28:46 BasicIcfg [2019-01-13 05:28:46,406 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-13 05:28:46,406 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-13 05:28:46,406 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-13 05:28:46,406 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-13 05:28:46,407 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 05:28:03" (3/4) ... [2019-01-13 05:28:46,412 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-13 05:28:46,568 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-13 05:28:46,568 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-13 05:28:46,569 INFO L168 Benchmark]: Toolchain (without parser) took 45457.22 ms. Allocated memory was 1.0 GB in the beginning and 3.1 GB in the end (delta: 2.1 GB). Free memory was 946.0 MB in the beginning and 1.3 GB in the end (delta: -377.7 MB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. [2019-01-13 05:28:46,571 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 05:28:46,572 INFO L168 Benchmark]: CACSL2BoogieTranslator took 783.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -164.2 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. [2019-01-13 05:28:46,572 INFO L168 Benchmark]: Boogie Procedure Inliner took 122.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-13 05:28:46,573 INFO L168 Benchmark]: Boogie Preprocessor took 75.97 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 05:28:46,575 INFO L168 Benchmark]: RCFGBuilder took 1421.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.4 MB). Peak memory consumption was 45.4 MB. Max. memory is 11.5 GB. [2019-01-13 05:28:46,576 INFO L168 Benchmark]: TraceAbstraction took 42886.21 ms. Allocated memory was 1.2 GB in the beginning and 3.1 GB in the end (delta: 1.9 GB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -265.7 MB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. [2019-01-13 05:28:46,576 INFO L168 Benchmark]: Witness Printer took 162.44 ms. Allocated memory is still 3.1 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 05:28:46,581 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 783.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -164.2 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 122.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 75.97 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1421.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.4 MB). Peak memory consumption was 45.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 42886.21 ms. Allocated memory was 1.2 GB in the beginning and 3.1 GB in the end (delta: 1.9 GB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -265.7 MB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. * Witness Printer took 162.44 ms. Allocated memory is still 3.1 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 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: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L672] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0] [L673] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0] [L675] -1 int x = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L677] -1 int y = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L678] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L679] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L680] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=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] [L681] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=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] [L682] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=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] [L683] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=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] [L684] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=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] [L685] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=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] [L686] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=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] [L687] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=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}] [L688] -1 int y$w_buff0; VAL [__unbuffered_cnt=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] [L689] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=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] [L690] -1 int y$w_buff1; VAL [__unbuffered_cnt=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] [L691] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=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] [L692] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=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] [L693] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=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] [L753] -1 pthread_t t2483; VAL [__unbuffered_cnt=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] [L754] FCALL, FORK -1 pthread_create(&t2483, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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] [L755] -1 pthread_t t2484; VAL [__unbuffered_cnt=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] [L756] FCALL, FORK -1 pthread_create(&t2484, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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] [L697] 0 y$w_buff1 = y$w_buff0 [L698] 0 y$w_buff0 = 2 [L699] 0 y$w_buff1_used = y$w_buff0_used [L700] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=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] [L702] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L703] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L704] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L705] 0 y$r_buff0_thd1 = (_Bool)1 [L708] 0 x = 1 VAL [__unbuffered_cnt=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] [L711] EXPR 0 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, 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] [L725] 1 x = 2 [L728] 1 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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] [L711] 0 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L712] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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] [L731] EXPR 1 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, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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] [L712] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L731] EXPR 1 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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] [L731] EXPR 1 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, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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] [L731] 1 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L732] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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] [L732] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L733] EXPR 1 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=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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] [L733] 1 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 [L734] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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] [L734] 1 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L735] EXPR 1 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=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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] [L735] 1 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 [L738] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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] [L713] EXPR 0 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=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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] [L713] 0 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 [L714] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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] [L714] 0 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L715] EXPR 0 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=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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] [L715] 0 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 [L718] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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] [L758] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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] [L762] EXPR -1 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, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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] [L762] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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] [L762] EXPR -1 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, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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] [L762] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L763] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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] [L763] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L764] EXPR -1 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, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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] [L764] -1 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 [L765] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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] [L765] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L766] EXPR -1 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, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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] [L766] -1 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 [L769] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L770] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L771] -1 y$flush_delayed = weak$$choice2 [L772] -1 y$mem_tmp = y VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, 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] [L773] EXPR -1 !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, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, 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] [L773] -1 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) [L774] EXPR -1 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, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, 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] [L774] -1 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)) [L775] EXPR -1 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, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, 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] [L775] -1 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)) [L776] EXPR -1 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, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, 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] [L776] -1 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)) [L777] EXPR -1 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, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, 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] [L777] -1 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)) [L778] EXPR -1 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, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, 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] [L778] -1 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)) [L779] EXPR -1 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, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, 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] [L779] -1 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)) [L780] -1 main$tmp_guard1 = !(x == 2 && y == 2) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, 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] [L781] EXPR -1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, 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] [L781] -1 y = y$flush_delayed ? y$mem_tmp : y [L782] -1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, 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 -1 !expression VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, 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] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, 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 5 procedures, 178 locations, 3 error locations. UNSAFE Result, 42.7s OverallTime, 31 OverallIterations, 1 TraceHistogramMax, 21.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7075 SDtfs, 6296 SDslu, 16016 SDs, 0 SdLazy, 6614 SolverSat, 377 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 303 GetRequests, 85 SyntacticMatches, 16 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 9.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43712occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 9.1s AutomataMinimizationTime, 30 MinimizatonAttempts, 92793 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 8.6s InterpolantComputationTime, 2453 NumberOfCodeBlocks, 2453 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 2330 ConstructedInterpolants, 0 QuantifiedInterpolants, 459738 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...