./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread/singleton_with-uninit-problems_true-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_df24c9c1-07fe-4a40-abf0-d245cdaa9a65/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_df24c9c1-07fe-4a40-abf0-d245cdaa9a65/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_df24c9c1-07fe-4a40-abf0-d245cdaa9a65/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_df24c9c1-07fe-4a40-abf0-d245cdaa9a65/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread/singleton_with-uninit-problems_true-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_df24c9c1-07fe-4a40-abf0-d245cdaa9a65/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_df24c9c1-07fe-4a40-abf0-d245cdaa9a65/bin-2019/uautomizer --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 17cb67016a37b4d6ca4d07f4518c2ed6beef643f .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-0cd3be1 [2018-11-28 13:10:12,889 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 13:10:12,890 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 13:10:12,896 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 13:10:12,897 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 13:10:12,897 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 13:10:12,898 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 13:10:12,899 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 13:10:12,900 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 13:10:12,900 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 13:10:12,901 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 13:10:12,901 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 13:10:12,902 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 13:10:12,903 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 13:10:12,903 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 13:10:12,904 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 13:10:12,904 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 13:10:12,905 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 13:10:12,907 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 13:10:12,908 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 13:10:12,908 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 13:10:12,909 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 13:10:12,910 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 13:10:12,911 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 13:10:12,911 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 13:10:12,911 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 13:10:12,912 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 13:10:12,912 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 13:10:12,913 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 13:10:12,914 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 13:10:12,914 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 13:10:12,914 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 13:10:12,914 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 13:10:12,915 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 13:10:12,915 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 13:10:12,916 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 13:10:12,916 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_df24c9c1-07fe-4a40-abf0-d245cdaa9a65/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 13:10:12,924 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 13:10:12,924 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 13:10:12,925 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 13:10:12,925 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 13:10:12,925 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 13:10:12,925 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 13:10:12,926 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 13:10:12,926 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 13:10:12,926 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 13:10:12,926 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 13:10:12,926 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 13:10:12,926 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 13:10:12,926 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 13:10:12,926 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 13:10:12,927 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 13:10:12,927 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 13:10:12,927 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 13:10:12,927 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 13:10:12,927 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 13:10:12,927 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 13:10:12,927 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 13:10:12,928 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 13:10:12,928 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 13:10:12,928 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 13:10:12,928 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 13:10:12,928 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 13:10:12,928 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 13:10:12,928 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 13:10:12,928 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 13:10:12,928 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 13:10:12,929 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_df24c9c1-07fe-4a40-abf0-d245cdaa9a65/bin-2019/uautomizer 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 -> 17cb67016a37b4d6ca4d07f4518c2ed6beef643f [2018-11-28 13:10:12,950 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 13:10:12,958 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 13:10:12,960 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 13:10:12,961 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 13:10:12,961 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 13:10:12,962 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_df24c9c1-07fe-4a40-abf0-d245cdaa9a65/bin-2019/uautomizer/../../sv-benchmarks/c/pthread/singleton_with-uninit-problems_true-unreach-call.i [2018-11-28 13:10:12,997 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_df24c9c1-07fe-4a40-abf0-d245cdaa9a65/bin-2019/uautomizer/data/4bebd72d2/d76801ac2123422ba82b56720357f98f/FLAG74d214549 [2018-11-28 13:10:13,441 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 13:10:13,442 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_df24c9c1-07fe-4a40-abf0-d245cdaa9a65/sv-benchmarks/c/pthread/singleton_with-uninit-problems_true-unreach-call.i [2018-11-28 13:10:13,453 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_df24c9c1-07fe-4a40-abf0-d245cdaa9a65/bin-2019/uautomizer/data/4bebd72d2/d76801ac2123422ba82b56720357f98f/FLAG74d214549 [2018-11-28 13:10:13,464 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_df24c9c1-07fe-4a40-abf0-d245cdaa9a65/bin-2019/uautomizer/data/4bebd72d2/d76801ac2123422ba82b56720357f98f [2018-11-28 13:10:13,465 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 13:10:13,466 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 13:10:13,467 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 13:10:13,467 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 13:10:13,469 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 13:10:13,469 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:10:13" (1/1) ... [2018-11-28 13:10:13,471 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@86ed628 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:10:13, skipping insertion in model container [2018-11-28 13:10:13,471 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:10:13" (1/1) ... [2018-11-28 13:10:13,475 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 13:10:13,505 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 13:10:13,797 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:10:13,806 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 13:10:13,884 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:10:13,970 INFO L195 MainTranslator]: Completed translation [2018-11-28 13:10:13,970 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:10:13 WrapperNode [2018-11-28 13:10:13,971 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 13:10:13,971 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 13:10:13,971 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 13:10:13,971 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 13:10:13,976 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:10:13" (1/1) ... [2018-11-28 13:10:13,990 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:10:13" (1/1) ... [2018-11-28 13:10:14,006 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 13:10:14,006 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 13:10:14,006 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 13:10:14,006 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 13:10:14,012 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:10:13" (1/1) ... [2018-11-28 13:10:14,012 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:10:13" (1/1) ... [2018-11-28 13:10:14,014 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:10:13" (1/1) ... [2018-11-28 13:10:14,014 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:10:13" (1/1) ... [2018-11-28 13:10:14,020 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:10:13" (1/1) ... [2018-11-28 13:10:14,022 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:10:13" (1/1) ... [2018-11-28 13:10:14,023 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:10:13" (1/1) ... [2018-11-28 13:10:14,026 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 13:10:14,026 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 13:10:14,026 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 13:10:14,026 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 13:10:14,027 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:10:13" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_df24c9c1-07fe-4a40-abf0-d245cdaa9a65/bin-2019/uautomizer/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 [2018-11-28 13:10:14,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 13:10:14,061 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 13:10:14,062 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 13:10:14,062 INFO L130 BoogieDeclarations]: Found specification of procedure thread0 [2018-11-28 13:10:14,062 INFO L138 BoogieDeclarations]: Found implementation of procedure thread0 [2018-11-28 13:10:14,062 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2018-11-28 13:10:14,062 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2018-11-28 13:10:14,062 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2018-11-28 13:10:14,062 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2018-11-28 13:10:14,062 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2018-11-28 13:10:14,062 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2018-11-28 13:10:14,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 13:10:14,063 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 13:10:14,063 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 13:10:14,064 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-11-28 13:10:14,342 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 13:10:14,343 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-28 13:10:14,343 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:10:14 BoogieIcfgContainer [2018-11-28 13:10:14,343 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 13:10:14,344 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 13:10:14,344 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 13:10:14,346 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 13:10:14,346 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 01:10:13" (1/3) ... [2018-11-28 13:10:14,346 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a4043fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 01:10:14, skipping insertion in model container [2018-11-28 13:10:14,346 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:10:13" (2/3) ... [2018-11-28 13:10:14,347 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a4043fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 01:10:14, skipping insertion in model container [2018-11-28 13:10:14,347 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:10:14" (3/3) ... [2018-11-28 13:10:14,348 INFO L112 eAbstractionObserver]: Analyzing ICFG singleton_with-uninit-problems_true-unreach-call.i [2018-11-28 13:10:14,377 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:10:14,378 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:10:14,378 WARN L317 ript$VariableManager]: TermVariabe Thread2_thread0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:10:14,378 WARN L317 ript$VariableManager]: TermVariabe Thread2_thread0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:10:14,378 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:10:14,378 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:10:14,378 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:10:14,378 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:10:14,379 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:10:14,379 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:10:14,379 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:10:14,379 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:10:14,379 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:10:14,379 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:10:14,380 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:10:14,380 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:10:14,380 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~nondet1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:10:14,380 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:10:14,380 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:10:14,381 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:10:14,381 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:10:14,383 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:10:14,383 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:10:14,384 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:10:14,384 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:10:14,384 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:10:14,384 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:10:14,384 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:10:14,384 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:10:14,384 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:10:14,385 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:10:14,385 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:10:14,385 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:10:14,385 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:10:14,385 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:10:14,385 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:10:14,386 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:10:14,386 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:10:14,386 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:10:14,386 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:10:14,386 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:10:14,386 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:10:14,386 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:10:14,387 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:10:14,387 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:10:14,387 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:10:14,387 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:10:14,387 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:10:14,387 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:10:14,388 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:10:14,388 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:10:14,388 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:10:14,388 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:10:14,388 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:10:14,388 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:10:14,388 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:10:14,389 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:10:14,389 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:10:14,389 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:10:14,389 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:10:14,389 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:10:14,389 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:10:14,390 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:10:14,390 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:10:14,390 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:10:14,390 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:10:14,390 WARN L317 ript$VariableManager]: TermVariabe |Thread4_thread1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:10:14,390 WARN L317 ript$VariableManager]: TermVariabe |Thread4_thread1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:10:14,391 WARN L317 ript$VariableManager]: TermVariabe Thread4_thread1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:10:14,391 WARN L317 ript$VariableManager]: TermVariabe Thread4_thread1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:10:14,391 WARN L317 ript$VariableManager]: TermVariabe |Thread4_thread1_#t~malloc0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:10:14,391 WARN L317 ript$VariableManager]: TermVariabe |Thread4_thread1_#t~malloc0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:10:14,391 WARN L317 ript$VariableManager]: TermVariabe |Thread4_thread1_#t~malloc0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:10:14,391 WARN L317 ript$VariableManager]: TermVariabe |Thread4_thread1_#t~malloc0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:10:14,392 WARN L317 ript$VariableManager]: TermVariabe |Thread4_thread1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:10:14,392 WARN L317 ript$VariableManager]: TermVariabe |Thread4_thread1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:10:14,392 WARN L317 ript$VariableManager]: TermVariabe |Thread3_thread2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:10:14,392 WARN L317 ript$VariableManager]: TermVariabe |Thread3_thread2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:10:14,392 WARN L317 ript$VariableManager]: TermVariabe Thread3_thread2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:10:14,392 WARN L317 ript$VariableManager]: TermVariabe Thread3_thread2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:10:14,393 WARN L317 ript$VariableManager]: TermVariabe |Thread3_thread2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:10:14,393 WARN L317 ript$VariableManager]: TermVariabe |Thread3_thread2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:10:14,393 WARN L317 ript$VariableManager]: TermVariabe |Thread1_thread2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:10:14,393 WARN L317 ript$VariableManager]: TermVariabe |Thread1_thread2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:10:14,393 WARN L317 ript$VariableManager]: TermVariabe Thread1_thread2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:10:14,393 WARN L317 ript$VariableManager]: TermVariabe Thread1_thread2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:10:14,393 WARN L317 ript$VariableManager]: TermVariabe |Thread1_thread2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:10:14,394 WARN L317 ript$VariableManager]: TermVariabe |Thread1_thread2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:10:14,394 WARN L317 ript$VariableManager]: TermVariabe |Thread5_thread2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:10:14,394 WARN L317 ript$VariableManager]: TermVariabe |Thread5_thread2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:10:14,394 WARN L317 ript$VariableManager]: TermVariabe Thread5_thread2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:10:14,394 WARN L317 ript$VariableManager]: TermVariabe Thread5_thread2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:10:14,394 WARN L317 ript$VariableManager]: TermVariabe |Thread5_thread2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:10:14,395 WARN L317 ript$VariableManager]: TermVariabe |Thread5_thread2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:10:14,395 WARN L317 ript$VariableManager]: TermVariabe |Thread0_thread3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:10:14,395 WARN L317 ript$VariableManager]: TermVariabe |Thread0_thread3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:10:14,395 WARN L317 ript$VariableManager]: TermVariabe Thread0_thread3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:10:14,395 WARN L317 ript$VariableManager]: TermVariabe Thread0_thread3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:10:14,395 WARN L317 ript$VariableManager]: TermVariabe |Thread0_thread3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:10:14,396 WARN L317 ript$VariableManager]: TermVariabe |Thread0_thread3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:10:14,532 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-11-28 13:10:14,532 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 13:10:14,538 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-28 13:10:14,547 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-28 13:10:14,563 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 13:10:14,564 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 13:10:14,564 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 13:10:14,564 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 13:10:14,564 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 13:10:14,564 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 13:10:14,564 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 13:10:14,564 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 13:10:14,564 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 13:10:14,573 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 145places, 239 transitions [2018-11-28 13:10:17,793 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 60962 states. [2018-11-28 13:10:17,794 INFO L276 IsEmpty]: Start isEmpty. Operand 60962 states. [2018-11-28 13:10:17,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-28 13:10:17,802 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:10:17,803 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] [2018-11-28 13:10:17,804 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:10:17,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:10:17,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1451762756, now seen corresponding path program 1 times [2018-11-28 13:10:17,809 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:10:17,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:10:17,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:17,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:10:17,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:17,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:10:17,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:10:17,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:10:17,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:10:17,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:10:17,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:10:17,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:10:17,987 INFO L87 Difference]: Start difference. First operand 60962 states. Second operand 5 states. [2018-11-28 13:10:18,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:10:18,834 INFO L93 Difference]: Finished difference Result 90537 states and 379072 transitions. [2018-11-28 13:10:18,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 13:10:18,836 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-11-28 13:10:18,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:10:19,032 INFO L225 Difference]: With dead ends: 90537 [2018-11-28 13:10:19,032 INFO L226 Difference]: Without dead ends: 40487 [2018-11-28 13:10:19,033 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-28 13:10:19,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40487 states. [2018-11-28 13:10:19,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40487 to 40487. [2018-11-28 13:10:19,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40487 states. [2018-11-28 13:10:20,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40487 states to 40487 states and 173218 transitions. [2018-11-28 13:10:20,125 INFO L78 Accepts]: Start accepts. Automaton has 40487 states and 173218 transitions. Word has length 33 [2018-11-28 13:10:20,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:10:20,126 INFO L480 AbstractCegarLoop]: Abstraction has 40487 states and 173218 transitions. [2018-11-28 13:10:20,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:10:20,126 INFO L276 IsEmpty]: Start isEmpty. Operand 40487 states and 173218 transitions. [2018-11-28 13:10:20,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-28 13:10:20,128 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:10:20,130 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] [2018-11-28 13:10:20,130 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:10:20,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:10:20,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1742157727, now seen corresponding path program 1 times [2018-11-28 13:10:20,130 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:10:20,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:10:20,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:20,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:10:20,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:20,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:10:20,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:10:20,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:10:20,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-28 13:10:20,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 13:10:20,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 13:10:20,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-11-28 13:10:20,265 INFO L87 Difference]: Start difference. First operand 40487 states and 173218 transitions. Second operand 10 states. [2018-11-28 13:10:20,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:10:20,810 INFO L93 Difference]: Finished difference Result 47144 states and 204499 transitions. [2018-11-28 13:10:20,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 13:10:20,811 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2018-11-28 13:10:20,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:10:21,001 INFO L225 Difference]: With dead ends: 47144 [2018-11-28 13:10:21,001 INFO L226 Difference]: Without dead ends: 47144 [2018-11-28 13:10:21,002 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-11-28 13:10:21,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47144 states. [2018-11-28 13:10:21,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47144 to 40505. [2018-11-28 13:10:21,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40505 states. [2018-11-28 13:10:21,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40505 states to 40505 states and 173247 transitions. [2018-11-28 13:10:21,961 INFO L78 Accepts]: Start accepts. Automaton has 40505 states and 173247 transitions. Word has length 35 [2018-11-28 13:10:21,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:10:21,962 INFO L480 AbstractCegarLoop]: Abstraction has 40505 states and 173247 transitions. [2018-11-28 13:10:21,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 13:10:21,962 INFO L276 IsEmpty]: Start isEmpty. Operand 40505 states and 173247 transitions. [2018-11-28 13:10:21,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-28 13:10:21,963 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:10:21,963 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] [2018-11-28 13:10:21,964 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:10:21,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:10:21,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1856245215, now seen corresponding path program 2 times [2018-11-28 13:10:21,964 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:10:21,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:10:21,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:21,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:10:21,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:21,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:10:22,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:10:22,084 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:10:22,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-28 13:10:22,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 13:10:22,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 13:10:22,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-11-28 13:10:22,085 INFO L87 Difference]: Start difference. First operand 40505 states and 173247 transitions. Second operand 10 states. [2018-11-28 13:10:22,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:10:22,781 INFO L93 Difference]: Finished difference Result 53745 states and 235686 transitions. [2018-11-28 13:10:22,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 13:10:22,781 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2018-11-28 13:10:22,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:10:22,907 INFO L225 Difference]: With dead ends: 53745 [2018-11-28 13:10:22,907 INFO L226 Difference]: Without dead ends: 53745 [2018-11-28 13:10:22,908 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2018-11-28 13:10:23,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53745 states. [2018-11-28 13:10:23,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53745 to 40451. [2018-11-28 13:10:23,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40451 states. [2018-11-28 13:10:23,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40451 states to 40451 states and 173155 transitions. [2018-11-28 13:10:23,579 INFO L78 Accepts]: Start accepts. Automaton has 40451 states and 173155 transitions. Word has length 35 [2018-11-28 13:10:23,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:10:23,579 INFO L480 AbstractCegarLoop]: Abstraction has 40451 states and 173155 transitions. [2018-11-28 13:10:23,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 13:10:23,580 INFO L276 IsEmpty]: Start isEmpty. Operand 40451 states and 173155 transitions. [2018-11-28 13:10:23,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-28 13:10:23,590 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:10:23,591 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] [2018-11-28 13:10:23,591 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:10:23,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:10:23,591 INFO L82 PathProgramCache]: Analyzing trace with hash 864239609, now seen corresponding path program 1 times [2018-11-28 13:10:23,591 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:10:23,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:10:23,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:23,594 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:10:23,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:23,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:10:23,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:10:23,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:10:23,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:10:23,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:10:23,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:10:23,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:10:23,671 INFO L87 Difference]: Start difference. First operand 40451 states and 173155 transitions. Second operand 5 states. [2018-11-28 13:10:24,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:10:24,063 INFO L93 Difference]: Finished difference Result 74947 states and 314581 transitions. [2018-11-28 13:10:24,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 13:10:24,063 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-11-28 13:10:24,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:10:24,434 INFO L225 Difference]: With dead ends: 74947 [2018-11-28 13:10:24,434 INFO L226 Difference]: Without dead ends: 56513 [2018-11-28 13:10:24,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-28 13:10:24,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56513 states. [2018-11-28 13:10:25,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56513 to 40763. [2018-11-28 13:10:25,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40763 states. [2018-11-28 13:10:25,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40763 states to 40763 states and 169305 transitions. [2018-11-28 13:10:25,089 INFO L78 Accepts]: Start accepts. Automaton has 40763 states and 169305 transitions. Word has length 45 [2018-11-28 13:10:25,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:10:25,089 INFO L480 AbstractCegarLoop]: Abstraction has 40763 states and 169305 transitions. [2018-11-28 13:10:25,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:10:25,089 INFO L276 IsEmpty]: Start isEmpty. Operand 40763 states and 169305 transitions. [2018-11-28 13:10:25,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-28 13:10:25,104 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:10:25,104 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] [2018-11-28 13:10:25,104 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:10:25,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:10:25,105 INFO L82 PathProgramCache]: Analyzing trace with hash 238055866, now seen corresponding path program 1 times [2018-11-28 13:10:25,105 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:10:25,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:10:25,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:25,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:10:25,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:25,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:10:25,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:10:25,478 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:10:25,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-11-28 13:10:25,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-28 13:10:25,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-28 13:10:25,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2018-11-28 13:10:25,479 INFO L87 Difference]: Start difference. First operand 40763 states and 169305 transitions. Second operand 19 states. [2018-11-28 13:10:27,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:10:27,122 INFO L93 Difference]: Finished difference Result 58950 states and 239857 transitions. [2018-11-28 13:10:27,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-28 13:10:27,122 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 47 [2018-11-28 13:10:27,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:10:27,221 INFO L225 Difference]: With dead ends: 58950 [2018-11-28 13:10:27,221 INFO L226 Difference]: Without dead ends: 56542 [2018-11-28 13:10:27,221 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=248, Invalid=1084, Unknown=0, NotChecked=0, Total=1332 [2018-11-28 13:10:27,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56542 states. [2018-11-28 13:10:27,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56542 to 40733. [2018-11-28 13:10:27,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40733 states. [2018-11-28 13:10:27,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40733 states to 40733 states and 169201 transitions. [2018-11-28 13:10:27,867 INFO L78 Accepts]: Start accepts. Automaton has 40733 states and 169201 transitions. Word has length 47 [2018-11-28 13:10:27,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:10:27,868 INFO L480 AbstractCegarLoop]: Abstraction has 40733 states and 169201 transitions. [2018-11-28 13:10:27,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-28 13:10:27,868 INFO L276 IsEmpty]: Start isEmpty. Operand 40733 states and 169201 transitions. [2018-11-28 13:10:27,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-28 13:10:27,879 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:10:27,879 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] [2018-11-28 13:10:27,879 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:10:27,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:10:27,880 INFO L82 PathProgramCache]: Analyzing trace with hash 565489518, now seen corresponding path program 2 times [2018-11-28 13:10:27,880 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:10:27,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:10:27,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:27,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:10:27,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:27,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:10:27,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:10:27,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:10:27,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 13:10:27,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 13:10:27,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 13:10:27,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-28 13:10:27,964 INFO L87 Difference]: Start difference. First operand 40733 states and 169201 transitions. Second operand 9 states. [2018-11-28 13:10:28,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:10:28,353 INFO L93 Difference]: Finished difference Result 58841 states and 239535 transitions. [2018-11-28 13:10:28,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 13:10:28,353 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 47 [2018-11-28 13:10:28,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:10:28,452 INFO L225 Difference]: With dead ends: 58841 [2018-11-28 13:10:28,452 INFO L226 Difference]: Without dead ends: 56433 [2018-11-28 13:10:28,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2018-11-28 13:10:28,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56433 states. [2018-11-28 13:10:29,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56433 to 40658. [2018-11-28 13:10:29,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40658 states. [2018-11-28 13:10:29,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40658 states to 40658 states and 168991 transitions. [2018-11-28 13:10:29,121 INFO L78 Accepts]: Start accepts. Automaton has 40658 states and 168991 transitions. Word has length 47 [2018-11-28 13:10:29,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:10:29,121 INFO L480 AbstractCegarLoop]: Abstraction has 40658 states and 168991 transitions. [2018-11-28 13:10:29,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 13:10:29,121 INFO L276 IsEmpty]: Start isEmpty. Operand 40658 states and 168991 transitions. [2018-11-28 13:10:29,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-28 13:10:29,136 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:10:29,136 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] [2018-11-28 13:10:29,136 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:10:29,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:10:29,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1318988660, now seen corresponding path program 1 times [2018-11-28 13:10:29,136 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:10:29,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:10:29,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:29,138 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:10:29,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:29,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:10:29,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:10:29,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:10:29,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 13:10:29,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 13:10:29,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 13:10:29,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:10:29,188 INFO L87 Difference]: Start difference. First operand 40658 states and 168991 transitions. Second operand 7 states. [2018-11-28 13:10:29,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:10:29,742 INFO L93 Difference]: Finished difference Result 71197 states and 287728 transitions. [2018-11-28 13:10:29,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 13:10:29,743 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2018-11-28 13:10:29,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:10:29,825 INFO L225 Difference]: With dead ends: 71197 [2018-11-28 13:10:29,825 INFO L226 Difference]: Without dead ends: 48359 [2018-11-28 13:10:29,825 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-11-28 13:10:29,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48359 states. [2018-11-28 13:10:30,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48359 to 42374. [2018-11-28 13:10:30,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42374 states. [2018-11-28 13:10:30,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42374 states to 42374 states and 171196 transitions. [2018-11-28 13:10:30,440 INFO L78 Accepts]: Start accepts. Automaton has 42374 states and 171196 transitions. Word has length 48 [2018-11-28 13:10:30,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:10:30,441 INFO L480 AbstractCegarLoop]: Abstraction has 42374 states and 171196 transitions. [2018-11-28 13:10:30,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 13:10:30,441 INFO L276 IsEmpty]: Start isEmpty. Operand 42374 states and 171196 transitions. [2018-11-28 13:10:30,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-28 13:10:30,462 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:10:30,462 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] [2018-11-28 13:10:30,462 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:10:30,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:10:30,462 INFO L82 PathProgramCache]: Analyzing trace with hash 1778320058, now seen corresponding path program 1 times [2018-11-28 13:10:30,463 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:10:30,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:10:30,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:30,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:10:30,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:30,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:10:30,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:10:30,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:10:30,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-28 13:10:30,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-28 13:10:30,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-28 13:10:30,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-11-28 13:10:30,625 INFO L87 Difference]: Start difference. First operand 42374 states and 171196 transitions. Second operand 13 states. [2018-11-28 13:10:31,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:10:31,030 INFO L93 Difference]: Finished difference Result 54161 states and 215849 transitions. [2018-11-28 13:10:31,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 13:10:31,031 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 50 [2018-11-28 13:10:31,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:10:31,118 INFO L225 Difference]: With dead ends: 54161 [2018-11-28 13:10:31,118 INFO L226 Difference]: Without dead ends: 50905 [2018-11-28 13:10:31,119 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2018-11-28 13:10:31,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50905 states. [2018-11-28 13:10:31,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50905 to 42044. [2018-11-28 13:10:31,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42044 states. [2018-11-28 13:10:31,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42044 states to 42044 states and 169930 transitions. [2018-11-28 13:10:31,997 INFO L78 Accepts]: Start accepts. Automaton has 42044 states and 169930 transitions. Word has length 50 [2018-11-28 13:10:31,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:10:31,997 INFO L480 AbstractCegarLoop]: Abstraction has 42044 states and 169930 transitions. [2018-11-28 13:10:31,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-28 13:10:31,997 INFO L276 IsEmpty]: Start isEmpty. Operand 42044 states and 169930 transitions. [2018-11-28 13:10:32,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-28 13:10:32,020 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:10:32,020 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] [2018-11-28 13:10:32,020 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:10:32,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:10:32,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1136732819, now seen corresponding path program 1 times [2018-11-28 13:10:32,020 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:10:32,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:10:32,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:32,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:10:32,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:32,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:10:32,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:10:32,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:10:32,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-11-28 13:10:32,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-28 13:10:32,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-28 13:10:32,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2018-11-28 13:10:32,331 INFO L87 Difference]: Start difference. First operand 42044 states and 169930 transitions. Second operand 17 states. [2018-11-28 13:10:33,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:10:33,074 INFO L93 Difference]: Finished difference Result 48342 states and 195029 transitions. [2018-11-28 13:10:33,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-28 13:10:33,074 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 50 [2018-11-28 13:10:33,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:10:33,156 INFO L225 Difference]: With dead ends: 48342 [2018-11-28 13:10:33,156 INFO L226 Difference]: Without dead ends: 47886 [2018-11-28 13:10:33,156 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=159, Invalid=543, Unknown=0, NotChecked=0, Total=702 [2018-11-28 13:10:33,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47886 states. [2018-11-28 13:10:33,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47886 to 45629. [2018-11-28 13:10:33,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45629 states. [2018-11-28 13:10:33,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45629 states to 45629 states and 185453 transitions. [2018-11-28 13:10:33,776 INFO L78 Accepts]: Start accepts. Automaton has 45629 states and 185453 transitions. Word has length 50 [2018-11-28 13:10:33,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:10:33,776 INFO L480 AbstractCegarLoop]: Abstraction has 45629 states and 185453 transitions. [2018-11-28 13:10:33,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-28 13:10:33,776 INFO L276 IsEmpty]: Start isEmpty. Operand 45629 states and 185453 transitions. [2018-11-28 13:10:33,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-28 13:10:33,799 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:10:33,799 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] [2018-11-28 13:10:33,800 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:10:33,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:10:33,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1695764147, now seen corresponding path program 2 times [2018-11-28 13:10:33,800 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:10:33,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:10:33,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:33,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:10:33,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:33,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:10:33,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:10:33,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:10:33,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-28 13:10:33,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-28 13:10:33,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-28 13:10:33,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-11-28 13:10:33,980 INFO L87 Difference]: Start difference. First operand 45629 states and 185453 transitions. Second operand 14 states. [2018-11-28 13:10:34,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:10:34,483 INFO L93 Difference]: Finished difference Result 56333 states and 228138 transitions. [2018-11-28 13:10:34,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 13:10:34,484 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 50 [2018-11-28 13:10:34,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:10:34,581 INFO L225 Difference]: With dead ends: 56333 [2018-11-28 13:10:34,582 INFO L226 Difference]: Without dead ends: 55877 [2018-11-28 13:10:34,582 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2018-11-28 13:10:34,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55877 states. [2018-11-28 13:10:35,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55877 to 45508. [2018-11-28 13:10:35,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45508 states. [2018-11-28 13:10:35,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45508 states to 45508 states and 185108 transitions. [2018-11-28 13:10:35,329 INFO L78 Accepts]: Start accepts. Automaton has 45508 states and 185108 transitions. Word has length 50 [2018-11-28 13:10:35,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:10:35,330 INFO L480 AbstractCegarLoop]: Abstraction has 45508 states and 185108 transitions. [2018-11-28 13:10:35,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-28 13:10:35,330 INFO L276 IsEmpty]: Start isEmpty. Operand 45508 states and 185108 transitions. [2018-11-28 13:10:35,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-28 13:10:35,353 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:10:35,353 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] [2018-11-28 13:10:35,353 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:10:35,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:10:35,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1546975859, now seen corresponding path program 1 times [2018-11-28 13:10:35,354 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:10:35,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:10:35,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:35,355 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:10:35,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:35,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:10:35,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:10:35,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:10:35,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-28 13:10:35,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 13:10:35,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 13:10:35,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-11-28 13:10:35,441 INFO L87 Difference]: Start difference. First operand 45508 states and 185108 transitions. Second operand 11 states. [2018-11-28 13:10:36,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:10:36,072 INFO L93 Difference]: Finished difference Result 56707 states and 227522 transitions. [2018-11-28 13:10:36,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 13:10:36,073 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 50 [2018-11-28 13:10:36,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:10:36,155 INFO L225 Difference]: With dead ends: 56707 [2018-11-28 13:10:36,155 INFO L226 Difference]: Without dead ends: 51132 [2018-11-28 13:10:36,155 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=150, Invalid=312, Unknown=0, NotChecked=0, Total=462 [2018-11-28 13:10:36,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51132 states. [2018-11-28 13:10:36,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51132 to 44908. [2018-11-28 13:10:36,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44908 states. [2018-11-28 13:10:36,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44908 states to 44908 states and 182813 transitions. [2018-11-28 13:10:36,784 INFO L78 Accepts]: Start accepts. Automaton has 44908 states and 182813 transitions. Word has length 50 [2018-11-28 13:10:36,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:10:36,784 INFO L480 AbstractCegarLoop]: Abstraction has 44908 states and 182813 transitions. [2018-11-28 13:10:36,784 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 13:10:36,784 INFO L276 IsEmpty]: Start isEmpty. Operand 44908 states and 182813 transitions. [2018-11-28 13:10:36,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-28 13:10:36,822 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:10:36,822 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] [2018-11-28 13:10:36,822 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:10:36,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:10:36,822 INFO L82 PathProgramCache]: Analyzing trace with hash -295598450, now seen corresponding path program 1 times [2018-11-28 13:10:36,822 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:10:36,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:10:36,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:36,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:10:36,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:36,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:10:37,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:10:37,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:10:37,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-11-28 13:10:37,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-28 13:10:37,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-28 13:10:37,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2018-11-28 13:10:37,240 INFO L87 Difference]: Start difference. First operand 44908 states and 182813 transitions. Second operand 17 states. [2018-11-28 13:10:38,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:10:38,541 INFO L93 Difference]: Finished difference Result 55621 states and 226438 transitions. [2018-11-28 13:10:38,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-28 13:10:38,541 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 52 [2018-11-28 13:10:38,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:10:38,635 INFO L225 Difference]: With dead ends: 55621 [2018-11-28 13:10:38,635 INFO L226 Difference]: Without dead ends: 55165 [2018-11-28 13:10:38,635 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=233, Invalid=697, Unknown=0, NotChecked=0, Total=930 [2018-11-28 13:10:38,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55165 states. [2018-11-28 13:10:39,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55165 to 44721. [2018-11-28 13:10:39,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44721 states. [2018-11-28 13:10:39,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44721 states to 44721 states and 182302 transitions. [2018-11-28 13:10:39,293 INFO L78 Accepts]: Start accepts. Automaton has 44721 states and 182302 transitions. Word has length 52 [2018-11-28 13:10:39,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:10:39,293 INFO L480 AbstractCegarLoop]: Abstraction has 44721 states and 182302 transitions. [2018-11-28 13:10:39,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-28 13:10:39,294 INFO L276 IsEmpty]: Start isEmpty. Operand 44721 states and 182302 transitions. [2018-11-28 13:10:39,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-28 13:10:39,324 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:10:39,324 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] [2018-11-28 13:10:39,324 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:10:39,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:10:39,324 INFO L82 PathProgramCache]: Analyzing trace with hash 897864341, now seen corresponding path program 1 times [2018-11-28 13:10:39,324 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:10:39,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:10:39,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:39,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:10:39,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:39,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:10:39,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:10:39,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:10:39,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-11-28 13:10:39,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-28 13:10:39,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-28 13:10:39,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2018-11-28 13:10:39,588 INFO L87 Difference]: Start difference. First operand 44721 states and 182302 transitions. Second operand 15 states. [2018-11-28 13:10:40,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:10:40,030 INFO L93 Difference]: Finished difference Result 52211 states and 210162 transitions. [2018-11-28 13:10:40,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 13:10:40,030 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 53 [2018-11-28 13:10:40,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:10:40,100 INFO L225 Difference]: With dead ends: 52211 [2018-11-28 13:10:40,100 INFO L226 Difference]: Without dead ends: 43294 [2018-11-28 13:10:40,100 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=121, Invalid=341, Unknown=0, NotChecked=0, Total=462 [2018-11-28 13:10:40,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43294 states. [2018-11-28 13:10:40,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43294 to 37956. [2018-11-28 13:10:40,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37956 states. [2018-11-28 13:10:40,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37956 states to 37956 states and 153296 transitions. [2018-11-28 13:10:40,793 INFO L78 Accepts]: Start accepts. Automaton has 37956 states and 153296 transitions. Word has length 53 [2018-11-28 13:10:40,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:10:40,793 INFO L480 AbstractCegarLoop]: Abstraction has 37956 states and 153296 transitions. [2018-11-28 13:10:40,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-28 13:10:40,793 INFO L276 IsEmpty]: Start isEmpty. Operand 37956 states and 153296 transitions. [2018-11-28 13:10:40,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-28 13:10:40,817 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:10:40,817 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] [2018-11-28 13:10:40,817 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:10:40,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:10:40,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1410636712, now seen corresponding path program 1 times [2018-11-28 13:10:40,817 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:10:40,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:10:40,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:40,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:10:40,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:40,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:10:40,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:10:40,954 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:10:40,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-28 13:10:40,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-28 13:10:40,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-28 13:10:40,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-11-28 13:10:40,954 INFO L87 Difference]: Start difference. First operand 37956 states and 153296 transitions. Second operand 13 states. [2018-11-28 13:10:41,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:10:41,409 INFO L93 Difference]: Finished difference Result 46513 states and 186428 transitions. [2018-11-28 13:10:41,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-28 13:10:41,409 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 53 [2018-11-28 13:10:41,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:10:41,471 INFO L225 Difference]: With dead ends: 46513 [2018-11-28 13:10:41,471 INFO L226 Difference]: Without dead ends: 38243 [2018-11-28 13:10:41,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=173, Invalid=379, Unknown=0, NotChecked=0, Total=552 [2018-11-28 13:10:41,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38243 states. [2018-11-28 13:10:41,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38243 to 32694. [2018-11-28 13:10:41,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32694 states. [2018-11-28 13:10:41,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32694 states to 32694 states and 131852 transitions. [2018-11-28 13:10:41,962 INFO L78 Accepts]: Start accepts. Automaton has 32694 states and 131852 transitions. Word has length 53 [2018-11-28 13:10:41,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:10:41,962 INFO L480 AbstractCegarLoop]: Abstraction has 32694 states and 131852 transitions. [2018-11-28 13:10:41,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-28 13:10:41,962 INFO L276 IsEmpty]: Start isEmpty. Operand 32694 states and 131852 transitions. [2018-11-28 13:10:41,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-28 13:10:41,984 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:10:41,984 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] [2018-11-28 13:10:41,984 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:10:41,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:10:41,984 INFO L82 PathProgramCache]: Analyzing trace with hash -142833368, now seen corresponding path program 1 times [2018-11-28 13:10:41,984 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:10:41,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:10:41,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:41,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:10:41,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:41,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:10:42,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:10:42,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:10:42,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-11-28 13:10:42,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-28 13:10:42,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-28 13:10:42,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2018-11-28 13:10:42,456 INFO L87 Difference]: Start difference. First operand 32694 states and 131852 transitions. Second operand 19 states. [2018-11-28 13:10:43,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:10:43,188 INFO L93 Difference]: Finished difference Result 37734 states and 151509 transitions. [2018-11-28 13:10:43,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-28 13:10:43,188 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 55 [2018-11-28 13:10:43,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:10:43,247 INFO L225 Difference]: With dead ends: 37734 [2018-11-28 13:10:43,248 INFO L226 Difference]: Without dead ends: 37293 [2018-11-28 13:10:43,248 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=153, Invalid=549, Unknown=0, NotChecked=0, Total=702 [2018-11-28 13:10:43,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37293 states. [2018-11-28 13:10:43,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37293 to 34905. [2018-11-28 13:10:43,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34905 states. [2018-11-28 13:10:43,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34905 states to 34905 states and 140988 transitions. [2018-11-28 13:10:43,717 INFO L78 Accepts]: Start accepts. Automaton has 34905 states and 140988 transitions. Word has length 55 [2018-11-28 13:10:43,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:10:43,718 INFO L480 AbstractCegarLoop]: Abstraction has 34905 states and 140988 transitions. [2018-11-28 13:10:43,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-28 13:10:43,718 INFO L276 IsEmpty]: Start isEmpty. Operand 34905 states and 140988 transitions. [2018-11-28 13:10:43,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-28 13:10:43,743 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:10:43,743 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] [2018-11-28 13:10:43,743 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:10:43,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:10:43,743 INFO L82 PathProgramCache]: Analyzing trace with hash -51175185, now seen corresponding path program 1 times [2018-11-28 13:10:43,743 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:10:43,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:10:43,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:43,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:10:43,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:43,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:10:44,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:10:44,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:10:44,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-11-28 13:10:44,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-28 13:10:44,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-28 13:10:44,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2018-11-28 13:10:44,139 INFO L87 Difference]: Start difference. First operand 34905 states and 140988 transitions. Second operand 19 states. [2018-11-28 13:10:44,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:10:44,872 INFO L93 Difference]: Finished difference Result 38941 states and 156506 transitions. [2018-11-28 13:10:44,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-28 13:10:44,872 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 55 [2018-11-28 13:10:44,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:10:44,933 INFO L225 Difference]: With dead ends: 38941 [2018-11-28 13:10:44,933 INFO L226 Difference]: Without dead ends: 38614 [2018-11-28 13:10:44,934 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=178, Invalid=634, Unknown=0, NotChecked=0, Total=812 [2018-11-28 13:10:45,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38614 states. [2018-11-28 13:10:45,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38614 to 34635. [2018-11-28 13:10:45,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34635 states. [2018-11-28 13:10:45,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34635 states to 34635 states and 139908 transitions. [2018-11-28 13:10:45,471 INFO L78 Accepts]: Start accepts. Automaton has 34635 states and 139908 transitions. Word has length 55 [2018-11-28 13:10:45,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:10:45,471 INFO L480 AbstractCegarLoop]: Abstraction has 34635 states and 139908 transitions. [2018-11-28 13:10:45,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-28 13:10:45,471 INFO L276 IsEmpty]: Start isEmpty. Operand 34635 states and 139908 transitions. [2018-11-28 13:10:45,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-28 13:10:45,495 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:10:45,495 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] [2018-11-28 13:10:45,495 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:10:45,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:10:45,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1740514353, now seen corresponding path program 2 times [2018-11-28 13:10:45,495 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:10:45,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:10:45,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:45,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:10:45,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:45,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:10:45,974 WARN L180 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 39 [2018-11-28 13:10:46,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:10:46,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:10:46,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-11-28 13:10:46,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-28 13:10:46,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-28 13:10:46,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2018-11-28 13:10:46,231 INFO L87 Difference]: Start difference. First operand 34635 states and 139908 transitions. Second operand 19 states. [2018-11-28 13:10:47,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:10:47,560 INFO L93 Difference]: Finished difference Result 39529 states and 158826 transitions. [2018-11-28 13:10:47,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-28 13:10:47,560 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 55 [2018-11-28 13:10:47,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:10:47,623 INFO L225 Difference]: With dead ends: 39529 [2018-11-28 13:10:47,623 INFO L226 Difference]: Without dead ends: 39082 [2018-11-28 13:10:47,623 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=237, Invalid=953, Unknown=0, NotChecked=0, Total=1190 [2018-11-28 13:10:47,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39082 states. [2018-11-28 13:10:48,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39082 to 34575. [2018-11-28 13:10:48,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34575 states. [2018-11-28 13:10:48,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34575 states to 34575 states and 139640 transitions. [2018-11-28 13:10:48,102 INFO L78 Accepts]: Start accepts. Automaton has 34575 states and 139640 transitions. Word has length 55 [2018-11-28 13:10:48,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:10:48,102 INFO L480 AbstractCegarLoop]: Abstraction has 34575 states and 139640 transitions. [2018-11-28 13:10:48,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-28 13:10:48,102 INFO L276 IsEmpty]: Start isEmpty. Operand 34575 states and 139640 transitions. [2018-11-28 13:10:48,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-28 13:10:48,127 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:10:48,127 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] [2018-11-28 13:10:48,127 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:10:48,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:10:48,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1858563217, now seen corresponding path program 3 times [2018-11-28 13:10:48,128 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:10:48,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:10:48,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:48,129 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:10:48,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:48,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:10:48,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:10:48,571 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:10:48,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-11-28 13:10:48,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-28 13:10:48,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-28 13:10:48,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2018-11-28 13:10:48,572 INFO L87 Difference]: Start difference. First operand 34575 states and 139640 transitions. Second operand 18 states. [2018-11-28 13:10:49,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:10:49,373 INFO L93 Difference]: Finished difference Result 39179 states and 157389 transitions. [2018-11-28 13:10:49,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-28 13:10:49,374 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 55 [2018-11-28 13:10:49,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:10:49,435 INFO L225 Difference]: With dead ends: 39179 [2018-11-28 13:10:49,435 INFO L226 Difference]: Without dead ends: 38714 [2018-11-28 13:10:49,436 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=190, Invalid=740, Unknown=0, NotChecked=0, Total=930 [2018-11-28 13:10:49,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38714 states. [2018-11-28 13:10:49,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38714 to 34551. [2018-11-28 13:10:49,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34551 states. [2018-11-28 13:10:49,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34551 states to 34551 states and 139552 transitions. [2018-11-28 13:10:49,911 INFO L78 Accepts]: Start accepts. Automaton has 34551 states and 139552 transitions. Word has length 55 [2018-11-28 13:10:49,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:10:49,912 INFO L480 AbstractCegarLoop]: Abstraction has 34551 states and 139552 transitions. [2018-11-28 13:10:49,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-28 13:10:49,912 INFO L276 IsEmpty]: Start isEmpty. Operand 34551 states and 139552 transitions. [2018-11-28 13:10:49,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-28 13:10:49,937 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:10:49,937 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] [2018-11-28 13:10:49,937 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:10:49,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:10:49,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1655779279, now seen corresponding path program 4 times [2018-11-28 13:10:49,938 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:10:49,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:10:49,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:49,939 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:10:49,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:49,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:10:50,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:10:50,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:10:50,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-11-28 13:10:50,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-28 13:10:50,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-28 13:10:50,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2018-11-28 13:10:50,353 INFO L87 Difference]: Start difference. First operand 34551 states and 139552 transitions. Second operand 18 states. [2018-11-28 13:10:51,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:10:51,360 INFO L93 Difference]: Finished difference Result 41153 states and 164986 transitions. [2018-11-28 13:10:51,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-28 13:10:51,361 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 55 [2018-11-28 13:10:51,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:10:51,425 INFO L225 Difference]: With dead ends: 41153 [2018-11-28 13:10:51,425 INFO L226 Difference]: Without dead ends: 40688 [2018-11-28 13:10:51,425 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=275, Invalid=1057, Unknown=0, NotChecked=0, Total=1332 [2018-11-28 13:10:51,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40688 states. [2018-11-28 13:10:51,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40688 to 32997. [2018-11-28 13:10:51,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32997 states. [2018-11-28 13:10:51,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32997 states to 32997 states and 133345 transitions. [2018-11-28 13:10:51,901 INFO L78 Accepts]: Start accepts. Automaton has 32997 states and 133345 transitions. Word has length 55 [2018-11-28 13:10:51,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:10:51,902 INFO L480 AbstractCegarLoop]: Abstraction has 32997 states and 133345 transitions. [2018-11-28 13:10:51,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-28 13:10:51,902 INFO L276 IsEmpty]: Start isEmpty. Operand 32997 states and 133345 transitions. [2018-11-28 13:10:51,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-28 13:10:51,924 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:10:51,924 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] [2018-11-28 13:10:51,924 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:10:51,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:10:51,924 INFO L82 PathProgramCache]: Analyzing trace with hash 2007864715, now seen corresponding path program 1 times [2018-11-28 13:10:51,924 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:10:51,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:10:51,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:51,925 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:10:51,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:51,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:10:52,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:10:52,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:10:52,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-11-28 13:10:52,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-28 13:10:52,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-28 13:10:52,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2018-11-28 13:10:52,446 INFO L87 Difference]: Start difference. First operand 32997 states and 133345 transitions. Second operand 18 states. [2018-11-28 13:10:52,668 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 39 [2018-11-28 13:10:53,060 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 63 [2018-11-28 13:10:53,398 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 61 [2018-11-28 13:10:53,534 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 66 [2018-11-28 13:10:53,652 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 65 [2018-11-28 13:10:53,792 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 66 [2018-11-28 13:10:53,930 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 64 [2018-11-28 13:10:54,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:10:54,186 INFO L93 Difference]: Finished difference Result 32175 states and 127243 transitions. [2018-11-28 13:10:54,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-28 13:10:54,186 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 55 [2018-11-28 13:10:54,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:10:54,234 INFO L225 Difference]: With dead ends: 32175 [2018-11-28 13:10:54,235 INFO L226 Difference]: Without dead ends: 31245 [2018-11-28 13:10:54,235 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2018-11-28 13:10:54,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31245 states. [2018-11-28 13:10:54,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31245 to 24269. [2018-11-28 13:10:54,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24269 states. [2018-11-28 13:10:54,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24269 states to 24269 states and 95867 transitions. [2018-11-28 13:10:54,582 INFO L78 Accepts]: Start accepts. Automaton has 24269 states and 95867 transitions. Word has length 55 [2018-11-28 13:10:54,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:10:54,582 INFO L480 AbstractCegarLoop]: Abstraction has 24269 states and 95867 transitions. [2018-11-28 13:10:54,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-28 13:10:54,582 INFO L276 IsEmpty]: Start isEmpty. Operand 24269 states and 95867 transitions. [2018-11-28 13:10:54,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-28 13:10:54,599 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:10:54,600 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] [2018-11-28 13:10:54,600 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:10:54,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:10:54,600 INFO L82 PathProgramCache]: Analyzing trace with hash -406541239, now seen corresponding path program 1 times [2018-11-28 13:10:54,600 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:10:54,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:10:54,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:54,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:10:54,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:54,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:10:54,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:10:54,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:10:54,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-11-28 13:10:54,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-28 13:10:54,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-28 13:10:54,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2018-11-28 13:10:54,965 INFO L87 Difference]: Start difference. First operand 24269 states and 95867 transitions. Second operand 19 states. [2018-11-28 13:10:55,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:10:55,657 INFO L93 Difference]: Finished difference Result 27222 states and 106645 transitions. [2018-11-28 13:10:55,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-28 13:10:55,657 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 55 [2018-11-28 13:10:55,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:10:55,698 INFO L225 Difference]: With dead ends: 27222 [2018-11-28 13:10:55,698 INFO L226 Difference]: Without dead ends: 26325 [2018-11-28 13:10:55,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=182, Invalid=630, Unknown=0, NotChecked=0, Total=812 [2018-11-28 13:10:55,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26325 states. [2018-11-28 13:10:55,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26325 to 25025. [2018-11-28 13:10:55,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25025 states. [2018-11-28 13:10:56,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25025 states to 25025 states and 98727 transitions. [2018-11-28 13:10:56,030 INFO L78 Accepts]: Start accepts. Automaton has 25025 states and 98727 transitions. Word has length 55 [2018-11-28 13:10:56,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:10:56,031 INFO L480 AbstractCegarLoop]: Abstraction has 25025 states and 98727 transitions. [2018-11-28 13:10:56,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-28 13:10:56,031 INFO L276 IsEmpty]: Start isEmpty. Operand 25025 states and 98727 transitions. [2018-11-28 13:10:56,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-28 13:10:56,049 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:10:56,049 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] [2018-11-28 13:10:56,049 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:10:56,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:10:56,049 INFO L82 PathProgramCache]: Analyzing trace with hash -513722103, now seen corresponding path program 2 times [2018-11-28 13:10:56,049 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:10:56,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:10:56,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:56,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:10:56,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:56,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:10:56,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:10:56,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:10:56,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-11-28 13:10:56,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-28 13:10:56,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-28 13:10:56,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2018-11-28 13:10:56,291 INFO L87 Difference]: Start difference. First operand 25025 states and 98727 transitions. Second operand 16 states. [2018-11-28 13:10:56,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:10:56,661 INFO L93 Difference]: Finished difference Result 30553 states and 119704 transitions. [2018-11-28 13:10:56,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-28 13:10:56,661 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 55 [2018-11-28 13:10:56,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:10:56,706 INFO L225 Difference]: With dead ends: 30553 [2018-11-28 13:10:56,706 INFO L226 Difference]: Without dead ends: 29656 [2018-11-28 13:10:56,706 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=156, Invalid=444, Unknown=0, NotChecked=0, Total=600 [2018-11-28 13:10:56,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29656 states. [2018-11-28 13:10:57,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29656 to 25173. [2018-11-28 13:10:57,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25173 states. [2018-11-28 13:10:57,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25173 states to 25173 states and 99424 transitions. [2018-11-28 13:10:57,058 INFO L78 Accepts]: Start accepts. Automaton has 25173 states and 99424 transitions. Word has length 55 [2018-11-28 13:10:57,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:10:57,058 INFO L480 AbstractCegarLoop]: Abstraction has 25173 states and 99424 transitions. [2018-11-28 13:10:57,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-28 13:10:57,058 INFO L276 IsEmpty]: Start isEmpty. Operand 25173 states and 99424 transitions. [2018-11-28 13:10:57,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-28 13:10:57,075 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:10:57,075 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] [2018-11-28 13:10:57,076 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:10:57,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:10:57,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1109025908, now seen corresponding path program 2 times [2018-11-28 13:10:57,076 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:10:57,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:10:57,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:57,077 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:10:57,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:57,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:10:57,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:10:57,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:10:57,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-28 13:10:57,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 13:10:57,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 13:10:57,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-28 13:10:57,153 INFO L87 Difference]: Start difference. First operand 25173 states and 99424 transitions. Second operand 10 states. [2018-11-28 13:10:57,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:10:57,392 INFO L93 Difference]: Finished difference Result 28345 states and 110953 transitions. [2018-11-28 13:10:57,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 13:10:57,393 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2018-11-28 13:10:57,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:10:57,434 INFO L225 Difference]: With dead ends: 28345 [2018-11-28 13:10:57,434 INFO L226 Difference]: Without dead ends: 27421 [2018-11-28 13:10:57,434 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2018-11-28 13:10:57,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27421 states. [2018-11-28 13:10:57,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27421 to 23789. [2018-11-28 13:10:57,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23789 states. [2018-11-28 13:10:57,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23789 states to 23789 states and 94227 transitions. [2018-11-28 13:10:57,749 INFO L78 Accepts]: Start accepts. Automaton has 23789 states and 94227 transitions. Word has length 55 [2018-11-28 13:10:57,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:10:57,750 INFO L480 AbstractCegarLoop]: Abstraction has 23789 states and 94227 transitions. [2018-11-28 13:10:57,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 13:10:57,750 INFO L276 IsEmpty]: Start isEmpty. Operand 23789 states and 94227 transitions. [2018-11-28 13:10:57,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-28 13:10:57,766 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:10:57,767 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] [2018-11-28 13:10:57,767 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:10:57,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:10:57,767 INFO L82 PathProgramCache]: Analyzing trace with hash 506208263, now seen corresponding path program 1 times [2018-11-28 13:10:57,767 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:10:57,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:10:57,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:57,768 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:10:57,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:57,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:10:58,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:10:58,268 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:10:58,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-11-28 13:10:58,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-28 13:10:58,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-28 13:10:58,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2018-11-28 13:10:58,268 INFO L87 Difference]: Start difference. First operand 23789 states and 94227 transitions. Second operand 20 states. [2018-11-28 13:10:58,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:10:58,918 INFO L93 Difference]: Finished difference Result 21753 states and 85053 transitions. [2018-11-28 13:10:58,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-28 13:10:58,918 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 57 [2018-11-28 13:10:58,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:10:58,948 INFO L225 Difference]: With dead ends: 21753 [2018-11-28 13:10:58,948 INFO L226 Difference]: Without dead ends: 20493 [2018-11-28 13:10:58,948 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=165, Invalid=537, Unknown=0, NotChecked=0, Total=702 [2018-11-28 13:10:58,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20493 states. [2018-11-28 13:10:59,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20493 to 17871. [2018-11-28 13:10:59,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17871 states. [2018-11-28 13:10:59,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17871 states to 17871 states and 69982 transitions. [2018-11-28 13:10:59,247 INFO L78 Accepts]: Start accepts. Automaton has 17871 states and 69982 transitions. Word has length 57 [2018-11-28 13:10:59,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:10:59,247 INFO L480 AbstractCegarLoop]: Abstraction has 17871 states and 69982 transitions. [2018-11-28 13:10:59,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-28 13:10:59,247 INFO L276 IsEmpty]: Start isEmpty. Operand 17871 states and 69982 transitions. [2018-11-28 13:10:59,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-28 13:10:59,260 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:10:59,260 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] [2018-11-28 13:10:59,260 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:10:59,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:10:59,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1231209688, now seen corresponding path program 1 times [2018-11-28 13:10:59,261 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:10:59,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:10:59,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:59,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:10:59,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:59,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:10:59,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:10:59,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:10:59,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-11-28 13:10:59,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-28 13:10:59,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-28 13:10:59,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2018-11-28 13:10:59,734 INFO L87 Difference]: Start difference. First operand 17871 states and 69982 transitions. Second operand 19 states. [2018-11-28 13:11:01,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:11:01,159 INFO L93 Difference]: Finished difference Result 25528 states and 98380 transitions. [2018-11-28 13:11:01,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-28 13:11:01,159 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 57 [2018-11-28 13:11:01,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:11:01,191 INFO L225 Difference]: With dead ends: 25528 [2018-11-28 13:11:01,191 INFO L226 Difference]: Without dead ends: 22783 [2018-11-28 13:11:01,191 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=273, Invalid=849, Unknown=0, NotChecked=0, Total=1122 [2018-11-28 13:11:01,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22783 states. [2018-11-28 13:11:01,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22783 to 13889. [2018-11-28 13:11:01,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13889 states. [2018-11-28 13:11:01,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13889 states to 13889 states and 53786 transitions. [2018-11-28 13:11:01,405 INFO L78 Accepts]: Start accepts. Automaton has 13889 states and 53786 transitions. Word has length 57 [2018-11-28 13:11:01,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:11:01,405 INFO L480 AbstractCegarLoop]: Abstraction has 13889 states and 53786 transitions. [2018-11-28 13:11:01,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-28 13:11:01,405 INFO L276 IsEmpty]: Start isEmpty. Operand 13889 states and 53786 transitions. [2018-11-28 13:11:01,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-28 13:11:01,415 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:11:01,415 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] [2018-11-28 13:11:01,416 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:11:01,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:11:01,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1637424555, now seen corresponding path program 1 times [2018-11-28 13:11:01,416 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:11:01,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:11:01,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:11:01,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:11:01,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:11:01,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:11:01,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:11:01,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:11:01,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-11-28 13:11:01,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-28 13:11:01,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-28 13:11:01,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2018-11-28 13:11:01,789 INFO L87 Difference]: Start difference. First operand 13889 states and 53786 transitions. Second operand 19 states. [2018-11-28 13:11:02,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:11:02,399 INFO L93 Difference]: Finished difference Result 18233 states and 70178 transitions. [2018-11-28 13:11:02,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-28 13:11:02,400 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 58 [2018-11-28 13:11:02,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:11:02,420 INFO L225 Difference]: With dead ends: 18233 [2018-11-28 13:11:02,420 INFO L226 Difference]: Without dead ends: 14273 [2018-11-28 13:11:02,420 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=197, Invalid=559, Unknown=0, NotChecked=0, Total=756 [2018-11-28 13:11:02,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14273 states. [2018-11-28 13:11:02,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14273 to 11633. [2018-11-28 13:11:02,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11633 states. [2018-11-28 13:11:02,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11633 states to 11633 states and 43674 transitions. [2018-11-28 13:11:02,563 INFO L78 Accepts]: Start accepts. Automaton has 11633 states and 43674 transitions. Word has length 58 [2018-11-28 13:11:02,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:11:02,564 INFO L480 AbstractCegarLoop]: Abstraction has 11633 states and 43674 transitions. [2018-11-28 13:11:02,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-28 13:11:02,564 INFO L276 IsEmpty]: Start isEmpty. Operand 11633 states and 43674 transitions. [2018-11-28 13:11:02,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-28 13:11:02,572 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:11:02,572 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] [2018-11-28 13:11:02,573 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:11:02,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:11:02,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1019541803, now seen corresponding path program 2 times [2018-11-28 13:11:02,573 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:11:02,573 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:11:02,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:11:02,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:11:02,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:11:02,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:11:03,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:11:03,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:11:03,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-11-28 13:11:03,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-28 13:11:03,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-28 13:11:03,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2018-11-28 13:11:03,121 INFO L87 Difference]: Start difference. First operand 11633 states and 43674 transitions. Second operand 16 states. [2018-11-28 13:11:03,758 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 69 [2018-11-28 13:11:03,890 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 75 [2018-11-28 13:11:04,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:11:04,618 INFO L93 Difference]: Finished difference Result 10553 states and 38610 transitions. [2018-11-28 13:11:04,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-28 13:11:04,618 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 58 [2018-11-28 13:11:04,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:11:04,630 INFO L225 Difference]: With dead ends: 10553 [2018-11-28 13:11:04,631 INFO L226 Difference]: Without dead ends: 9063 [2018-11-28 13:11:04,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=276, Invalid=914, Unknown=0, NotChecked=0, Total=1190 [2018-11-28 13:11:04,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9063 states. [2018-11-28 13:11:04,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9063 to 9063. [2018-11-28 13:11:04,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9063 states. [2018-11-28 13:11:04,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9063 states to 9063 states and 33711 transitions. [2018-11-28 13:11:04,726 INFO L78 Accepts]: Start accepts. Automaton has 9063 states and 33711 transitions. Word has length 58 [2018-11-28 13:11:04,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:11:04,726 INFO L480 AbstractCegarLoop]: Abstraction has 9063 states and 33711 transitions. [2018-11-28 13:11:04,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-28 13:11:04,726 INFO L276 IsEmpty]: Start isEmpty. Operand 9063 states and 33711 transitions. [2018-11-28 13:11:04,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-28 13:11:04,733 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:11:04,733 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] [2018-11-28 13:11:04,733 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:11:04,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:11:04,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1171302596, now seen corresponding path program 1 times [2018-11-28 13:11:04,733 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:11:04,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:11:04,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:11:04,734 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:11:04,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:11:04,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:11:05,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:11:05,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:11:05,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-11-28 13:11:05,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-28 13:11:05,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-28 13:11:05,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2018-11-28 13:11:05,269 INFO L87 Difference]: Start difference. First operand 9063 states and 33711 transitions. Second operand 21 states. [2018-11-28 13:11:05,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:11:05,856 INFO L93 Difference]: Finished difference Result 10116 states and 37492 transitions. [2018-11-28 13:11:05,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-28 13:11:05,856 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 60 [2018-11-28 13:11:05,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:11:05,867 INFO L225 Difference]: With dead ends: 10116 [2018-11-28 13:11:05,867 INFO L226 Difference]: Without dead ends: 8685 [2018-11-28 13:11:05,868 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=169, Invalid=643, Unknown=0, NotChecked=0, Total=812 [2018-11-28 13:11:05,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8685 states. [2018-11-28 13:11:05,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8685 to 8109. [2018-11-28 13:11:05,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8109 states. [2018-11-28 13:11:05,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8109 states to 8109 states and 29535 transitions. [2018-11-28 13:11:05,955 INFO L78 Accepts]: Start accepts. Automaton has 8109 states and 29535 transitions. Word has length 60 [2018-11-28 13:11:05,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:11:05,955 INFO L480 AbstractCegarLoop]: Abstraction has 8109 states and 29535 transitions. [2018-11-28 13:11:05,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-28 13:11:05,955 INFO L276 IsEmpty]: Start isEmpty. Operand 8109 states and 29535 transitions. [2018-11-28 13:11:05,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-28 13:11:05,961 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:11:05,961 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] [2018-11-28 13:11:05,961 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:11:05,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:11:05,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1909123070, now seen corresponding path program 2 times [2018-11-28 13:11:05,962 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:11:05,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:11:05,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:11:05,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:11:05,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:11:05,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:11:06,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:11:06,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:11:06,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-11-28 13:11:06,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-28 13:11:06,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-28 13:11:06,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2018-11-28 13:11:06,483 INFO L87 Difference]: Start difference. First operand 8109 states and 29535 transitions. Second operand 20 states. [2018-11-28 13:11:07,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:11:07,193 INFO L93 Difference]: Finished difference Result 9270 states and 33722 transitions. [2018-11-28 13:11:07,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-28 13:11:07,193 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 60 [2018-11-28 13:11:07,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:11:07,204 INFO L225 Difference]: With dead ends: 9270 [2018-11-28 13:11:07,204 INFO L226 Difference]: Without dead ends: 8793 [2018-11-28 13:11:07,205 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=174, Invalid=582, Unknown=0, NotChecked=0, Total=756 [2018-11-28 13:11:07,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8793 states. [2018-11-28 13:11:07,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8793 to 7893. [2018-11-28 13:11:07,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7893 states. [2018-11-28 13:11:07,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7893 states to 7893 states and 28711 transitions. [2018-11-28 13:11:07,291 INFO L78 Accepts]: Start accepts. Automaton has 7893 states and 28711 transitions. Word has length 60 [2018-11-28 13:11:07,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:11:07,291 INFO L480 AbstractCegarLoop]: Abstraction has 7893 states and 28711 transitions. [2018-11-28 13:11:07,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-28 13:11:07,291 INFO L276 IsEmpty]: Start isEmpty. Operand 7893 states and 28711 transitions. [2018-11-28 13:11:07,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-28 13:11:07,297 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:11:07,297 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] [2018-11-28 13:11:07,297 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:11:07,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:11:07,297 INFO L82 PathProgramCache]: Analyzing trace with hash -2058615640, now seen corresponding path program 1 times [2018-11-28 13:11:07,297 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:11:07,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:11:07,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:11:07,298 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:11:07,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:11:07,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:11:07,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:11:07,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:11:07,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-11-28 13:11:07,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-28 13:11:07,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-28 13:11:07,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2018-11-28 13:11:07,804 INFO L87 Difference]: Start difference. First operand 7893 states and 28711 transitions. Second operand 20 states. [2018-11-28 13:11:08,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:11:08,052 INFO L93 Difference]: Finished difference Result 8949 states and 32183 transitions. [2018-11-28 13:11:08,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 13:11:08,053 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 60 [2018-11-28 13:11:08,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:11:08,062 INFO L225 Difference]: With dead ends: 8949 [2018-11-28 13:11:08,063 INFO L226 Difference]: Without dead ends: 7509 [2018-11-28 13:11:08,063 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=148, Invalid=404, Unknown=0, NotChecked=0, Total=552 [2018-11-28 13:11:08,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7509 states. [2018-11-28 13:11:08,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7509 to 7509. [2018-11-28 13:11:08,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7509 states. [2018-11-28 13:11:08,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7509 states to 7509 states and 27191 transitions. [2018-11-28 13:11:08,139 INFO L78 Accepts]: Start accepts. Automaton has 7509 states and 27191 transitions. Word has length 60 [2018-11-28 13:11:08,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:11:08,140 INFO L480 AbstractCegarLoop]: Abstraction has 7509 states and 27191 transitions. [2018-11-28 13:11:08,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-28 13:11:08,140 INFO L276 IsEmpty]: Start isEmpty. Operand 7509 states and 27191 transitions. [2018-11-28 13:11:08,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-28 13:11:08,145 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:11:08,145 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] [2018-11-28 13:11:08,145 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:11:08,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:11:08,146 INFO L82 PathProgramCache]: Analyzing trace with hash -726446296, now seen corresponding path program 2 times [2018-11-28 13:11:08,146 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:11:08,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:11:08,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:11:08,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:11:08,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:11:08,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:11:08,356 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 29 [2018-11-28 13:11:08,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:11:08,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:11:08,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-11-28 13:11:08,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-28 13:11:08,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-28 13:11:08,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2018-11-28 13:11:08,761 INFO L87 Difference]: Start difference. First operand 7509 states and 27191 transitions. Second operand 20 states. [2018-11-28 13:11:09,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:11:09,017 INFO L93 Difference]: Finished difference Result 4917 states and 17063 transitions. [2018-11-28 13:11:09,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 13:11:09,018 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 60 [2018-11-28 13:11:09,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:11:09,022 INFO L225 Difference]: With dead ends: 4917 [2018-11-28 13:11:09,022 INFO L226 Difference]: Without dead ends: 3597 [2018-11-28 13:11:09,022 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=148, Invalid=404, Unknown=0, NotChecked=0, Total=552 [2018-11-28 13:11:09,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3597 states. [2018-11-28 13:11:09,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3597 to 3597. [2018-11-28 13:11:09,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3597 states. [2018-11-28 13:11:09,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3597 states to 3597 states and 12663 transitions. [2018-11-28 13:11:09,054 INFO L78 Accepts]: Start accepts. Automaton has 3597 states and 12663 transitions. Word has length 60 [2018-11-28 13:11:09,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:11:09,055 INFO L480 AbstractCegarLoop]: Abstraction has 3597 states and 12663 transitions. [2018-11-28 13:11:09,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-28 13:11:09,055 INFO L276 IsEmpty]: Start isEmpty. Operand 3597 states and 12663 transitions. [2018-11-28 13:11:09,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-28 13:11:09,057 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:11:09,057 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] [2018-11-28 13:11:09,057 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:11:09,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:11:09,057 INFO L82 PathProgramCache]: Analyzing trace with hash -894531326, now seen corresponding path program 3 times [2018-11-28 13:11:09,057 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:11:09,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:11:09,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:11:09,058 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:11:09,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:11:09,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:11:09,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:11:09,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:11:09,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-11-28 13:11:09,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-28 13:11:09,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-28 13:11:09,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2018-11-28 13:11:09,490 INFO L87 Difference]: Start difference. First operand 3597 states and 12663 transitions. Second operand 19 states. [2018-11-28 13:11:09,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:11:09,765 INFO L93 Difference]: Finished difference Result 4296 states and 14936 transitions. [2018-11-28 13:11:09,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 13:11:09,765 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 60 [2018-11-28 13:11:09,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:11:09,769 INFO L225 Difference]: With dead ends: 4296 [2018-11-28 13:11:09,769 INFO L226 Difference]: Without dead ends: 3549 [2018-11-28 13:11:09,769 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=135, Invalid=417, Unknown=0, NotChecked=0, Total=552 [2018-11-28 13:11:09,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3549 states. [2018-11-28 13:11:09,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3549 to 3549. [2018-11-28 13:11:09,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3549 states. [2018-11-28 13:11:09,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3549 states to 3549 states and 12499 transitions. [2018-11-28 13:11:09,802 INFO L78 Accepts]: Start accepts. Automaton has 3549 states and 12499 transitions. Word has length 60 [2018-11-28 13:11:09,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:11:09,802 INFO L480 AbstractCegarLoop]: Abstraction has 3549 states and 12499 transitions. [2018-11-28 13:11:09,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-28 13:11:09,802 INFO L276 IsEmpty]: Start isEmpty. Operand 3549 states and 12499 transitions. [2018-11-28 13:11:09,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-28 13:11:09,805 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:11:09,805 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] [2018-11-28 13:11:09,805 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:11:09,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:11:09,805 INFO L82 PathProgramCache]: Analyzing trace with hash 314196332, now seen corresponding path program 4 times [2018-11-28 13:11:09,805 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:11:09,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:11:09,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:11:09,806 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:11:09,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:11:09,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:11:10,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:11:10,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:11:10,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-11-28 13:11:10,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-28 13:11:10,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-28 13:11:10,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2018-11-28 13:11:10,358 INFO L87 Difference]: Start difference. First operand 3549 states and 12499 transitions. Second operand 19 states. [2018-11-28 13:11:10,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:11:10,591 INFO L93 Difference]: Finished difference Result 882 states and 2688 transitions. [2018-11-28 13:11:10,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 13:11:10,591 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 60 [2018-11-28 13:11:10,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:11:10,591 INFO L225 Difference]: With dead ends: 882 [2018-11-28 13:11:10,591 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 13:11:10,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2018-11-28 13:11:10,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 13:11:10,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 13:11:10,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 13:11:10,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 13:11:10,592 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 60 [2018-11-28 13:11:10,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:11:10,592 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 13:11:10,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-28 13:11:10,592 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 13:11:10,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 13:11:10,594 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-11-28 13:11:10,595 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 01:11:10 BasicIcfg [2018-11-28 13:11:10,595 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 13:11:10,595 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 13:11:10,595 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 13:11:10,595 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 13:11:10,595 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:10:14" (3/4) ... [2018-11-28 13:11:10,597 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 13:11:10,602 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread0 [2018-11-28 13:11:10,602 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2018-11-28 13:11:10,602 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2018-11-28 13:11:10,602 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2018-11-28 13:11:10,605 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-11-28 13:11:10,605 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-28 13:11:10,628 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_df24c9c1-07fe-4a40-abf0-d245cdaa9a65/bin-2019/uautomizer/witness.graphml [2018-11-28 13:11:10,628 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 13:11:10,629 INFO L168 Benchmark]: Toolchain (without parser) took 57162.95 ms. Allocated memory was 1.0 GB in the beginning and 4.7 GB in the end (delta: 3.6 GB). Free memory was 950.6 MB in the beginning and 2.9 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. [2018-11-28 13:11:10,629 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 13:11:10,629 INFO L168 Benchmark]: CACSL2BoogieTranslator took 504.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -140.6 MB). Peak memory consumption was 37.7 MB. Max. memory is 11.5 GB. [2018-11-28 13:11:10,630 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.93 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-28 13:11:10,630 INFO L168 Benchmark]: Boogie Preprocessor took 19.56 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. [2018-11-28 13:11:10,630 INFO L168 Benchmark]: RCFGBuilder took 317.13 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: 28.8 MB). Peak memory consumption was 28.8 MB. Max. memory is 11.5 GB. [2018-11-28 13:11:10,630 INFO L168 Benchmark]: TraceAbstraction took 56251.18 ms. Allocated memory was 1.2 GB in the beginning and 4.7 GB in the end (delta: 3.5 GB). Free memory was 1.1 GB in the beginning and 2.9 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. [2018-11-28 13:11:10,631 INFO L168 Benchmark]: Witness Printer took 33.10 ms. Allocated memory is still 4.7 GB. Free memory is still 2.9 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 13:11:10,632 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 504.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -140.6 MB). Peak memory consumption was 37.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 34.93 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.56 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 317.13 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: 28.8 MB). Peak memory consumption was 28.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 56251.18 ms. Allocated memory was 1.2 GB in the beginning and 4.7 GB in the end (delta: 3.5 GB). Free memory was 1.1 GB in the beginning and 2.9 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. * Witness Printer took 33.10 ms. Allocated memory is still 4.7 GB. Free memory is still 2.9 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1212]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 172 locations, 1 error locations. SAFE Result, 56.0s OverallTime, 33 OverallIterations, 1 TraceHistogramMax, 26.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6310 SDtfs, 18063 SDslu, 36552 SDs, 0 SdLazy, 14965 SolverSat, 2451 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 898 GetRequests, 98 SyntacticMatches, 44 SemanticMatches, 756 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3261 ImplicationChecksByTransitivity, 20.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60962occurred in iteration=0, 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: 14.8s AutomataMinimizationTime, 33 MinimizatonAttempts, 177045 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 10.7s InterpolantComputationTime, 1733 NumberOfCodeBlocks, 1733 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 1700 ConstructedInterpolants, 0 QuantifiedInterpolants, 1541418 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...