./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 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_0457a80b-e0b2-44a7-a548-36c102c0a654/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0457a80b-e0b2-44a7-a548-36c102c0a654/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0457a80b-e0b2-44a7-a548-36c102c0a654/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0457a80b-e0b2-44a7-a548-36c102c0a654/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_0457a80b-e0b2-44a7-a548-36c102c0a654/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0457a80b-e0b2-44a7-a548-36c102c0a654/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-635dfa2 [2018-12-03 01:03:45,856 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 01:03:45,857 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 01:03:45,863 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 01:03:45,863 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 01:03:45,864 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 01:03:45,864 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 01:03:45,865 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 01:03:45,866 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 01:03:45,866 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 01:03:45,866 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 01:03:45,867 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 01:03:45,867 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 01:03:45,868 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 01:03:45,868 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 01:03:45,868 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 01:03:45,869 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 01:03:45,870 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 01:03:45,870 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 01:03:45,871 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 01:03:45,872 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 01:03:45,872 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 01:03:45,873 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 01:03:45,873 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 01:03:45,873 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 01:03:45,874 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 01:03:45,874 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 01:03:45,875 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 01:03:45,875 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 01:03:45,875 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 01:03:45,876 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 01:03:45,876 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 01:03:45,876 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 01:03:45,876 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 01:03:45,877 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 01:03:45,877 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 01:03:45,877 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0457a80b-e0b2-44a7-a548-36c102c0a654/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-03 01:03:45,884 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 01:03:45,884 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 01:03:45,884 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 01:03:45,884 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 01:03:45,885 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 01:03:45,885 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 01:03:45,885 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 01:03:45,885 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 01:03:45,885 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 01:03:45,885 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 01:03:45,885 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 01:03:45,885 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 01:03:45,885 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 01:03:45,885 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 01:03:45,885 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 01:03:45,885 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 01:03:45,886 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 01:03:45,886 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-03 01:03:45,886 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 01:03:45,886 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 01:03:45,886 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 01:03:45,886 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-03 01:03:45,886 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 01:03:45,886 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 01:03:45,886 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 01:03:45,886 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 01:03:45,886 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 01:03:45,886 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-03 01:03:45,887 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 01:03:45,887 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 01:03:45,887 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_0457a80b-e0b2-44a7-a548-36c102c0a654/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-12-03 01:03:45,904 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 01:03:45,913 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 01:03:45,915 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 01:03:45,917 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-03 01:03:45,917 INFO L276 PluginConnector]: CDTParser initialized [2018-12-03 01:03:45,917 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0457a80b-e0b2-44a7-a548-36c102c0a654/bin-2019/uautomizer/../../sv-benchmarks/c/pthread/singleton_with-uninit-problems_true-unreach-call.i [2018-12-03 01:03:45,958 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0457a80b-e0b2-44a7-a548-36c102c0a654/bin-2019/uautomizer/data/645b0ac1a/5da45e5fb3ee481da7b262e0987a4f52/FLAG7cd924a0f [2018-12-03 01:03:46,311 INFO L307 CDTParser]: Found 1 translation units. [2018-12-03 01:03:46,312 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0457a80b-e0b2-44a7-a548-36c102c0a654/sv-benchmarks/c/pthread/singleton_with-uninit-problems_true-unreach-call.i [2018-12-03 01:03:46,323 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0457a80b-e0b2-44a7-a548-36c102c0a654/bin-2019/uautomizer/data/645b0ac1a/5da45e5fb3ee481da7b262e0987a4f52/FLAG7cd924a0f [2018-12-03 01:03:46,335 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0457a80b-e0b2-44a7-a548-36c102c0a654/bin-2019/uautomizer/data/645b0ac1a/5da45e5fb3ee481da7b262e0987a4f52 [2018-12-03 01:03:46,337 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 01:03:46,338 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-03 01:03:46,339 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-03 01:03:46,339 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-03 01:03:46,342 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-03 01:03:46,342 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 01:03:46" (1/1) ... [2018-12-03 01:03:46,344 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35e48869 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:03:46, skipping insertion in model container [2018-12-03 01:03:46,345 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 01:03:46" (1/1) ... [2018-12-03 01:03:46,350 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-03 01:03:46,376 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-03 01:03:46,620 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 01:03:46,660 INFO L191 MainTranslator]: Completed pre-run [2018-12-03 01:03:46,686 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 01:03:46,751 INFO L195 MainTranslator]: Completed translation [2018-12-03 01:03:46,751 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:03:46 WrapperNode [2018-12-03 01:03:46,751 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-03 01:03:46,752 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 01:03:46,752 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 01:03:46,752 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 01:03:46,757 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:03:46" (1/1) ... [2018-12-03 01:03:46,767 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:03:46" (1/1) ... [2018-12-03 01:03:46,779 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 01:03:46,779 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 01:03:46,779 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 01:03:46,779 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 01:03:46,784 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:03:46" (1/1) ... [2018-12-03 01:03:46,784 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:03:46" (1/1) ... [2018-12-03 01:03:46,786 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:03:46" (1/1) ... [2018-12-03 01:03:46,786 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:03:46" (1/1) ... [2018-12-03 01:03:46,790 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:03:46" (1/1) ... [2018-12-03 01:03:46,791 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:03:46" (1/1) ... [2018-12-03 01:03:46,792 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:03:46" (1/1) ... [2018-12-03 01:03:46,793 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 01:03:46,793 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 01:03:46,794 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 01:03:46,794 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 01:03:46,794 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:03:46" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0457a80b-e0b2-44a7-a548-36c102c0a654/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-12-03 01:03:46,824 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-03 01:03:46,824 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-03 01:03:46,824 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-03 01:03:46,825 INFO L130 BoogieDeclarations]: Found specification of procedure thread0 [2018-12-03 01:03:46,825 INFO L138 BoogieDeclarations]: Found implementation of procedure thread0 [2018-12-03 01:03:46,825 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2018-12-03 01:03:46,825 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2018-12-03 01:03:46,825 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2018-12-03 01:03:46,825 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2018-12-03 01:03:46,825 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2018-12-03 01:03:46,825 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2018-12-03 01:03:46,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-03 01:03:46,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 01:03:46,825 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 01:03:46,826 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-03 01:03:47,003 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 01:03:47,003 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-12-03 01:03:47,003 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 01:03:47 BoogieIcfgContainer [2018-12-03 01:03:47,003 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 01:03:47,004 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 01:03:47,004 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 01:03:47,005 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 01:03:47,005 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.12 01:03:46" (1/3) ... [2018-12-03 01:03:47,006 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75e535d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 01:03:47, skipping insertion in model container [2018-12-03 01:03:47,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:03:46" (2/3) ... [2018-12-03 01:03:47,006 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75e535d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 01:03:47, skipping insertion in model container [2018-12-03 01:03:47,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 01:03:47" (3/3) ... [2018-12-03 01:03:47,007 INFO L112 eAbstractionObserver]: Analyzing ICFG singleton_with-uninit-problems_true-unreach-call.i [2018-12-03 01:03:47,030 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:03:47,031 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:03:47,031 WARN L317 ript$VariableManager]: TermVariabe Thread2_thread0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:03:47,031 WARN L317 ript$VariableManager]: TermVariabe Thread2_thread0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:03:47,031 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:03:47,031 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:03:47,031 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:03:47,031 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:03:47,031 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:03:47,032 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:03:47,032 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:03:47,032 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:03:47,032 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:03:47,032 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:03:47,032 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:03:47,032 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:03:47,032 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~nondet1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:03:47,033 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:03:47,033 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:03:47,033 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:03:47,033 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:03:47,033 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:03:47,033 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:03:47,034 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:03:47,034 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:03:47,034 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:03:47,034 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:03:47,034 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:03:47,034 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:03:47,034 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:03:47,034 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:03:47,034 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:03:47,035 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:03:47,035 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:03:47,035 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:03:47,035 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:03:47,035 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:03:47,035 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:03:47,035 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:03:47,035 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:03:47,035 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:03:47,035 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:03:47,036 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:03:47,036 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:03:47,036 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:03:47,036 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:03:47,036 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:03:47,036 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:03:47,036 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:03:47,036 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:03:47,036 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:03:47,036 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:03:47,037 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:03:47,037 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:03:47,037 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:03:47,037 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:03:47,037 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:03:47,037 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:03:47,037 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:03:47,037 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:03:47,037 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:03:47,037 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:03:47,037 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:03:47,038 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:03:47,038 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:03:47,038 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:03:47,038 WARN L317 ript$VariableManager]: TermVariabe |Thread4_thread1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:03:47,038 WARN L317 ript$VariableManager]: TermVariabe |Thread4_thread1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:03:47,038 WARN L317 ript$VariableManager]: TermVariabe Thread4_thread1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:03:47,038 WARN L317 ript$VariableManager]: TermVariabe Thread4_thread1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:03:47,038 WARN L317 ript$VariableManager]: TermVariabe |Thread4_thread1_#t~malloc0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:03:47,039 WARN L317 ript$VariableManager]: TermVariabe |Thread4_thread1_#t~malloc0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:03:47,039 WARN L317 ript$VariableManager]: TermVariabe |Thread4_thread1_#t~malloc0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:03:47,039 WARN L317 ript$VariableManager]: TermVariabe |Thread4_thread1_#t~malloc0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:03:47,039 WARN L317 ript$VariableManager]: TermVariabe |Thread4_thread1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:03:47,039 WARN L317 ript$VariableManager]: TermVariabe |Thread4_thread1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:03:47,039 WARN L317 ript$VariableManager]: TermVariabe |Thread3_thread2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:03:47,039 WARN L317 ript$VariableManager]: TermVariabe |Thread3_thread2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:03:47,039 WARN L317 ript$VariableManager]: TermVariabe Thread3_thread2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:03:47,039 WARN L317 ript$VariableManager]: TermVariabe Thread3_thread2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:03:47,040 WARN L317 ript$VariableManager]: TermVariabe |Thread3_thread2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:03:47,040 WARN L317 ript$VariableManager]: TermVariabe |Thread3_thread2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:03:47,040 WARN L317 ript$VariableManager]: TermVariabe |Thread1_thread2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:03:47,040 WARN L317 ript$VariableManager]: TermVariabe |Thread1_thread2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:03:47,040 WARN L317 ript$VariableManager]: TermVariabe Thread1_thread2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:03:47,040 WARN L317 ript$VariableManager]: TermVariabe Thread1_thread2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:03:47,040 WARN L317 ript$VariableManager]: TermVariabe |Thread1_thread2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:03:47,040 WARN L317 ript$VariableManager]: TermVariabe |Thread1_thread2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:03:47,041 WARN L317 ript$VariableManager]: TermVariabe |Thread5_thread2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:03:47,041 WARN L317 ript$VariableManager]: TermVariabe |Thread5_thread2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:03:47,041 WARN L317 ript$VariableManager]: TermVariabe Thread5_thread2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:03:47,041 WARN L317 ript$VariableManager]: TermVariabe Thread5_thread2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:03:47,041 WARN L317 ript$VariableManager]: TermVariabe |Thread5_thread2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:03:47,041 WARN L317 ript$VariableManager]: TermVariabe |Thread5_thread2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:03:47,041 WARN L317 ript$VariableManager]: TermVariabe |Thread0_thread3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:03:47,041 WARN L317 ript$VariableManager]: TermVariabe |Thread0_thread3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:03:47,041 WARN L317 ript$VariableManager]: TermVariabe Thread0_thread3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:03:47,042 WARN L317 ript$VariableManager]: TermVariabe Thread0_thread3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:03:47,042 WARN L317 ript$VariableManager]: TermVariabe |Thread0_thread3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:03:47,042 WARN L317 ript$VariableManager]: TermVariabe |Thread0_thread3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:03:47,128 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-03 01:03:47,128 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 01:03:47,134 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 01:03:47,143 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 01:03:47,158 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-03 01:03:47,158 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 01:03:47,158 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 01:03:47,159 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 01:03:47,159 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 01:03:47,159 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 01:03:47,159 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 01:03:47,159 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 01:03:47,159 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 01:03:47,166 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 145places, 239 transitions [2018-12-03 01:03:50,211 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 60962 states. [2018-12-03 01:03:50,213 INFO L276 IsEmpty]: Start isEmpty. Operand 60962 states. [2018-12-03 01:03:50,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-03 01:03:50,219 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:03:50,220 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-12-03 01:03:50,221 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:03:50,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:03:50,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1451762756, now seen corresponding path program 1 times [2018-12-03 01:03:50,226 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 01:03:50,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 01:03:50,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:03:50,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:03:50,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:03:50,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:03:50,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:03:50,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:03:50,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 01:03:50,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 01:03:50,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 01:03:50,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:03:50,381 INFO L87 Difference]: Start difference. First operand 60962 states. Second operand 5 states. [2018-12-03 01:03:50,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:03:50,875 INFO L93 Difference]: Finished difference Result 90537 states and 379072 transitions. [2018-12-03 01:03:50,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 01:03:50,877 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-12-03 01:03:50,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:03:51,050 INFO L225 Difference]: With dead ends: 90537 [2018-12-03 01:03:51,050 INFO L226 Difference]: Without dead ends: 40487 [2018-12-03 01:03:51,051 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-12-03 01:03:51,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40487 states. [2018-12-03 01:03:51,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40487 to 40487. [2018-12-03 01:03:51,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40487 states. [2018-12-03 01:03:51,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40487 states to 40487 states and 173218 transitions. [2018-12-03 01:03:51,918 INFO L78 Accepts]: Start accepts. Automaton has 40487 states and 173218 transitions. Word has length 33 [2018-12-03 01:03:51,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:03:51,919 INFO L480 AbstractCegarLoop]: Abstraction has 40487 states and 173218 transitions. [2018-12-03 01:03:51,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 01:03:51,919 INFO L276 IsEmpty]: Start isEmpty. Operand 40487 states and 173218 transitions. [2018-12-03 01:03:51,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-03 01:03:51,921 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:03:51,921 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-12-03 01:03:51,921 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:03:51,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:03:51,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1742157727, now seen corresponding path program 1 times [2018-12-03 01:03:51,921 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 01:03:51,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 01:03:51,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:03:51,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:03:51,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:03:51,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:03:52,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:03:52,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:03:52,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-03 01:03:52,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 01:03:52,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 01:03:52,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-03 01:03:52,029 INFO L87 Difference]: Start difference. First operand 40487 states and 173218 transitions. Second operand 10 states. [2018-12-03 01:03:52,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:03:52,519 INFO L93 Difference]: Finished difference Result 47144 states and 204499 transitions. [2018-12-03 01:03:52,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 01:03:52,520 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2018-12-03 01:03:52,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:03:52,629 INFO L225 Difference]: With dead ends: 47144 [2018-12-03 01:03:52,629 INFO L226 Difference]: Without dead ends: 47144 [2018-12-03 01:03:52,630 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-12-03 01:03:52,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47144 states. [2018-12-03 01:03:53,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47144 to 40505. [2018-12-03 01:03:53,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40505 states. [2018-12-03 01:03:53,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40505 states to 40505 states and 173247 transitions. [2018-12-03 01:03:53,543 INFO L78 Accepts]: Start accepts. Automaton has 40505 states and 173247 transitions. Word has length 35 [2018-12-03 01:03:53,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:03:53,544 INFO L480 AbstractCegarLoop]: Abstraction has 40505 states and 173247 transitions. [2018-12-03 01:03:53,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 01:03:53,544 INFO L276 IsEmpty]: Start isEmpty. Operand 40505 states and 173247 transitions. [2018-12-03 01:03:53,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-03 01:03:53,545 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:03:53,545 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-12-03 01:03:53,545 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:03:53,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:03:53,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1856245215, now seen corresponding path program 2 times [2018-12-03 01:03:53,546 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 01:03:53,546 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 01:03:53,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:03:53,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:03:53,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:03:53,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:03:53,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:03:53,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:03:53,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-03 01:03:53,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 01:03:53,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 01:03:53,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-03 01:03:53,635 INFO L87 Difference]: Start difference. First operand 40505 states and 173247 transitions. Second operand 10 states. [2018-12-03 01:03:54,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:03:54,083 INFO L93 Difference]: Finished difference Result 53745 states and 235686 transitions. [2018-12-03 01:03:54,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 01:03:54,083 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2018-12-03 01:03:54,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:03:54,207 INFO L225 Difference]: With dead ends: 53745 [2018-12-03 01:03:54,207 INFO L226 Difference]: Without dead ends: 53745 [2018-12-03 01:03:54,208 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-12-03 01:03:54,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53745 states. [2018-12-03 01:03:54,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53745 to 40451. [2018-12-03 01:03:54,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40451 states. [2018-12-03 01:03:55,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40451 states to 40451 states and 173155 transitions. [2018-12-03 01:03:55,065 INFO L78 Accepts]: Start accepts. Automaton has 40451 states and 173155 transitions. Word has length 35 [2018-12-03 01:03:55,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:03:55,065 INFO L480 AbstractCegarLoop]: Abstraction has 40451 states and 173155 transitions. [2018-12-03 01:03:55,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 01:03:55,065 INFO L276 IsEmpty]: Start isEmpty. Operand 40451 states and 173155 transitions. [2018-12-03 01:03:55,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-03 01:03:55,074 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:03:55,074 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-12-03 01:03:55,074 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:03:55,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:03:55,074 INFO L82 PathProgramCache]: Analyzing trace with hash 864239609, now seen corresponding path program 1 times [2018-12-03 01:03:55,074 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 01:03:55,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 01:03:55,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:03:55,076 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 01:03:55,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:03:55,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:03:55,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:03:55,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:03:55,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 01:03:55,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 01:03:55,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 01:03:55,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:03:55,123 INFO L87 Difference]: Start difference. First operand 40451 states and 173155 transitions. Second operand 5 states. [2018-12-03 01:03:55,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:03:55,464 INFO L93 Difference]: Finished difference Result 74947 states and 314581 transitions. [2018-12-03 01:03:55,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 01:03:55,465 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-12-03 01:03:55,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:03:55,591 INFO L225 Difference]: With dead ends: 74947 [2018-12-03 01:03:55,592 INFO L226 Difference]: Without dead ends: 56513 [2018-12-03 01:03:55,592 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-12-03 01:03:55,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56513 states. [2018-12-03 01:03:56,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56513 to 40763. [2018-12-03 01:03:56,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40763 states. [2018-12-03 01:03:56,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40763 states to 40763 states and 169305 transitions. [2018-12-03 01:03:56,534 INFO L78 Accepts]: Start accepts. Automaton has 40763 states and 169305 transitions. Word has length 45 [2018-12-03 01:03:56,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:03:56,534 INFO L480 AbstractCegarLoop]: Abstraction has 40763 states and 169305 transitions. [2018-12-03 01:03:56,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 01:03:56,534 INFO L276 IsEmpty]: Start isEmpty. Operand 40763 states and 169305 transitions. [2018-12-03 01:03:56,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-03 01:03:56,548 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:03:56,548 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-12-03 01:03:56,548 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:03:56,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:03:56,548 INFO L82 PathProgramCache]: Analyzing trace with hash 238055866, now seen corresponding path program 1 times [2018-12-03 01:03:56,548 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 01:03:56,548 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 01:03:56,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:03:56,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:03:56,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:03:56,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:03:56,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:03:56,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:03:56,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-12-03 01:03:56,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 01:03:56,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 01:03:56,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2018-12-03 01:03:56,920 INFO L87 Difference]: Start difference. First operand 40763 states and 169305 transitions. Second operand 19 states. [2018-12-03 01:03:57,866 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2018-12-03 01:03:58,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:03:58,931 INFO L93 Difference]: Finished difference Result 58950 states and 239857 transitions. [2018-12-03 01:03:58,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 01:03:58,931 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 47 [2018-12-03 01:03:58,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:03:59,041 INFO L225 Difference]: With dead ends: 58950 [2018-12-03 01:03:59,041 INFO L226 Difference]: Without dead ends: 56542 [2018-12-03 01:03:59,042 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=248, Invalid=1084, Unknown=0, NotChecked=0, Total=1332 [2018-12-03 01:03:59,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56542 states. [2018-12-03 01:04:00,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56542 to 40733. [2018-12-03 01:04:00,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40733 states. [2018-12-03 01:04:00,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40733 states to 40733 states and 169201 transitions. [2018-12-03 01:04:00,726 INFO L78 Accepts]: Start accepts. Automaton has 40733 states and 169201 transitions. Word has length 47 [2018-12-03 01:04:00,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:04:00,726 INFO L480 AbstractCegarLoop]: Abstraction has 40733 states and 169201 transitions. [2018-12-03 01:04:00,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 01:04:00,726 INFO L276 IsEmpty]: Start isEmpty. Operand 40733 states and 169201 transitions. [2018-12-03 01:04:00,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-03 01:04:00,737 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:04:00,737 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-12-03 01:04:00,737 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:04:00,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:04:00,737 INFO L82 PathProgramCache]: Analyzing trace with hash 565489518, now seen corresponding path program 2 times [2018-12-03 01:04:00,737 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 01:04:00,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 01:04:00,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:04:00,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:04:00,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:04:00,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:04:00,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-12-03 01:04:00,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:04:00,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-03 01:04:00,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 01:04:00,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 01:04:00,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-03 01:04:00,804 INFO L87 Difference]: Start difference. First operand 40733 states and 169201 transitions. Second operand 9 states. [2018-12-03 01:04:01,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:04:01,208 INFO L93 Difference]: Finished difference Result 58841 states and 239535 transitions. [2018-12-03 01:04:01,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 01:04:01,209 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 47 [2018-12-03 01:04:01,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:04:01,322 INFO L225 Difference]: With dead ends: 58841 [2018-12-03 01:04:01,322 INFO L226 Difference]: Without dead ends: 56433 [2018-12-03 01:04:01,322 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2018-12-03 01:04:01,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56433 states. [2018-12-03 01:04:01,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56433 to 40658. [2018-12-03 01:04:01,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40658 states. [2018-12-03 01:04:02,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40658 states to 40658 states and 168991 transitions. [2018-12-03 01:04:02,057 INFO L78 Accepts]: Start accepts. Automaton has 40658 states and 168991 transitions. Word has length 47 [2018-12-03 01:04:02,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:04:02,057 INFO L480 AbstractCegarLoop]: Abstraction has 40658 states and 168991 transitions. [2018-12-03 01:04:02,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 01:04:02,057 INFO L276 IsEmpty]: Start isEmpty. Operand 40658 states and 168991 transitions. [2018-12-03 01:04:02,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-03 01:04:02,073 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:04:02,073 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-12-03 01:04:02,073 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:04:02,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:04:02,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1318988660, now seen corresponding path program 1 times [2018-12-03 01:04:02,074 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 01:04:02,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 01:04:02,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:04:02,075 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 01:04:02,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:04:02,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:04:02,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:04:02,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:04:02,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 01:04:02,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 01:04:02,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 01:04:02,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 01:04:02,123 INFO L87 Difference]: Start difference. First operand 40658 states and 168991 transitions. Second operand 7 states. [2018-12-03 01:04:02,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:04:02,507 INFO L93 Difference]: Finished difference Result 71197 states and 287728 transitions. [2018-12-03 01:04:02,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 01:04:02,507 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2018-12-03 01:04:02,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:04:02,598 INFO L225 Difference]: With dead ends: 71197 [2018-12-03 01:04:02,599 INFO L226 Difference]: Without dead ends: 48359 [2018-12-03 01:04:02,599 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-12-03 01:04:02,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48359 states. [2018-12-03 01:04:03,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48359 to 42374. [2018-12-03 01:04:03,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42374 states. [2018-12-03 01:04:03,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42374 states to 42374 states and 171196 transitions. [2018-12-03 01:04:03,388 INFO L78 Accepts]: Start accepts. Automaton has 42374 states and 171196 transitions. Word has length 48 [2018-12-03 01:04:03,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:04:03,389 INFO L480 AbstractCegarLoop]: Abstraction has 42374 states and 171196 transitions. [2018-12-03 01:04:03,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 01:04:03,389 INFO L276 IsEmpty]: Start isEmpty. Operand 42374 states and 171196 transitions. [2018-12-03 01:04:03,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-03 01:04:03,411 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:04:03,411 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-12-03 01:04:03,412 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:04:03,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:04:03,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1778320058, now seen corresponding path program 1 times [2018-12-03 01:04:03,412 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 01:04:03,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 01:04:03,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:04:03,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:04:03,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:04:03,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:04:03,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:04:03,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:04:03,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-03 01:04:03,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 01:04:03,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 01:04:03,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-12-03 01:04:03,554 INFO L87 Difference]: Start difference. First operand 42374 states and 171196 transitions. Second operand 13 states. [2018-12-03 01:04:03,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:04:03,984 INFO L93 Difference]: Finished difference Result 54161 states and 215849 transitions. [2018-12-03 01:04:03,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 01:04:03,984 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 50 [2018-12-03 01:04:03,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:04:04,084 INFO L225 Difference]: With dead ends: 54161 [2018-12-03 01:04:04,084 INFO L226 Difference]: Without dead ends: 50905 [2018-12-03 01:04:04,084 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-12-03 01:04:04,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50905 states. [2018-12-03 01:04:04,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50905 to 42044. [2018-12-03 01:04:04,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42044 states. [2018-12-03 01:04:04,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42044 states to 42044 states and 169930 transitions. [2018-12-03 01:04:04,770 INFO L78 Accepts]: Start accepts. Automaton has 42044 states and 169930 transitions. Word has length 50 [2018-12-03 01:04:04,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:04:04,770 INFO L480 AbstractCegarLoop]: Abstraction has 42044 states and 169930 transitions. [2018-12-03 01:04:04,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 01:04:04,770 INFO L276 IsEmpty]: Start isEmpty. Operand 42044 states and 169930 transitions. [2018-12-03 01:04:04,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-03 01:04:04,793 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:04:04,793 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-12-03 01:04:04,793 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:04:04,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:04:04,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1136732819, now seen corresponding path program 1 times [2018-12-03 01:04:04,793 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 01:04:04,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 01:04:04,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:04:04,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:04:04,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:04:04,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:04:05,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:04:05,086 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:04:05,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-12-03 01:04:05,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 01:04:05,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 01:04:05,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2018-12-03 01:04:05,087 INFO L87 Difference]: Start difference. First operand 42044 states and 169930 transitions. Second operand 17 states. [2018-12-03 01:04:05,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:04:05,873 INFO L93 Difference]: Finished difference Result 48342 states and 195029 transitions. [2018-12-03 01:04:05,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 01:04:05,873 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 50 [2018-12-03 01:04:05,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:04:06,089 INFO L225 Difference]: With dead ends: 48342 [2018-12-03 01:04:06,089 INFO L226 Difference]: Without dead ends: 47886 [2018-12-03 01:04:06,090 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-12-03 01:04:06,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47886 states. [2018-12-03 01:04:06,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47886 to 45629. [2018-12-03 01:04:06,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45629 states. [2018-12-03 01:04:06,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45629 states to 45629 states and 185453 transitions. [2018-12-03 01:04:06,737 INFO L78 Accepts]: Start accepts. Automaton has 45629 states and 185453 transitions. Word has length 50 [2018-12-03 01:04:06,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:04:06,737 INFO L480 AbstractCegarLoop]: Abstraction has 45629 states and 185453 transitions. [2018-12-03 01:04:06,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 01:04:06,737 INFO L276 IsEmpty]: Start isEmpty. Operand 45629 states and 185453 transitions. [2018-12-03 01:04:06,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-03 01:04:06,762 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:04:06,762 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-12-03 01:04:06,762 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:04:06,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:04:06,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1695764147, now seen corresponding path program 2 times [2018-12-03 01:04:06,763 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 01:04:06,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 01:04:06,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:04:06,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:04:06,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:04:06,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:04:06,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:04:06,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:04:06,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-03 01:04:06,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 01:04:06,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 01:04:06,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-12-03 01:04:06,920 INFO L87 Difference]: Start difference. First operand 45629 states and 185453 transitions. Second operand 14 states. [2018-12-03 01:04:07,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:04:07,409 INFO L93 Difference]: Finished difference Result 56333 states and 228138 transitions. [2018-12-03 01:04:07,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 01:04:07,409 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 50 [2018-12-03 01:04:07,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:04:07,520 INFO L225 Difference]: With dead ends: 56333 [2018-12-03 01:04:07,520 INFO L226 Difference]: Without dead ends: 55877 [2018-12-03 01:04:07,520 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2018-12-03 01:04:07,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55877 states. [2018-12-03 01:04:08,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55877 to 45508. [2018-12-03 01:04:08,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45508 states. [2018-12-03 01:04:08,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45508 states to 45508 states and 185108 transitions. [2018-12-03 01:04:08,271 INFO L78 Accepts]: Start accepts. Automaton has 45508 states and 185108 transitions. Word has length 50 [2018-12-03 01:04:08,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:04:08,271 INFO L480 AbstractCegarLoop]: Abstraction has 45508 states and 185108 transitions. [2018-12-03 01:04:08,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 01:04:08,271 INFO L276 IsEmpty]: Start isEmpty. Operand 45508 states and 185108 transitions. [2018-12-03 01:04:08,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-03 01:04:08,296 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:04:08,296 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-12-03 01:04:08,296 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:04:08,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:04:08,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1546975859, now seen corresponding path program 1 times [2018-12-03 01:04:08,297 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 01:04:08,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 01:04:08,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:04:08,298 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 01:04:08,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:04:08,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:04:08,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:04:08,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:04:08,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-03 01:04:08,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 01:04:08,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 01:04:08,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-12-03 01:04:08,366 INFO L87 Difference]: Start difference. First operand 45508 states and 185108 transitions. Second operand 11 states. [2018-12-03 01:04:08,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:04:08,776 INFO L93 Difference]: Finished difference Result 56707 states and 227522 transitions. [2018-12-03 01:04:08,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 01:04:08,777 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 50 [2018-12-03 01:04:08,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:04:08,875 INFO L225 Difference]: With dead ends: 56707 [2018-12-03 01:04:08,875 INFO L226 Difference]: Without dead ends: 51132 [2018-12-03 01:04:08,876 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-12-03 01:04:09,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51132 states. [2018-12-03 01:04:09,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51132 to 44908. [2018-12-03 01:04:09,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44908 states. [2018-12-03 01:04:09,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44908 states to 44908 states and 182813 transitions. [2018-12-03 01:04:09,707 INFO L78 Accepts]: Start accepts. Automaton has 44908 states and 182813 transitions. Word has length 50 [2018-12-03 01:04:09,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:04:09,708 INFO L480 AbstractCegarLoop]: Abstraction has 44908 states and 182813 transitions. [2018-12-03 01:04:09,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 01:04:09,708 INFO L276 IsEmpty]: Start isEmpty. Operand 44908 states and 182813 transitions. [2018-12-03 01:04:09,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-03 01:04:09,739 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:04:09,739 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-12-03 01:04:09,740 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:04:09,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:04:09,740 INFO L82 PathProgramCache]: Analyzing trace with hash -295598450, now seen corresponding path program 1 times [2018-12-03 01:04:09,740 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 01:04:09,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 01:04:09,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:04:09,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:04:09,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:04:09,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:04:10,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:04:10,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:04:10,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-12-03 01:04:10,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 01:04:10,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 01:04:10,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2018-12-03 01:04:10,134 INFO L87 Difference]: Start difference. First operand 44908 states and 182813 transitions. Second operand 17 states. [2018-12-03 01:04:11,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:04:11,484 INFO L93 Difference]: Finished difference Result 55621 states and 226438 transitions. [2018-12-03 01:04:11,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 01:04:11,484 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 52 [2018-12-03 01:04:11,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:04:11,592 INFO L225 Difference]: With dead ends: 55621 [2018-12-03 01:04:11,592 INFO L226 Difference]: Without dead ends: 55165 [2018-12-03 01:04:11,593 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-12-03 01:04:11,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55165 states. [2018-12-03 01:04:12,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55165 to 44721. [2018-12-03 01:04:12,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44721 states. [2018-12-03 01:04:12,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44721 states to 44721 states and 182302 transitions. [2018-12-03 01:04:12,331 INFO L78 Accepts]: Start accepts. Automaton has 44721 states and 182302 transitions. Word has length 52 [2018-12-03 01:04:12,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:04:12,332 INFO L480 AbstractCegarLoop]: Abstraction has 44721 states and 182302 transitions. [2018-12-03 01:04:12,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 01:04:12,332 INFO L276 IsEmpty]: Start isEmpty. Operand 44721 states and 182302 transitions. [2018-12-03 01:04:12,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-03 01:04:12,365 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:04:12,365 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-12-03 01:04:12,365 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:04:12,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:04:12,365 INFO L82 PathProgramCache]: Analyzing trace with hash 897864341, now seen corresponding path program 1 times [2018-12-03 01:04:12,365 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 01:04:12,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 01:04:12,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:04:12,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:04:12,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:04:12,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:04:12,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:04:12,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:04:12,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-12-03 01:04:12,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 01:04:12,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 01:04:12,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2018-12-03 01:04:12,532 INFO L87 Difference]: Start difference. First operand 44721 states and 182302 transitions. Second operand 15 states. [2018-12-03 01:04:12,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:04:12,986 INFO L93 Difference]: Finished difference Result 52211 states and 210162 transitions. [2018-12-03 01:04:12,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 01:04:12,986 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 53 [2018-12-03 01:04:12,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:04:13,067 INFO L225 Difference]: With dead ends: 52211 [2018-12-03 01:04:13,068 INFO L226 Difference]: Without dead ends: 43294 [2018-12-03 01:04:13,068 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=341, Unknown=0, NotChecked=0, Total=462 [2018-12-03 01:04:13,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43294 states. [2018-12-03 01:04:13,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43294 to 37956. [2018-12-03 01:04:13,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37956 states. [2018-12-03 01:04:13,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37956 states to 37956 states and 153296 transitions. [2018-12-03 01:04:13,822 INFO L78 Accepts]: Start accepts. Automaton has 37956 states and 153296 transitions. Word has length 53 [2018-12-03 01:04:13,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:04:13,822 INFO L480 AbstractCegarLoop]: Abstraction has 37956 states and 153296 transitions. [2018-12-03 01:04:13,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 01:04:13,822 INFO L276 IsEmpty]: Start isEmpty. Operand 37956 states and 153296 transitions. [2018-12-03 01:04:13,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-03 01:04:13,847 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:04:13,847 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-12-03 01:04:13,847 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:04:13,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:04:13,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1410636712, now seen corresponding path program 1 times [2018-12-03 01:04:13,848 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 01:04:13,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 01:04:13,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:04:13,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:04:13,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:04:13,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:04:13,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:04:13,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:04:13,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-03 01:04:13,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 01:04:13,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 01:04:13,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-12-03 01:04:13,945 INFO L87 Difference]: Start difference. First operand 37956 states and 153296 transitions. Second operand 13 states. [2018-12-03 01:04:14,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:04:14,438 INFO L93 Difference]: Finished difference Result 46513 states and 186428 transitions. [2018-12-03 01:04:14,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 01:04:14,439 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 53 [2018-12-03 01:04:14,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:04:14,510 INFO L225 Difference]: With dead ends: 46513 [2018-12-03 01:04:14,510 INFO L226 Difference]: Without dead ends: 38243 [2018-12-03 01:04:14,510 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-12-03 01:04:14,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38243 states. [2018-12-03 01:04:14,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38243 to 32694. [2018-12-03 01:04:14,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32694 states. [2018-12-03 01:04:15,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32694 states to 32694 states and 131852 transitions. [2018-12-03 01:04:15,031 INFO L78 Accepts]: Start accepts. Automaton has 32694 states and 131852 transitions. Word has length 53 [2018-12-03 01:04:15,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:04:15,031 INFO L480 AbstractCegarLoop]: Abstraction has 32694 states and 131852 transitions. [2018-12-03 01:04:15,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 01:04:15,031 INFO L276 IsEmpty]: Start isEmpty. Operand 32694 states and 131852 transitions. [2018-12-03 01:04:15,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-03 01:04:15,055 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:04:15,055 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-12-03 01:04:15,055 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:04:15,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:04:15,055 INFO L82 PathProgramCache]: Analyzing trace with hash -142833368, now seen corresponding path program 1 times [2018-12-03 01:04:15,056 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 01:04:15,056 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 01:04:15,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:04:15,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:04:15,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:04:15,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:04:15,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:04:15,424 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:04:15,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-12-03 01:04:15,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 01:04:15,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 01:04:15,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2018-12-03 01:04:15,425 INFO L87 Difference]: Start difference. First operand 32694 states and 131852 transitions. Second operand 19 states. [2018-12-03 01:04:16,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:04:16,298 INFO L93 Difference]: Finished difference Result 37734 states and 151509 transitions. [2018-12-03 01:04:16,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 01:04:16,298 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 55 [2018-12-03 01:04:16,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:04:16,365 INFO L225 Difference]: With dead ends: 37734 [2018-12-03 01:04:16,365 INFO L226 Difference]: Without dead ends: 37293 [2018-12-03 01:04:16,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=153, Invalid=549, Unknown=0, NotChecked=0, Total=702 [2018-12-03 01:04:16,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37293 states. [2018-12-03 01:04:16,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37293 to 34905. [2018-12-03 01:04:16,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34905 states. [2018-12-03 01:04:16,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34905 states to 34905 states and 140988 transitions. [2018-12-03 01:04:16,886 INFO L78 Accepts]: Start accepts. Automaton has 34905 states and 140988 transitions. Word has length 55 [2018-12-03 01:04:16,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:04:16,886 INFO L480 AbstractCegarLoop]: Abstraction has 34905 states and 140988 transitions. [2018-12-03 01:04:16,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 01:04:16,886 INFO L276 IsEmpty]: Start isEmpty. Operand 34905 states and 140988 transitions. [2018-12-03 01:04:16,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-03 01:04:16,914 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:04:16,914 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-12-03 01:04:16,914 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:04:16,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:04:16,915 INFO L82 PathProgramCache]: Analyzing trace with hash -51175185, now seen corresponding path program 1 times [2018-12-03 01:04:16,915 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 01:04:16,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 01:04:16,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:04:16,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:04:16,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:04:16,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:04:17,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:04:17,314 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:04:17,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-12-03 01:04:17,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 01:04:17,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 01:04:17,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2018-12-03 01:04:17,314 INFO L87 Difference]: Start difference. First operand 34905 states and 140988 transitions. Second operand 19 states. [2018-12-03 01:04:18,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:04:18,341 INFO L93 Difference]: Finished difference Result 38941 states and 156506 transitions. [2018-12-03 01:04:18,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 01:04:18,342 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 55 [2018-12-03 01:04:18,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:04:18,411 INFO L225 Difference]: With dead ends: 38941 [2018-12-03 01:04:18,411 INFO L226 Difference]: Without dead ends: 38614 [2018-12-03 01:04:18,411 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=178, Invalid=634, Unknown=0, NotChecked=0, Total=812 [2018-12-03 01:04:18,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38614 states. [2018-12-03 01:04:18,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38614 to 34635. [2018-12-03 01:04:18,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34635 states. [2018-12-03 01:04:18,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34635 states to 34635 states and 139908 transitions. [2018-12-03 01:04:18,947 INFO L78 Accepts]: Start accepts. Automaton has 34635 states and 139908 transitions. Word has length 55 [2018-12-03 01:04:18,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:04:18,947 INFO L480 AbstractCegarLoop]: Abstraction has 34635 states and 139908 transitions. [2018-12-03 01:04:18,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 01:04:18,948 INFO L276 IsEmpty]: Start isEmpty. Operand 34635 states and 139908 transitions. [2018-12-03 01:04:18,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-03 01:04:18,981 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:04:18,981 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-12-03 01:04:18,981 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:04:18,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:04:18,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1740514353, now seen corresponding path program 2 times [2018-12-03 01:04:18,981 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 01:04:18,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 01:04:18,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:04:18,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:04:18,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:04:18,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:04:19,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:04:19,543 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:04:19,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-12-03 01:04:19,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 01:04:19,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 01:04:19,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2018-12-03 01:04:19,543 INFO L87 Difference]: Start difference. First operand 34635 states and 139908 transitions. Second operand 19 states. [2018-12-03 01:04:21,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:04:21,096 INFO L93 Difference]: Finished difference Result 39529 states and 158826 transitions. [2018-12-03 01:04:21,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 01:04:21,096 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 55 [2018-12-03 01:04:21,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:04:21,167 INFO L225 Difference]: With dead ends: 39529 [2018-12-03 01:04:21,167 INFO L226 Difference]: Without dead ends: 39082 [2018-12-03 01:04:21,167 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=237, Invalid=953, Unknown=0, NotChecked=0, Total=1190 [2018-12-03 01:04:21,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39082 states. [2018-12-03 01:04:21,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39082 to 34575. [2018-12-03 01:04:21,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34575 states. [2018-12-03 01:04:21,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34575 states to 34575 states and 139640 transitions. [2018-12-03 01:04:21,713 INFO L78 Accepts]: Start accepts. Automaton has 34575 states and 139640 transitions. Word has length 55 [2018-12-03 01:04:21,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:04:21,713 INFO L480 AbstractCegarLoop]: Abstraction has 34575 states and 139640 transitions. [2018-12-03 01:04:21,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 01:04:21,713 INFO L276 IsEmpty]: Start isEmpty. Operand 34575 states and 139640 transitions. [2018-12-03 01:04:21,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-03 01:04:21,741 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:04:21,741 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-12-03 01:04:21,741 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:04:21,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:04:21,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1858563217, now seen corresponding path program 3 times [2018-12-03 01:04:21,742 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 01:04:21,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 01:04:21,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:04:21,743 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 01:04:21,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:04:21,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:04:22,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:04:22,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:04:22,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-12-03 01:04:22,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 01:04:22,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 01:04:22,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2018-12-03 01:04:22,158 INFO L87 Difference]: Start difference. First operand 34575 states and 139640 transitions. Second operand 18 states. [2018-12-03 01:04:24,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:04:24,136 INFO L93 Difference]: Finished difference Result 39179 states and 157389 transitions. [2018-12-03 01:04:24,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 01:04:24,136 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 55 [2018-12-03 01:04:24,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:04:24,205 INFO L225 Difference]: With dead ends: 39179 [2018-12-03 01:04:24,205 INFO L226 Difference]: Without dead ends: 38714 [2018-12-03 01:04:24,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=190, Invalid=740, Unknown=0, NotChecked=0, Total=930 [2018-12-03 01:04:24,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38714 states. [2018-12-03 01:04:24,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38714 to 34551. [2018-12-03 01:04:24,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34551 states. [2018-12-03 01:04:24,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34551 states to 34551 states and 139552 transitions. [2018-12-03 01:04:24,742 INFO L78 Accepts]: Start accepts. Automaton has 34551 states and 139552 transitions. Word has length 55 [2018-12-03 01:04:24,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:04:24,742 INFO L480 AbstractCegarLoop]: Abstraction has 34551 states and 139552 transitions. [2018-12-03 01:04:24,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 01:04:24,742 INFO L276 IsEmpty]: Start isEmpty. Operand 34551 states and 139552 transitions. [2018-12-03 01:04:24,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-03 01:04:24,770 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:04:24,770 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-12-03 01:04:24,770 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:04:24,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:04:24,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1655779279, now seen corresponding path program 4 times [2018-12-03 01:04:24,771 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 01:04:24,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 01:04:24,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:04:24,772 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 01:04:24,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:04:24,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:04:25,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:04:25,143 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:04:25,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-12-03 01:04:25,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 01:04:25,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 01:04:25,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2018-12-03 01:04:25,144 INFO L87 Difference]: Start difference. First operand 34551 states and 139552 transitions. Second operand 18 states. [2018-12-03 01:04:26,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:04:26,239 INFO L93 Difference]: Finished difference Result 41153 states and 164986 transitions. [2018-12-03 01:04:26,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-03 01:04:26,240 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 55 [2018-12-03 01:04:26,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:04:26,313 INFO L225 Difference]: With dead ends: 41153 [2018-12-03 01:04:26,313 INFO L226 Difference]: Without dead ends: 40688 [2018-12-03 01:04:26,314 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-12-03 01:04:26,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40688 states. [2018-12-03 01:04:26,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40688 to 32997. [2018-12-03 01:04:26,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32997 states. [2018-12-03 01:04:26,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32997 states to 32997 states and 133345 transitions. [2018-12-03 01:04:26,847 INFO L78 Accepts]: Start accepts. Automaton has 32997 states and 133345 transitions. Word has length 55 [2018-12-03 01:04:26,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:04:26,847 INFO L480 AbstractCegarLoop]: Abstraction has 32997 states and 133345 transitions. [2018-12-03 01:04:26,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 01:04:26,847 INFO L276 IsEmpty]: Start isEmpty. Operand 32997 states and 133345 transitions. [2018-12-03 01:04:26,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-03 01:04:26,871 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:04:26,871 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-12-03 01:04:26,872 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:04:26,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:04:26,872 INFO L82 PathProgramCache]: Analyzing trace with hash 2007864715, now seen corresponding path program 1 times [2018-12-03 01:04:26,872 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 01:04:26,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 01:04:26,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:04:26,873 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 01:04:26,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:04:26,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:04:27,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:04:27,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:04:27,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-12-03 01:04:27,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 01:04:27,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 01:04:27,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2018-12-03 01:04:27,360 INFO L87 Difference]: Start difference. First operand 32997 states and 133345 transitions. Second operand 18 states. [2018-12-03 01:04:27,870 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 44 [2018-12-03 01:04:28,190 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 63 [2018-12-03 01:04:28,425 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 61 [2018-12-03 01:04:28,557 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 61 [2018-12-03 01:04:28,705 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 66 [2018-12-03 01:04:28,893 WARN L180 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 65 [2018-12-03 01:04:29,328 WARN L180 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 66 [2018-12-03 01:04:29,499 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 64 [2018-12-03 01:04:29,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:04:29,921 INFO L93 Difference]: Finished difference Result 32175 states and 127243 transitions. [2018-12-03 01:04:29,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 01:04:29,921 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 55 [2018-12-03 01:04:29,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:04:29,975 INFO L225 Difference]: With dead ends: 32175 [2018-12-03 01:04:29,975 INFO L226 Difference]: Without dead ends: 31245 [2018-12-03 01:04:29,975 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2018-12-03 01:04:30,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31245 states. [2018-12-03 01:04:30,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31245 to 24269. [2018-12-03 01:04:30,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24269 states. [2018-12-03 01:04:30,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24269 states to 24269 states and 95867 transitions. [2018-12-03 01:04:30,368 INFO L78 Accepts]: Start accepts. Automaton has 24269 states and 95867 transitions. Word has length 55 [2018-12-03 01:04:30,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:04:30,368 INFO L480 AbstractCegarLoop]: Abstraction has 24269 states and 95867 transitions. [2018-12-03 01:04:30,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 01:04:30,368 INFO L276 IsEmpty]: Start isEmpty. Operand 24269 states and 95867 transitions. [2018-12-03 01:04:30,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-03 01:04:30,387 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:04:30,387 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-12-03 01:04:30,388 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:04:30,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:04:30,388 INFO L82 PathProgramCache]: Analyzing trace with hash -406541239, now seen corresponding path program 1 times [2018-12-03 01:04:30,388 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 01:04:30,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 01:04:30,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:04:30,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:04:30,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:04:30,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:04:30,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:04:30,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:04:30,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-12-03 01:04:30,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 01:04:30,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 01:04:30,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2018-12-03 01:04:30,719 INFO L87 Difference]: Start difference. First operand 24269 states and 95867 transitions. Second operand 19 states. [2018-12-03 01:04:31,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:04:31,482 INFO L93 Difference]: Finished difference Result 27222 states and 106645 transitions. [2018-12-03 01:04:31,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 01:04:31,482 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 55 [2018-12-03 01:04:31,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:04:31,527 INFO L225 Difference]: With dead ends: 27222 [2018-12-03 01:04:31,528 INFO L226 Difference]: Without dead ends: 26325 [2018-12-03 01:04:31,528 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=182, Invalid=630, Unknown=0, NotChecked=0, Total=812 [2018-12-03 01:04:31,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26325 states. [2018-12-03 01:04:31,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26325 to 25025. [2018-12-03 01:04:31,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25025 states. [2018-12-03 01:04:31,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25025 states to 25025 states and 98727 transitions. [2018-12-03 01:04:31,906 INFO L78 Accepts]: Start accepts. Automaton has 25025 states and 98727 transitions. Word has length 55 [2018-12-03 01:04:31,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:04:31,906 INFO L480 AbstractCegarLoop]: Abstraction has 25025 states and 98727 transitions. [2018-12-03 01:04:31,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 01:04:31,906 INFO L276 IsEmpty]: Start isEmpty. Operand 25025 states and 98727 transitions. [2018-12-03 01:04:31,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-03 01:04:31,927 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:04:31,927 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-12-03 01:04:31,927 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:04:31,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:04:31,927 INFO L82 PathProgramCache]: Analyzing trace with hash -513722103, now seen corresponding path program 2 times [2018-12-03 01:04:31,927 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 01:04:31,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 01:04:31,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:04:31,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:04:31,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:04:31,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:04:32,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:04:32,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:04:32,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-12-03 01:04:32,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 01:04:32,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 01:04:32,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2018-12-03 01:04:32,185 INFO L87 Difference]: Start difference. First operand 25025 states and 98727 transitions. Second operand 16 states. [2018-12-03 01:04:32,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:04:32,578 INFO L93 Difference]: Finished difference Result 30553 states and 119704 transitions. [2018-12-03 01:04:32,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 01:04:32,579 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 55 [2018-12-03 01:04:32,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:04:32,630 INFO L225 Difference]: With dead ends: 30553 [2018-12-03 01:04:32,630 INFO L226 Difference]: Without dead ends: 29656 [2018-12-03 01:04:32,630 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=156, Invalid=444, Unknown=0, NotChecked=0, Total=600 [2018-12-03 01:04:32,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29656 states. [2018-12-03 01:04:32,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29656 to 25173. [2018-12-03 01:04:32,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25173 states. [2018-12-03 01:04:33,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25173 states to 25173 states and 99424 transitions. [2018-12-03 01:04:33,024 INFO L78 Accepts]: Start accepts. Automaton has 25173 states and 99424 transitions. Word has length 55 [2018-12-03 01:04:33,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:04:33,024 INFO L480 AbstractCegarLoop]: Abstraction has 25173 states and 99424 transitions. [2018-12-03 01:04:33,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 01:04:33,024 INFO L276 IsEmpty]: Start isEmpty. Operand 25173 states and 99424 transitions. [2018-12-03 01:04:33,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-03 01:04:33,044 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:04:33,044 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-12-03 01:04:33,044 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:04:33,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:04:33,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1109025908, now seen corresponding path program 2 times [2018-12-03 01:04:33,045 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 01:04:33,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 01:04:33,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:04:33,046 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 01:04:33,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:04:33,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:04:33,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:04:33,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:04:33,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-03 01:04:33,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 01:04:33,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 01:04:33,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-12-03 01:04:33,110 INFO L87 Difference]: Start difference. First operand 25173 states and 99424 transitions. Second operand 10 states. [2018-12-03 01:04:33,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:04:33,364 INFO L93 Difference]: Finished difference Result 28345 states and 110953 transitions. [2018-12-03 01:04:33,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 01:04:33,365 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2018-12-03 01:04:33,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:04:33,412 INFO L225 Difference]: With dead ends: 28345 [2018-12-03 01:04:33,412 INFO L226 Difference]: Without dead ends: 27421 [2018-12-03 01:04:33,413 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2018-12-03 01:04:33,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27421 states. [2018-12-03 01:04:33,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27421 to 23789. [2018-12-03 01:04:33,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23789 states. [2018-12-03 01:04:33,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23789 states to 23789 states and 94227 transitions. [2018-12-03 01:04:33,763 INFO L78 Accepts]: Start accepts. Automaton has 23789 states and 94227 transitions. Word has length 55 [2018-12-03 01:04:33,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:04:33,763 INFO L480 AbstractCegarLoop]: Abstraction has 23789 states and 94227 transitions. [2018-12-03 01:04:33,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 01:04:33,763 INFO L276 IsEmpty]: Start isEmpty. Operand 23789 states and 94227 transitions. [2018-12-03 01:04:33,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-03 01:04:33,782 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:04:33,782 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-12-03 01:04:33,782 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:04:33,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:04:33,782 INFO L82 PathProgramCache]: Analyzing trace with hash 506208263, now seen corresponding path program 1 times [2018-12-03 01:04:33,782 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 01:04:33,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 01:04:33,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:04:33,783 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 01:04:33,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:04:33,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:04:34,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:04:34,293 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:04:34,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-12-03 01:04:34,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 01:04:34,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 01:04:34,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2018-12-03 01:04:34,294 INFO L87 Difference]: Start difference. First operand 23789 states and 94227 transitions. Second operand 20 states. [2018-12-03 01:04:35,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:04:35,200 INFO L93 Difference]: Finished difference Result 21753 states and 85053 transitions. [2018-12-03 01:04:35,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 01:04:35,200 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 57 [2018-12-03 01:04:35,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:04:35,232 INFO L225 Difference]: With dead ends: 21753 [2018-12-03 01:04:35,232 INFO L226 Difference]: Without dead ends: 20493 [2018-12-03 01:04:35,232 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=165, Invalid=537, Unknown=0, NotChecked=0, Total=702 [2018-12-03 01:04:35,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20493 states. [2018-12-03 01:04:35,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20493 to 17871. [2018-12-03 01:04:35,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17871 states. [2018-12-03 01:04:35,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17871 states to 17871 states and 69982 transitions. [2018-12-03 01:04:35,485 INFO L78 Accepts]: Start accepts. Automaton has 17871 states and 69982 transitions. Word has length 57 [2018-12-03 01:04:35,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:04:35,485 INFO L480 AbstractCegarLoop]: Abstraction has 17871 states and 69982 transitions. [2018-12-03 01:04:35,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 01:04:35,485 INFO L276 IsEmpty]: Start isEmpty. Operand 17871 states and 69982 transitions. [2018-12-03 01:04:35,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-03 01:04:35,500 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:04:35,500 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-12-03 01:04:35,500 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:04:35,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:04:35,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1231209688, now seen corresponding path program 1 times [2018-12-03 01:04:35,501 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 01:04:35,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 01:04:35,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:04:35,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:04:35,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:04:35,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:04:35,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:04:35,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:04:35,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-12-03 01:04:35,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 01:04:35,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 01:04:35,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2018-12-03 01:04:35,947 INFO L87 Difference]: Start difference. First operand 17871 states and 69982 transitions. Second operand 19 states. [2018-12-03 01:04:36,752 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 58 [2018-12-03 01:04:36,874 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 59 [2018-12-03 01:04:37,225 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 61 [2018-12-03 01:04:37,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:04:37,508 INFO L93 Difference]: Finished difference Result 25528 states and 98380 transitions. [2018-12-03 01:04:37,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 01:04:37,509 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 57 [2018-12-03 01:04:37,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:04:37,544 INFO L225 Difference]: With dead ends: 25528 [2018-12-03 01:04:37,544 INFO L226 Difference]: Without dead ends: 22783 [2018-12-03 01:04:37,545 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=273, Invalid=849, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 01:04:37,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22783 states. [2018-12-03 01:04:37,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22783 to 13889. [2018-12-03 01:04:37,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13889 states. [2018-12-03 01:04:37,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13889 states to 13889 states and 53786 transitions. [2018-12-03 01:04:37,787 INFO L78 Accepts]: Start accepts. Automaton has 13889 states and 53786 transitions. Word has length 57 [2018-12-03 01:04:37,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:04:37,787 INFO L480 AbstractCegarLoop]: Abstraction has 13889 states and 53786 transitions. [2018-12-03 01:04:37,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 01:04:37,788 INFO L276 IsEmpty]: Start isEmpty. Operand 13889 states and 53786 transitions. [2018-12-03 01:04:37,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-03 01:04:37,801 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:04:37,801 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-12-03 01:04:37,801 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:04:37,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:04:37,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1637424555, now seen corresponding path program 1 times [2018-12-03 01:04:37,801 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 01:04:37,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 01:04:37,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:04:37,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:04:37,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:04:37,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:04:38,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:04:38,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:04:38,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-12-03 01:04:38,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 01:04:38,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 01:04:38,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2018-12-03 01:04:38,133 INFO L87 Difference]: Start difference. First operand 13889 states and 53786 transitions. Second operand 19 states. [2018-12-03 01:04:38,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:04:38,772 INFO L93 Difference]: Finished difference Result 18233 states and 70178 transitions. [2018-12-03 01:04:38,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 01:04:38,772 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 58 [2018-12-03 01:04:38,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:04:38,794 INFO L225 Difference]: With dead ends: 18233 [2018-12-03 01:04:38,794 INFO L226 Difference]: Without dead ends: 14273 [2018-12-03 01:04:38,795 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=197, Invalid=559, Unknown=0, NotChecked=0, Total=756 [2018-12-03 01:04:38,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14273 states. [2018-12-03 01:04:38,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14273 to 11633. [2018-12-03 01:04:38,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11633 states. [2018-12-03 01:04:38,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11633 states to 11633 states and 43674 transitions. [2018-12-03 01:04:38,950 INFO L78 Accepts]: Start accepts. Automaton has 11633 states and 43674 transitions. Word has length 58 [2018-12-03 01:04:38,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:04:38,950 INFO L480 AbstractCegarLoop]: Abstraction has 11633 states and 43674 transitions. [2018-12-03 01:04:38,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 01:04:38,951 INFO L276 IsEmpty]: Start isEmpty. Operand 11633 states and 43674 transitions. [2018-12-03 01:04:38,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-03 01:04:38,960 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:04:38,960 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-12-03 01:04:38,960 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:04:38,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:04:38,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1019541803, now seen corresponding path program 2 times [2018-12-03 01:04:38,960 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 01:04:38,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 01:04:38,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:04:38,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:04:38,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:04:38,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:04:39,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:04:39,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:04:39,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-12-03 01:04:39,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 01:04:39,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 01:04:39,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2018-12-03 01:04:39,469 INFO L87 Difference]: Start difference. First operand 11633 states and 43674 transitions. Second operand 16 states. [2018-12-03 01:04:40,088 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 51 [2018-12-03 01:04:40,661 WARN L180 SmtUtils]: Spent 479.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 69 [2018-12-03 01:04:41,255 WARN L180 SmtUtils]: Spent 566.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 75 [2018-12-03 01:04:41,731 WARN L180 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 79 [2018-12-03 01:04:42,423 WARN L180 SmtUtils]: Spent 530.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 85 [2018-12-03 01:04:43,015 WARN L180 SmtUtils]: Spent 502.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 82 [2018-12-03 01:04:43,737 WARN L180 SmtUtils]: Spent 604.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 88 [2018-12-03 01:04:44,393 WARN L180 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 91 [2018-12-03 01:04:44,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:04:44,544 INFO L93 Difference]: Finished difference Result 10553 states and 38610 transitions. [2018-12-03 01:04:44,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 01:04:44,545 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 58 [2018-12-03 01:04:44,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:04:44,558 INFO L225 Difference]: With dead ends: 10553 [2018-12-03 01:04:44,558 INFO L226 Difference]: Without dead ends: 9063 [2018-12-03 01:04:44,558 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=276, Invalid=914, Unknown=0, NotChecked=0, Total=1190 [2018-12-03 01:04:44,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9063 states. [2018-12-03 01:04:44,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9063 to 9063. [2018-12-03 01:04:44,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9063 states. [2018-12-03 01:04:44,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9063 states to 9063 states and 33711 transitions. [2018-12-03 01:04:44,662 INFO L78 Accepts]: Start accepts. Automaton has 9063 states and 33711 transitions. Word has length 58 [2018-12-03 01:04:44,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:04:44,662 INFO L480 AbstractCegarLoop]: Abstraction has 9063 states and 33711 transitions. [2018-12-03 01:04:44,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 01:04:44,662 INFO L276 IsEmpty]: Start isEmpty. Operand 9063 states and 33711 transitions. [2018-12-03 01:04:44,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-03 01:04:44,670 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:04:44,670 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-12-03 01:04:44,670 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:04:44,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:04:44,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1171302596, now seen corresponding path program 1 times [2018-12-03 01:04:44,671 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 01:04:44,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 01:04:44,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:04:44,672 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 01:04:44,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:04:44,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:04:45,146 WARN L180 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 31 [2018-12-03 01:04:45,333 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 36 [2018-12-03 01:04:45,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:04:45,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:04:45,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-12-03 01:04:45,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 01:04:45,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 01:04:45,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2018-12-03 01:04:45,566 INFO L87 Difference]: Start difference. First operand 9063 states and 33711 transitions. Second operand 21 states. [2018-12-03 01:04:46,023 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 49 [2018-12-03 01:04:46,242 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2018-12-03 01:04:46,455 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2018-12-03 01:04:46,843 WARN L180 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2018-12-03 01:04:47,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:04:47,113 INFO L93 Difference]: Finished difference Result 10116 states and 37492 transitions. [2018-12-03 01:04:47,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 01:04:47,114 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 60 [2018-12-03 01:04:47,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:04:47,125 INFO L225 Difference]: With dead ends: 10116 [2018-12-03 01:04:47,125 INFO L226 Difference]: Without dead ends: 8685 [2018-12-03 01:04:47,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=169, Invalid=643, Unknown=0, NotChecked=0, Total=812 [2018-12-03 01:04:47,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8685 states. [2018-12-03 01:04:47,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8685 to 8109. [2018-12-03 01:04:47,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8109 states. [2018-12-03 01:04:47,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8109 states to 8109 states and 29535 transitions. [2018-12-03 01:04:47,220 INFO L78 Accepts]: Start accepts. Automaton has 8109 states and 29535 transitions. Word has length 60 [2018-12-03 01:04:47,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:04:47,220 INFO L480 AbstractCegarLoop]: Abstraction has 8109 states and 29535 transitions. [2018-12-03 01:04:47,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 01:04:47,220 INFO L276 IsEmpty]: Start isEmpty. Operand 8109 states and 29535 transitions. [2018-12-03 01:04:47,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-03 01:04:47,227 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:04:47,227 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-12-03 01:04:47,227 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:04:47,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:04:47,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1909123070, now seen corresponding path program 2 times [2018-12-03 01:04:47,228 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 01:04:47,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 01:04:47,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:04:47,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:04:47,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:04:47,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:04:47,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:04:47,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:04:47,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-12-03 01:04:47,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 01:04:47,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 01:04:47,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2018-12-03 01:04:47,833 INFO L87 Difference]: Start difference. First operand 8109 states and 29535 transitions. Second operand 20 states. [2018-12-03 01:04:48,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:04:48,589 INFO L93 Difference]: Finished difference Result 9270 states and 33722 transitions. [2018-12-03 01:04:48,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 01:04:48,590 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 60 [2018-12-03 01:04:48,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:04:48,601 INFO L225 Difference]: With dead ends: 9270 [2018-12-03 01:04:48,601 INFO L226 Difference]: Without dead ends: 8793 [2018-12-03 01:04:48,602 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=174, Invalid=582, Unknown=0, NotChecked=0, Total=756 [2018-12-03 01:04:48,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8793 states. [2018-12-03 01:04:48,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8793 to 7893. [2018-12-03 01:04:48,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7893 states. [2018-12-03 01:04:48,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7893 states to 7893 states and 28711 transitions. [2018-12-03 01:04:48,695 INFO L78 Accepts]: Start accepts. Automaton has 7893 states and 28711 transitions. Word has length 60 [2018-12-03 01:04:48,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:04:48,695 INFO L480 AbstractCegarLoop]: Abstraction has 7893 states and 28711 transitions. [2018-12-03 01:04:48,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 01:04:48,695 INFO L276 IsEmpty]: Start isEmpty. Operand 7893 states and 28711 transitions. [2018-12-03 01:04:48,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-03 01:04:48,701 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:04:48,701 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-12-03 01:04:48,701 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:04:48,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:04:48,702 INFO L82 PathProgramCache]: Analyzing trace with hash -2058615640, now seen corresponding path program 1 times [2018-12-03 01:04:48,702 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 01:04:48,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 01:04:48,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:04:48,703 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 01:04:48,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:04:48,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:04:49,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:04:49,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:04:49,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-12-03 01:04:49,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 01:04:49,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 01:04:49,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2018-12-03 01:04:49,145 INFO L87 Difference]: Start difference. First operand 7893 states and 28711 transitions. Second operand 20 states. [2018-12-03 01:04:49,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:04:49,418 INFO L93 Difference]: Finished difference Result 8949 states and 32183 transitions. [2018-12-03 01:04:49,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 01:04:49,418 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 60 [2018-12-03 01:04:49,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:04:49,429 INFO L225 Difference]: With dead ends: 8949 [2018-12-03 01:04:49,429 INFO L226 Difference]: Without dead ends: 7509 [2018-12-03 01:04:49,429 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-12-03 01:04:49,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7509 states. [2018-12-03 01:04:49,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7509 to 7509. [2018-12-03 01:04:49,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7509 states. [2018-12-03 01:04:49,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7509 states to 7509 states and 27191 transitions. [2018-12-03 01:04:49,511 INFO L78 Accepts]: Start accepts. Automaton has 7509 states and 27191 transitions. Word has length 60 [2018-12-03 01:04:49,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:04:49,511 INFO L480 AbstractCegarLoop]: Abstraction has 7509 states and 27191 transitions. [2018-12-03 01:04:49,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 01:04:49,511 INFO L276 IsEmpty]: Start isEmpty. Operand 7509 states and 27191 transitions. [2018-12-03 01:04:49,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-03 01:04:49,517 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:04:49,517 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-12-03 01:04:49,517 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:04:49,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:04:49,518 INFO L82 PathProgramCache]: Analyzing trace with hash -726446296, now seen corresponding path program 2 times [2018-12-03 01:04:49,518 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 01:04:49,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 01:04:49,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:04:49,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:04:49,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:04:49,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:04:50,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:04:50,001 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:04:50,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-12-03 01:04:50,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 01:04:50,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 01:04:50,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2018-12-03 01:04:50,002 INFO L87 Difference]: Start difference. First operand 7509 states and 27191 transitions. Second operand 20 states. [2018-12-03 01:04:50,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:04:50,278 INFO L93 Difference]: Finished difference Result 4917 states and 17063 transitions. [2018-12-03 01:04:50,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 01:04:50,278 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 60 [2018-12-03 01:04:50,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:04:50,283 INFO L225 Difference]: With dead ends: 4917 [2018-12-03 01:04:50,283 INFO L226 Difference]: Without dead ends: 3597 [2018-12-03 01:04:50,283 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-12-03 01:04:50,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3597 states. [2018-12-03 01:04:50,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3597 to 3597. [2018-12-03 01:04:50,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3597 states. [2018-12-03 01:04:50,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3597 states to 3597 states and 12663 transitions. [2018-12-03 01:04:50,317 INFO L78 Accepts]: Start accepts. Automaton has 3597 states and 12663 transitions. Word has length 60 [2018-12-03 01:04:50,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:04:50,317 INFO L480 AbstractCegarLoop]: Abstraction has 3597 states and 12663 transitions. [2018-12-03 01:04:50,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 01:04:50,317 INFO L276 IsEmpty]: Start isEmpty. Operand 3597 states and 12663 transitions. [2018-12-03 01:04:50,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-03 01:04:50,320 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:04:50,320 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-12-03 01:04:50,320 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:04:50,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:04:50,320 INFO L82 PathProgramCache]: Analyzing trace with hash -894531326, now seen corresponding path program 3 times [2018-12-03 01:04:50,320 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 01:04:50,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 01:04:50,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:04:50,321 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 01:04:50,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:04:50,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:04:50,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:04:50,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:04:50,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-12-03 01:04:50,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 01:04:50,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 01:04:50,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2018-12-03 01:04:50,781 INFO L87 Difference]: Start difference. First operand 3597 states and 12663 transitions. Second operand 19 states. [2018-12-03 01:04:51,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:04:51,095 INFO L93 Difference]: Finished difference Result 4296 states and 14936 transitions. [2018-12-03 01:04:51,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 01:04:51,095 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 60 [2018-12-03 01:04:51,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:04:51,100 INFO L225 Difference]: With dead ends: 4296 [2018-12-03 01:04:51,100 INFO L226 Difference]: Without dead ends: 3549 [2018-12-03 01:04:51,100 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-12-03 01:04:51,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3549 states. [2018-12-03 01:04:51,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3549 to 3549. [2018-12-03 01:04:51,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3549 states. [2018-12-03 01:04:51,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3549 states to 3549 states and 12499 transitions. [2018-12-03 01:04:51,133 INFO L78 Accepts]: Start accepts. Automaton has 3549 states and 12499 transitions. Word has length 60 [2018-12-03 01:04:51,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:04:51,133 INFO L480 AbstractCegarLoop]: Abstraction has 3549 states and 12499 transitions. [2018-12-03 01:04:51,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 01:04:51,133 INFO L276 IsEmpty]: Start isEmpty. Operand 3549 states and 12499 transitions. [2018-12-03 01:04:51,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-03 01:04:51,135 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:04:51,135 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-12-03 01:04:51,135 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:04:51,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:04:51,136 INFO L82 PathProgramCache]: Analyzing trace with hash 314196332, now seen corresponding path program 4 times [2018-12-03 01:04:51,136 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-03 01:04:51,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-03 01:04:51,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:04:51,136 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 01:04:51,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:04:51,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:04:51,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:04:51,591 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:04:51,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-12-03 01:04:51,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 01:04:51,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 01:04:51,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2018-12-03 01:04:51,591 INFO L87 Difference]: Start difference. First operand 3549 states and 12499 transitions. Second operand 19 states. [2018-12-03 01:04:51,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:04:51,826 INFO L93 Difference]: Finished difference Result 882 states and 2688 transitions. [2018-12-03 01:04:51,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 01:04:51,826 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 60 [2018-12-03 01:04:51,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:04:51,826 INFO L225 Difference]: With dead ends: 882 [2018-12-03 01:04:51,827 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 01:04:51,827 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2018-12-03 01:04:51,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 01:04:51,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 01:04:51,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 01:04:51,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 01:04:51,827 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 60 [2018-12-03 01:04:51,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:04:51,827 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 01:04:51,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 01:04:51,827 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 01:04:51,828 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 01:04:51,829 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-03 01:04:51,830 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 01:04:51 BasicIcfg [2018-12-03 01:04:51,830 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 01:04:51,830 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-03 01:04:51,830 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-03 01:04:51,831 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-03 01:04:51,831 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 01:03:47" (3/4) ... [2018-12-03 01:04:51,833 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-03 01:04:51,837 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread0 [2018-12-03 01:04:51,837 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2018-12-03 01:04:51,837 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2018-12-03 01:04:51,837 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2018-12-03 01:04:51,839 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-12-03 01:04:51,839 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-12-03 01:04:51,861 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_0457a80b-e0b2-44a7-a548-36c102c0a654/bin-2019/uautomizer/witness.graphml [2018-12-03 01:04:51,861 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-03 01:04:51,861 INFO L168 Benchmark]: Toolchain (without parser) took 65523.53 ms. Allocated memory was 1.0 GB in the beginning and 5.4 GB in the end (delta: 4.3 GB). Free memory was 950.6 MB in the beginning and 3.0 GB in the end (delta: -2.1 GB). Peak memory consumption was 2.3 GB. Max. memory is 11.5 GB. [2018-12-03 01:04:51,862 INFO L168 Benchmark]: CDTParser took 0.15 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-12-03 01:04:51,862 INFO L168 Benchmark]: CACSL2BoogieTranslator took 412.50 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.3 MB). Free memory was 950.6 MB in the beginning and 1.0 GB in the end (delta: -99.2 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. [2018-12-03 01:04:51,862 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.07 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-03 01:04:51,862 INFO L168 Benchmark]: Boogie Preprocessor took 14.32 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 01:04:51,862 INFO L168 Benchmark]: RCFGBuilder took 209.74 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 30.5 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. [2018-12-03 01:04:51,862 INFO L168 Benchmark]: TraceAbstraction took 64826.72 ms. Allocated memory was 1.1 GB in the beginning and 5.4 GB in the end (delta: 4.2 GB). Free memory was 1.0 GB in the beginning and 3.0 GB in the end (delta: -2.0 GB). Peak memory consumption was 2.2 GB. Max. memory is 11.5 GB. [2018-12-03 01:04:51,863 INFO L168 Benchmark]: Witness Printer took 30.25 ms. Allocated memory is still 5.4 GB. Free memory is still 3.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 01:04:51,864 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.15 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 412.50 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.3 MB). Free memory was 950.6 MB in the beginning and 1.0 GB in the end (delta: -99.2 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 27.07 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.32 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 209.74 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 30.5 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 64826.72 ms. Allocated memory was 1.1 GB in the beginning and 5.4 GB in the end (delta: 4.2 GB). Free memory was 1.0 GB in the beginning and 3.0 GB in the end (delta: -2.0 GB). Peak memory consumption was 2.2 GB. Max. memory is 11.5 GB. * Witness Printer took 30.25 ms. Allocated memory is still 5.4 GB. Free memory is still 3.0 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, 64.6s OverallTime, 33 OverallIterations, 1 TraceHistogramMax, 33.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6310 SDtfs, 18063 SDslu, 36552 SDs, 0 SdLazy, 14965 SolverSat, 2451 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 898 GetRequests, 98 SyntacticMatches, 44 SemanticMatches, 756 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3261 ImplicationChecksByTransitivity, 24.9s 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: 16.9s AutomataMinimizationTime, 33 MinimizatonAttempts, 177045 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 10.1s 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...